@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/git-I2U4X7BH.cjs","../../src/blocks/commit/draw.ts","../../src/blocks/branch/draw.ts","../../src/blocks/copy/draw.ts","../../src/blocks/merge/draw.ts","../../src/render/git.ts","../../src/kinds/git/layout.ts","../../src/kinds/git.ts"],"names":["y"],"mappings":"AAAA;AACE;AACF,wDAA6B;AAC7B;AACE;AACF,wDAA6B;AAC7B;AACE;AACA;AACA;AACA;AACF,wDAA6B;AAC7B,gCAA6B;AAC7B,gCAA6B;AAC7B;AACE;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;AACE;AACF,wDAA6B;AAC7B,gCAA6B;AAC7B,gCAA6B;AAC7B,gCAA6B;AAC7B;AACA;AChCO,IAAM,WAAA,EAAuB,CAAC,CAAA,EAAG,IAAA,EAAM,GAAA,EAAA,GAAQ;AACpD,EAAA,MAAM,EAAE,EAAE,EAAA,EAAI,GAAA;AACd,EAAA,MAAM,EAAA,EAAI,sCAAA,CAAO,CAAE,MAAA,EAAQ,GAAA,CAAI,MAAM,CAAA;AACrC,EAAA,MAAM,GAAA,EAAK,CAAA,CAAE,EAAA,CAAG;AAAA,IACd,CAAC,CAAA,EAAG,EAAE,OAAA,EAAS,CAAA,EAAG,mBAAA,EAAqB,EAAE,CAAC,CAAA;AAAA,IAC1C,CAAC,IAAA,CAAK,KAAA,EAAO,EAAE,OAAA,EAAS,CAAA,EAAG,mBAAA,EAAqB,EAAE,CAAA,EAAG,sBAAA,CAAK,KAAK,CAAA;AAAA,IAC/D,CAAC,IAAA,CAAK,MAAA,EAAQ,IAAA,EAAM,EAAE,OAAA,EAAS,EAAE,CAAC,CAAA;AAAA,IAClC,CAAC,IAAA,CAAK,KAAA,EAAO,EAAE,mBAAA,EAAqB,EAAE,CAAC,CAAA;AAAA,IACvC,CAAC,CAAA,CAAE,IAAA,EAAM,EAAE,OAAA,EAAS,CAAA,EAAG,mBAAA,EAAqB,EAAE,CAAA,EAAG,sBAAA,CAAK,KAAK,CAAA;AAAA,IAC3D,CAAC,CAAA,CAAE,KAAA,EAAO,EAAE,OAAA,EAAS,CAAA,EAAG,mBAAA,EAAqB,EAAE,CAAC;AAAA,EAClD,CAAC,CAAA;AACD,EAAA,OAAO,CAAA,UAAA,EAAa,kCAAA,CAAG,CAAE,KAAK,CAAC,CAAA,gDAAA,EAAmD,CAAC,CAAA,SAAA,EAAY,EAAE,CAAA,OAAA,CAAA;AACnG,CAAA;AAGO,SAAS,SAAA,CAAU,CAAA,EAAc,MAAA,EAAgB,GAAA,EAAkB;AACxE,EAAA,MAAM,EAAE,EAAE,EAAA,EAAI,GAAA;AACd,EAAA,MAAM,GAAA,mCAAK,MAAA,mBAAO,CAAA,CAAE,IAAA,EAAM,CAAA,CAAE,KAAK,CAAA,6BAAG,OAAA,UAAS,GAAA;AAC7C,EAAA,MAAM,KAAA,EAAO,EAAE,CAAA,EAAG,CAAA,CAAE,GAAA,EAAK,CAAA,CAAE,CAAA,EAAG,CAAA,EAAG,CAAA,CAAE,GAAA,EAAK,CAAA,CAAE,CAAA,EAAG,CAAA,EAAG,CAAA,CAAE,EAAA,EAAI,CAAA,EAAG,CAAA,EAAG,CAAA,CAAE,EAAA,EAAI,EAAE,CAAA;AACpE,EAAA,GAAA,CAAI,GAAA,CAAI,IAAA,CAAK,EAAE,IAAA,EAAM,CAAA,CAAE,EAAA,EAAI,IAAA,EAAM,IAAA,EAAM,KAAA,EAAO,CAAC,CAAC,EAAA,EAAI,MAAA,CAAO,iBAAiB,CAAC,CAAA,EAAG,KAAA,EAAO,KAAK,CAAC,CAAA;AAC7F,EAAA,MAAM,MAAA,EAAA,kCAAS,CAAA,qBAAE,IAAA,6BAAM,OAAA,UAAS,CAAC,GAAA,CAAA,CAC9B,GAAA,CAAI,CAAC,IAAA,EAAM,CAAA,EAAA,GAAM;AAChB,IAAA,MAAM,KAAA,EAAO,EAAA,IAAM,EAAA,GAAK,CAAA,CAAE,KAAA,IAAS,KAAA,CAAA;AACnC,IAAA,MAAM,SAAA,mCAAW,CAAA,qBAAE,IAAA,6BAAM,SAAA,qBAAU,CAAC,GAAA,UAAK,CAAA,CAAE,IAAA;AAC3C,IAAA,OAAO,qCAAA,GAAM,CAAI,GAAA,EAAK,KAAA,EAAO,WAAA,EAAa,UAAA,EAAY,CAAA,CAAE,EAAA,EAAI,QAAA,EAAU,IAAA,EAAM,KAAA,EAAO,sBAAA,CAAK,QAAA,EAAU,sBAAA,CAAK,OAAA,EAAS,CAAC,CAAC,EAAA,EAAI,MAAA,CAAO,iBAAiB,CAAC,CAAA,EAAG,QAAQ,CAAA;AAAA,EAC5J,CAAC,CAAA,CACA,IAAA,CAAK,EAAE,CAAA;AACV,EAAA,MAAM,GAAA,EAAK,CAAA,2BAAA,EAA8B,kCAAA,CAAG,CAAE,EAAE,CAAC,CAAA,KAAA,EAAQ,kCAAA,CAAG,CAAE,GAAA,EAAK,sBAAA,CAAK,QAAA,CAAS,KAAK,CAAC,CAAA,uBAAA,EAA0B,mCAAA,CAAI,CAAE,EAAE,CAAC,CAAA,OAAA,CAAA;AAC1H,EAAA,MAAM,KAAA,EAAO,CAAA,+BAAA,EAAkC,CAAA,CAAE,GAAA,CAAI,EAAE,CAAC,CAAA,+BAAA,EAAkC,kCAAA,CAAG,CAAE,EAAE,CAAC,CAAA,MAAA,EAAS,kCAAA,CAAG,CAAE,EAAE,CAAC,CAAA,KAAA,EAAQ,CAAA,CAAE,CAAC,CAAA,EAAA,EAAK,GAAA,CAAI,EAAE,CAAA,EAAA,EAAK,EAAE,CAAA,IAAA,CAAA;AAChJ,EAAA,MAAM,KAAA,EAAO,MAAA,IAAU,GAAA,EAAK,GAAA,EAAK,CAAA,uBAAA,EAA0B,CAAA,CAAE,GAAA,CAAI,EAAE,CAAC,CAAA,EAAA,EAAK,KAAK,CAAA,IAAA,CAAA;AAC9E,EAAA,MAAM,SAAA,EAAW,CAAA,CAAE,OAAA,IAAW,KAAA,EAAA,EAAY,KAAA,EAAA,kBAAY,MAAA,mBAAO,CAAA,CAAE,MAAA,mBAAQ,CAAA,CAAE,WAAA,UAAe,GAAC,CAAA,+BAAG,OAAA;AAC5F,EAAA,MAAM,OAAA,EACJ,SAAA,IAAa,KAAA,EAAA,EACT,GAAA,EACA,CAAA,6BAAA,EAAgC,mCAAA,CAAI,CAAE,EAAE,CAAC,CAAA,SAAA,EAAY,CAAA,CAAE,GAAA,CAAI,QAAA,EAAU,CAAA,CAAE,IAAA,EAAM,EAAE,CAAA,EAAG,IAAI,CAAC,CAAC,CAAA,iCAAA,EAAoC,kCAAA,CAAG,CAAE,EAAE,CAAC,CAAA,MAAA,EAAS,kCAAA,CAAG,CAAE,EAAE,CAAC,CAAA,KAAA,EAAQ,sBAAA,CAAK,GAAA,CAAI,MAAM,CAAA,gCAAA,EAAmC,kCAAA,CAAG,CAAE,EAAE,CAAC,CAAA,KAAA,EAAQ,kCAAA,CAAG,CAAE,GAAA,EAAK,sBAAA,CAAK,QAAA,CAAS,KAAK,CAAC,CAAA,uBAAA,EAA0B,mCAAA,CAAI,CAAE,EAAE,CAAC,CAAA,WAAA,CAAA;AACtS,EAAA,OAAO,CAAA,gBAAA,EAAmB,mCAAA,CAAI,CAAE,EAAE,CAAC,CAAA,SAAA,EAAY,kCAAA,CAAG,CAAE,KAAK,CAAC,CAAA,EAAA,EAAK,IAAI,CAAA,EAAA;AACrE;AD2BsE;AACA;AE3EK;AF6EL;AACA;AG7ElB;AACpC,EAAA;AACsD,EAAA;AACtE;AH+EsE;AACA;AIpFM;AJsFN;AACA;AKxEd;AACQ;AAGI;AACnD,EAAA;AACQ,EAAA;AAC2C,EAAA;AACH,EAAA;AACjE;AAG8G;AAMlB;AAC3C,EAAA;AACgB,EAAA;AACvC,EAAA;AAC1B;AAEiK;AACjJ,EAAA;AACqF,EAAA;AAGrF,EAAA;AACyB,IAAA;AACjB,IAAA;AAC0C,IAAA;AACN,IAAA;AAEhD,EAAA;AAEyD,EAAA;AAGhD,EAAA;AACsB,IAAA;AACN,IAAA;AACe,IAAA;AAC9B,IAAA;AACL,MAAA;AACW,MAAA;AACT,MAAA;AACoB,MAAA;AAChC,IAAA;AACe,IAAA;AAC4B,MAAA;AACqB,MAAA;AAC7B,MAAA;AACK,MAAA;AACP,MAAA;AACN,MAAA;AACsB,MAAA;AACjD,IAAA;AACM,IAAA;AACoB,MAAA;AAC3B,IAAA;AAEM,EAAA;AAIQ,EAAA;AAC6C,IAAA;AACP,IAAA;AACF,IAAA;AACrC,IAAA;AACH,MAAA;AACC,MAAA;AACA,MAAA;AACW,MAAA;AACT,MAAA;AACD,MAAA;AACI,MAAA;AAChB,IAAA;AAC+D,IAAA;AAEzD,EAAA;AACgD,EAAA;AAGrD,EAAA;AACC,IAAA;AACE,MAAA;AAC0C,MAAA;AAC1C,MAAA;AACA,MAAA;AACF,IAAA;AAEU,EAAA;AACqB,EAAA;AACvC;AAWU;AACM,EAAA;AAC8B,EAAA;AACD,EAAA;AAClC,EAAA;AACL,EAAA;AAC+B,EAAA;AAC6B,IAAA;AACvD,IAAA;AACT,EAAA;AACuB,EAAA;AACgB,IAAA;AAC1B,IAAA;AACoB,IAAA;AACU,IAAA;AACN,IAAA;AAC5B,IAAA;AAE6B,IAAA;AAC2B,MAAA;AACvD,MAAA;AAC0B,QAAA;AACE,QAAA;AACU,QAAA;AACxB,QAAA;AACpB,MAAA;AACuC,MAAA;AACvC,MAAA;AACF,IAAA;AAC2C,IAAA;AACN,IAAA;AACtB,IAAA;AAEsB,MAAA;AACyB,MAAA;AACvD,MAAA;AACe,IAAA;AACoC,MAAA;AACnD,MAAA;AACP,IAAA;AAC0C,IAAA;AAC5C,EAAA;AAC8B,EAAA;AACE,EAAA;AACV,EAAA;AACe,EAAA;AAC8B,EAAA;AAC1B,EAAA;AAC2B,EAAA;AACF,EAAA;AACpE;ALsCsE;AACA;AMjDzB;AACmB,EAAA;AAC3B,EAAA;AACW,IAAA;AAC9C,EAAA;AACmE,EAAA;AACO,EAAA;AAC9C,EAAA;AACE,EAAA;AACR,EAAA;AACa,EAAA;AACH,EAAA;AACA,EAAA;AACF,EAAA;AACkB,EAAA;AACX,EAAA;AACD,EAAA;AACJ,EAAA;AACuC,EAAA;AACrC,EAAA;AAGmD,EAAA;AACzC,EAAA;AACR,IAAA;AACJ,IAAA;AACE,IAAA;AAClC,EAAA;AAE4F,EAAA;AAClC,IAAA;AACrC,IAAA;AACZ,IAAA;AACyD,IAAA;AAC3B,IAAA;AACT,MAAA;AAChB,MAAA;AACiD,QAAA;AACzC,QAAA;AAClB,MAAA;AACmB,MAAA;AACpB,IAAA;AACoC,IAAA;AAE2B,MAAA;AACpC,MAAA;AACtB,MAAA;AACiB,MAAA;AACyB,QAAA;AACV,QAAA;AACnB,QAAA;AACM,QAAA;AACyC,QAAA;AAC7C,QAAA;AACnB,MAAA;AACmE,MAAA;AACrE,IAAA;AACF,EAAA;AAEqD,EAAA;AACrB,IAAA;AACgD,IAAA;AACrD,IAAA;AACF,MAAA;AACF,MAAA;AACP,MAAA;AAC+B,MAAA;AAC7C,IAAA;AACsE,IAAA;AACxE,EAAA;AAEmC,EAAA;AACH,IAAA;AACW,MAAA;AACT,MAAA;AACL,QAAA;AACuC,QAAA;AAC3C,QAAA;AACQ,UAAA;AACZ,UAAA;AACF,UAAA;AACZ,QAAA;AAC6B,MAAA;AAEL,QAAA;AACN,QAAA;AACM,UAAA;AACxB,QAAA;AAC2B,MAAA;AACd,QAAA;AAC2C,QAAA;AACzD,QAAA;AACE,UAAA;AACA,UAAA;AACM,UAAA;AACc,YAAA;AACL,cAAA;AACA,cAAA;AACX,cAAA;AACF,YAAA;AACkB,YAAA;AACe,YAAA;AACyB,YAAA;AAC5D,UAAA;AACA,UAAA;AACF,QAAA;AACK,MAAA;AACG,MAAA;AACX,IAAA;AACkE,IAAA;AAChD,IAAA;AACI,IAAA;AACG,MAAA;AACqB,MAAA;AAC/C,IAAA;AACD,EAAA;AAE+C,EAAA;AACzB,IAAA;AACvB,EAAA;AAE0F,EAAA;AACpE,IAAA;AAC6C,IAAA;AACE,IAAA;AACE,IAAA;AACO,IAAA;AAC5D,IAAA;AACR,MAAA;AACI,MAAA;AACV,MAAA;AAC4D,MAAA;AACvB,MAAA;AACU,MAAA;AACA,MAAA;AACzC,MAAA;AACC,MAAA;AACT,IAAA;AACW,IAAA;AACK,IAAA;AAC+C,IAAA;AACM,IAAA;AACvB,IAAA;AAC3B,IAAA;AACO,MAAA;AACC,QAAA;AACe,QAAA;AACC,MAAA;AAC9B,MAAA;AACI,QAAA;AACF,QAAA;AACb,MAAA;AACD,IAAA;AACH,EAAA;AAE4E,EAAA;AACd,EAAA;AAChE;AAGoE;AAC/C,EAAA;AAC+B,EAAA;AAC5B,IAAA;AACN,IAAA;AACmE,IAAA;AAC7D,IAAA;AACrB,EAAA;AACH;AAMgD;AACO,EAAA;AACe,EAAA;AACtE;AAUkE;AACnC,EAAA;AACZ,EAAA;AACe,EAAA;AACwC,EAAA;AACG,EAAA;AACnB,EAAA;AACzB,EAAA;AACmC,EAAA;AACO,EAAA;AAC3E;AAQ8E;AACrC,EAAA;AACkC,EAAA;AACvC,EAAA;AACV,IAAA;AAA4B;AACgB,IAAA;AACtB,IAAA;AACvB,IAAA;AACvB,EAAA;AACoC,EAAA;AACU,EAAA;AACS,IAAA;AAClB,IAAA;AAA6C;AAClF,EAAA;AACO,EAAA;AACT;AAG6C;AACZ,EAAA;AACI,EAAA;AACO,EAAA;AACoB,EAAA;AAC3B,EAAA;AACiC,EAAA;AAClB,EAAA;AACpD;AAGiD;AACd,EAAA;AACV,IAAA;AACQ,IAAA;AACqC,IAAA;AACpE,EAAA;AACgC,EAAA;AACU,EAAA;AACA,EAAA;AACZ,EAAA;AACoC,EAAA;AACpE;AAE4D;AACK,EAAA;AACpC,EAAA;AACuC,EAAA;AACD,EAAA;AACqB,EAAA;AAGlD,EAAA;AACK,EAAA;AACZ,EAAA;AACkC,IAAA;AAC9C,IAAA;AACS,IAAA;AAC1B,EAAA;AAEmE,EAAA;AACK,IAAA;AACA,IAAA;AACxE,EAAA;AAC2E,EAAA;AACF,EAAA;AACL,EAAA;AACH,EAAA;AAGE,EAAA;AACA,EAAA;AACF,EAAA;AACV,EAAA;AAIrC,EAAA;AACa,IAAA;AAC2B,MAAA;AACO,MAAA;AAC9D,IAAA;AACH,EAAA;AAEqC,EAAA;AAE+B,EAAA;AAC1C,EAAA;AAClB,EAAA;AAC2B,EAAA;AACf,IAAA;AAC4B,IAAA;AACe,IAAA;AACF,IAAA;AACO,IAAA;AACvD,IAAA;AACZ,EAAA;AACyB,EAAA;AACwB,EAAA;AAEE,EAAA;AAClB,IAAA;AACU,IAAA;AACkB,IAAA;AAC5C,IAAA;AACO,IAAA;AAEwC,IAAA;AACH,IAAA;AACK,IAAA;AAEI,IAAA;AAC9D,IAAA;AACC,MAAA;AACI,MAAA;AACV,MAAA;AACA,MAAA;AACA,MAAA;AACK,MAAA;AACG,MAAA;AACC,MAAA;AACE,MAAA;AACoC,MAAA;AACA,MAAA;AACA,MAAA;AACxB,MAAA;AACuC,MAAA;AAChE,IAAA;AACD,EAAA;AACmD,EAAA;AAIe,EAAA;AACnC,IAAA;AACZ,IAAA;AACwC,IAAA;AAChC,IAAA;AACkC,IAAA;AAClD,IAAA;AACZ,EAAA;AAC+D,EAAA;AAC/C,EAAA;AACc,IAAA;AACF,MAAA;AACqD,MAAA;AAC9E,IAAA;AACH,EAAA;AACgE,EAAA;AAChC,IAAA;AACX,IAAA;AACK,IAAA;AACiC,IAAA;AAAc;AAC9C,IAAA;AACO,MAAA;AACkC,MAAA;AAClE,IAAA;AAC0B,IAAA;AACtB,IAAA;AAC0D,IAAA;AACR,IAAA;AACS,IAAA;AACpC,IAAA;AACc,IAAA;AAC1C,EAAA;AAGkD,EAAA;AACjB,IAAA;AACgB,IAAA;AAC9B,IAAA;AAC8C,IAAA;AAClE,EAAA;AACgE,EAAA;AAMA,EAAA;AAC/C,IAAA;AAC2C,IAAA;AACQ,IAAA;AACD,IAAA;AAC1B,IAAA;AACzC,EAAA;AAEiD,EAAA;AACA,IAAA;AACN,IAAA;AACW,IAAA;AACc,IAAA;AAC3D,IAAA;AACE,MAAA;AACC,MAAA;AACC,MAAA;AACc,MAAA;AACJ,MAAA;AACmB,MAAA;AACH,MAAA;AAC2B,MAAA;AACvD,MAAA;AACT,IAAA;AACD,EAAA;AAC2E,EAAA;AAG5C,EAAA;AACb,EAAA;AACjB,IAAA;AACkE,IAAA;AACtC,IAAA;AACsC,IAAA;AACpE,EAAA;AACuB,EAAA;AACwC,EAAA;AAErD,EAAA;AAC4C,EAAA;AACc,IAAA;AACjD,IAAA;AAEqB,IAAA;AACxB,IAAA;AACP,IAAA;AACC,MAAA;AACE,MAAA;AACoC,MAAA;AACG,MAAA;AACpB,MAAA;AACxB,MAAA;AACHA,MAAAA;AACG,MAAA;AACY,MAAA;AACH,MAAA;AACd,IAAA;AACD,EAAA;AAEqD,EAAA;AACtB,IAAA;AACvB,IAAA;AACI,MAAA;AACM,MAAA;AACsB,MAAA;AAC/B,MAAA;AACM,MAAA;AACJ,MAAA;AACA,MAAA;AACL,MAAA;AACK,MAAA;AACwD,MAAA;AAClE,IAAA;AACD,EAAA;AAEyB,EAAA;AAClB,IAAA;AACC,IAAA;AACC,IAAA;AACR,IAAA;AACA,IAAA;AACY,IAAA;AACJ,IAAA;AACC,IAAA;AACC,IAAA;AACD,IAAA;AACD,IAAA;AACD,IAAA;AACP,IAAA;AACA,IAAA;AACA,IAAA;AACA,IAAA;AACa,IAAA;AACb,IAAA;AACF,EAAA;AACwC,EAAA;AACA,EAAA;AAE0B,EAAA;AACC,EAAA;AACT,EAAA;AACN,EAAA;AACc,EAAA;AACD,EAAA;AAClD,EAAA;AACwC,EAAA;AAC7B,EAAA;AAEc,EAAA;AACjC,EAAA;AACT;AAEoC;AACS,EAAA;AACA,EAAA;AACwB,EAAA;AACrE;AAM0I;AAC1H,EAAA;AACsD,IAAA;AACnC,IAAA;AAC8B,MAAA;AACK,MAAA;AACjE,IAAA;AAC+B,EAAA;AACpB,EAAA;AAChB;AAM8C;AAM0D;AAC5E,EAAA;AACF,EAAA;AACD,EAAA;AACN,IAAA;AACA,IAAA;AACA,IAAA;AACA,IAAA;AACjB,EAAA;AACa,EAAA;AACsD,IAAA;AACnE,EAAA;AACF;AAM0G;AAChE,EAAA;AACR,EAAA;AAC6B,EAAA;AACpB,EAAA;AACd,IAAA;AACD,IAAA;AACsC,IAAA;AAChE,EAAA;AACO,EAAA;AACT;AAS0E;AACjD,EAAA;AACC,EAAA;AAC2C,EAAA;AACxC,EAAA;AACL,EAAA;AACV,IAAA;AACwD,IAAA;AACpE,EAAA;AACkE,EAAA;AAC/B,EAAA;AACD,IAAA;AAC6B,IAAA;AAC1B,IAAA;AACb,MAAA;AACwC,MAAA;AAC5C,MAAA;AACgD,MAAA;AAChE,MAAA;AACF,IAAA;AAC+D,IAAA;AACtD,IAAA;AACkB,MAAA;AACzB,MAAA;AACF,IAAA;AACiE,IAAA;AACzB,MAAA;AACI,MAAA;AAC1C,MAAA;AACF,IAAA;AAGgE,IAAA;AACH,IAAA;AAC5C,IAAA;AACA,MAAA;AAC+C,MAAA;AAC9D,MAAA;AACF,IAAA;AACiC,IAAA;AACN,IAAA;AACqC,IAAA;AACjE,EAAA;AACqD,EAAA;AACxD;AAM0E;AACzD,EAAA;AACe,EAAA;AAC2C,EAAA;AACG,EAAA;AAC1B,EAAA;AACjB,EAAA;AAC2B,IAAA;AACS,IAAA;AACP,IAAA;AAC/C,IAAA;AAC8B,IAAA;AACoB,IAAA;AACE,IAAA;AACA,IAAA;AAEf,IAAA;AAKrC,IAAA;AAEqD,IAAA;AACP,IAAA;AACpD,IAAA;AACL,MAAA;AAC4D,QAAA;AACC,QAAA;AAC7D,MAAA;AACF,IAAA;AACF,EAAA;AACO,EAAA;AACT;AN1DsE;AACA;AOnvB3B;AACjC,EAAA;AACwB,EAAA;AACiB,IAAA;AACmB,IAAA;AACpE,EAAA;AACF;APqvBsE;AACA;AACA","file":"/Users/cardene/Desktop/projects/dragon-3711-release-0-75-0/packages/dragon/dist/light/git-I2U4X7BH.cjs","sourcesContent":[null,"/**\n * commit の描き方 (#3164、#3347)。\n *\n * commit の丸は、親から引く線を引き終えた時に弾んで出て、hash と一言を丸の外に添える。\n * どの札からも辿れなくなった commit は、その時に点線の丸を重ねる。\n * 親から引く線は引いた後も残す。線の並びは並べ方が 1 つの並びに出すので、枝分かれの図を描く部品 (`render/git.ts`) が順に読み、線の種類ごとの描き方を引く。\n * この file は枝分かれの図を描く部品だけが読み、見本帳を開いた時に読む塊に入れない (#3248)。\n */\nimport type { GitLink, GitPlaced } from \"../../kinds/git/layout\";\nimport { EASE, LOOK, TYPE } from \"../../look/values\";\nimport { type Ctx, esc, pathOf, r1, write } from \"../../render/parts\";\nimport type { EdgeTime } from \"../../timeline\";\nimport { cs } from \"../color/draw\";\n\n/** 線を引く時刻を引く処理。段と段の中の出来事の番号で引き、描かない線は `undefined` */\nexport type TimeOf = (step: number, event: number) => EdgeTime | undefined;\n\n/** 線の種類ごとの描き方。線の時刻 `time` に引き始め、描いた線を返す */\nexport type LinkLine = (link: GitLink, time: EdgeTime, ctx: Ctx) => string;\n\n/** 親から子へ引く線。引き始めてから引き終えるまでに伸ばし、繰り返す前まで残す */\nexport const parentLine: LinkLine = (l, time, ctx) => {\n const { m } = ctx;\n const d = pathOf(l.points, ctx.corner);\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 `<g style=\"${cs(l.color)}\"><path class=\"dg-git-l dg-a\" pathLength=\"1\" d=\"${d}\" style=\"${kf}\"/></g>`;\n};\n\n/** commit の丸と名札と、丸の外の hash と一言と、辿れなくなった時に重ねる点線の丸 */\nexport function commitDot(c: GitPlaced, timeOf: TimeOf, ctx: Ctx): string {\n const { m } = ctx;\n const at = timeOf(c.step, c.event)?.drawn ?? 0;\n const ring = { x: c.cx - c.r, y: c.cy - c.r, w: c.r * 2, h: c.r * 2 };\n ctx.ink.push({ text: c.id, rect: ring, shown: [[at, Number.POSITIVE_INFINITY]], boxed: true });\n const lines = (c.text?.lines ?? [])\n .map((line, k) => {\n const hash = k === 0 && c.hash !== undefined;\n const baseline = c.text?.baselines[k] ?? c.cy;\n return write(ctx.ink, hash ? \"dg-git-h\" : \"dg-git-n\", c.cx, baseline, line, hash ? TYPE.gitHash : TYPE.gitNote, [[at, Number.POSITIVE_INFINITY]], \"middle\");\n })\n .join(\"\");\n const id = `<text class=\"dg-git-id\" x=\"${r1(c.cx)}\" y=\"${r1(c.cy + LOOK.baseline.badge)}\" text-anchor=\"middle\">${esc(c.id)}</text>`;\n const node = `<g class=\"dg-popc dg-a\" style=\"${m.pop(at)}\"><circle class=\"dg-git-c\" cx=\"${r1(c.cx)}\" cy=\"${r1(c.cy)}\" r=\"${c.r}\" ${ctx.sh}/>${id}</g>`;\n const text = lines === \"\" ? \"\" : `<g class=\"dg-a\" style=\"${m.vis(at)}\">${lines}</g>`;\n const orphanAt = c.orphan === undefined ? undefined : timeOf(c.orphan, c.orphanEvent ?? 0)?.drawn;\n const orphan =\n orphanAt === undefined\n ? \"\"\n : `<g class=\"dg-a\" data-orphan=\"${esc(c.id)}\" style=\"${m.vis(orphanAt, m.last, { f: 0.5 })}\"><circle class=\"dg-git-old\" cx=\"${r1(c.cx)}\" cy=\"${r1(c.cy)}\" r=\"${LOOK.git.orphan}\"/><text class=\"dg-git-oldl\" x=\"${r1(c.cx)}\" y=\"${r1(c.cy + LOOK.baseline.badge)}\" text-anchor=\"middle\">${esc(c.id)}</text></g>`;\n return `<g data-commit=\"${esc(c.id)}\" style=\"${cs(c.color)}\">${node}${text}${orphan}</g>`;\n}\n","/**\n * 枝の描き方 (#3164、#3347)。\n *\n * 枝を切る線は、切った commit から枝の帯へ引く。引き方は親から子へ引く線と同じで、引いた後も残す。\n * 枝の帯と名札は、並べ方が区画の形 (`SceneRegion`) で出して区画のブロックの描き方 (`blocks/group/draw.ts`) で描くので、この file は分かれの線だけを持つ。\n * この file は枝分かれの図を描く部品 (`render/git.ts`) だけが読み、見本帳を開いた時に読む塊に入れない (#3248)。\n */\nimport { type LinkLine, parentLine } from \"../commit/draw\";\n\n/** 枝を切る線。親から子へ引く線と同じく、引き始めてから引き終えるまでに伸ばし、繰り返す前まで残す */\nexport const forkLine: LinkLine = (l, time, ctx) => parentLine(l, time, ctx);\n","/**\n * 当て直しの描き方 (#3164、#3347)。\n *\n * 当て直しの線は、元の commit から写しへ点線で引き、写しを積んだ時に出して繰り返す前まで残す。伸ばさずに出す。\n * この file は枝分かれの図を描く部品 (`render/git.ts`) だけが読み、見本帳を開いた時に読む塊に入れない (#3248)。\n */\nimport { pathOf } from \"../../render/parts\";\nimport { cs } from \"../color/draw\";\nimport type { LinkLine } from \"../commit/draw\";\n\n/** 元の commit から写しへの点線 */\nexport const copyLine: LinkLine = (l, time, ctx) => {\n const { m } = ctx;\n return `<g style=\"${cs(l.color)}\"><path class=\"dg-git-cp dg-a\" d=\"${pathOf(l.points, ctx.corner)}\" style=\"${m.vis(time.start, m.last)}\"/></g>`;\n};\n","/**\n * merge commit の描き方 (#3164、#3347)。\n *\n * 取り込みの線は、取り込む枝の先端から merge commit へ引く。引き方は親から子へ引く線と同じで、引いた後も残す。\n * 線の道の形 (取り込む枝の帯から merge commit の帯へ折れる形) は並べ方が持つ。\n * この file は枝分かれの図を描く部品 (`render/git.ts`) だけが読み、見本帳を開いた時に読む塊に入れない (#3248)。\n */\nimport { type LinkLine, parentLine } from \"../commit/draw\";\n\n/** 取り込みの線。親から子へ引く線と同じく、引き始めてから引き終えるまでに伸ばし、繰り返す前まで残す */\nexport const mergeLine: LinkLine = (l, time, ctx) => parentLine(l, time, ctx);\n","/**\n * 枝分かれの図 (#3164) を描く部品。見本帳の試作 `docs/design/base/scenes/git.js` の commit と札を写す。\n *\n * commit の丸と、commit どうしを結ぶ線 (親から子、枝を切る、取り込み、当て直し) は、commit と枝と merge commit と当て直しのブロックが描く (#3347)。\n * 線は並べ方が 1 つの並びに出すので、ここで並びを順に読み、線の種類ごとの描き方をブロックから引く。動きの名前は呼んだ順に番号が付くので、描く順は変えない。\n * 札は枝ごとと HEAD に 1 つずつ置き、出来事のたびに次の置き場へ走らせる。札を動かす線は、その段の間だけ引いて消す。\n * 札はその後も動くので、線を残すと札の去った所を指したまま残る。\n * 札の見た目は運ぶ物の札と同じで、どの札も主役ではないので、時刻の表の運ぶ物とは別に動かす。\n */\nimport { forkLine } from \"../blocks/branch/draw\";\nimport { carrier } from \"../blocks/carry/draw\";\nimport { cs } from \"../blocks/color/draw\";\nimport { commitDot, type LinkLine, parentLine } from \"../blocks/commit/draw\";\nimport { copyLine } from \"../blocks/copy/draw\";\nimport { mergeLine } from \"../blocks/merge/draw\";\nimport type { GitLayout, GitLink, GitMove, GitPlaced } from \"../kinds/git/layout\";\nimport type { DiagramModel } from \"../schema\";\nimport { hasWide, textWidth } from \"../layout/measure\";\nimport type { Point, Rect } from \"../layout/scene\";\nimport { type Corner, EASE, LOOK, MOTION, TYPE } from \"../look/values\";\nimport { partRadius } from \"./corner\";\nimport type { EdgeTime, Span, Timeline } from \"../timeline\";\nimport type { Frame } from \"./motion\";\nimport { type Ctx, esc, pathOf } from \"./parts\";\n\nconst r1 = (v: number): number => Math.round(v * 100) / 100;\nconst center = (r: Rect): Point => [r.x + r.w / 2, r.y + r.h / 2];\n\n/** 札の形。真ん中を (0, 0) に置き、動きで置き場へ運ぶ */\nfunction tagShape(text: string, sh: string, corner: Corner): string {\n const C = LOOK.carrier;\n const ja = hasWide(text);\n const w = textWidth(text, ja ? TYPE.carrierJa : TYPE.carrier) + C.tagPadX * 2;\n return `<rect class=\"dg-car\" x=\"${r1(-w / 2)}\" y=\"${-C.tagH / 2}\" width=\"${r1(w)}\" height=\"${C.tagH}\" rx=\"${partRadius(corner, C.tagH / 2)}\" ${sh}/><text class=\"dg-car-t${ja ? \" dg-car-tj\" : \"\"}\" y=\"${LOOK.baseline.carrier}\" text-anchor=\"middle\">${esc(text)}</text>`;\n}\n\n/** 線の種類ごとの描き方。親から子は commit、枝を切るのは枝、当て直しは当て直しのブロックが持つ */\nconst LINK_LINES: Readonly<Record<GitLink[\"kind\"], LinkLine>> = { parent: parentLine, branch: forkLine, copy: copyLine };\n\n/**\n * 線の描き方。親から子への線のうち、merge commit が取り込む枝の先端から引く線は merge commit のブロックが描く。\n * 並べ方は親を取り込む先の先端、取り込む枝の先端の順に並べるので、merge commit の親の並びの最後から引く線が取り込みの線\n */\nfunction lineOf(l: GitLink, diagram: DiagramModel, commits: readonly GitPlaced[]): LinkLine {\n const e = diagram.steps[l.step]?.events[l.event];\n if (l.kind === \"parent\" && e?.type === \"commit\" && e.merge !== undefined && commits.find((c) => c.id === l.to)?.parents.at(-1) === l.from) return mergeLine;\n return LINK_LINES[l.kind];\n}\n\nexport function drawGit(layout: GitLayout, diagram: DiagramModel, timeline: Timeline, ctx: Ctx): { links: string; lines: string; commits: string; tags: string } {\n const { m } = ctx;\n const timeOf = (step: number, event: number): EdgeTime | undefined => timeline.edges.find((t) => t.step === step && t.event === event);\n\n const links = layout.links\n .map((l) => {\n const time = timeOf(l.step, l.event);\n if (!time) return \"\";\n ctx.traces.push({ from: l.from, to: l.to, points: l.points, shown: [[time.start, Number.POSITIVE_INFINITY]] });\n return lineOf(l, diagram, layout.commits)(l, time, ctx);\n })\n .join(\"\");\n\n const commits = layout.commits.map((c) => commitDot(c, timeOf, ctx)).join(\"\");\n\n const lines = layout.moves\n .flatMap((mv) => {\n const time = timeOf(mv.step, mv.event);\n if (!mv.line || !time) return [];\n const end = (timeline.steps[mv.step] as Span).end;\n ctx.traces.push({\n from: mv.ref,\n to: mv.target ?? mv.ref,\n points: mv.line,\n shown: [[time.start, end + 0.4]],\n });\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 [end, { opacity: 1 }, EASE.inOut],\n [end + 0.4, { opacity: 0 }],\n [m.total, { opacity: 0, \"stroke-dashoffset\": 0 }],\n ]);\n return [\n `<g style=\"${cs(mv.color)}\"><path class=\"dg-e-on dg-a\" pathLength=\"1\" d=\"${pathOf(mv.line, ctx.corner)}\" style=\"${kf}\"/></g>`,\n ];\n })\n .join(\"\");\n\n // 線に書いた運ぶ物は、線を走って着いた所で消える。着いた所には枝の札が留まるので、運ぶ物は留めない\n const carried = timeline.carriers\n .flatMap((t) => {\n const mv = layout.moves.find((x) => x.step === t.step && x.event === t.event && x.line);\n const source = diagram.steps[t.step]?.events[t.event];\n if (!mv?.line || source?.type !== \"edge\") return [];\n const edge = {\n step: t.step,\n event: t.event,\n from: mv.ref,\n to: mv.target ?? mv.ref,\n points: mv.line,\n color: mv.color,\n carry: source.carry,\n };\n return [carrier(edge, { ...t, start: t.depart, end: t.arrive + MOTION.fade }, ctx)];\n })\n .join(\"\");\n const refs = [...new Set(layout.moves.map((mv) => mv.ref))];\n const tags =\n refs\n .map((ref) =>\n tagMotion(\n ref,\n layout.moves.filter((mv) => mv.ref === ref),\n timeOf,\n ctx,\n ),\n )\n .join(\"\") + carried;\n return { links, lines, commits, tags };\n}\n\n/**\n * 1 つの札の動き。現れる出来事では着いた時に出し、動く出来事では前の置き場から次の置き場へ走らせ、消える出来事では着いた時に消す。\n * 留まっている間の四角を、字の重なりを数える記録に残す\n */\nfunction tagMotion(\n ref: string,\n list: GitMove[],\n timeOf: (step: number, event: number) => EdgeTime | undefined,\n ctx: Ctx,\n): string {\n const { m } = ctx;\n const points: [number, number, number][] = [];\n const fades: Frame[] = [[0, { opacity: 0 }]];\n let on = false;\n let rest: { rect: Rect; since: number } | undefined;\n const leave = (t: number): void => {\n if (rest) ctx.ink.push({ text: ref, rect: rest.rect, shown: [[rest.since, t]], boxed: true });\n rest = undefined;\n };\n for (const mv of list) {\n const time = timeOf(mv.step, mv.event);\n if (!time) continue;\n const { start: a, drawn: b } = time;\n const from = mv.from ? center(mv.from) : undefined;\n const to = mv.to ? center(mv.to) : undefined;\n leave(a);\n // 線に運ぶ物を書いた時は、枝の札は走らずに消え、運ぶ物が着いた時に着いた所へ出る\n if (mv.carried && from && to && on) {\n points.push([a + MOTION.fade, from[0], from[1]], [b - MOTION.fade, to[0], to[1]]);\n fades.push(\n [a, { opacity: 1 }, EASE.inOut],\n [a + MOTION.fade, { opacity: 0 }],\n [b - MOTION.fade, { opacity: 0 }, EASE.out],\n [b, { opacity: 1 }],\n );\n rest = { rect: mv.to as Rect, since: b };\n continue;\n }\n if (from) points.push([a, from[0], from[1]]);\n if (to) points.push([b, to[0], to[1]]);\n if (to && !on) {\n // 前の置き場から走る札は走り出す時に、何も無い所に現れる札は着いた時に出す\n const show = from ? a : b - MOTION.fade;\n fades.push([show, { opacity: 0 }, EASE.out], [show + MOTION.fade, { opacity: 1 }]);\n on = true;\n } else if (!to && on) {\n fades.push([b, { opacity: 1 }, EASE.inOut], [b + MOTION.untilFade, { opacity: 0 }]);\n on = false;\n }\n if (mv.to) rest = { rect: mv.to, since: b };\n }\n leave(Number.POSITIVE_INFINITY);\n if (points.length === 0) return \"\";\n const first = points[0] as [number, number, number];\n const last = points[points.length - 1] as [number, number, number];\n if (on) fades.push([m.last, { opacity: 1 }, EASE.inOut], [m.total, { opacity: 0 }]);\n else fades.push([m.total, { opacity: 0 }]);\n const style = m.move([[0, first[1], first[2]], ...points, [m.total, last[1], last[2]]], fades);\n return `<g class=\"dg-a\" data-ref=\"${esc(ref)}\" style=\"${style}\">${tagShape(ref, ctx.sh, ctx.corner)}</g>`;\n}\n","/**\n * 枝分かれの図の置き場所 (#3164)。見た目の元は見本帳の試作 `docs/design/base/scenes/git.js`。\n *\n * 枝ごとに横長の帯を宣言した順に上から並べ、commit の丸を枝の帯の線に置く。commit は親より 1 列右に置き、\n * 同じ帯では積んだ順に右へ進める。一番上でない帯の commit は列の半分だけ右へずらし、上の帯の丸と縦に揃わないようにする。\n * hash と一言は丸の外に 2 行で置き、一番上の帯では丸の上に、ほかの帯では丸の下に置く (step 2 で本人が選んだ)。\n * 札 (枝の名前と HEAD) は丸の上に段を重ねて置き、一番上の帯では字のさらに上に置く。\n * 同じ commit から別々の枝へ分かれる線は、出口を横に離して別々の道を通す (#3547)。\n *\n * 札がどの commit を指すかは、段の中の出来事を順に辿って決める。\n * commit を積むと、積んだ枝の札と、その枝を指す HEAD が新しい commit へ進む。最初に積んだ枝を HEAD が指す。\n * 枝を切ると、その枝の札が切る commit に置かれ、HEAD がその枝へ移る。\n * 当て直し (`copy`) は枝の札を動かさず、枝から離れた HEAD だけが付いていく。親は枝から離れた HEAD の commit か、枝の札の commit。\n * merge commit (`merge`) は取り込む先の先端と取り込む枝の先端の 2 つを親に持ち、取り込む先の札だけが進む。\n * 札を動かす線 (`<札> -> <commit>`) は、枝の札ならその枝を、HEAD なら HEAD を枝から離して動かす。\n * 枝から離れた HEAD が指す commit へ枝の札が来ると、HEAD はその枝に戻る。HEAD の札は枝から離れた間だけ出す。\n * 札を動かす線は、動いた札の段から着いた札の段まで引く。着いた札が同じ段のうちに枝へ戻って消えるか先へ進む時は、\n * 段の終わりにその札が居る所 (枝に戻った HEAD は戻った枝の札) まで引き、端に何も無い所を残さない (#3648)。\n * 枝を消す (`delete`) と、その枝の札は図から消え、帯は残る (#3632)。\n * どの札からも辿れなくなった commit は、その段で点線の丸に変わる。\n *\n * 箱は commit の並びの右に縦に並べ、中身の帯は図の下に置く。\n * 宣言していない枝に積んだ原本の JSON は、その枝の帯を下に足して描く。辿れない名札を指す出来事は描かない。\n */\nimport { APART, type ColorKey, LOOK, type TextStyle, TYPE } from \"../../look/values\";\nimport type { DiagramModel, DiagramEvent } from \"../../schema\";\nimport { HEAD } from \"../../words\";\nimport { hasWide, textBox, textWidth } from \"../../layout/measure\";\nimport {\n along,\n badgeBlocked,\n badgeOnPath,\n badgeRect,\n besideSameSpot,\n cornerOf,\n frameLines,\n gapBetween,\n boxColors,\n boxWidth,\n type Layout,\n layoutStrip,\n onFrameLine,\n pathLength,\n placeLabel,\n type Point,\n type Rect,\n type SceneBadge,\n type SceneBox,\n type SceneLabel,\n type SceneRegion,\n shapedSize,\n stripBadge,\n stripNeed,\n} from \"../../layout/scene\";\n\n/** 枝の帯。`line` は commit の丸を並べる高さ */\nexport interface GitLane extends Rect {\n id: string;\n line: number;\n color: ColorKey;\n /** 丸の真ん中から 1 段目の札の真ん中まで。丸の上に字を置く帯は、字のさらに上に札を置く */\n tagBase: number;\n}\n\nexport interface GitPlaced {\n id: string;\n branch: string;\n color: ColorKey;\n cx: number;\n cy: number;\n r: number;\n /** commit を積んだ段と、段の中の出来事の番号 */\n step: number;\n event: number;\n /** 親の commit。merge commit は取り込む先の先端と取り込む枝の先端の 2 つ */\n parents: string[];\n /** 当て直した元の commit */\n copy?: string;\n hash?: string;\n note?: string;\n /** hash と一言の字の四角と、上から並べた行と、行ごとの基準線の高さ */\n text?: Rect & { lines: string[]; baselines: number[] };\n /** どの札からも辿れなくなった段と、その段の中の出来事の番号 */\n orphan?: number;\n orphanEvent?: number;\n}\n\n/** 丸と丸を繋ぐ線。親から子 (`parent`)、当て直しの元から写し (`copy`)、枝を切る (`branch`、`to` は枝の名札) */\nexport interface GitLink {\n kind: \"parent\" | \"copy\" | \"branch\";\n from: string;\n to: string;\n step: number;\n event: number;\n points: Point[];\n color: ColorKey;\n}\n\n/** 段の終わりに札が留まる四角 */\nexport interface GitTag extends Rect {\n ref: string;\n step: number;\n}\n\n/** 札が段の終わりに指す commit。HEAD は `attached` に段の終わりに指す枝を持ち、枝から離れた段は `null` */\nexport interface GitRef {\n name: string;\n at: (string | null)[];\n attached?: (string | null)[];\n}\n\n/**\n * 札の動き。段の中の出来事で、札が `from` の四角から `to` の四角へ移る。\n * `from` が無い札はその出来事で現れ、`to` が無い札は消える。`line` は札を動かす線の出来事が引く線\n */\nexport interface GitMove {\n ref: string;\n step: number;\n event: number;\n from?: Rect;\n to?: Rect;\n /** 札が着く commit */\n target?: string;\n /** 札を動かす線に、枝の札と別の運ぶ物を書いたか。書いた時は運ぶ物が線を走り、枝の札は走らずに着いた所へ移る */\n carried?: boolean;\n line?: Point[];\n color: ColorKey;\n}\n\nexport interface GitLayout extends Layout {\n kind: \"git\";\n lanes: GitLane[];\n commits: GitPlaced[];\n links: GitLink[];\n tags: GitTag[];\n refs: GitRef[];\n moves: GitMove[];\n}\n\n\n/** 札が留まる所。commit と、その commit の上の札の段 (0 から数える) */\ninterface Slot {\n commit: string;\n row: number;\n}\n\ninterface Made {\n id: string;\n branch: string;\n parents: string[];\n /** 取り込む枝の先端の親 */\n joined?: string;\n copy?: string;\n hash?: string;\n note?: string;\n step: number;\n event: number;\n orphan?: { step: number; event: number };\n}\n\ninterface Walked {\n branches: string[];\n made: Made[];\n links: Omit<GitLink, \"points\" | \"color\">[];\n moves: { ref: string; step: number; event: number; from?: Slot; to?: Slot; line: boolean }[];\n refs: GitRef[];\n tags: { ref: string; step: number; slot: Slot }[];\n /** commit ごとの、同時に留まる札の段の数の最大 */\n rows: Map<string, number>;\n}\n\n/** 段の中の出来事を順に辿り、commit と親と、札が指す commit と、札の動きを決める */\nfunction walk(diagram: DiagramModel): Walked {\n const branches = (diagram.git?.branches ?? []).map((b) => b.id);\n const lane = (id: string): void => {\n if (!branches.includes(id)) branches.push(id);\n };\n for (const step of diagram.steps) for (const e of step.events) if (e.type === \"commit\" || e.type === \"branch\") lane(e.branch);\n const tips = new Map<string, string | null>(branches.map((b) => [b, null]));\n let headAt: string | null = null;\n let attached: string | null = null;\n const made: Made[] = [];\n const byId = new Map<string, Made>();\n const links: Walked[\"links\"] = [];\n const moves: Walked[\"moves\"] = [];\n const tags: Walked[\"tags\"] = [];\n const rows = new Map<string, (string | null)[]>();\n const most = new Map<string, number>();\n const shown = new Map<string, Slot>();\n const names = [...branches, HEAD];\n const at = new Map<string, (string | null)[]>(names.map((n) => [n, []]));\n const heads: (string | null)[] = [];\n\n /** 札が今出ている commit。HEAD は枝から離れた間だけ出る */\n const visible = (ref: string): string | null => (ref === HEAD ? (attached === null ? headAt : null) : (tips.get(ref) ?? null));\n const freeRow = (commit: string): number => {\n const list = rows.get(commit) ?? [];\n const free = list.indexOf(null);\n return free < 0 ? list.length : free;\n };\n /** 出来事で札の指す先を変え、出ている札を動かす。離れる札を先に外し、来る札を宣言の順に空いた段へ置く */\n const settle = (step: number, event: number, change: () => void, lineFor?: string): void => {\n const before = new Map(names.map((n) => [n, visible(n)]));\n const headBefore = headAt;\n change();\n const changed = names.filter((n) => before.get(n) !== visible(n));\n const leaving = changed.map((ref) => {\n const slot = shown.get(ref);\n if (slot) {\n (rows.get(slot.commit) as (string | null)[])[slot.row] = null;\n shown.delete(ref);\n }\n return { ref, slot };\n });\n for (const { ref, slot } of leaving) {\n // 枝から離れる HEAD は、それまで指していた commit の空いた段から出る\n const from = slot ?? (ref === HEAD && headBefore !== null ? { commit: headBefore, row: freeRow(headBefore) } : undefined);\n const target = visible(ref);\n let to: Slot | undefined;\n if (target !== null) {\n to = { commit: target, row: freeRow(target) };\n const list = rows.get(target) ?? [];\n list[to.row] = ref;\n rows.set(target, list);\n most.set(target, Math.max(most.get(target) ?? 0, list.filter((r) => r !== null).length));\n shown.set(ref, to);\n }\n moves.push({ ref, step, event, ...(from ? { from } : {}), ...(to ? { to } : {}), line: ref === lineFor });\n }\n };\n /** どの札からも辿れなくなった commit に、その出来事を記す */\n const prune = (step: number, event: number): void => {\n const reach = new Set<string>();\n const stack = [...tips.values(), headAt].filter((c): c is string => c !== null);\n while (stack.length > 0) {\n const id = stack.pop() as string;\n if (reach.has(id)) continue;\n reach.add(id);\n stack.push(...(byId.get(id)?.parents ?? []));\n }\n for (const c of made) if (!reach.has(c.id) && c.orphan === undefined) c.orphan = { step, event };\n };\n\n diagram.steps.forEach((step, s) => {\n step.events.forEach((e, k) => {\n if (e.type === \"commit\") commit(e, s, k);\n else if (e.type === \"branch\") {\n if (!byId.has(e.from)) return;\n if (laneOf(e.from) !== e.branch) links.push({ kind: \"branch\", from: e.from, to: e.branch, step: s, event: k });\n settle(s, k, () => {\n tips.set(e.branch, e.from);\n attached = e.branch;\n headAt = e.from;\n });\n } else if (e.type === \"delete\") {\n // 枝を消すと、その枝の札は図から消える。帯は残す (#3632)\n if (!tips.has(e.branch)) return;\n settle(s, k, () => {\n tips.set(e.branch, null);\n });\n } else if (e.type === \"edge\") {\n const ref = e.from;\n if ((ref !== HEAD && !tips.has(ref)) || !byId.has(e.to)) return;\n settle(\n s,\n k,\n () => {\n if (ref === HEAD) {\n attached = null;\n headAt = e.to;\n return;\n }\n tips.set(ref, e.to);\n if (attached === ref) headAt = e.to;\n else if (attached === null && headAt === e.to) attached = ref;\n },\n ref,\n );\n } else return;\n prune(s, k);\n });\n for (const n of names) at.get(n)?.push(n === HEAD ? headAt : (tips.get(n) ?? null));\n heads.push(attached);\n for (const n of names) {\n const slot = shown.get(n);\n if (slot) tags.push({ ref: n, step: s, slot });\n }\n });\n\n function laneOf(id: string): string | undefined {\n return byId.get(id)?.branch;\n }\n\n function commit(e: Extract<DiagramEvent, { type: \"commit\" }>, s: number, k: number): void {\n if (byId.has(e.id)) return;\n const copy = e.copy !== undefined && byId.has(e.copy) ? e.copy : undefined;\n const base = copy !== undefined && attached === null && headAt !== null ? headAt : (tips.get(e.branch) ?? null);\n const joined = e.merge !== undefined && e.merge !== e.branch ? (tips.get(e.merge) ?? undefined) : undefined;\n const parents = [...new Set([base, joined].filter((c): c is string => c !== null && c !== undefined))];\n const c: Made = {\n id: e.id,\n branch: e.branch,\n parents,\n ...(joined !== undefined && joined !== base ? { joined } : {}),\n ...(copy !== undefined ? { copy } : {}),\n ...(e.hash !== undefined ? { hash: e.hash } : {}),\n ...(e.note !== undefined ? { note: e.note } : {}),\n step: s,\n event: k,\n };\n made.push(c);\n byId.set(c.id, c);\n for (const p of parents) links.push({ kind: \"parent\", from: p, to: c.id, step: s, event: k });\n if (copy !== undefined) links.push({ kind: \"copy\", from: copy, to: c.id, step: s, event: k });\n const first = attached === null && headAt === null;\n settle(s, k, () => {\n if (copy === undefined) {\n tips.set(e.branch, c.id);\n if (attached === e.branch) headAt = c.id;\n } else if (attached === null) headAt = c.id;\n if (first) {\n attached = e.branch;\n headAt = c.id;\n }\n });\n }\n\n const refs: GitRef[] = names.map((name) => ({ name, at: at.get(name) ?? [], ...(name === HEAD ? { attached: heads } : {}) }));\n return { branches, made, links, moves, refs, tags, rows: most };\n}\n\n/** 3 次の Bézier 曲線を点で区切る。始まりの点は含めない */\nfunction cubic(p0: Point, c1: Point, c2: Point, p3: Point): Point[] {\n const n = LOOK.git.samples;\n return Array.from({ length: n }, (_, k): Point => {\n const t = (k + 1) / n;\n const u = 1 - t;\n const at = (i: 0 | 1): number => u * u * u * p0[i] + 3 * u * u * t * c1[i] + 3 * u * t * t * c2[i] + t * t * t * p3[i];\n return [at(0), at(1)];\n });\n}\n\n/**\n * 札を動かす線。高さの違う札の間は、低い側の札の x で縦に進み、高い側の札の高さで横に進む鉤形にする。\n * 一番上でない帯の commit は上の帯の commit と列の半分ずれるので、縦の線は上の帯の字の間を通る\n */\nfunction elbow(from: Point, to: Point): Point[] {\n if (Math.abs(from[1] - to[1]) < 0.5) return [from, to];\n return from[1] > to[1] ? [from, [from[0], to[1]], to] : [from, [to[0], from[1]], to];\n}\n\n/** 丸の真ん中と半径 */\ntype Circle = { cx: number; cy: number; r: number };\n\n/**\n * 枝へ分かれる線。親の丸から縦に出て曲がり、`ty` の高さを横へ `tx` まで進む。\n * `dx` は縦に出る所を丸の真ん中から横へずらす長さ (#3547)。丸の幅に収まる出口は丸の縁から縦に出し、\n * 丸の幅を越える出口は丸の縁から斜めに出て、ずらした所で縦に折れる\n */\nfunction fork(p: Circle, tx: number, ty: number, dx = 0): Point[] {\n const sign = ty > p.cy ? 1 : -1;\n const x = p.cx + dx;\n const inside = Math.abs(dx) < p.r;\n const lead: Point[] = inside ? [] : [[p.cx + Math.sign(dx) * p.r * Math.SQRT1_2, p.cy + sign * p.r * Math.SQRT1_2]];\n const p0: Point = [x, p.cy + sign * (inside ? Math.sqrt(p.r * p.r - dx * dx) : Math.abs(dx))];\n const turn = Math.max(0, Math.min(LOOK.git.turn, tx - x));\n const p3: Point = [x + turn, ty];\n const curve = cubic(p0, [p0[0], p0[1] + (ty - p0[1]) * 0.7], [x + turn * 0.2, ty], p3);\n return [...lead, p0, ...curve, ...(tx > p3[0] ? [[tx, ty] as Point] : [])];\n}\n\n/**\n * 同じ commit から同じ向きに分かれる線の出口を、行き先の帯ごとに横へ離す長さ (#3547)。\n * 出口の間は、崩れの検査が並んだ線に求める間 (`APART.line`) に線の太さを足した値にし、2本の線の縁どうしの間も検査の下限を下回らない。\n * 遠い帯へ行く線ほど左から出す。近い帯へ行く線は先に右へ曲がるので、遠い帯へ縦に進む線を横切らない。\n * 1本だけ分かれる commit の線は丸の真ん中から出す\n */\nfunction exits(forks: { from: GitPlaced; ty: number }[]): Map<string, number> {\n const apart = APART.line + LOOK.stroke.git;\n const groups = new Map<string, { id: string; cy: number; ys: number[] }>();\n for (const { from, ty } of forks) {\n const key = `${from.id}\\n${Math.sign(ty - from.cy)}`;\n const group = groups.get(key) ?? { id: from.id, cy: from.cy, ys: [] };\n if (!group.ys.includes(ty)) group.ys.push(ty);\n groups.set(key, group);\n }\n const out = new Map<string, number>();\n for (const { id, cy, ys } of groups.values()) {\n ys.sort((a, b) => Math.abs(b - cy) - Math.abs(a - cy));\n ys.forEach((ty, k) => out.set(`${id}\\n${ty}`, (k - (ys.length - 1) / 2) * apart));\n }\n return out;\n}\n\n/** 枝から入る線。親の帯の線を横へ進み、曲がって子の丸へ縦に入る */\nfunction join(p: Circle, c: Circle): Point[] {\n const sign = c.cy < p.cy ? 1 : -1;\n const p0: Point = [p.cx + p.r, p.cy];\n const p3: Point = [c.cx, c.cy + sign * c.r];\n const turn = Math.max(0, Math.min(LOOK.git.turn, c.cx - p0[0]));\n const h: Point = [c.cx - turn, p.cy];\n const curve = cubic(h, [c.cx - turn * 0.2, p.cy], [c.cx, p3[1] + (p.cy - p3[1]) * 0.7], p3);\n return [p0, ...(h[0] > p0[0] ? [h] : []), ...curve];\n}\n\n/** 当て直しの線。元の丸の縁から写しの丸の縁へ、S 字に縦に渡る。同じ帯の時は丸の上を弧で渡る */\nfunction copyLine(p: Circle, c: Circle): Point[] {\n if (Math.abs(p.cy - c.cy) < 0.5) {\n const top = p.cy - p.r;\n const lift = LOOK.git.turn * 0.7;\n return [[p.cx, top], ...cubic([p.cx, top], [p.cx, top - lift], [c.cx, top - lift], [c.cx, top])];\n }\n const sign = c.cy < p.cy ? -1 : 1;\n const p0: Point = [p.cx, p.cy + sign * p.r];\n const p3: Point = [c.cx, c.cy - sign * c.r];\n const mid = (p3[1] - p0[1]) * 0.5;\n return [p0, ...cubic(p0, [p0[0], p0[1] + mid], [p3[0], p3[1] - mid], p3)];\n}\n\nexport function layoutGit(diagram: DiagramModel): GitLayout {\n const { margin, gap, box: B, region: R, git: G, carrier: C } = LOOK;\n const walked = walk(diagram);\n const notes = new Map((diagram.git?.branches ?? []).map((b) => [b.id, b.note]));\n const laneIndex = new Map(walked.branches.map((id, i) => [id, i]));\n const colorOf = (branch: string): ColorKey => G.colors[(laneIndex.get(branch) ?? 0) % G.colors.length] as ColorKey;\n\n // 列。親より 1 列右で、同じ帯では前に積んだ commit より右\n const col = new Map<string, number>();\n const laneLast = new Map<string, number>();\n for (const c of walked.made) {\n const k = Math.max(0, ...c.parents.map((p) => (col.get(p) ?? -1) + 1), (laneLast.get(c.branch) ?? -1) + 1);\n col.set(c.id, k);\n laneLast.set(c.branch, k);\n }\n /** hash と一言の行と、行ごとの字。hash は等幅で書く */\n const linesOf = (c: Made): { text: string; style: TextStyle }[] => [\n ...(c.hash !== undefined ? [{ text: c.hash, style: TYPE.gitHash }] : []),\n ...(c.note !== undefined ? [{ text: c.note, style: TYPE.gitNote }] : []),\n ];\n const textW = (c: Made): number => Math.max(0, ...linesOf(c).map((line) => textWidth(line.text, line.style)));\n const tagW = (ref: string): number => textWidth(ref, hasWide(ref) ? TYPE.carrierJa : TYPE.carrier) + C.tagPadX * 2;\n const refWidth = Math.max(0, ...walked.refs.map((r) => tagW(r.name)));\n const pitch = Math.max(G.pitch, ...walked.made.map((c) => textW(c) + G.textGap), refWidth + G.textGap);\n\n // 帯の左上の名前と添え書き。最初の列の commit の字と札は、名前の右に置く\n const headers = walked.branches.map((id) => ({ w: Math.max(R.icon, textWidth(id, TYPE.regionName), textWidth(notes.get(id) ?? \"\", TYPE.regionNote)) }));\n const headerRight = margin + R.inset + Math.max(0, ...headers.map((h) => h.w));\n const firstHalf = Math.max(G.r, ...walked.made.filter((c) => col.get(c.id) === 0 && laneIndex.get(c.branch) === 0).map((c) => textW(c) / 2), refWidth / 2);\n const x0 = Math.max(G.x0, headerRight + gap + firstHalf);\n\n // 帯の高さ。札が 2 段より多く重なる commit がある帯は、その分だけ線を下げる。\n // 一番上でない帯の下は、その帯の commit へ札を動かす線の名前を置く帯だけ、名前の分を空ける\n const named = new Set(\n walked.moves.flatMap((mv) => {\n const source = diagram.steps[mv.step]?.events[mv.event];\n return mv.line && mv.to && source?.type === \"edge\" && source.label !== undefined ? [walked.made.find((c) => c.id === mv.to?.commit)?.branch ?? \"\"] : [];\n }),\n );\n const extraRows = (branch: string): number =>\n Math.max(0, ...walked.made.filter((c) => c.branch === branch).map((c) => (walked.rows.get(c.id) ?? 0) - 2)) * G.row;\n // 一番上の帯の commit が字を持たない時は、札を丸のすぐ上に置き、字の分の高さを帯から除く\n const topText = walked.made.some((c) => laneIndex.get(c.branch) === 0 && linesOf(c).length > 0);\n const lanes: GitLane[] = [];\n let y = margin;\n walked.branches.forEach((id, i) => {\n const top = i === 0;\n const tagBase = top && topText ? G.tagTop : G.tag;\n const line = y + (top ? G.topLine - (G.tagTop - tagBase) : G.line) + extraRows(id);\n const h = line - y + (top ? G.topBelow : named.has(id) ? G.below : G.bare);\n lanes.push({ id, x: margin, y, w: 0, h, line, color: colorOf(id), tagBase });\n y += h + R.gap;\n });\n const lanesBottom = y - R.gap;\n const laneOf = new Map(lanes.map((l) => [l.id, l]));\n\n const commits: GitPlaced[] = walked.made.map((c) => {\n const lane = laneOf.get(c.branch) as GitLane;\n const isTop = laneIndex.get(c.branch) === 0;\n const cx = x0 + pitch * (col.get(c.id) ?? 0) + (isTop ? 0 : pitch / 2);\n const cy = lane.line;\n const lines = linesOf(c);\n // 一番上の帯は丸の上へ、下の行を丸に近く積む。ほかの帯は丸の下へ、上の行を丸に近く積む\n const baselines = lines.map((_, k) => (isTop ? cy - G.above - (lines.length - 1 - k) * G.lineStep : cy + G.under + k * G.lineStep));\n const boxes = lines.map((line, k) => textBox(line.text, cx, baselines[k] as number, line.style, \"middle\"));\n const text = boxes.length === 0 ? undefined : { ...union(boxes), lines: lines.map((line) => line.text), baselines };\n // 当て直した commit は元の commit の色で描く\n const color = c.copy !== undefined ? colorOf(walked.made.find((m) => m.id === c.copy)?.branch ?? c.branch) : colorOf(c.branch);\n return {\n id: c.id,\n branch: c.branch,\n color,\n cx,\n cy,\n r: G.r,\n step: c.step,\n event: c.event,\n parents: c.parents,\n ...(c.copy !== undefined ? { copy: c.copy } : {}),\n ...(c.hash !== undefined ? { hash: c.hash } : {}),\n ...(c.note !== undefined ? { note: c.note } : {}),\n ...(text ? { text } : {}),\n ...(c.orphan ? { orphan: c.orphan.step, orphanEvent: c.orphan.event } : {}),\n };\n });\n const placed = new Map(commits.map((c) => [c.id, c]));\n\n // 枝へ分かれる線の行き先の高さ。枝を切る線は枝の帯の線へ、親から子への線は別の帯の子へ分かれる。merge commit へ入る線と当て直しの線は分かれる線でない。\n // 枝を切る線は、その枝に後で commit を積む時だけ引く。積まない枝の帯へ引くと、線が何も無い所で途切れる\n const forkTo = (l: Walked[\"links\"][number]): number | undefined => {\n const from = placed.get(l.from);\n if (!from) return undefined;\n if (l.kind === \"branch\") return walked.made.some((c) => c.branch === l.to) ? laneOf.get(l.to)?.line : undefined;\n const to = placed.get(l.to);\n if (l.kind === \"copy\" || !to || Math.abs(from.cy - to.cy) < 0.5 || walked.made.find((m) => m.id === l.to)?.joined === l.from) return undefined;\n return to.cy;\n };\n const forkTos = new Map(walked.links.map((l) => [l, forkTo(l)]));\n const offsets = exits(\n walked.links.flatMap((l) => {\n const ty = forkTos.get(l);\n return ty === undefined ? [] : [{ from: placed.get(l.from) as GitPlaced, ty }];\n }),\n );\n const links: GitLink[] = walked.links.flatMap((l): GitLink[] => {\n const from = placed.get(l.from);\n if (!from) return [];\n const ty = forkTos.get(l);\n const dx = ty === undefined ? 0 : (offsets.get(`${from.id}\\n${ty}`) ?? 0);\n if (l.kind === \"branch\") {\n if (ty === undefined) return [];\n return [{ ...l, points: fork(from, from.cx + dx + G.turn, ty, dx), color: colorOf(l.to) }];\n }\n const to = placed.get(l.to) as GitPlaced;\n let points: Point[];\n if (ty !== undefined) points = fork(from, to.cx - to.r, ty, dx);\n else if (l.kind === \"copy\") points = copyLine(from, to);\n else if (Math.abs(from.cy - to.cy) < 0.5) points = [[from.cx + from.r, from.cy], [to.cx - to.r, to.cy]];\n else points = join(from, to);\n return [{ ...l, points, color: to.color }];\n });\n\n /** 札の段の四角。一番上の帯は字の上に、ほかの帯は丸の上に重ねる */\n const tagRect = (ref: string, slot: Slot): Rect => {\n const c = placed.get(slot.commit) as GitPlaced;\n const base = laneOf.get(c.branch)?.tagBase ?? G.tag;\n const w = tagW(ref);\n return { x: c.cx - w / 2, y: c.cy - base - slot.row * G.row - C.tagH / 2, w, h: C.tagH };\n };\n const center = (r: Rect): Point => [r.x + r.w / 2, r.y + r.h / 2];\n /**\n * 札を動かす線の端の四角。着いた札が段の終わりまでその段に留まる時はその四角。\n * 同じ段のうちに消えるか先へ進む時は、段の終わりにその札が出ている四角で、枝に戻った HEAD は戻った枝の札の四角 (#3648)。\n * 段の終わりに札が出ていない時 (同じ段で枝を消した時) は着いた段の四角のまま\n */\n const lineEnd = (m: Walked[\"moves\"][number], to: Rect): Rect => {\n const slot = m.to;\n if (!slot || walked.tags.some((t) => t.ref === m.ref && t.step === m.step && t.slot.commit === slot.commit && t.slot.row === slot.row)) return to;\n const name = m.ref === HEAD ? (walked.refs.find((r) => r.name === HEAD)?.attached?.[m.step] ?? HEAD) : m.ref;\n const end = walked.tags.find((t) => t.ref === name && t.step === m.step);\n return end ? tagRect(name, end.slot) : to;\n };\n // 札を動かす線は札と同じ墨の灰で引く。札は枝の色を持たず、同じ札の通り道に重なる線どうしを 1 本に見せるため\n const moves: GitMove[] = walked.moves.map((m) => {\n const from = m.from ? tagRect(m.ref, m.from) : undefined;\n const to = m.to ? tagRect(m.ref, m.to) : undefined;\n const source = diagram.steps[m.step]?.events[m.event];\n const carried = m.line && source?.type === \"edge\" && source.carry.kind !== \"none\" && !(source.carry.kind === \"tag\" && source.carry.text === source.from);\n return {\n ref: m.ref,\n step: m.step,\n event: m.event,\n ...(from ? { from } : {}),\n ...(to ? { to } : {}),\n ...(m.to ? { target: m.to.commit } : {}),\n ...(carried ? { carried: true } : {}),\n ...(m.line && from && to ? { line: elbow(center(from), center(lineEnd(m, to))) } : {}),\n color: \"slate\",\n };\n });\n const tags: GitTag[] = walked.tags.map((t) => ({ ...tagRect(t.ref, t.slot), ref: t.ref, step: t.step }));\n\n // 箱は commit の並びの右に縦に並べる。最初の箱は 2 本目の帯の線の高さに置く\n const colors = boxColors(diagram);\n const right = Math.max(\n x0,\n ...commits.flatMap((c) => [c.cx + c.r, ...(c.text ? [c.text.x + c.text.w] : [])]),\n ...tags.map((t) => t.x + t.w),\n ...moves.flatMap((m) => [m.from, m.to].flatMap((r) => (r ? [r.x + r.w] : []))),\n );\n const boxX = right + G.boxGap;\n const firstCy = (lanes[1] ?? lanes[0])?.line ?? margin + B.h / 2;\n // 形を持つ箱は、中身が形の内に収まる大きさにする (#3520)。高くなった箱の分だけ下の箱を下げる\n let top = 0;\n const boxes: SceneBox[] = diagram.boxes.map((b, i) => {\n const fit = shapedSize(diagram, b.id, boxWidth(diagram, b.id, true), true);\n const { w, h } = fit;\n // 最初の箱は、高くなっても真ん中を 2 本目の帯の線の高さに置く\n const y = i === 0 ? firstCy - h / 2 : top;\n top = y + h + gap;\n return {\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 });\n\n const regions: SceneRegion[] = lanes.map((lane, i) => {\n const note = notes.get(lane.id);\n return {\n id: lane.id,\n lines: [lane.id],\n ...(note !== undefined ? { note } : {}),\n icon: \"branch\",\n color: lane.color,\n x: lane.x,\n y: lane.y,\n w: 0,\n h: lane.h,\n header: { x: lane.x + R.inset, y: lane.y + R.inset, w: headers[i]?.w ?? 0, h: R.nameY - R.inset + (note !== undefined ? R.line : 0) + gap / 2 },\n };\n });\n\n const layout: GitLayout = {\n kind: \"git\",\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 lanes,\n commits,\n links,\n tags,\n refs: walked.refs,\n moves,\n };\n layout.badges = badgesOf(diagram, layout);\n layout.labels = labelsOf(diagram, layout);\n\n const contentRight = Math.max(right, ...boxes.map((b) => b.x + b.w), ...layout.labels.map((l) => l.x + l.w)) + R.pad;\n const width = Math.max(contentRight + margin, stripNeed(diagram) + margin * 2);\n for (const region of regions) region.w = width - margin * 2;\n for (const lane of lanes) lane.w = width - margin * 2;\n const bottom = Math.max(lanesBottom, ...boxes.map((b) => b.y + b.h), ...layout.labels.map((l) => l.y + l.h));\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);\n return layout;\n}\n\nfunction union(rects: Rect[]): Rect {\n const x = Math.min(...rects.map((r) => r.x));\n const y = Math.min(...rects.map((r) => r.y));\n return { x, y, w: Math.max(...rects.map((r) => r.x + r.w)) - x, h: Math.max(...rects.map((r) => r.y + r.h)) - y };\n}\n\n/**\n * 段で最初に起きる、番号を置ける出来事。commit の親からの線と枝を切る線は線を、札を動かす線は札が着く commit を返す。\n * 札を動かす線は段が終わると消えるので、番号は線ではなく着いた commit の脇に置く\n */\nfunction firstMark(layout: GitLayout, step: number): { event: number; points?: Point[]; target?: GitPlaced; color: ColorKey } | undefined {\n const marks = [\n ...layout.links.filter((l) => l.step === step && l.kind !== \"copy\").map((l) => ({ event: l.event, points: l.points, color: l.color })),\n ...layout.moves.flatMap((m) => {\n const target = layout.commits.find((c) => c.id === m.target);\n return m.step === step && m.line && target ? [{ event: m.event, target, color: target.color }] : [];\n }),\n ].sort((a, b) => a.event - b.event);\n return marks[0];\n}\n\n/**\n * 段の番号の丸の真ん中どうしの間の下限 (#3547)。丸の縁どうしの間を、崩れの検査が近すぎる番号に数える下限 (`APART.badge`) より狭くしない。\n * 線の上の番号 (`badgeOnPath`) と同じ値で離し、描いた図と検査が食い違わないようにする\n */\nconst BADGES_APART = LOOK.badge.r * 2 + APART.badge;\n\n/**\n * commit の丸の右、下、左、上のうち、段の番号の丸が札と字と丸に掛からず、枝の帯の枠線 (`frames` の高さの線) にも掛からず、\n * 先に置いた番号からも離れた最初の点 (#3525)。無ければ `undefined`\n */\nfunction besideCommit(c: GitPlaced, taken: Point[], avoid: Rect[], frames: number[]): Point | undefined {\n const { r, inset } = LOOK.badge;\n const d = c.r + inset + r;\n const spots: Point[] = [\n [c.cx + d, c.cy],\n [c.cx, c.cy + d],\n [c.cx - d, c.cy],\n [c.cx, c.cy - d],\n ];\n return spots.find(\n (p) => taken.every(([x, y]) => Math.hypot(p[0] - x, p[1] - y) >= BADGES_APART) && avoid.every((a) => gapBetween(badgeRect(p), a) >= LOOK.label.touch) && !onFrameLine(p[1], frames),\n );\n}\n\n/**\n * 線の上で、段の番号の丸が札と字と丸 (`avoid`) に掛からず、枝の帯の枠線 (`frames` の高さの線、#3525) にも掛からず、先に置いた番号 (`taken`) からも離れた最初の点。\n * 札はどの段に留まる札も避ける。済んだ段の番号は最後の段まで残るので、後の段に来る札にも掛けない。無ければ `undefined`\n */\nfunction clearOnPath(points: Point[], taken: Point[], avoid: Rect[], frames: number[]): Point | undefined {\n const { r, along: start, short } = LOOK.badge;\n const length = pathLength(points);\n const first = length < short ? Math.min(r + 1, length / 2) : start;\n for (let d = first; d <= length; d += 1) {\n const p = along(points, d);\n const rect = badgeRect(p);\n if (taken.every(([x, y]) => Math.hypot(p[0] - x, p[1] - y) >= BADGES_APART) && avoid.every((a) => gapBetween(rect, a) >= LOOK.label.touch) && !onFrameLine(p[1], frames)) return p;\n }\n return undefined;\n}\n\n/**\n * 段の番号。commit を積む段と枝を切る段は、段で最初に引く線の始まりから少し進んだ所に置き、先に置いた番号と札と字と丸を避けて線に沿って進める。\n * 札を動かす段は、札が着いた commit の丸の脇に置く。線の番号と commit の脇の番号は、枝の帯の枠線を避ける (#3525)。\n * 線の無い段は、箱を書き換える段なら箱の左上の角に、帯を書き換える段なら帯の左上の角の丸みの中に、\n * 何も起きない段は一番上の枝の先端の commit の脇に置き、脇が埋まっていれば前の段の番号の所に置く。\n * 前の段の番号と同じ所に来た番号は、前の番号の脇に並べる (#3525)\n */\nfunction badgesOf(diagram: DiagramModel, layout: GitLayout): SceneBadge[] {\n const { inset } = LOOK.badge;\n const taken: Point[] = [];\n const all = [...layout.links.map((l) => l.points), ...layout.moves.flatMap((m) => (m.line ? [m.line] : []))];\n const out: SceneBadge[] = [];\n const avoid: Rect[] = [\n ...layout.tags,\n ...layout.commits.flatMap((c) => [{ x: c.cx - c.r, y: c.cy - c.r, w: c.r * 2, h: c.r * 2 }, ...(c.text ? [c.text] : [])]),\n ];\n const frames = frameLines([...layout.regions, ...(layout.strip ? [layout.strip] : [])]);\n diagram.steps.forEach((step, s) => {\n const mark = firstMark(layout, s);\n const near = mark?.target ? besideCommit(mark.target, taken, avoid, frames) : undefined;\n if (mark && (mark.points || near)) {\n const points = mark.points;\n const point = near ?? (points ? (clearOnPath(points, taken, avoid, frames) ?? badgeOnPath(points, taken, all.filter((p) => p !== points), frames)) : [0, 0]);\n taken.push(point);\n out.push({ step: s, x: point[0], y: point[1], color: mark.color });\n return;\n }\n const box = step.events.flatMap((e) => (e.type === \"swap\" || e.type === \"action\" ? [e.box] : [])).map((id) => layout.boxes.find((b) => b.id === id))[0];\n if (box) {\n out.push(cornerOf(box, s));\n return;\n }\n if (layout.strip && step.events.some((e) => e.type === \"strip\")) {\n const [x, y] = stripBadge(layout.strip);\n out.push({ step: s, x, y, color: \"slate\" });\n return;\n }\n // 何も起きない段と、着いた commit の脇が埋まっている札の段は、一番上の枝の先端の commit の脇に置く。\n // 先端が無いか、脇が埋まっている時は前の段の番号の所に置き、前の番号の脇に並べる\n const tip = layout.commits.find((c) => c.id === layout.refs[0]?.at[s]);\n const spot = tip ? besideCommit(tip, taken, avoid, frames) : undefined;\n if (tip && spot) {\n taken.push(spot);\n out.push({ step: s, x: spot[0], y: spot[1], color: tip.color });\n return;\n }\n const before = out[out.length - 1];\n const lane = layout.lanes[0];\n out.push(before ? { ...before, step: s } : { step: s, x: (lane?.x ?? 0) + (lane?.w ?? 0) - inset - LOOK.badge.r, y: (lane?.y ?? 0) + inset + LOOK.badge.r, color: lane?.color ?? \"slate\" });\n });\n return besideSameSpot(out, badgeBlocked(layout, avoid));\n}\n\n/**\n * 札を動かす線の名前。一番上の帯の commit へ動かす線は札の段のさらに上に、ほかの帯の commit へ動かす線は丸の下の字のさらに下に置き、\n * 丸と字と、その段の終わりに留まる札と、同じ時刻に見える段の番号を避ける\n */\nfunction labelsOf(diagram: DiagramModel, layout: GitLayout): SceneLabel[] {\n const G = LOOK.git;\n const labels: SceneLabel[] = [];\n const circles: Rect[] = layout.commits.map((c) => ({ x: c.cx - c.r, y: c.cy - c.r, w: c.r * 2, h: c.r * 2 }));\n const texts: Rect[] = layout.commits.flatMap((c) => (c.text ? [c.text] : []));\n const headers = layout.regions.map((r) => r.header);\n for (const move of layout.moves) {\n const source = diagram.steps[move.step]?.events[move.event];\n if (source?.type !== \"edge\" || source.label === undefined || !move.line) continue;\n const target = layout.commits.find((c) => c.id === source.to);\n if (!target) continue;\n const top = layout.lanes[0]?.id === target.branch;\n const w = textWidth(source.label, hasWide(source.label) ? TYPE.labelJa : TYPE.label) + LOOK.label.padX * 2;\n const [mx] = move.line.reduce((sum, p) => [sum[0] + p[0] / (move.line as Point[]).length, 0], [0, 0]);\n const rows = Math.max(0, ...layout.tags.filter((t) => t.step === move.step && Math.abs(t.x + t.w / 2 - target.cx) < 0.5).map((t) => target.cy - t.y));\n // 置く側を書いた名前は、その側の線の脇から探す\n const side = source.labelSide ?? (top ? \"above\" : \"below\");\n const base =\n source.labelSide !== undefined\n ? undefined\n : top\n ? { x: mx - w / 2, y: target.cy - Math.max(rows, (layout.lanes[0]?.tagBase ?? G.tag) + LOOK.carrier.tagH / 2) - LOOK.label.soft - LOOK.label.h }\n : { x: mx - w / 2, y: target.cy + G.labelUnder };\n const seen = layout.badges.filter((b) => b.step <= move.step).map((b) => badgeRect([b.x, b.y]));\n const tags = layout.tags.filter((t) => t.step === move.step);\n labels.push(\n placeLabel(\n { step: move.step, event: move.event, text: source.label, points: move.line, color: move.color, side, ...(base ? { base } : {}) },\n { hard: [...circles, ...layout.boxes], soft: [...texts, ...tags, ...headers, ...labels.filter((l) => l.step === move.step)], touch: seen },\n ),\n );\n }\n return labels;\n}\n","/** 枝分かれの図の描く部品の組 (#3248、#3656)。並べ方は図の種類の置き場 (`kinds/git/layout.ts`、#3347)、線と commit と札の描き方は `render/git.ts` が持つ (#3164) */\nimport { drawGit } from \"../render/git\";\nimport { type GitLayout, layoutGit } from \"./git/layout\";\nimport type { KindParts } from \"./parts\";\n\nexport const parts: KindParts<GitLayout> = {\n layout: layoutGit,\n draw: (layout, diagram, ctx) => {\n const git = drawGit(layout, diagram, ctx.t, ctx);\n return { base: git.links, lit: git.lines, node: git.commits, top: git.tags };\n },\n};\n"]}
1
+ {"version":3,"sources":["/Users/cardene/Desktop/projects/dragon-3715-release-0-76-0/packages/dragon/dist/light/git-I2U4X7BH.cjs","../../src/blocks/commit/draw.ts","../../src/blocks/branch/draw.ts","../../src/blocks/copy/draw.ts","../../src/blocks/merge/draw.ts","../../src/render/git.ts","../../src/kinds/git/layout.ts","../../src/kinds/git.ts"],"names":["y"],"mappings":"AAAA;AACE;AACF,wDAA6B;AAC7B;AACE;AACF,wDAA6B;AAC7B;AACE;AACA;AACA;AACA;AACF,wDAA6B;AAC7B,gCAA6B;AAC7B,gCAA6B;AAC7B;AACE;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;AACE;AACF,wDAA6B;AAC7B,gCAA6B;AAC7B,gCAA6B;AAC7B,gCAA6B;AAC7B;AACA;AChCO,IAAM,WAAA,EAAuB,CAAC,CAAA,EAAG,IAAA,EAAM,GAAA,EAAA,GAAQ;AACpD,EAAA,MAAM,EAAE,EAAE,EAAA,EAAI,GAAA;AACd,EAAA,MAAM,EAAA,EAAI,sCAAA,CAAO,CAAE,MAAA,EAAQ,GAAA,CAAI,MAAM,CAAA;AACrC,EAAA,MAAM,GAAA,EAAK,CAAA,CAAE,EAAA,CAAG;AAAA,IACd,CAAC,CAAA,EAAG,EAAE,OAAA,EAAS,CAAA,EAAG,mBAAA,EAAqB,EAAE,CAAC,CAAA;AAAA,IAC1C,CAAC,IAAA,CAAK,KAAA,EAAO,EAAE,OAAA,EAAS,CAAA,EAAG,mBAAA,EAAqB,EAAE,CAAA,EAAG,sBAAA,CAAK,KAAK,CAAA;AAAA,IAC/D,CAAC,IAAA,CAAK,MAAA,EAAQ,IAAA,EAAM,EAAE,OAAA,EAAS,EAAE,CAAC,CAAA;AAAA,IAClC,CAAC,IAAA,CAAK,KAAA,EAAO,EAAE,mBAAA,EAAqB,EAAE,CAAC,CAAA;AAAA,IACvC,CAAC,CAAA,CAAE,IAAA,EAAM,EAAE,OAAA,EAAS,CAAA,EAAG,mBAAA,EAAqB,EAAE,CAAA,EAAG,sBAAA,CAAK,KAAK,CAAA;AAAA,IAC3D,CAAC,CAAA,CAAE,KAAA,EAAO,EAAE,OAAA,EAAS,CAAA,EAAG,mBAAA,EAAqB,EAAE,CAAC;AAAA,EAClD,CAAC,CAAA;AACD,EAAA,OAAO,CAAA,UAAA,EAAa,kCAAA,CAAG,CAAE,KAAK,CAAC,CAAA,gDAAA,EAAmD,CAAC,CAAA,SAAA,EAAY,EAAE,CAAA,OAAA,CAAA;AACnG,CAAA;AAGO,SAAS,SAAA,CAAU,CAAA,EAAc,MAAA,EAAgB,GAAA,EAAkB;AACxE,EAAA,MAAM,EAAE,EAAE,EAAA,EAAI,GAAA;AACd,EAAA,MAAM,GAAA,mCAAK,MAAA,mBAAO,CAAA,CAAE,IAAA,EAAM,CAAA,CAAE,KAAK,CAAA,6BAAG,OAAA,UAAS,GAAA;AAC7C,EAAA,MAAM,KAAA,EAAO,EAAE,CAAA,EAAG,CAAA,CAAE,GAAA,EAAK,CAAA,CAAE,CAAA,EAAG,CAAA,EAAG,CAAA,CAAE,GAAA,EAAK,CAAA,CAAE,CAAA,EAAG,CAAA,EAAG,CAAA,CAAE,EAAA,EAAI,CAAA,EAAG,CAAA,EAAG,CAAA,CAAE,EAAA,EAAI,EAAE,CAAA;AACpE,EAAA,GAAA,CAAI,GAAA,CAAI,IAAA,CAAK,EAAE,IAAA,EAAM,CAAA,CAAE,EAAA,EAAI,IAAA,EAAM,IAAA,EAAM,KAAA,EAAO,CAAC,CAAC,EAAA,EAAI,MAAA,CAAO,iBAAiB,CAAC,CAAA,EAAG,KAAA,EAAO,KAAK,CAAC,CAAA;AAC7F,EAAA,MAAM,MAAA,EAAA,kCAAS,CAAA,qBAAE,IAAA,6BAAM,OAAA,UAAS,CAAC,GAAA,CAAA,CAC9B,GAAA,CAAI,CAAC,IAAA,EAAM,CAAA,EAAA,GAAM;AAChB,IAAA,MAAM,KAAA,EAAO,EAAA,IAAM,EAAA,GAAK,CAAA,CAAE,KAAA,IAAS,KAAA,CAAA;AACnC,IAAA,MAAM,SAAA,mCAAW,CAAA,qBAAE,IAAA,6BAAM,SAAA,qBAAU,CAAC,GAAA,UAAK,CAAA,CAAE,IAAA;AAC3C,IAAA,OAAO,qCAAA,GAAM,CAAI,GAAA,EAAK,KAAA,EAAO,WAAA,EAAa,UAAA,EAAY,CAAA,CAAE,EAAA,EAAI,QAAA,EAAU,IAAA,EAAM,KAAA,EAAO,sBAAA,CAAK,QAAA,EAAU,sBAAA,CAAK,OAAA,EAAS,CAAC,CAAC,EAAA,EAAI,MAAA,CAAO,iBAAiB,CAAC,CAAA,EAAG,QAAQ,CAAA;AAAA,EAC5J,CAAC,CAAA,CACA,IAAA,CAAK,EAAE,CAAA;AACV,EAAA,MAAM,GAAA,EAAK,CAAA,2BAAA,EAA8B,kCAAA,CAAG,CAAE,EAAE,CAAC,CAAA,KAAA,EAAQ,kCAAA,CAAG,CAAE,GAAA,EAAK,sBAAA,CAAK,QAAA,CAAS,KAAK,CAAC,CAAA,uBAAA,EAA0B,mCAAA,CAAI,CAAE,EAAE,CAAC,CAAA,OAAA,CAAA;AAC1H,EAAA,MAAM,KAAA,EAAO,CAAA,+BAAA,EAAkC,CAAA,CAAE,GAAA,CAAI,EAAE,CAAC,CAAA,+BAAA,EAAkC,kCAAA,CAAG,CAAE,EAAE,CAAC,CAAA,MAAA,EAAS,kCAAA,CAAG,CAAE,EAAE,CAAC,CAAA,KAAA,EAAQ,CAAA,CAAE,CAAC,CAAA,EAAA,EAAK,GAAA,CAAI,EAAE,CAAA,EAAA,EAAK,EAAE,CAAA,IAAA,CAAA;AAChJ,EAAA,MAAM,KAAA,EAAO,MAAA,IAAU,GAAA,EAAK,GAAA,EAAK,CAAA,uBAAA,EAA0B,CAAA,CAAE,GAAA,CAAI,EAAE,CAAC,CAAA,EAAA,EAAK,KAAK,CAAA,IAAA,CAAA;AAC9E,EAAA,MAAM,SAAA,EAAW,CAAA,CAAE,OAAA,IAAW,KAAA,EAAA,EAAY,KAAA,EAAA,kBAAY,MAAA,mBAAO,CAAA,CAAE,MAAA,mBAAQ,CAAA,CAAE,WAAA,UAAe,GAAC,CAAA,+BAAG,OAAA;AAC5F,EAAA,MAAM,OAAA,EACJ,SAAA,IAAa,KAAA,EAAA,EACT,GAAA,EACA,CAAA,6BAAA,EAAgC,mCAAA,CAAI,CAAE,EAAE,CAAC,CAAA,SAAA,EAAY,CAAA,CAAE,GAAA,CAAI,QAAA,EAAU,CAAA,CAAE,IAAA,EAAM,EAAE,CAAA,EAAG,IAAI,CAAC,CAAC,CAAA,iCAAA,EAAoC,kCAAA,CAAG,CAAE,EAAE,CAAC,CAAA,MAAA,EAAS,kCAAA,CAAG,CAAE,EAAE,CAAC,CAAA,KAAA,EAAQ,sBAAA,CAAK,GAAA,CAAI,MAAM,CAAA,gCAAA,EAAmC,kCAAA,CAAG,CAAE,EAAE,CAAC,CAAA,KAAA,EAAQ,kCAAA,CAAG,CAAE,GAAA,EAAK,sBAAA,CAAK,QAAA,CAAS,KAAK,CAAC,CAAA,uBAAA,EAA0B,mCAAA,CAAI,CAAE,EAAE,CAAC,CAAA,WAAA,CAAA;AACtS,EAAA,OAAO,CAAA,gBAAA,EAAmB,mCAAA,CAAI,CAAE,EAAE,CAAC,CAAA,SAAA,EAAY,kCAAA,CAAG,CAAE,KAAK,CAAC,CAAA,EAAA,EAAK,IAAI,CAAA,EAAA;AACrE;AD2BsE;AACA;AE3EK;AF6EL;AACA;AG7ElB;AACpC,EAAA;AACsD,EAAA;AACtE;AH+EsE;AACA;AIpFM;AJsFN;AACA;AKxEd;AACQ;AAGI;AACnD,EAAA;AACQ,EAAA;AAC2C,EAAA;AACH,EAAA;AACjE;AAG8G;AAMlB;AAC3C,EAAA;AACgB,EAAA;AACvC,EAAA;AAC1B;AAEiK;AACjJ,EAAA;AACqF,EAAA;AAGrF,EAAA;AACyB,IAAA;AACjB,IAAA;AAC0C,IAAA;AACN,IAAA;AAEhD,EAAA;AAEyD,EAAA;AAGhD,EAAA;AACsB,IAAA;AACN,IAAA;AACe,IAAA;AAC9B,IAAA;AACL,MAAA;AACW,MAAA;AACT,MAAA;AACoB,MAAA;AAChC,IAAA;AACe,IAAA;AAC4B,MAAA;AACqB,MAAA;AAC7B,MAAA;AACK,MAAA;AACP,MAAA;AACN,MAAA;AACsB,MAAA;AACjD,IAAA;AACM,IAAA;AACoB,MAAA;AAC3B,IAAA;AAEM,EAAA;AAIQ,EAAA;AAC6C,IAAA;AACP,IAAA;AACF,IAAA;AACrC,IAAA;AACH,MAAA;AACC,MAAA;AACA,MAAA;AACW,MAAA;AACT,MAAA;AACD,MAAA;AACI,MAAA;AAChB,IAAA;AAC+D,IAAA;AAEzD,EAAA;AACgD,EAAA;AAGrD,EAAA;AACC,IAAA;AACE,MAAA;AAC0C,MAAA;AAC1C,MAAA;AACA,MAAA;AACF,IAAA;AAEU,EAAA;AACqB,EAAA;AACvC;AAWU;AACM,EAAA;AAC8B,EAAA;AACD,EAAA;AAClC,EAAA;AACL,EAAA;AAC+B,EAAA;AAC6B,IAAA;AACvD,IAAA;AACT,EAAA;AACuB,EAAA;AACgB,IAAA;AAC1B,IAAA;AACoB,IAAA;AACU,IAAA;AACN,IAAA;AAC5B,IAAA;AAE6B,IAAA;AAC2B,MAAA;AACvD,MAAA;AAC0B,QAAA;AACE,QAAA;AACU,QAAA;AACxB,QAAA;AACpB,MAAA;AACuC,MAAA;AACvC,MAAA;AACF,IAAA;AAC2C,IAAA;AACN,IAAA;AACtB,IAAA;AAEsB,MAAA;AACyB,MAAA;AACvD,MAAA;AACe,IAAA;AACoC,MAAA;AACnD,MAAA;AACP,IAAA;AAC0C,IAAA;AAC5C,EAAA;AAC8B,EAAA;AACE,EAAA;AACV,EAAA;AACe,EAAA;AAC8B,EAAA;AAC1B,EAAA;AAC2B,EAAA;AACF,EAAA;AACpE;ALsCsE;AACA;AMjDzB;AACmB,EAAA;AAC3B,EAAA;AACW,IAAA;AAC9C,EAAA;AACmE,EAAA;AACO,EAAA;AAC9C,EAAA;AACE,EAAA;AACR,EAAA;AACa,EAAA;AACH,EAAA;AACA,EAAA;AACF,EAAA;AACkB,EAAA;AACX,EAAA;AACD,EAAA;AACJ,EAAA;AACuC,EAAA;AACrC,EAAA;AAGmD,EAAA;AACzC,EAAA;AACR,IAAA;AACJ,IAAA;AACE,IAAA;AAClC,EAAA;AAE4F,EAAA;AAClC,IAAA;AACrC,IAAA;AACZ,IAAA;AACyD,IAAA;AAC3B,IAAA;AACT,MAAA;AAChB,MAAA;AACiD,QAAA;AACzC,QAAA;AAClB,MAAA;AACmB,MAAA;AACpB,IAAA;AACoC,IAAA;AAE2B,MAAA;AACpC,MAAA;AACtB,MAAA;AACiB,MAAA;AACyB,QAAA;AACV,QAAA;AACnB,QAAA;AACM,QAAA;AACyC,QAAA;AAC7C,QAAA;AACnB,MAAA;AACmE,MAAA;AACrE,IAAA;AACF,EAAA;AAEqD,EAAA;AACrB,IAAA;AACgD,IAAA;AACrD,IAAA;AACF,MAAA;AACF,MAAA;AACP,MAAA;AAC+B,MAAA;AAC7C,IAAA;AACsE,IAAA;AACxE,EAAA;AAEmC,EAAA;AACH,IAAA;AACW,MAAA;AACT,MAAA;AACL,QAAA;AACuC,QAAA;AAC3C,QAAA;AACQ,UAAA;AACZ,UAAA;AACF,UAAA;AACZ,QAAA;AAC6B,MAAA;AAEL,QAAA;AACN,QAAA;AACM,UAAA;AACxB,QAAA;AAC2B,MAAA;AACd,QAAA;AAC2C,QAAA;AACzD,QAAA;AACE,UAAA;AACA,UAAA;AACM,UAAA;AACc,YAAA;AACL,cAAA;AACA,cAAA;AACX,cAAA;AACF,YAAA;AACkB,YAAA;AACe,YAAA;AACyB,YAAA;AAC5D,UAAA;AACA,UAAA;AACF,QAAA;AACK,MAAA;AACG,MAAA;AACX,IAAA;AACkE,IAAA;AAChD,IAAA;AACI,IAAA;AACG,MAAA;AACqB,MAAA;AAC/C,IAAA;AACD,EAAA;AAE+C,EAAA;AACzB,IAAA;AACvB,EAAA;AAE0F,EAAA;AACpE,IAAA;AAC6C,IAAA;AACE,IAAA;AACE,IAAA;AACO,IAAA;AAC5D,IAAA;AACR,MAAA;AACI,MAAA;AACV,MAAA;AAC4D,MAAA;AACvB,MAAA;AACU,MAAA;AACA,MAAA;AACzC,MAAA;AACC,MAAA;AACT,IAAA;AACW,IAAA;AACK,IAAA;AAC+C,IAAA;AACM,IAAA;AACvB,IAAA;AAC3B,IAAA;AACO,MAAA;AACC,QAAA;AACe,QAAA;AACC,MAAA;AAC9B,MAAA;AACI,QAAA;AACF,QAAA;AACb,MAAA;AACD,IAAA;AACH,EAAA;AAE4E,EAAA;AACd,EAAA;AAChE;AAGoE;AAC/C,EAAA;AAC+B,EAAA;AAC5B,IAAA;AACN,IAAA;AACmE,IAAA;AAC7D,IAAA;AACrB,EAAA;AACH;AAMgD;AACO,EAAA;AACe,EAAA;AACtE;AAUkE;AACnC,EAAA;AACZ,EAAA;AACe,EAAA;AACwC,EAAA;AACG,EAAA;AACnB,EAAA;AACzB,EAAA;AACmC,EAAA;AACO,EAAA;AAC3E;AAQ8E;AACrC,EAAA;AACkC,EAAA;AACvC,EAAA;AACV,IAAA;AAA4B;AACgB,IAAA;AACtB,IAAA;AACvB,IAAA;AACvB,EAAA;AACoC,EAAA;AACU,EAAA;AACS,IAAA;AAClB,IAAA;AAA6C;AAClF,EAAA;AACO,EAAA;AACT;AAG6C;AACZ,EAAA;AACI,EAAA;AACO,EAAA;AACoB,EAAA;AAC3B,EAAA;AACiC,EAAA;AAClB,EAAA;AACpD;AAGiD;AACd,EAAA;AACV,IAAA;AACQ,IAAA;AACqC,IAAA;AACpE,EAAA;AACgC,EAAA;AACU,EAAA;AACA,EAAA;AACZ,EAAA;AACoC,EAAA;AACpE;AAE4D;AACK,EAAA;AACpC,EAAA;AACuC,EAAA;AACD,EAAA;AACqB,EAAA;AAGlD,EAAA;AACK,EAAA;AACZ,EAAA;AACkC,IAAA;AAC9C,IAAA;AACS,IAAA;AAC1B,EAAA;AAEmE,EAAA;AACK,IAAA;AACA,IAAA;AACxE,EAAA;AAC2E,EAAA;AACF,EAAA;AACL,EAAA;AACH,EAAA;AAGE,EAAA;AACA,EAAA;AACF,EAAA;AACV,EAAA;AAIrC,EAAA;AACa,IAAA;AAC2B,MAAA;AACO,MAAA;AAC9D,IAAA;AACH,EAAA;AAEqC,EAAA;AAE+B,EAAA;AAC1C,EAAA;AAClB,EAAA;AAC2B,EAAA;AACf,IAAA;AAC4B,IAAA;AACe,IAAA;AACF,IAAA;AACO,IAAA;AACvD,IAAA;AACZ,EAAA;AACyB,EAAA;AACwB,EAAA;AAEE,EAAA;AAClB,IAAA;AACU,IAAA;AACkB,IAAA;AAC5C,IAAA;AACO,IAAA;AAEwC,IAAA;AACH,IAAA;AACK,IAAA;AAEI,IAAA;AAC9D,IAAA;AACC,MAAA;AACI,MAAA;AACV,MAAA;AACA,MAAA;AACA,MAAA;AACK,MAAA;AACG,MAAA;AACC,MAAA;AACE,MAAA;AACoC,MAAA;AACA,MAAA;AACA,MAAA;AACxB,MAAA;AACuC,MAAA;AAChE,IAAA;AACD,EAAA;AACmD,EAAA;AAIe,EAAA;AACnC,IAAA;AACZ,IAAA;AACwC,IAAA;AAChC,IAAA;AACkC,IAAA;AAClD,IAAA;AACZ,EAAA;AAC+D,EAAA;AAC/C,EAAA;AACc,IAAA;AACF,MAAA;AACqD,MAAA;AAC9E,IAAA;AACH,EAAA;AACgE,EAAA;AAChC,IAAA;AACX,IAAA;AACK,IAAA;AACiC,IAAA;AAAc;AAC9C,IAAA;AACO,MAAA;AACkC,MAAA;AAClE,IAAA;AAC0B,IAAA;AACtB,IAAA;AAC0D,IAAA;AACR,IAAA;AACS,IAAA;AACpC,IAAA;AACc,IAAA;AAC1C,EAAA;AAGkD,EAAA;AACjB,IAAA;AACgB,IAAA;AAC9B,IAAA;AAC8C,IAAA;AAClE,EAAA;AACgE,EAAA;AAMA,EAAA;AAC/C,IAAA;AAC2C,IAAA;AACQ,IAAA;AACD,IAAA;AAC1B,IAAA;AACzC,EAAA;AAEiD,EAAA;AACA,IAAA;AACN,IAAA;AACW,IAAA;AACc,IAAA;AAC3D,IAAA;AACE,MAAA;AACC,MAAA;AACC,MAAA;AACc,MAAA;AACJ,MAAA;AACmB,MAAA;AACH,MAAA;AAC2B,MAAA;AACvD,MAAA;AACT,IAAA;AACD,EAAA;AAC2E,EAAA;AAG5C,EAAA;AACb,EAAA;AACjB,IAAA;AACkE,IAAA;AACtC,IAAA;AACsC,IAAA;AACpE,EAAA;AACuB,EAAA;AACwC,EAAA;AAErD,EAAA;AAC4C,EAAA;AACc,IAAA;AACjD,IAAA;AAEqB,IAAA;AACxB,IAAA;AACP,IAAA;AACC,MAAA;AACE,MAAA;AACoC,MAAA;AACG,MAAA;AACpB,MAAA;AACxB,MAAA;AACHA,MAAAA;AACG,MAAA;AACY,MAAA;AACH,MAAA;AACd,IAAA;AACD,EAAA;AAEqD,EAAA;AACtB,IAAA;AACvB,IAAA;AACI,MAAA;AACM,MAAA;AACsB,MAAA;AAC/B,MAAA;AACM,MAAA;AACJ,MAAA;AACA,MAAA;AACL,MAAA;AACK,MAAA;AACwD,MAAA;AAClE,IAAA;AACD,EAAA;AAEyB,EAAA;AAClB,IAAA;AACC,IAAA;AACC,IAAA;AACR,IAAA;AACA,IAAA;AACY,IAAA;AACJ,IAAA;AACC,IAAA;AACC,IAAA;AACD,IAAA;AACD,IAAA;AACD,IAAA;AACP,IAAA;AACA,IAAA;AACA,IAAA;AACA,IAAA;AACa,IAAA;AACb,IAAA;AACF,EAAA;AACwC,EAAA;AACA,EAAA;AAE0B,EAAA;AACC,EAAA;AACT,EAAA;AACN,EAAA;AACc,EAAA;AACD,EAAA;AAClD,EAAA;AACwC,EAAA;AAC7B,EAAA;AAEc,EAAA;AACjC,EAAA;AACT;AAEoC;AACS,EAAA;AACA,EAAA;AACwB,EAAA;AACrE;AAM0I;AAC1H,EAAA;AACsD,IAAA;AACnC,IAAA;AAC8B,MAAA;AACK,MAAA;AACjE,IAAA;AAC+B,EAAA;AACpB,EAAA;AAChB;AAM8C;AAM0D;AAC5E,EAAA;AACF,EAAA;AACD,EAAA;AACN,IAAA;AACA,IAAA;AACA,IAAA;AACA,IAAA;AACjB,EAAA;AACa,EAAA;AACsD,IAAA;AACnE,EAAA;AACF;AAM0G;AAChE,EAAA;AACR,EAAA;AAC6B,EAAA;AACpB,EAAA;AACd,IAAA;AACD,IAAA;AACsC,IAAA;AAChE,EAAA;AACO,EAAA;AACT;AAS0E;AACjD,EAAA;AACC,EAAA;AAC2C,EAAA;AACxC,EAAA;AACL,EAAA;AACV,IAAA;AACwD,IAAA;AACpE,EAAA;AACkE,EAAA;AAC/B,EAAA;AACD,IAAA;AAC6B,IAAA;AAC1B,IAAA;AACb,MAAA;AACwC,MAAA;AAC5C,MAAA;AACgD,MAAA;AAChE,MAAA;AACF,IAAA;AAC+D,IAAA;AACtD,IAAA;AACkB,MAAA;AACzB,MAAA;AACF,IAAA;AACiE,IAAA;AACzB,MAAA;AACI,MAAA;AAC1C,MAAA;AACF,IAAA;AAGgE,IAAA;AACH,IAAA;AAC5C,IAAA;AACA,MAAA;AAC+C,MAAA;AAC9D,MAAA;AACF,IAAA;AACiC,IAAA;AACN,IAAA;AACqC,IAAA;AACjE,EAAA;AACqD,EAAA;AACxD;AAM0E;AACzD,EAAA;AACe,EAAA;AAC2C,EAAA;AACG,EAAA;AAC1B,EAAA;AACjB,EAAA;AAC2B,IAAA;AACS,IAAA;AACP,IAAA;AAC/C,IAAA;AAC8B,IAAA;AACoB,IAAA;AACE,IAAA;AACA,IAAA;AAEf,IAAA;AAKrC,IAAA;AAEqD,IAAA;AACP,IAAA;AACpD,IAAA;AACL,MAAA;AAC4D,QAAA;AACC,QAAA;AAC7D,MAAA;AACF,IAAA;AACF,EAAA;AACO,EAAA;AACT;AN1DsE;AACA;AOnvB3B;AACjC,EAAA;AACwB,EAAA;AACiB,IAAA;AACmB,IAAA;AACpE,EAAA;AACF;APqvBsE;AACA;AACA","file":"/Users/cardene/Desktop/projects/dragon-3715-release-0-76-0/packages/dragon/dist/light/git-I2U4X7BH.cjs","sourcesContent":[null,"/**\n * commit の描き方 (#3164、#3347)。\n *\n * commit の丸は、親から引く線を引き終えた時に弾んで出て、hash と一言を丸の外に添える。\n * どの札からも辿れなくなった commit は、その時に点線の丸を重ねる。\n * 親から引く線は引いた後も残す。線の並びは並べ方が 1 つの並びに出すので、枝分かれの図を描く部品 (`render/git.ts`) が順に読み、線の種類ごとの描き方を引く。\n * この file は枝分かれの図を描く部品だけが読み、見本帳を開いた時に読む塊に入れない (#3248)。\n */\nimport type { GitLink, GitPlaced } from \"../../kinds/git/layout\";\nimport { EASE, LOOK, TYPE } from \"../../look/values\";\nimport { type Ctx, esc, pathOf, r1, write } from \"../../render/parts\";\nimport type { EdgeTime } from \"../../timeline\";\nimport { cs } from \"../color/draw\";\n\n/** 線を引く時刻を引く処理。段と段の中の出来事の番号で引き、描かない線は `undefined` */\nexport type TimeOf = (step: number, event: number) => EdgeTime | undefined;\n\n/** 線の種類ごとの描き方。線の時刻 `time` に引き始め、描いた線を返す */\nexport type LinkLine = (link: GitLink, time: EdgeTime, ctx: Ctx) => string;\n\n/** 親から子へ引く線。引き始めてから引き終えるまでに伸ばし、繰り返す前まで残す */\nexport const parentLine: LinkLine = (l, time, ctx) => {\n const { m } = ctx;\n const d = pathOf(l.points, ctx.corner);\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 `<g style=\"${cs(l.color)}\"><path class=\"dg-git-l dg-a\" pathLength=\"1\" d=\"${d}\" style=\"${kf}\"/></g>`;\n};\n\n/** commit の丸と名札と、丸の外の hash と一言と、辿れなくなった時に重ねる点線の丸 */\nexport function commitDot(c: GitPlaced, timeOf: TimeOf, ctx: Ctx): string {\n const { m } = ctx;\n const at = timeOf(c.step, c.event)?.drawn ?? 0;\n const ring = { x: c.cx - c.r, y: c.cy - c.r, w: c.r * 2, h: c.r * 2 };\n ctx.ink.push({ text: c.id, rect: ring, shown: [[at, Number.POSITIVE_INFINITY]], boxed: true });\n const lines = (c.text?.lines ?? [])\n .map((line, k) => {\n const hash = k === 0 && c.hash !== undefined;\n const baseline = c.text?.baselines[k] ?? c.cy;\n return write(ctx.ink, hash ? \"dg-git-h\" : \"dg-git-n\", c.cx, baseline, line, hash ? TYPE.gitHash : TYPE.gitNote, [[at, Number.POSITIVE_INFINITY]], \"middle\");\n })\n .join(\"\");\n const id = `<text class=\"dg-git-id\" x=\"${r1(c.cx)}\" y=\"${r1(c.cy + LOOK.baseline.badge)}\" text-anchor=\"middle\">${esc(c.id)}</text>`;\n const node = `<g class=\"dg-popc dg-a\" style=\"${m.pop(at)}\"><circle class=\"dg-git-c\" cx=\"${r1(c.cx)}\" cy=\"${r1(c.cy)}\" r=\"${c.r}\" ${ctx.sh}/>${id}</g>`;\n const text = lines === \"\" ? \"\" : `<g class=\"dg-a\" style=\"${m.vis(at)}\">${lines}</g>`;\n const orphanAt = c.orphan === undefined ? undefined : timeOf(c.orphan, c.orphanEvent ?? 0)?.drawn;\n const orphan =\n orphanAt === undefined\n ? \"\"\n : `<g class=\"dg-a\" data-orphan=\"${esc(c.id)}\" style=\"${m.vis(orphanAt, m.last, { f: 0.5 })}\"><circle class=\"dg-git-old\" cx=\"${r1(c.cx)}\" cy=\"${r1(c.cy)}\" r=\"${LOOK.git.orphan}\"/><text class=\"dg-git-oldl\" x=\"${r1(c.cx)}\" y=\"${r1(c.cy + LOOK.baseline.badge)}\" text-anchor=\"middle\">${esc(c.id)}</text></g>`;\n return `<g data-commit=\"${esc(c.id)}\" style=\"${cs(c.color)}\">${node}${text}${orphan}</g>`;\n}\n","/**\n * 枝の描き方 (#3164、#3347)。\n *\n * 枝を切る線は、切った commit から枝の帯へ引く。引き方は親から子へ引く線と同じで、引いた後も残す。\n * 枝の帯と名札は、並べ方が区画の形 (`SceneRegion`) で出して区画のブロックの描き方 (`blocks/group/draw.ts`) で描くので、この file は分かれの線だけを持つ。\n * この file は枝分かれの図を描く部品 (`render/git.ts`) だけが読み、見本帳を開いた時に読む塊に入れない (#3248)。\n */\nimport { type LinkLine, parentLine } from \"../commit/draw\";\n\n/** 枝を切る線。親から子へ引く線と同じく、引き始めてから引き終えるまでに伸ばし、繰り返す前まで残す */\nexport const forkLine: LinkLine = (l, time, ctx) => parentLine(l, time, ctx);\n","/**\n * 当て直しの描き方 (#3164、#3347)。\n *\n * 当て直しの線は、元の commit から写しへ点線で引き、写しを積んだ時に出して繰り返す前まで残す。伸ばさずに出す。\n * この file は枝分かれの図を描く部品 (`render/git.ts`) だけが読み、見本帳を開いた時に読む塊に入れない (#3248)。\n */\nimport { pathOf } from \"../../render/parts\";\nimport { cs } from \"../color/draw\";\nimport type { LinkLine } from \"../commit/draw\";\n\n/** 元の commit から写しへの点線 */\nexport const copyLine: LinkLine = (l, time, ctx) => {\n const { m } = ctx;\n return `<g style=\"${cs(l.color)}\"><path class=\"dg-git-cp dg-a\" d=\"${pathOf(l.points, ctx.corner)}\" style=\"${m.vis(time.start, m.last)}\"/></g>`;\n};\n","/**\n * merge commit の描き方 (#3164、#3347)。\n *\n * 取り込みの線は、取り込む枝の先端から merge commit へ引く。引き方は親から子へ引く線と同じで、引いた後も残す。\n * 線の道の形 (取り込む枝の帯から merge commit の帯へ折れる形) は並べ方が持つ。\n * この file は枝分かれの図を描く部品 (`render/git.ts`) だけが読み、見本帳を開いた時に読む塊に入れない (#3248)。\n */\nimport { type LinkLine, parentLine } from \"../commit/draw\";\n\n/** 取り込みの線。親から子へ引く線と同じく、引き始めてから引き終えるまでに伸ばし、繰り返す前まで残す */\nexport const mergeLine: LinkLine = (l, time, ctx) => parentLine(l, time, ctx);\n","/**\n * 枝分かれの図 (#3164) を描く部品。見本帳の試作 `docs/design/base/scenes/git.js` の commit と札を写す。\n *\n * commit の丸と、commit どうしを結ぶ線 (親から子、枝を切る、取り込み、当て直し) は、commit と枝と merge commit と当て直しのブロックが描く (#3347)。\n * 線は並べ方が 1 つの並びに出すので、ここで並びを順に読み、線の種類ごとの描き方をブロックから引く。動きの名前は呼んだ順に番号が付くので、描く順は変えない。\n * 札は枝ごとと HEAD に 1 つずつ置き、出来事のたびに次の置き場へ走らせる。札を動かす線は、その段の間だけ引いて消す。\n * 札はその後も動くので、線を残すと札の去った所を指したまま残る。\n * 札の見た目は運ぶ物の札と同じで、どの札も主役ではないので、時刻の表の運ぶ物とは別に動かす。\n */\nimport { forkLine } from \"../blocks/branch/draw\";\nimport { carrier } from \"../blocks/carry/draw\";\nimport { cs } from \"../blocks/color/draw\";\nimport { commitDot, type LinkLine, parentLine } from \"../blocks/commit/draw\";\nimport { copyLine } from \"../blocks/copy/draw\";\nimport { mergeLine } from \"../blocks/merge/draw\";\nimport type { GitLayout, GitLink, GitMove, GitPlaced } from \"../kinds/git/layout\";\nimport type { DiagramModel } from \"../schema\";\nimport { hasWide, textWidth } from \"../layout/measure\";\nimport type { Point, Rect } from \"../layout/scene\";\nimport { type Corner, EASE, LOOK, MOTION, TYPE } from \"../look/values\";\nimport { partRadius } from \"./corner\";\nimport type { EdgeTime, Span, Timeline } from \"../timeline\";\nimport type { Frame } from \"./motion\";\nimport { type Ctx, esc, pathOf } from \"./parts\";\n\nconst r1 = (v: number): number => Math.round(v * 100) / 100;\nconst center = (r: Rect): Point => [r.x + r.w / 2, r.y + r.h / 2];\n\n/** 札の形。真ん中を (0, 0) に置き、動きで置き場へ運ぶ */\nfunction tagShape(text: string, sh: string, corner: Corner): string {\n const C = LOOK.carrier;\n const ja = hasWide(text);\n const w = textWidth(text, ja ? TYPE.carrierJa : TYPE.carrier) + C.tagPadX * 2;\n return `<rect class=\"dg-car\" x=\"${r1(-w / 2)}\" y=\"${-C.tagH / 2}\" width=\"${r1(w)}\" height=\"${C.tagH}\" rx=\"${partRadius(corner, C.tagH / 2)}\" ${sh}/><text class=\"dg-car-t${ja ? \" dg-car-tj\" : \"\"}\" y=\"${LOOK.baseline.carrier}\" text-anchor=\"middle\">${esc(text)}</text>`;\n}\n\n/** 線の種類ごとの描き方。親から子は commit、枝を切るのは枝、当て直しは当て直しのブロックが持つ */\nconst LINK_LINES: Readonly<Record<GitLink[\"kind\"], LinkLine>> = { parent: parentLine, branch: forkLine, copy: copyLine };\n\n/**\n * 線の描き方。親から子への線のうち、merge commit が取り込む枝の先端から引く線は merge commit のブロックが描く。\n * 並べ方は親を取り込む先の先端、取り込む枝の先端の順に並べるので、merge commit の親の並びの最後から引く線が取り込みの線\n */\nfunction lineOf(l: GitLink, diagram: DiagramModel, commits: readonly GitPlaced[]): LinkLine {\n const e = diagram.steps[l.step]?.events[l.event];\n if (l.kind === \"parent\" && e?.type === \"commit\" && e.merge !== undefined && commits.find((c) => c.id === l.to)?.parents.at(-1) === l.from) return mergeLine;\n return LINK_LINES[l.kind];\n}\n\nexport function drawGit(layout: GitLayout, diagram: DiagramModel, timeline: Timeline, ctx: Ctx): { links: string; lines: string; commits: string; tags: string } {\n const { m } = ctx;\n const timeOf = (step: number, event: number): EdgeTime | undefined => timeline.edges.find((t) => t.step === step && t.event === event);\n\n const links = layout.links\n .map((l) => {\n const time = timeOf(l.step, l.event);\n if (!time) return \"\";\n ctx.traces.push({ from: l.from, to: l.to, points: l.points, shown: [[time.start, Number.POSITIVE_INFINITY]] });\n return lineOf(l, diagram, layout.commits)(l, time, ctx);\n })\n .join(\"\");\n\n const commits = layout.commits.map((c) => commitDot(c, timeOf, ctx)).join(\"\");\n\n const lines = layout.moves\n .flatMap((mv) => {\n const time = timeOf(mv.step, mv.event);\n if (!mv.line || !time) return [];\n const end = (timeline.steps[mv.step] as Span).end;\n ctx.traces.push({\n from: mv.ref,\n to: mv.target ?? mv.ref,\n points: mv.line,\n shown: [[time.start, end + 0.4]],\n });\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 [end, { opacity: 1 }, EASE.inOut],\n [end + 0.4, { opacity: 0 }],\n [m.total, { opacity: 0, \"stroke-dashoffset\": 0 }],\n ]);\n return [\n `<g style=\"${cs(mv.color)}\"><path class=\"dg-e-on dg-a\" pathLength=\"1\" d=\"${pathOf(mv.line, ctx.corner)}\" style=\"${kf}\"/></g>`,\n ];\n })\n .join(\"\");\n\n // 線に書いた運ぶ物は、線を走って着いた所で消える。着いた所には枝の札が留まるので、運ぶ物は留めない\n const carried = timeline.carriers\n .flatMap((t) => {\n const mv = layout.moves.find((x) => x.step === t.step && x.event === t.event && x.line);\n const source = diagram.steps[t.step]?.events[t.event];\n if (!mv?.line || source?.type !== \"edge\") return [];\n const edge = {\n step: t.step,\n event: t.event,\n from: mv.ref,\n to: mv.target ?? mv.ref,\n points: mv.line,\n color: mv.color,\n carry: source.carry,\n };\n return [carrier(edge, { ...t, start: t.depart, end: t.arrive + MOTION.fade }, ctx)];\n })\n .join(\"\");\n const refs = [...new Set(layout.moves.map((mv) => mv.ref))];\n const tags =\n refs\n .map((ref) =>\n tagMotion(\n ref,\n layout.moves.filter((mv) => mv.ref === ref),\n timeOf,\n ctx,\n ),\n )\n .join(\"\") + carried;\n return { links, lines, commits, tags };\n}\n\n/**\n * 1 つの札の動き。現れる出来事では着いた時に出し、動く出来事では前の置き場から次の置き場へ走らせ、消える出来事では着いた時に消す。\n * 留まっている間の四角を、字の重なりを数える記録に残す\n */\nfunction tagMotion(\n ref: string,\n list: GitMove[],\n timeOf: (step: number, event: number) => EdgeTime | undefined,\n ctx: Ctx,\n): string {\n const { m } = ctx;\n const points: [number, number, number][] = [];\n const fades: Frame[] = [[0, { opacity: 0 }]];\n let on = false;\n let rest: { rect: Rect; since: number } | undefined;\n const leave = (t: number): void => {\n if (rest) ctx.ink.push({ text: ref, rect: rest.rect, shown: [[rest.since, t]], boxed: true });\n rest = undefined;\n };\n for (const mv of list) {\n const time = timeOf(mv.step, mv.event);\n if (!time) continue;\n const { start: a, drawn: b } = time;\n const from = mv.from ? center(mv.from) : undefined;\n const to = mv.to ? center(mv.to) : undefined;\n leave(a);\n // 線に運ぶ物を書いた時は、枝の札は走らずに消え、運ぶ物が着いた時に着いた所へ出る\n if (mv.carried && from && to && on) {\n points.push([a + MOTION.fade, from[0], from[1]], [b - MOTION.fade, to[0], to[1]]);\n fades.push(\n [a, { opacity: 1 }, EASE.inOut],\n [a + MOTION.fade, { opacity: 0 }],\n [b - MOTION.fade, { opacity: 0 }, EASE.out],\n [b, { opacity: 1 }],\n );\n rest = { rect: mv.to as Rect, since: b };\n continue;\n }\n if (from) points.push([a, from[0], from[1]]);\n if (to) points.push([b, to[0], to[1]]);\n if (to && !on) {\n // 前の置き場から走る札は走り出す時に、何も無い所に現れる札は着いた時に出す\n const show = from ? a : b - MOTION.fade;\n fades.push([show, { opacity: 0 }, EASE.out], [show + MOTION.fade, { opacity: 1 }]);\n on = true;\n } else if (!to && on) {\n fades.push([b, { opacity: 1 }, EASE.inOut], [b + MOTION.untilFade, { opacity: 0 }]);\n on = false;\n }\n if (mv.to) rest = { rect: mv.to, since: b };\n }\n leave(Number.POSITIVE_INFINITY);\n if (points.length === 0) return \"\";\n const first = points[0] as [number, number, number];\n const last = points[points.length - 1] as [number, number, number];\n if (on) fades.push([m.last, { opacity: 1 }, EASE.inOut], [m.total, { opacity: 0 }]);\n else fades.push([m.total, { opacity: 0 }]);\n const style = m.move([[0, first[1], first[2]], ...points, [m.total, last[1], last[2]]], fades);\n return `<g class=\"dg-a\" data-ref=\"${esc(ref)}\" style=\"${style}\">${tagShape(ref, ctx.sh, ctx.corner)}</g>`;\n}\n","/**\n * 枝分かれの図の置き場所 (#3164)。見た目の元は見本帳の試作 `docs/design/base/scenes/git.js`。\n *\n * 枝ごとに横長の帯を宣言した順に上から並べ、commit の丸を枝の帯の線に置く。commit は親より 1 列右に置き、\n * 同じ帯では積んだ順に右へ進める。一番上でない帯の commit は列の半分だけ右へずらし、上の帯の丸と縦に揃わないようにする。\n * hash と一言は丸の外に 2 行で置き、一番上の帯では丸の上に、ほかの帯では丸の下に置く (step 2 で本人が選んだ)。\n * 札 (枝の名前と HEAD) は丸の上に段を重ねて置き、一番上の帯では字のさらに上に置く。\n * 同じ commit から別々の枝へ分かれる線は、出口を横に離して別々の道を通す (#3547)。\n *\n * 札がどの commit を指すかは、段の中の出来事を順に辿って決める。\n * commit を積むと、積んだ枝の札と、その枝を指す HEAD が新しい commit へ進む。最初に積んだ枝を HEAD が指す。\n * 枝を切ると、その枝の札が切る commit に置かれ、HEAD がその枝へ移る。\n * 当て直し (`copy`) は枝の札を動かさず、枝から離れた HEAD だけが付いていく。親は枝から離れた HEAD の commit か、枝の札の commit。\n * merge commit (`merge`) は取り込む先の先端と取り込む枝の先端の 2 つを親に持ち、取り込む先の札だけが進む。\n * 札を動かす線 (`<札> -> <commit>`) は、枝の札ならその枝を、HEAD なら HEAD を枝から離して動かす。\n * 枝から離れた HEAD が指す commit へ枝の札が来ると、HEAD はその枝に戻る。HEAD の札は枝から離れた間だけ出す。\n * 札を動かす線は、動いた札の段から着いた札の段まで引く。着いた札が同じ段のうちに枝へ戻って消えるか先へ進む時は、\n * 段の終わりにその札が居る所 (枝に戻った HEAD は戻った枝の札) まで引き、端に何も無い所を残さない (#3648)。\n * 枝を消す (`delete`) と、その枝の札は図から消え、帯は残る (#3632)。\n * どの札からも辿れなくなった commit は、その段で点線の丸に変わる。\n *\n * 箱は commit の並びの右に縦に並べ、中身の帯は図の下に置く。\n * 宣言していない枝に積んだ原本の JSON は、その枝の帯を下に足して描く。辿れない名札を指す出来事は描かない。\n */\nimport { APART, type ColorKey, LOOK, type TextStyle, TYPE } from \"../../look/values\";\nimport type { DiagramModel, DiagramEvent } from \"../../schema\";\nimport { HEAD } from \"../../words\";\nimport { hasWide, textBox, textWidth } from \"../../layout/measure\";\nimport {\n along,\n badgeBlocked,\n badgeOnPath,\n badgeRect,\n besideSameSpot,\n cornerOf,\n frameLines,\n gapBetween,\n boxColors,\n boxWidth,\n type Layout,\n layoutStrip,\n onFrameLine,\n pathLength,\n placeLabel,\n type Point,\n type Rect,\n type SceneBadge,\n type SceneBox,\n type SceneLabel,\n type SceneRegion,\n shapedSize,\n stripBadge,\n stripNeed,\n} from \"../../layout/scene\";\n\n/** 枝の帯。`line` は commit の丸を並べる高さ */\nexport interface GitLane extends Rect {\n id: string;\n line: number;\n color: ColorKey;\n /** 丸の真ん中から 1 段目の札の真ん中まで。丸の上に字を置く帯は、字のさらに上に札を置く */\n tagBase: number;\n}\n\nexport interface GitPlaced {\n id: string;\n branch: string;\n color: ColorKey;\n cx: number;\n cy: number;\n r: number;\n /** commit を積んだ段と、段の中の出来事の番号 */\n step: number;\n event: number;\n /** 親の commit。merge commit は取り込む先の先端と取り込む枝の先端の 2 つ */\n parents: string[];\n /** 当て直した元の commit */\n copy?: string;\n hash?: string;\n note?: string;\n /** hash と一言の字の四角と、上から並べた行と、行ごとの基準線の高さ */\n text?: Rect & { lines: string[]; baselines: number[] };\n /** どの札からも辿れなくなった段と、その段の中の出来事の番号 */\n orphan?: number;\n orphanEvent?: number;\n}\n\n/** 丸と丸を繋ぐ線。親から子 (`parent`)、当て直しの元から写し (`copy`)、枝を切る (`branch`、`to` は枝の名札) */\nexport interface GitLink {\n kind: \"parent\" | \"copy\" | \"branch\";\n from: string;\n to: string;\n step: number;\n event: number;\n points: Point[];\n color: ColorKey;\n}\n\n/** 段の終わりに札が留まる四角 */\nexport interface GitTag extends Rect {\n ref: string;\n step: number;\n}\n\n/** 札が段の終わりに指す commit。HEAD は `attached` に段の終わりに指す枝を持ち、枝から離れた段は `null` */\nexport interface GitRef {\n name: string;\n at: (string | null)[];\n attached?: (string | null)[];\n}\n\n/**\n * 札の動き。段の中の出来事で、札が `from` の四角から `to` の四角へ移る。\n * `from` が無い札はその出来事で現れ、`to` が無い札は消える。`line` は札を動かす線の出来事が引く線\n */\nexport interface GitMove {\n ref: string;\n step: number;\n event: number;\n from?: Rect;\n to?: Rect;\n /** 札が着く commit */\n target?: string;\n /** 札を動かす線に、枝の札と別の運ぶ物を書いたか。書いた時は運ぶ物が線を走り、枝の札は走らずに着いた所へ移る */\n carried?: boolean;\n line?: Point[];\n color: ColorKey;\n}\n\nexport interface GitLayout extends Layout {\n kind: \"git\";\n lanes: GitLane[];\n commits: GitPlaced[];\n links: GitLink[];\n tags: GitTag[];\n refs: GitRef[];\n moves: GitMove[];\n}\n\n\n/** 札が留まる所。commit と、その commit の上の札の段 (0 から数える) */\ninterface Slot {\n commit: string;\n row: number;\n}\n\ninterface Made {\n id: string;\n branch: string;\n parents: string[];\n /** 取り込む枝の先端の親 */\n joined?: string;\n copy?: string;\n hash?: string;\n note?: string;\n step: number;\n event: number;\n orphan?: { step: number; event: number };\n}\n\ninterface Walked {\n branches: string[];\n made: Made[];\n links: Omit<GitLink, \"points\" | \"color\">[];\n moves: { ref: string; step: number; event: number; from?: Slot; to?: Slot; line: boolean }[];\n refs: GitRef[];\n tags: { ref: string; step: number; slot: Slot }[];\n /** commit ごとの、同時に留まる札の段の数の最大 */\n rows: Map<string, number>;\n}\n\n/** 段の中の出来事を順に辿り、commit と親と、札が指す commit と、札の動きを決める */\nfunction walk(diagram: DiagramModel): Walked {\n const branches = (diagram.git?.branches ?? []).map((b) => b.id);\n const lane = (id: string): void => {\n if (!branches.includes(id)) branches.push(id);\n };\n for (const step of diagram.steps) for (const e of step.events) if (e.type === \"commit\" || e.type === \"branch\") lane(e.branch);\n const tips = new Map<string, string | null>(branches.map((b) => [b, null]));\n let headAt: string | null = null;\n let attached: string | null = null;\n const made: Made[] = [];\n const byId = new Map<string, Made>();\n const links: Walked[\"links\"] = [];\n const moves: Walked[\"moves\"] = [];\n const tags: Walked[\"tags\"] = [];\n const rows = new Map<string, (string | null)[]>();\n const most = new Map<string, number>();\n const shown = new Map<string, Slot>();\n const names = [...branches, HEAD];\n const at = new Map<string, (string | null)[]>(names.map((n) => [n, []]));\n const heads: (string | null)[] = [];\n\n /** 札が今出ている commit。HEAD は枝から離れた間だけ出る */\n const visible = (ref: string): string | null => (ref === HEAD ? (attached === null ? headAt : null) : (tips.get(ref) ?? null));\n const freeRow = (commit: string): number => {\n const list = rows.get(commit) ?? [];\n const free = list.indexOf(null);\n return free < 0 ? list.length : free;\n };\n /** 出来事で札の指す先を変え、出ている札を動かす。離れる札を先に外し、来る札を宣言の順に空いた段へ置く */\n const settle = (step: number, event: number, change: () => void, lineFor?: string): void => {\n const before = new Map(names.map((n) => [n, visible(n)]));\n const headBefore = headAt;\n change();\n const changed = names.filter((n) => before.get(n) !== visible(n));\n const leaving = changed.map((ref) => {\n const slot = shown.get(ref);\n if (slot) {\n (rows.get(slot.commit) as (string | null)[])[slot.row] = null;\n shown.delete(ref);\n }\n return { ref, slot };\n });\n for (const { ref, slot } of leaving) {\n // 枝から離れる HEAD は、それまで指していた commit の空いた段から出る\n const from = slot ?? (ref === HEAD && headBefore !== null ? { commit: headBefore, row: freeRow(headBefore) } : undefined);\n const target = visible(ref);\n let to: Slot | undefined;\n if (target !== null) {\n to = { commit: target, row: freeRow(target) };\n const list = rows.get(target) ?? [];\n list[to.row] = ref;\n rows.set(target, list);\n most.set(target, Math.max(most.get(target) ?? 0, list.filter((r) => r !== null).length));\n shown.set(ref, to);\n }\n moves.push({ ref, step, event, ...(from ? { from } : {}), ...(to ? { to } : {}), line: ref === lineFor });\n }\n };\n /** どの札からも辿れなくなった commit に、その出来事を記す */\n const prune = (step: number, event: number): void => {\n const reach = new Set<string>();\n const stack = [...tips.values(), headAt].filter((c): c is string => c !== null);\n while (stack.length > 0) {\n const id = stack.pop() as string;\n if (reach.has(id)) continue;\n reach.add(id);\n stack.push(...(byId.get(id)?.parents ?? []));\n }\n for (const c of made) if (!reach.has(c.id) && c.orphan === undefined) c.orphan = { step, event };\n };\n\n diagram.steps.forEach((step, s) => {\n step.events.forEach((e, k) => {\n if (e.type === \"commit\") commit(e, s, k);\n else if (e.type === \"branch\") {\n if (!byId.has(e.from)) return;\n if (laneOf(e.from) !== e.branch) links.push({ kind: \"branch\", from: e.from, to: e.branch, step: s, event: k });\n settle(s, k, () => {\n tips.set(e.branch, e.from);\n attached = e.branch;\n headAt = e.from;\n });\n } else if (e.type === \"delete\") {\n // 枝を消すと、その枝の札は図から消える。帯は残す (#3632)\n if (!tips.has(e.branch)) return;\n settle(s, k, () => {\n tips.set(e.branch, null);\n });\n } else if (e.type === \"edge\") {\n const ref = e.from;\n if ((ref !== HEAD && !tips.has(ref)) || !byId.has(e.to)) return;\n settle(\n s,\n k,\n () => {\n if (ref === HEAD) {\n attached = null;\n headAt = e.to;\n return;\n }\n tips.set(ref, e.to);\n if (attached === ref) headAt = e.to;\n else if (attached === null && headAt === e.to) attached = ref;\n },\n ref,\n );\n } else return;\n prune(s, k);\n });\n for (const n of names) at.get(n)?.push(n === HEAD ? headAt : (tips.get(n) ?? null));\n heads.push(attached);\n for (const n of names) {\n const slot = shown.get(n);\n if (slot) tags.push({ ref: n, step: s, slot });\n }\n });\n\n function laneOf(id: string): string | undefined {\n return byId.get(id)?.branch;\n }\n\n function commit(e: Extract<DiagramEvent, { type: \"commit\" }>, s: number, k: number): void {\n if (byId.has(e.id)) return;\n const copy = e.copy !== undefined && byId.has(e.copy) ? e.copy : undefined;\n const base = copy !== undefined && attached === null && headAt !== null ? headAt : (tips.get(e.branch) ?? null);\n const joined = e.merge !== undefined && e.merge !== e.branch ? (tips.get(e.merge) ?? undefined) : undefined;\n const parents = [...new Set([base, joined].filter((c): c is string => c !== null && c !== undefined))];\n const c: Made = {\n id: e.id,\n branch: e.branch,\n parents,\n ...(joined !== undefined && joined !== base ? { joined } : {}),\n ...(copy !== undefined ? { copy } : {}),\n ...(e.hash !== undefined ? { hash: e.hash } : {}),\n ...(e.note !== undefined ? { note: e.note } : {}),\n step: s,\n event: k,\n };\n made.push(c);\n byId.set(c.id, c);\n for (const p of parents) links.push({ kind: \"parent\", from: p, to: c.id, step: s, event: k });\n if (copy !== undefined) links.push({ kind: \"copy\", from: copy, to: c.id, step: s, event: k });\n const first = attached === null && headAt === null;\n settle(s, k, () => {\n if (copy === undefined) {\n tips.set(e.branch, c.id);\n if (attached === e.branch) headAt = c.id;\n } else if (attached === null) headAt = c.id;\n if (first) {\n attached = e.branch;\n headAt = c.id;\n }\n });\n }\n\n const refs: GitRef[] = names.map((name) => ({ name, at: at.get(name) ?? [], ...(name === HEAD ? { attached: heads } : {}) }));\n return { branches, made, links, moves, refs, tags, rows: most };\n}\n\n/** 3 次の Bézier 曲線を点で区切る。始まりの点は含めない */\nfunction cubic(p0: Point, c1: Point, c2: Point, p3: Point): Point[] {\n const n = LOOK.git.samples;\n return Array.from({ length: n }, (_, k): Point => {\n const t = (k + 1) / n;\n const u = 1 - t;\n const at = (i: 0 | 1): number => u * u * u * p0[i] + 3 * u * u * t * c1[i] + 3 * u * t * t * c2[i] + t * t * t * p3[i];\n return [at(0), at(1)];\n });\n}\n\n/**\n * 札を動かす線。高さの違う札の間は、低い側の札の x で縦に進み、高い側の札の高さで横に進む鉤形にする。\n * 一番上でない帯の commit は上の帯の commit と列の半分ずれるので、縦の線は上の帯の字の間を通る\n */\nfunction elbow(from: Point, to: Point): Point[] {\n if (Math.abs(from[1] - to[1]) < 0.5) return [from, to];\n return from[1] > to[1] ? [from, [from[0], to[1]], to] : [from, [to[0], from[1]], to];\n}\n\n/** 丸の真ん中と半径 */\ntype Circle = { cx: number; cy: number; r: number };\n\n/**\n * 枝へ分かれる線。親の丸から縦に出て曲がり、`ty` の高さを横へ `tx` まで進む。\n * `dx` は縦に出る所を丸の真ん中から横へずらす長さ (#3547)。丸の幅に収まる出口は丸の縁から縦に出し、\n * 丸の幅を越える出口は丸の縁から斜めに出て、ずらした所で縦に折れる\n */\nfunction fork(p: Circle, tx: number, ty: number, dx = 0): Point[] {\n const sign = ty > p.cy ? 1 : -1;\n const x = p.cx + dx;\n const inside = Math.abs(dx) < p.r;\n const lead: Point[] = inside ? [] : [[p.cx + Math.sign(dx) * p.r * Math.SQRT1_2, p.cy + sign * p.r * Math.SQRT1_2]];\n const p0: Point = [x, p.cy + sign * (inside ? Math.sqrt(p.r * p.r - dx * dx) : Math.abs(dx))];\n const turn = Math.max(0, Math.min(LOOK.git.turn, tx - x));\n const p3: Point = [x + turn, ty];\n const curve = cubic(p0, [p0[0], p0[1] + (ty - p0[1]) * 0.7], [x + turn * 0.2, ty], p3);\n return [...lead, p0, ...curve, ...(tx > p3[0] ? [[tx, ty] as Point] : [])];\n}\n\n/**\n * 同じ commit から同じ向きに分かれる線の出口を、行き先の帯ごとに横へ離す長さ (#3547)。\n * 出口の間は、崩れの検査が並んだ線に求める間 (`APART.line`) に線の太さを足した値にし、2本の線の縁どうしの間も検査の下限を下回らない。\n * 遠い帯へ行く線ほど左から出す。近い帯へ行く線は先に右へ曲がるので、遠い帯へ縦に進む線を横切らない。\n * 1本だけ分かれる commit の線は丸の真ん中から出す\n */\nfunction exits(forks: { from: GitPlaced; ty: number }[]): Map<string, number> {\n const apart = APART.line + LOOK.stroke.git;\n const groups = new Map<string, { id: string; cy: number; ys: number[] }>();\n for (const { from, ty } of forks) {\n const key = `${from.id}\\n${Math.sign(ty - from.cy)}`;\n const group = groups.get(key) ?? { id: from.id, cy: from.cy, ys: [] };\n if (!group.ys.includes(ty)) group.ys.push(ty);\n groups.set(key, group);\n }\n const out = new Map<string, number>();\n for (const { id, cy, ys } of groups.values()) {\n ys.sort((a, b) => Math.abs(b - cy) - Math.abs(a - cy));\n ys.forEach((ty, k) => out.set(`${id}\\n${ty}`, (k - (ys.length - 1) / 2) * apart));\n }\n return out;\n}\n\n/** 枝から入る線。親の帯の線を横へ進み、曲がって子の丸へ縦に入る */\nfunction join(p: Circle, c: Circle): Point[] {\n const sign = c.cy < p.cy ? 1 : -1;\n const p0: Point = [p.cx + p.r, p.cy];\n const p3: Point = [c.cx, c.cy + sign * c.r];\n const turn = Math.max(0, Math.min(LOOK.git.turn, c.cx - p0[0]));\n const h: Point = [c.cx - turn, p.cy];\n const curve = cubic(h, [c.cx - turn * 0.2, p.cy], [c.cx, p3[1] + (p.cy - p3[1]) * 0.7], p3);\n return [p0, ...(h[0] > p0[0] ? [h] : []), ...curve];\n}\n\n/** 当て直しの線。元の丸の縁から写しの丸の縁へ、S 字に縦に渡る。同じ帯の時は丸の上を弧で渡る */\nfunction copyLine(p: Circle, c: Circle): Point[] {\n if (Math.abs(p.cy - c.cy) < 0.5) {\n const top = p.cy - p.r;\n const lift = LOOK.git.turn * 0.7;\n return [[p.cx, top], ...cubic([p.cx, top], [p.cx, top - lift], [c.cx, top - lift], [c.cx, top])];\n }\n const sign = c.cy < p.cy ? -1 : 1;\n const p0: Point = [p.cx, p.cy + sign * p.r];\n const p3: Point = [c.cx, c.cy - sign * c.r];\n const mid = (p3[1] - p0[1]) * 0.5;\n return [p0, ...cubic(p0, [p0[0], p0[1] + mid], [p3[0], p3[1] - mid], p3)];\n}\n\nexport function layoutGit(diagram: DiagramModel): GitLayout {\n const { margin, gap, box: B, region: R, git: G, carrier: C } = LOOK;\n const walked = walk(diagram);\n const notes = new Map((diagram.git?.branches ?? []).map((b) => [b.id, b.note]));\n const laneIndex = new Map(walked.branches.map((id, i) => [id, i]));\n const colorOf = (branch: string): ColorKey => G.colors[(laneIndex.get(branch) ?? 0) % G.colors.length] as ColorKey;\n\n // 列。親より 1 列右で、同じ帯では前に積んだ commit より右\n const col = new Map<string, number>();\n const laneLast = new Map<string, number>();\n for (const c of walked.made) {\n const k = Math.max(0, ...c.parents.map((p) => (col.get(p) ?? -1) + 1), (laneLast.get(c.branch) ?? -1) + 1);\n col.set(c.id, k);\n laneLast.set(c.branch, k);\n }\n /** hash と一言の行と、行ごとの字。hash は等幅で書く */\n const linesOf = (c: Made): { text: string; style: TextStyle }[] => [\n ...(c.hash !== undefined ? [{ text: c.hash, style: TYPE.gitHash }] : []),\n ...(c.note !== undefined ? [{ text: c.note, style: TYPE.gitNote }] : []),\n ];\n const textW = (c: Made): number => Math.max(0, ...linesOf(c).map((line) => textWidth(line.text, line.style)));\n const tagW = (ref: string): number => textWidth(ref, hasWide(ref) ? TYPE.carrierJa : TYPE.carrier) + C.tagPadX * 2;\n const refWidth = Math.max(0, ...walked.refs.map((r) => tagW(r.name)));\n const pitch = Math.max(G.pitch, ...walked.made.map((c) => textW(c) + G.textGap), refWidth + G.textGap);\n\n // 帯の左上の名前と添え書き。最初の列の commit の字と札は、名前の右に置く\n const headers = walked.branches.map((id) => ({ w: Math.max(R.icon, textWidth(id, TYPE.regionName), textWidth(notes.get(id) ?? \"\", TYPE.regionNote)) }));\n const headerRight = margin + R.inset + Math.max(0, ...headers.map((h) => h.w));\n const firstHalf = Math.max(G.r, ...walked.made.filter((c) => col.get(c.id) === 0 && laneIndex.get(c.branch) === 0).map((c) => textW(c) / 2), refWidth / 2);\n const x0 = Math.max(G.x0, headerRight + gap + firstHalf);\n\n // 帯の高さ。札が 2 段より多く重なる commit がある帯は、その分だけ線を下げる。\n // 一番上でない帯の下は、その帯の commit へ札を動かす線の名前を置く帯だけ、名前の分を空ける\n const named = new Set(\n walked.moves.flatMap((mv) => {\n const source = diagram.steps[mv.step]?.events[mv.event];\n return mv.line && mv.to && source?.type === \"edge\" && source.label !== undefined ? [walked.made.find((c) => c.id === mv.to?.commit)?.branch ?? \"\"] : [];\n }),\n );\n const extraRows = (branch: string): number =>\n Math.max(0, ...walked.made.filter((c) => c.branch === branch).map((c) => (walked.rows.get(c.id) ?? 0) - 2)) * G.row;\n // 一番上の帯の commit が字を持たない時は、札を丸のすぐ上に置き、字の分の高さを帯から除く\n const topText = walked.made.some((c) => laneIndex.get(c.branch) === 0 && linesOf(c).length > 0);\n const lanes: GitLane[] = [];\n let y = margin;\n walked.branches.forEach((id, i) => {\n const top = i === 0;\n const tagBase = top && topText ? G.tagTop : G.tag;\n const line = y + (top ? G.topLine - (G.tagTop - tagBase) : G.line) + extraRows(id);\n const h = line - y + (top ? G.topBelow : named.has(id) ? G.below : G.bare);\n lanes.push({ id, x: margin, y, w: 0, h, line, color: colorOf(id), tagBase });\n y += h + R.gap;\n });\n const lanesBottom = y - R.gap;\n const laneOf = new Map(lanes.map((l) => [l.id, l]));\n\n const commits: GitPlaced[] = walked.made.map((c) => {\n const lane = laneOf.get(c.branch) as GitLane;\n const isTop = laneIndex.get(c.branch) === 0;\n const cx = x0 + pitch * (col.get(c.id) ?? 0) + (isTop ? 0 : pitch / 2);\n const cy = lane.line;\n const lines = linesOf(c);\n // 一番上の帯は丸の上へ、下の行を丸に近く積む。ほかの帯は丸の下へ、上の行を丸に近く積む\n const baselines = lines.map((_, k) => (isTop ? cy - G.above - (lines.length - 1 - k) * G.lineStep : cy + G.under + k * G.lineStep));\n const boxes = lines.map((line, k) => textBox(line.text, cx, baselines[k] as number, line.style, \"middle\"));\n const text = boxes.length === 0 ? undefined : { ...union(boxes), lines: lines.map((line) => line.text), baselines };\n // 当て直した commit は元の commit の色で描く\n const color = c.copy !== undefined ? colorOf(walked.made.find((m) => m.id === c.copy)?.branch ?? c.branch) : colorOf(c.branch);\n return {\n id: c.id,\n branch: c.branch,\n color,\n cx,\n cy,\n r: G.r,\n step: c.step,\n event: c.event,\n parents: c.parents,\n ...(c.copy !== undefined ? { copy: c.copy } : {}),\n ...(c.hash !== undefined ? { hash: c.hash } : {}),\n ...(c.note !== undefined ? { note: c.note } : {}),\n ...(text ? { text } : {}),\n ...(c.orphan ? { orphan: c.orphan.step, orphanEvent: c.orphan.event } : {}),\n };\n });\n const placed = new Map(commits.map((c) => [c.id, c]));\n\n // 枝へ分かれる線の行き先の高さ。枝を切る線は枝の帯の線へ、親から子への線は別の帯の子へ分かれる。merge commit へ入る線と当て直しの線は分かれる線でない。\n // 枝を切る線は、その枝に後で commit を積む時だけ引く。積まない枝の帯へ引くと、線が何も無い所で途切れる\n const forkTo = (l: Walked[\"links\"][number]): number | undefined => {\n const from = placed.get(l.from);\n if (!from) return undefined;\n if (l.kind === \"branch\") return walked.made.some((c) => c.branch === l.to) ? laneOf.get(l.to)?.line : undefined;\n const to = placed.get(l.to);\n if (l.kind === \"copy\" || !to || Math.abs(from.cy - to.cy) < 0.5 || walked.made.find((m) => m.id === l.to)?.joined === l.from) return undefined;\n return to.cy;\n };\n const forkTos = new Map(walked.links.map((l) => [l, forkTo(l)]));\n const offsets = exits(\n walked.links.flatMap((l) => {\n const ty = forkTos.get(l);\n return ty === undefined ? [] : [{ from: placed.get(l.from) as GitPlaced, ty }];\n }),\n );\n const links: GitLink[] = walked.links.flatMap((l): GitLink[] => {\n const from = placed.get(l.from);\n if (!from) return [];\n const ty = forkTos.get(l);\n const dx = ty === undefined ? 0 : (offsets.get(`${from.id}\\n${ty}`) ?? 0);\n if (l.kind === \"branch\") {\n if (ty === undefined) return [];\n return [{ ...l, points: fork(from, from.cx + dx + G.turn, ty, dx), color: colorOf(l.to) }];\n }\n const to = placed.get(l.to) as GitPlaced;\n let points: Point[];\n if (ty !== undefined) points = fork(from, to.cx - to.r, ty, dx);\n else if (l.kind === \"copy\") points = copyLine(from, to);\n else if (Math.abs(from.cy - to.cy) < 0.5) points = [[from.cx + from.r, from.cy], [to.cx - to.r, to.cy]];\n else points = join(from, to);\n return [{ ...l, points, color: to.color }];\n });\n\n /** 札の段の四角。一番上の帯は字の上に、ほかの帯は丸の上に重ねる */\n const tagRect = (ref: string, slot: Slot): Rect => {\n const c = placed.get(slot.commit) as GitPlaced;\n const base = laneOf.get(c.branch)?.tagBase ?? G.tag;\n const w = tagW(ref);\n return { x: c.cx - w / 2, y: c.cy - base - slot.row * G.row - C.tagH / 2, w, h: C.tagH };\n };\n const center = (r: Rect): Point => [r.x + r.w / 2, r.y + r.h / 2];\n /**\n * 札を動かす線の端の四角。着いた札が段の終わりまでその段に留まる時はその四角。\n * 同じ段のうちに消えるか先へ進む時は、段の終わりにその札が出ている四角で、枝に戻った HEAD は戻った枝の札の四角 (#3648)。\n * 段の終わりに札が出ていない時 (同じ段で枝を消した時) は着いた段の四角のまま\n */\n const lineEnd = (m: Walked[\"moves\"][number], to: Rect): Rect => {\n const slot = m.to;\n if (!slot || walked.tags.some((t) => t.ref === m.ref && t.step === m.step && t.slot.commit === slot.commit && t.slot.row === slot.row)) return to;\n const name = m.ref === HEAD ? (walked.refs.find((r) => r.name === HEAD)?.attached?.[m.step] ?? HEAD) : m.ref;\n const end = walked.tags.find((t) => t.ref === name && t.step === m.step);\n return end ? tagRect(name, end.slot) : to;\n };\n // 札を動かす線は札と同じ墨の灰で引く。札は枝の色を持たず、同じ札の通り道に重なる線どうしを 1 本に見せるため\n const moves: GitMove[] = walked.moves.map((m) => {\n const from = m.from ? tagRect(m.ref, m.from) : undefined;\n const to = m.to ? tagRect(m.ref, m.to) : undefined;\n const source = diagram.steps[m.step]?.events[m.event];\n const carried = m.line && source?.type === \"edge\" && source.carry.kind !== \"none\" && !(source.carry.kind === \"tag\" && source.carry.text === source.from);\n return {\n ref: m.ref,\n step: m.step,\n event: m.event,\n ...(from ? { from } : {}),\n ...(to ? { to } : {}),\n ...(m.to ? { target: m.to.commit } : {}),\n ...(carried ? { carried: true } : {}),\n ...(m.line && from && to ? { line: elbow(center(from), center(lineEnd(m, to))) } : {}),\n color: \"slate\",\n };\n });\n const tags: GitTag[] = walked.tags.map((t) => ({ ...tagRect(t.ref, t.slot), ref: t.ref, step: t.step }));\n\n // 箱は commit の並びの右に縦に並べる。最初の箱は 2 本目の帯の線の高さに置く\n const colors = boxColors(diagram);\n const right = Math.max(\n x0,\n ...commits.flatMap((c) => [c.cx + c.r, ...(c.text ? [c.text.x + c.text.w] : [])]),\n ...tags.map((t) => t.x + t.w),\n ...moves.flatMap((m) => [m.from, m.to].flatMap((r) => (r ? [r.x + r.w] : []))),\n );\n const boxX = right + G.boxGap;\n const firstCy = (lanes[1] ?? lanes[0])?.line ?? margin + B.h / 2;\n // 形を持つ箱は、中身が形の内に収まる大きさにする (#3520)。高くなった箱の分だけ下の箱を下げる\n let top = 0;\n const boxes: SceneBox[] = diagram.boxes.map((b, i) => {\n const fit = shapedSize(diagram, b.id, boxWidth(diagram, b.id, true), true);\n const { w, h } = fit;\n // 最初の箱は、高くなっても真ん中を 2 本目の帯の線の高さに置く\n const y = i === 0 ? firstCy - h / 2 : top;\n top = y + h + gap;\n return {\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 });\n\n const regions: SceneRegion[] = lanes.map((lane, i) => {\n const note = notes.get(lane.id);\n return {\n id: lane.id,\n lines: [lane.id],\n ...(note !== undefined ? { note } : {}),\n icon: \"branch\",\n color: lane.color,\n x: lane.x,\n y: lane.y,\n w: 0,\n h: lane.h,\n header: { x: lane.x + R.inset, y: lane.y + R.inset, w: headers[i]?.w ?? 0, h: R.nameY - R.inset + (note !== undefined ? R.line : 0) + gap / 2 },\n };\n });\n\n const layout: GitLayout = {\n kind: \"git\",\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 lanes,\n commits,\n links,\n tags,\n refs: walked.refs,\n moves,\n };\n layout.badges = badgesOf(diagram, layout);\n layout.labels = labelsOf(diagram, layout);\n\n const contentRight = Math.max(right, ...boxes.map((b) => b.x + b.w), ...layout.labels.map((l) => l.x + l.w)) + R.pad;\n const width = Math.max(contentRight + margin, stripNeed(diagram) + margin * 2);\n for (const region of regions) region.w = width - margin * 2;\n for (const lane of lanes) lane.w = width - margin * 2;\n const bottom = Math.max(lanesBottom, ...boxes.map((b) => b.y + b.h), ...layout.labels.map((l) => l.y + l.h));\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);\n return layout;\n}\n\nfunction union(rects: Rect[]): Rect {\n const x = Math.min(...rects.map((r) => r.x));\n const y = Math.min(...rects.map((r) => r.y));\n return { x, y, w: Math.max(...rects.map((r) => r.x + r.w)) - x, h: Math.max(...rects.map((r) => r.y + r.h)) - y };\n}\n\n/**\n * 段で最初に起きる、番号を置ける出来事。commit の親からの線と枝を切る線は線を、札を動かす線は札が着く commit を返す。\n * 札を動かす線は段が終わると消えるので、番号は線ではなく着いた commit の脇に置く\n */\nfunction firstMark(layout: GitLayout, step: number): { event: number; points?: Point[]; target?: GitPlaced; color: ColorKey } | undefined {\n const marks = [\n ...layout.links.filter((l) => l.step === step && l.kind !== \"copy\").map((l) => ({ event: l.event, points: l.points, color: l.color })),\n ...layout.moves.flatMap((m) => {\n const target = layout.commits.find((c) => c.id === m.target);\n return m.step === step && m.line && target ? [{ event: m.event, target, color: target.color }] : [];\n }),\n ].sort((a, b) => a.event - b.event);\n return marks[0];\n}\n\n/**\n * 段の番号の丸の真ん中どうしの間の下限 (#3547)。丸の縁どうしの間を、崩れの検査が近すぎる番号に数える下限 (`APART.badge`) より狭くしない。\n * 線の上の番号 (`badgeOnPath`) と同じ値で離し、描いた図と検査が食い違わないようにする\n */\nconst BADGES_APART = LOOK.badge.r * 2 + APART.badge;\n\n/**\n * commit の丸の右、下、左、上のうち、段の番号の丸が札と字と丸に掛からず、枝の帯の枠線 (`frames` の高さの線) にも掛からず、\n * 先に置いた番号からも離れた最初の点 (#3525)。無ければ `undefined`\n */\nfunction besideCommit(c: GitPlaced, taken: Point[], avoid: Rect[], frames: number[]): Point | undefined {\n const { r, inset } = LOOK.badge;\n const d = c.r + inset + r;\n const spots: Point[] = [\n [c.cx + d, c.cy],\n [c.cx, c.cy + d],\n [c.cx - d, c.cy],\n [c.cx, c.cy - d],\n ];\n return spots.find(\n (p) => taken.every(([x, y]) => Math.hypot(p[0] - x, p[1] - y) >= BADGES_APART) && avoid.every((a) => gapBetween(badgeRect(p), a) >= LOOK.label.touch) && !onFrameLine(p[1], frames),\n );\n}\n\n/**\n * 線の上で、段の番号の丸が札と字と丸 (`avoid`) に掛からず、枝の帯の枠線 (`frames` の高さの線、#3525) にも掛からず、先に置いた番号 (`taken`) からも離れた最初の点。\n * 札はどの段に留まる札も避ける。済んだ段の番号は最後の段まで残るので、後の段に来る札にも掛けない。無ければ `undefined`\n */\nfunction clearOnPath(points: Point[], taken: Point[], avoid: Rect[], frames: number[]): Point | undefined {\n const { r, along: start, short } = LOOK.badge;\n const length = pathLength(points);\n const first = length < short ? Math.min(r + 1, length / 2) : start;\n for (let d = first; d <= length; d += 1) {\n const p = along(points, d);\n const rect = badgeRect(p);\n if (taken.every(([x, y]) => Math.hypot(p[0] - x, p[1] - y) >= BADGES_APART) && avoid.every((a) => gapBetween(rect, a) >= LOOK.label.touch) && !onFrameLine(p[1], frames)) return p;\n }\n return undefined;\n}\n\n/**\n * 段の番号。commit を積む段と枝を切る段は、段で最初に引く線の始まりから少し進んだ所に置き、先に置いた番号と札と字と丸を避けて線に沿って進める。\n * 札を動かす段は、札が着いた commit の丸の脇に置く。線の番号と commit の脇の番号は、枝の帯の枠線を避ける (#3525)。\n * 線の無い段は、箱を書き換える段なら箱の左上の角に、帯を書き換える段なら帯の左上の角の丸みの中に、\n * 何も起きない段は一番上の枝の先端の commit の脇に置き、脇が埋まっていれば前の段の番号の所に置く。\n * 前の段の番号と同じ所に来た番号は、前の番号の脇に並べる (#3525)\n */\nfunction badgesOf(diagram: DiagramModel, layout: GitLayout): SceneBadge[] {\n const { inset } = LOOK.badge;\n const taken: Point[] = [];\n const all = [...layout.links.map((l) => l.points), ...layout.moves.flatMap((m) => (m.line ? [m.line] : []))];\n const out: SceneBadge[] = [];\n const avoid: Rect[] = [\n ...layout.tags,\n ...layout.commits.flatMap((c) => [{ x: c.cx - c.r, y: c.cy - c.r, w: c.r * 2, h: c.r * 2 }, ...(c.text ? [c.text] : [])]),\n ];\n const frames = frameLines([...layout.regions, ...(layout.strip ? [layout.strip] : [])]);\n diagram.steps.forEach((step, s) => {\n const mark = firstMark(layout, s);\n const near = mark?.target ? besideCommit(mark.target, taken, avoid, frames) : undefined;\n if (mark && (mark.points || near)) {\n const points = mark.points;\n const point = near ?? (points ? (clearOnPath(points, taken, avoid, frames) ?? badgeOnPath(points, taken, all.filter((p) => p !== points), frames)) : [0, 0]);\n taken.push(point);\n out.push({ step: s, x: point[0], y: point[1], color: mark.color });\n return;\n }\n const box = step.events.flatMap((e) => (e.type === \"swap\" || e.type === \"action\" ? [e.box] : [])).map((id) => layout.boxes.find((b) => b.id === id))[0];\n if (box) {\n out.push(cornerOf(box, s));\n return;\n }\n if (layout.strip && step.events.some((e) => e.type === \"strip\")) {\n const [x, y] = stripBadge(layout.strip);\n out.push({ step: s, x, y, color: \"slate\" });\n return;\n }\n // 何も起きない段と、着いた commit の脇が埋まっている札の段は、一番上の枝の先端の commit の脇に置く。\n // 先端が無いか、脇が埋まっている時は前の段の番号の所に置き、前の番号の脇に並べる\n const tip = layout.commits.find((c) => c.id === layout.refs[0]?.at[s]);\n const spot = tip ? besideCommit(tip, taken, avoid, frames) : undefined;\n if (tip && spot) {\n taken.push(spot);\n out.push({ step: s, x: spot[0], y: spot[1], color: tip.color });\n return;\n }\n const before = out[out.length - 1];\n const lane = layout.lanes[0];\n out.push(before ? { ...before, step: s } : { step: s, x: (lane?.x ?? 0) + (lane?.w ?? 0) - inset - LOOK.badge.r, y: (lane?.y ?? 0) + inset + LOOK.badge.r, color: lane?.color ?? \"slate\" });\n });\n return besideSameSpot(out, badgeBlocked(layout, avoid));\n}\n\n/**\n * 札を動かす線の名前。一番上の帯の commit へ動かす線は札の段のさらに上に、ほかの帯の commit へ動かす線は丸の下の字のさらに下に置き、\n * 丸と字と、その段の終わりに留まる札と、同じ時刻に見える段の番号を避ける\n */\nfunction labelsOf(diagram: DiagramModel, layout: GitLayout): SceneLabel[] {\n const G = LOOK.git;\n const labels: SceneLabel[] = [];\n const circles: Rect[] = layout.commits.map((c) => ({ x: c.cx - c.r, y: c.cy - c.r, w: c.r * 2, h: c.r * 2 }));\n const texts: Rect[] = layout.commits.flatMap((c) => (c.text ? [c.text] : []));\n const headers = layout.regions.map((r) => r.header);\n for (const move of layout.moves) {\n const source = diagram.steps[move.step]?.events[move.event];\n if (source?.type !== \"edge\" || source.label === undefined || !move.line) continue;\n const target = layout.commits.find((c) => c.id === source.to);\n if (!target) continue;\n const top = layout.lanes[0]?.id === target.branch;\n const w = textWidth(source.label, hasWide(source.label) ? TYPE.labelJa : TYPE.label) + LOOK.label.padX * 2;\n const [mx] = move.line.reduce((sum, p) => [sum[0] + p[0] / (move.line as Point[]).length, 0], [0, 0]);\n const rows = Math.max(0, ...layout.tags.filter((t) => t.step === move.step && Math.abs(t.x + t.w / 2 - target.cx) < 0.5).map((t) => target.cy - t.y));\n // 置く側を書いた名前は、その側の線の脇から探す\n const side = source.labelSide ?? (top ? \"above\" : \"below\");\n const base =\n source.labelSide !== undefined\n ? undefined\n : top\n ? { x: mx - w / 2, y: target.cy - Math.max(rows, (layout.lanes[0]?.tagBase ?? G.tag) + LOOK.carrier.tagH / 2) - LOOK.label.soft - LOOK.label.h }\n : { x: mx - w / 2, y: target.cy + G.labelUnder };\n const seen = layout.badges.filter((b) => b.step <= move.step).map((b) => badgeRect([b.x, b.y]));\n const tags = layout.tags.filter((t) => t.step === move.step);\n labels.push(\n placeLabel(\n { step: move.step, event: move.event, text: source.label, points: move.line, color: move.color, side, ...(base ? { base } : {}) },\n { hard: [...circles, ...layout.boxes], soft: [...texts, ...tags, ...headers, ...labels.filter((l) => l.step === move.step)], touch: seen },\n ),\n );\n }\n return labels;\n}\n","/** 枝分かれの図の描く部品の組 (#3248、#3656)。並べ方は図の種類の置き場 (`kinds/git/layout.ts`、#3347)、線と commit と札の描き方は `render/git.ts` が持つ (#3164) */\nimport { drawGit } from \"../render/git\";\nimport { type GitLayout, layoutGit } from \"./git/layout\";\nimport type { KindParts } from \"./parts\";\n\nexport const parts: KindParts<GitLayout> = {\n layout: layoutGit,\n draw: (layout, diagram, ctx) => {\n const git = drawGit(layout, diagram, ctx.t, ctx);\n return { base: git.links, lit: git.lines, node: git.commits, top: git.tags };\n },\n};\n"]}