@sme.up/ketchup2 1.18.0 → 1.19.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 (211) hide show
  1. package/dist/{_basePickBy-B1R94gYg.js → _basePickBy-DLc0xS6g.js} +29 -30
  2. package/dist/_basePickBy-hU15nnuu.cjs +1 -0
  3. package/dist/_baseUniq-Bn1jRtDY.js +614 -0
  4. package/dist/_baseUniq-v0HaTFyU.cjs +1 -0
  5. package/dist/{arc-BDhRalCq.cjs → arc-BN7cLDvU.cjs} +1 -1
  6. package/dist/{arc-DvVEbzqi.js → arc-aCClK8cT.js} +1 -1
  7. package/dist/{architecture-U656AL7Q-Bf9nK-g5.cjs → architecture-U656AL7Q-BlzcZYj0.cjs} +1 -1
  8. package/dist/{architecture-U656AL7Q-xWSQ4SRv.js → architecture-U656AL7Q-CGK9HO5M.js} +1 -1
  9. package/dist/{architectureDiagram-VXUJARFQ-DZV4IIVV.js → architectureDiagram-VXUJARFQ-CDlmghav.js} +3 -3
  10. package/dist/{architectureDiagram-VXUJARFQ-CfqXQSfK.cjs → architectureDiagram-VXUJARFQ-CxXB06ya.cjs} +1 -1
  11. package/dist/assets/imageListAssets.d.ts +3 -1
  12. package/dist/assets/imageListAssets.d.ts.map +1 -1
  13. package/dist/basic-components/autocomplete/autocomplete.d.ts.map +1 -1
  14. package/dist/basic-components/cell/cell-utils.d.ts +8 -0
  15. package/dist/basic-components/cell/cell-utils.d.ts.map +1 -1
  16. package/dist/basic-components/cell/cell.d.ts.map +1 -1
  17. package/dist/basic-components/checkbox/checkbox.d.ts.map +1 -1
  18. package/dist/basic-components/icon/icon.d.ts.map +1 -1
  19. package/dist/basic-components/image/image-types.d.ts +14 -2
  20. package/dist/basic-components/image/image-types.d.ts.map +1 -1
  21. package/dist/basic-components/image/image-utils.d.ts +3 -1
  22. package/dist/basic-components/image/image-utils.d.ts.map +1 -1
  23. package/dist/basic-components/image/image.d.ts.map +1 -1
  24. package/dist/basic-components/image-cell/image-cell-types.d.ts +20 -0
  25. package/dist/basic-components/image-cell/image-cell-types.d.ts.map +1 -0
  26. package/dist/basic-components/image-cell/image-cell.d.ts +3 -0
  27. package/dist/basic-components/image-cell/image-cell.d.ts.map +1 -0
  28. package/dist/basic-components/multiple-select/multiple-select.d.ts.map +1 -1
  29. package/dist/basic-components/slider/slider-types.d.ts +8 -0
  30. package/dist/basic-components/slider/slider-types.d.ts.map +1 -0
  31. package/dist/basic-components/slider/slider.d.ts +4 -0
  32. package/dist/basic-components/slider/slider.d.ts.map +1 -0
  33. package/dist/basic-components/text/text-types.d.ts +3 -0
  34. package/dist/basic-components/text/text-types.d.ts.map +1 -1
  35. package/dist/basic-components/text/text.d.ts.map +1 -1
  36. package/dist/basic-components/text-editor/text-editor-types.d.ts +0 -65
  37. package/dist/basic-components/text-editor/text-editor-types.d.ts.map +1 -1
  38. package/dist/basic-components/text-editor/text-editor-utils.d.ts +13 -23
  39. package/dist/basic-components/text-editor/text-editor-utils.d.ts.map +1 -1
  40. package/dist/basic-components/text-editor/text-editor.d.ts.map +1 -1
  41. package/dist/basic-components/textfield/textfield.d.ts.map +1 -1
  42. package/dist/basic-components/time-picker/time-picker.d.ts.map +1 -1
  43. package/dist/basic-components/time-picker/time-utils.d.ts +1 -1
  44. package/dist/basic-components/time-picker/time-utils.d.ts.map +1 -1
  45. package/dist/{blockDiagram-VD42YOAC-BkkV6LWv.cjs → blockDiagram-VD42YOAC-DaEdiOdS.cjs} +1 -1
  46. package/dist/{blockDiagram-VD42YOAC-tKn8dzo0.js → blockDiagram-VD42YOAC-otiz2gnO.js} +5 -5
  47. package/dist/{c4Diagram-YG6GDRKO-RBwhYEc2.cjs → c4Diagram-YG6GDRKO-B_M0pXDI.cjs} +1 -1
  48. package/dist/{c4Diagram-YG6GDRKO-B0gjRSdn.js → c4Diagram-YG6GDRKO-BqtunVbe.js} +2 -2
  49. package/dist/{channel-3tFaSeKk.js → channel-B3xNo1hN.js} +1 -1
  50. package/dist/channel-BWzBcvC1.cjs +1 -0
  51. package/dist/{chunk-4BX2VUAB-D3u0w2gk.js → chunk-4BX2VUAB-D0ckS2Js.js} +1 -1
  52. package/dist/{chunk-4BX2VUAB-Boz0nX9s.cjs → chunk-4BX2VUAB-jQAMlkG5.cjs} +1 -1
  53. package/dist/{chunk-55IACEB6-BpT8GkSp.js → chunk-55IACEB6-4k6jNTPh.js} +1 -1
  54. package/dist/{chunk-55IACEB6-DVWliiDK.cjs → chunk-55IACEB6-CYP5QeDP.cjs} +1 -1
  55. package/dist/{chunk-B4BG7PRW-Bmq8n4Hs.cjs → chunk-B4BG7PRW-40wFwe2_.cjs} +1 -1
  56. package/dist/{chunk-B4BG7PRW-DH5WVTGe.js → chunk-B4BG7PRW-C5a0R2TF.js} +4 -4
  57. package/dist/{chunk-DI55MBZ5-DVb6521f.cjs → chunk-DI55MBZ5-D46Nxv4C.cjs} +1 -1
  58. package/dist/{chunk-DI55MBZ5-CnYYh3n2.js → chunk-DI55MBZ5-Xs_EvPU9.js} +3 -3
  59. package/dist/{chunk-FMBD7UC4-Cou9fU3U.cjs → chunk-FMBD7UC4-JwXIwsff.cjs} +1 -1
  60. package/dist/{chunk-FMBD7UC4-CfbK5tDm.js → chunk-FMBD7UC4-sbfIyVl_.js} +1 -1
  61. package/dist/{chunk-QN33PNHL-CCaezjI9.js → chunk-QN33PNHL-CZLTe-5X.js} +1 -1
  62. package/dist/{chunk-QN33PNHL-bDqDrxJR.cjs → chunk-QN33PNHL-D89dqsY7.cjs} +1 -1
  63. package/dist/{chunk-QZHKN3VN-B_jBa8Xi.js → chunk-QZHKN3VN-Bym_staK.js} +1 -1
  64. package/dist/{chunk-QZHKN3VN-agaSkAKB.cjs → chunk-QZHKN3VN-CnB6OkgR.cjs} +1 -1
  65. package/dist/{chunk-TZMSLE5B-DhehdAHS.cjs → chunk-TZMSLE5B-CzF1p6NC.cjs} +1 -1
  66. package/dist/{chunk-TZMSLE5B-L3IDdUIe.js → chunk-TZMSLE5B-Dp0YIOCM.js} +1 -1
  67. package/dist/{classDiagram-v2-WZHVMYZB-vQpFohnj.js → classDiagram-2ON5EDUG-Bckc28LC.js} +2 -2
  68. package/dist/{classDiagram-2ON5EDUG-SmUoP7ZW.cjs → classDiagram-2ON5EDUG-FQVyK433.cjs} +1 -1
  69. package/dist/{classDiagram-2ON5EDUG-vQpFohnj.js → classDiagram-v2-WZHVMYZB-Bckc28LC.js} +2 -2
  70. package/dist/{classDiagram-v2-WZHVMYZB-SmUoP7ZW.cjs → classDiagram-v2-WZHVMYZB-FQVyK433.cjs} +1 -1
  71. package/dist/clone-BuJ6ESdC.cjs +1 -0
  72. package/dist/{clone-YOXgx4TW.js → clone-gnQjFue0.js} +1 -1
  73. package/dist/components/data-table/filtering/data-table-filter-utils.d.ts +3 -3
  74. package/dist/components/data-table/filtering/data-table-filter-utils.d.ts.map +1 -1
  75. package/dist/components/image-list/components/image-list-catalog.d.ts +5 -0
  76. package/dist/components/image-list/components/image-list-catalog.d.ts.map +1 -0
  77. package/dist/components/image-list/components/image-list-compact.d.ts +5 -0
  78. package/dist/components/image-list/components/image-list-compact.d.ts.map +1 -0
  79. package/dist/components/image-list/components/image-list-drill-down.d.ts +1 -1
  80. package/dist/components/image-list/components/image-list-drill-down.d.ts.map +1 -1
  81. package/dist/components/image-list/components/image-list-explorer.d.ts +5 -0
  82. package/dist/components/image-list/components/image-list-explorer.d.ts.map +1 -0
  83. package/dist/components/image-list/components/image-list-modal.d.ts +5 -0
  84. package/dist/components/image-list/components/image-list-modal.d.ts.map +1 -0
  85. package/dist/components/image-list/components/image-list-slideshow.d.ts +5 -0
  86. package/dist/components/image-list/components/image-list-slideshow.d.ts.map +1 -0
  87. package/dist/components/image-list/components/image-list-tree.d.ts +5 -0
  88. package/dist/components/image-list/components/image-list-tree.d.ts.map +1 -0
  89. package/dist/components/image-list/hooks/useNavigation.d.ts +2 -2
  90. package/dist/components/image-list/hooks/useNavigation.d.ts.map +1 -1
  91. package/dist/components/image-list/hooks/useSelection.d.ts +3 -19
  92. package/dist/components/image-list/hooks/useSelection.d.ts.map +1 -1
  93. package/dist/components/image-list/image-list-types.d.ts +95 -0
  94. package/dist/components/image-list/image-list-types.d.ts.map +1 -0
  95. package/dist/components/image-list/image-list-utils.d.ts +13 -0
  96. package/dist/components/image-list/image-list-utils.d.ts.map +1 -0
  97. package/dist/components/image-list/image-list.d.ts +1 -1
  98. package/dist/components/image-list/image-list.d.ts.map +1 -1
  99. package/dist/components/input-panel/assets/data.d.ts.map +1 -1
  100. package/dist/components/input-panel/input-panel.d.ts.map +1 -1
  101. package/dist/{cose-bilkent-S5V4N54A-DD8g8ODW.js → cose-bilkent-S5V4N54A-Df1US9MJ.js} +1 -1
  102. package/dist/{cose-bilkent-S5V4N54A-DdSoONjd.cjs → cose-bilkent-S5V4N54A-DsOyNFsG.cjs} +1 -1
  103. package/dist/{dagre-6UL2VRFP-BjOVGWYT.js → dagre-6UL2VRFP-COacgFYc.js} +6 -6
  104. package/dist/{dagre-6UL2VRFP-B2AtgfKt.cjs → dagre-6UL2VRFP-CXVsDZys.cjs} +1 -1
  105. package/dist/{diagram-PSM6KHXK-D3n0zVfd.js → diagram-PSM6KHXK-Blv6GFOJ.js} +4 -4
  106. package/dist/{diagram-PSM6KHXK-D_fCWLTY.cjs → diagram-PSM6KHXK-D1gDIrxH.cjs} +1 -1
  107. package/dist/{diagram-QEK2KX5R-CIX1p2TE.cjs → diagram-QEK2KX5R-DGRRWbUu.cjs} +1 -1
  108. package/dist/{diagram-QEK2KX5R-D4IV84fI.js → diagram-QEK2KX5R-DvB0VrfT.js} +3 -3
  109. package/dist/{diagram-S2PKOQOG-DQyeu84g.cjs → diagram-S2PKOQOG--lHmHnKW.cjs} +1 -1
  110. package/dist/{diagram-S2PKOQOG-D_bz5gIz.js → diagram-S2PKOQOG-DxIEa6jg.js} +3 -3
  111. package/dist/{erDiagram-Q2GNP2WA-FaG72Sma.js → erDiagram-Q2GNP2WA-B--ZupT4.js} +4 -4
  112. package/dist/{erDiagram-Q2GNP2WA-CA3u15D8.cjs → erDiagram-Q2GNP2WA-BZ1GgS-i.cjs} +1 -1
  113. package/dist/{flowDiagram-NV44I4VS-Cqs3UFBQ.js → flowDiagram-NV44I4VS-82EN5frg.js} +5 -5
  114. package/dist/{flowDiagram-NV44I4VS-CR_U7F3i.cjs → flowDiagram-NV44I4VS-BjclDOwK.cjs} +1 -1
  115. package/dist/functional-components/badge/badge-types.d.ts +0 -4
  116. package/dist/functional-components/badge/badge-types.d.ts.map +1 -1
  117. package/dist/functional-components/badge/badge.d.ts.map +1 -1
  118. package/dist/functional-components/layout/layout-utils.test.d.ts +2 -0
  119. package/dist/functional-components/layout/layout-utils.test.d.ts.map +1 -0
  120. package/dist/{ganttDiagram-JELNMOA3-64EHKpud.js → ganttDiagram-JELNMOA3-D8bgGv3W.js} +2 -2
  121. package/dist/{ganttDiagram-JELNMOA3-CN1LWzl3.cjs → ganttDiagram-JELNMOA3-Dg3gcgGP.cjs} +1 -1
  122. package/dist/{gitGraph-F6HP7TQM-BHF2Px3a.js → gitGraph-F6HP7TQM-CYYpWdGq.js} +1 -1
  123. package/dist/{gitGraph-F6HP7TQM-g-uFxP-W.cjs → gitGraph-F6HP7TQM-DAOdDfOa.cjs} +1 -1
  124. package/dist/{gitGraphDiagram-NY62KEGX-gkspcAEl.cjs → gitGraphDiagram-NY62KEGX-CACSicRn.cjs} +1 -1
  125. package/dist/{gitGraphDiagram-NY62KEGX-BMZgJCnk.js → gitGraphDiagram-NY62KEGX-CM2Vxzlx.js} +4 -4
  126. package/dist/{graph-Bl9cAjm8.js → graph-B-keMiTZ.js} +2 -3
  127. package/dist/graph-Mv2qv5SB.cjs +1 -0
  128. package/dist/{index-D_kILrIh.js → index-D5NyASqq.js} +28996 -28426
  129. package/dist/{index-DIIaXWro.cjs → index-dhfrnDvJ.cjs} +152 -152
  130. package/dist/index.d.ts +4 -1
  131. package/dist/index.d.ts.map +1 -1
  132. package/dist/{info-NVLQJR56-srf2MBEA.cjs → info-NVLQJR56-BlLr9dLS.cjs} +1 -1
  133. package/dist/info-NVLQJR56-CuxiCK8q.js +5 -0
  134. package/dist/{infoDiagram-WHAUD3N6-xpWWBRHb.js → infoDiagram-WHAUD3N6-BdRjW-aL.js} +2 -2
  135. package/dist/{infoDiagram-WHAUD3N6-DA8ixL4V.cjs → infoDiagram-WHAUD3N6-DFw2Z3_-.cjs} +1 -1
  136. package/dist/{journeyDiagram-XKPGCS4Q-DF1jSlK-.cjs → journeyDiagram-XKPGCS4Q-DkjuGmmU.cjs} +1 -1
  137. package/dist/{journeyDiagram-XKPGCS4Q-CiHV35D-.js → journeyDiagram-XKPGCS4Q-DlpDeIYp.js} +4 -4
  138. package/dist/{kanban-definition-3W4ZIXB7-BWGryLGw.js → kanban-definition-3W4ZIXB7-51Pnrmuv.js} +2 -2
  139. package/dist/{kanban-definition-3W4ZIXB7-gS0oGytB.cjs → kanban-definition-3W4ZIXB7-aQx57fCW.cjs} +1 -1
  140. package/dist/ketchup2.cjs.js +1 -1
  141. package/dist/ketchup2.css +1 -1
  142. package/dist/ketchup2.es.js +16 -15
  143. package/dist/{layout-DqfckNJZ.js → layout-DN-p0Ppz.js} +245 -242
  144. package/dist/layout-TZOoqACN.cjs +1 -0
  145. package/dist/{linear-CDB37PVm.cjs → linear-K9FI-N_R.cjs} +1 -1
  146. package/dist/{linear-BwTuJ7Vo.js → linear-SvFy3H5R.js} +1 -1
  147. package/dist/locale/en/translation.json.d.ts +0 -1
  148. package/dist/locale/it/translation.json.d.ts +0 -1
  149. package/dist/{mermaid-parser.core-Kh2GaZjn.js → mermaid-parser.core-C0aPfQrd.js} +208 -209
  150. package/dist/{mermaid-parser.core-2c535U97.cjs → mermaid-parser.core-DrvvGvos.cjs} +64 -64
  151. package/dist/{mindmap-definition-VGOIOE7T-CHXB52JE.js → mindmap-definition-VGOIOE7T-B-XcJ1QB.js} +3 -3
  152. package/dist/{mindmap-definition-VGOIOE7T-Dbf-IjJg.cjs → mindmap-definition-VGOIOE7T-CQBoNmIj.cjs} +1 -1
  153. package/dist/{packet-BFZMPI3H-CWlKzkUT.js → packet-BFZMPI3H-C96MlUhq.js} +1 -1
  154. package/dist/{packet-BFZMPI3H-CHjUkc3K.cjs → packet-BFZMPI3H-CFs8sQKO.cjs} +1 -1
  155. package/dist/pie-7BOR55EZ-B7H6T2nu.js +5 -0
  156. package/dist/{pie-7BOR55EZ-DF8jDFu6.cjs → pie-7BOR55EZ-D1z_FiDQ.cjs} +1 -1
  157. package/dist/{pieDiagram-ADFJNKIX-BS47ESx3.js → pieDiagram-ADFJNKIX-Btipy1Yg.js} +4 -4
  158. package/dist/{pieDiagram-ADFJNKIX-CUXoHrUo.cjs → pieDiagram-ADFJNKIX-DITgkzrb.cjs} +1 -1
  159. package/dist/{quadrantDiagram-AYHSOK5B-BDCNfr1M.js → quadrantDiagram-AYHSOK5B-0REjJWXf.js} +2 -2
  160. package/dist/{quadrantDiagram-AYHSOK5B-DR-GeD40.cjs → quadrantDiagram-AYHSOK5B-DUvmRtA9.cjs} +1 -1
  161. package/dist/radar-NHE76QYJ-BBThtHed.js +5 -0
  162. package/dist/{radar-NHE76QYJ-CTPycyar.cjs → radar-NHE76QYJ-buBWFcX8.cjs} +1 -1
  163. package/dist/{requirementDiagram-UZGBJVZJ-CUfIh-7P.js → requirementDiagram-UZGBJVZJ-3qREmHHw.js} +3 -3
  164. package/dist/{requirementDiagram-UZGBJVZJ-vOYjKcHP.cjs → requirementDiagram-UZGBJVZJ-D5HKHjuR.cjs} +1 -1
  165. package/dist/{sankeyDiagram-TZEHDZUN-Ddj4CqOU.js → sankeyDiagram-TZEHDZUN-CB7aU9wG.js} +1 -1
  166. package/dist/{sankeyDiagram-TZEHDZUN-Dn5DcHZn.cjs → sankeyDiagram-TZEHDZUN-DDHq92cR.cjs} +1 -1
  167. package/dist/{sequenceDiagram-WL72ISMW-DzATBRBb.cjs → sequenceDiagram-WL72ISMW-CrGNKfm7.cjs} +1 -1
  168. package/dist/{sequenceDiagram-WL72ISMW-DCp5IF0l.js → sequenceDiagram-WL72ISMW-Dp9D1kc1.js} +3 -3
  169. package/dist/{stateDiagram-FKZM4ZOC-CYSSqqZ6.js → stateDiagram-FKZM4ZOC-Dg2jwdvB.js} +4 -4
  170. package/dist/{stateDiagram-FKZM4ZOC-Du6jFWWB.cjs → stateDiagram-FKZM4ZOC-TVfktX-m.cjs} +1 -1
  171. package/dist/{stateDiagram-v2-4FDKWEC3-Cxj_JYYu.js → stateDiagram-v2-4FDKWEC3-BeDflo8x.js} +2 -2
  172. package/dist/{stateDiagram-v2-4FDKWEC3-BAYfudRi.cjs → stateDiagram-v2-4FDKWEC3-CVw7R7Sy.cjs} +1 -1
  173. package/dist/{timeline-definition-IT6M3QCI-Dw1JJhHl.js → timeline-definition-IT6M3QCI-DPYD0-yi.js} +2 -2
  174. package/dist/{timeline-definition-IT6M3QCI-fZZ7KhwG.cjs → timeline-definition-IT6M3QCI-QaW1rM2C.cjs} +1 -1
  175. package/dist/{treemap-KMMF4GRG-DIf-BmJb.cjs → treemap-KMMF4GRG-B3ovpU-a.cjs} +1 -1
  176. package/dist/{treemap-KMMF4GRG-DOx8Kmfm.js → treemap-KMMF4GRG-BtzlMHus.js} +1 -1
  177. package/dist/types/data-structures.d.ts +8 -3
  178. package/dist/types/data-structures.d.ts.map +1 -1
  179. package/dist/types/translation.d.ts +0 -1
  180. package/dist/types/translation.d.ts.map +1 -1
  181. package/dist/utils/display-value.d.ts.map +1 -1
  182. package/dist/utils/wrapper-types/date.d.ts.map +1 -1
  183. package/dist/utils/wrapper-types/time/time-utils.d.ts +8 -0
  184. package/dist/utils/wrapper-types/time/time-utils.d.ts.map +1 -1
  185. package/dist/utils/wrapper-types/time/time.d.ts +1 -1
  186. package/dist/utils/wrapper-types/time/time.d.ts.map +1 -1
  187. package/dist/{xychartDiagram-PRI3JC2R-CHFF9E0J.js → xychartDiagram-PRI3JC2R-6W3NRZoh.js} +2 -2
  188. package/dist/{xychartDiagram-PRI3JC2R-Cg1xVYiM.cjs → xychartDiagram-PRI3JC2R-9Qn35IaK.cjs} +1 -1
  189. package/package.json +1 -2
  190. package/dist/_baseIsEqual-CEeDg5JY.cjs +0 -1
  191. package/dist/_baseIsEqual-DGkLOOUv.js +0 -330
  192. package/dist/_basePickBy-DaIc-wgz.cjs +0 -1
  193. package/dist/_baseUniq-DTfHgbiF.cjs +0 -1
  194. package/dist/_baseUniq-Fo_obzds.js +0 -292
  195. package/dist/channel-0VH3jwlj.cjs +0 -1
  196. package/dist/clone-B_ggB8XZ.cjs +0 -1
  197. package/dist/cloneDeep-BKtU4IKb.js +0 -8
  198. package/dist/cloneDeep-CAsH5xlb.cjs +0 -1
  199. package/dist/components/image-list/components/image-list-item.d.ts +0 -3
  200. package/dist/components/image-list/components/image-list-item.d.ts.map +0 -1
  201. package/dist/components/image-list/types/image-list-types.d.ts +0 -69
  202. package/dist/components/image-list/types/image-list-types.d.ts.map +0 -1
  203. package/dist/components/image-list/utils/image-list-utils.d.ts +0 -7
  204. package/dist/components/image-list/utils/image-list-utils.d.ts.map +0 -1
  205. package/dist/graph-BAbMYZfV.cjs +0 -1
  206. package/dist/info-NVLQJR56-Coo8EJ5Z.js +0 -5
  207. package/dist/layout-BAOkTpMt.cjs +0 -1
  208. package/dist/pie-7BOR55EZ-ev26J3c5.js +0 -5
  209. package/dist/quill-CL1W1hro.js +0 -6687
  210. package/dist/quill-izWMIyId.cjs +0 -49
  211. package/dist/radar-NHE76QYJ-CrwtClJN.js +0 -5
@@ -1,39 +1,42 @@
1
- import { G as g } from "./graph-Bl9cAjm8.js";
2
- import { n as ce, o as le, e as z, d as ee, j as F, m as Te, p as Ie, a as Me, q as je, c as f, i as m, f as R, v as x, r as M } from "./_baseUniq-Fo_obzds.js";
3
- import { f as O, b as he, a as Se, c as Fe, d as Ve, t as V, m as w, e as P, h as ve, g as X, l as T, i as Be } from "./_basePickBy-B1R94gYg.js";
4
- import { by as Ae, bz as Ye, bw as Ge, aU as De, bA as qe, aY as pe, aX as we, bi as $e, aT as q, aC as We, a_ as ze, aE as Xe, bB as $ } from "./index-D_kILrIh.js";
5
- import { c as Ue } from "./cloneDeep-BKtU4IKb.js";
1
+ import { G as g } from "./graph-B-keMiTZ.js";
2
+ import { b as Te, p as ce, q as le, g as X, e as ee, l as F, o as Ie, s as Me, c as Se, u as je, d as f, i as m, f as _, v as x, r as M } from "./_baseUniq-Bn1jRtDY.js";
3
+ import { f as O, b as he, a as Fe, c as Ve, d as Ae, t as V, m as w, e as P, h as ve, g as z, l as T, i as Be } from "./_basePickBy-DLc0xS6g.js";
4
+ import { b9 as Ge, ba as Ye, bb as De, aU as qe, bc as $e, aY as pe, aX as we, bd as We, aT as q, aC as Xe, a_ as ze, aE as Ue, be as $ } from "./index-D5NyASqq.js";
6
5
  function He(e) {
7
- return Ae(Ye(e, void 0, O), e + "");
6
+ return Ge(Ye(e, void 0, O), e + "");
8
7
  }
9
- function Je(e, n) {
10
- return e == null ? e : Ge(e, ce(n), De);
8
+ var Je = 1, Ze = 4;
9
+ function Ke(e) {
10
+ return Te(e, Je | Ze);
11
11
  }
12
- function Ze(e, n) {
12
+ function Qe(e, n) {
13
+ return e == null ? e : De(e, ce(n), qe);
14
+ }
15
+ function en(e, n) {
13
16
  return e && le(e, ce(n));
14
17
  }
15
- function Ke(e, n) {
18
+ function nn(e, n) {
16
19
  return e > n;
17
20
  }
18
- function j(e, n) {
21
+ function S(e, n) {
19
22
  var r = {};
20
- return n = z(n), le(e, function(t, a, i) {
21
- qe(r, a, n(t, a, i));
23
+ return n = X(n), le(e, function(t, a, i) {
24
+ $e(r, a, n(t, a, i));
22
25
  }), r;
23
26
  }
24
27
  function y(e) {
25
- return e && e.length ? he(e, pe, Ke) : void 0;
28
+ return e && e.length ? he(e, pe, nn) : void 0;
26
29
  }
27
30
  function U(e, n) {
28
- return e && e.length ? he(e, z(n), Se) : void 0;
31
+ return e && e.length ? he(e, X(n), Fe) : void 0;
29
32
  }
30
- function Qe(e, n) {
33
+ function rn(e, n) {
31
34
  var r = e.length;
32
35
  for (e.sort(n); r--; )
33
36
  e[r] = e[r].value;
34
37
  return e;
35
38
  }
36
- function en(e, n) {
39
+ function tn(e, n) {
37
40
  if (e !== n) {
38
41
  var r = e !== void 0, t = e === null, a = e === e, i = ee(e), o = n !== void 0, u = n === null, d = n === n, s = ee(n);
39
42
  if (!u && !s && !i && e > n || i && o && d && !u && !s || t && o && d || !r && d || !a)
@@ -43,9 +46,9 @@ function en(e, n) {
43
46
  }
44
47
  return 0;
45
48
  }
46
- function nn(e, n, r) {
49
+ function an(e, n, r) {
47
50
  for (var t = -1, a = e.criteria, i = n.criteria, o = a.length, u = r.length; ++t < o; ) {
48
- var d = en(a[t], i[t]);
51
+ var d = tn(a[t], i[t]);
49
52
  if (d) {
50
53
  if (t >= u)
51
54
  return d;
@@ -55,63 +58,63 @@ function nn(e, n, r) {
55
58
  }
56
59
  return e.index - n.index;
57
60
  }
58
- function rn(e, n, r) {
61
+ function on(e, n, r) {
59
62
  n.length ? n = F(n, function(i) {
60
63
  return we(i) ? function(o) {
61
- return Te(o, i.length === 1 ? i[0] : i);
64
+ return Ie(o, i.length === 1 ? i[0] : i);
62
65
  } : i;
63
66
  }) : n = [pe];
64
67
  var t = -1;
65
- n = F(n, $e(z));
66
- var a = Fe(e, function(i, o, u) {
68
+ n = F(n, We(X));
69
+ var a = Ve(e, function(i, o, u) {
67
70
  var d = F(n, function(s) {
68
71
  return s(i);
69
72
  });
70
73
  return { criteria: d, index: ++t, value: i };
71
74
  });
72
- return Qe(a, function(i, o) {
73
- return nn(i, o, r);
75
+ return rn(a, function(i, o) {
76
+ return an(i, o, r);
74
77
  });
75
78
  }
76
- function tn(e, n) {
77
- return Ve(e, n, function(r, t) {
78
- return Ie(e, t);
79
+ function un(e, n) {
80
+ return Ae(e, n, function(r, t) {
81
+ return Me(e, t);
79
82
  });
80
83
  }
81
84
  var I = He(function(e, n) {
82
- return e == null ? {} : tn(e, n);
83
- }), an = Math.ceil, on = Math.max;
84
- function un(e, n, r, t) {
85
- for (var a = -1, i = on(an((n - e) / (r || 1)), 0), o = Array(i); i--; )
85
+ return e == null ? {} : un(e, n);
86
+ }), dn = Math.ceil, sn = Math.max;
87
+ function fn(e, n, r, t) {
88
+ for (var a = -1, i = sn(dn((n - e) / (r || 1)), 0), o = Array(i); i--; )
86
89
  o[++a] = e, e += r;
87
90
  return o;
88
91
  }
89
- function dn(e) {
92
+ function cn(e) {
90
93
  return function(n, r, t) {
91
- return t && typeof t != "number" && q(n, r, t) && (r = t = void 0), n = V(n), r === void 0 ? (r = n, n = 0) : r = V(r), t = t === void 0 ? n < r ? 1 : -1 : V(t), un(n, r, t);
94
+ return t && typeof t != "number" && q(n, r, t) && (r = t = void 0), n = V(n), r === void 0 ? (r = n, n = 0) : r = V(r), t = t === void 0 ? n < r ? 1 : -1 : V(t), fn(n, r, t);
92
95
  };
93
96
  }
94
- var E = dn(), _ = We(function(e, n) {
97
+ var E = cn(), R = Xe(function(e, n) {
95
98
  if (e == null)
96
99
  return [];
97
100
  var r = n.length;
98
- return r > 1 && q(e, n[0], n[1]) ? n = [] : r > 2 && q(n[0], n[1], n[2]) && (n = [n[0]]), rn(e, Me(n), []);
99
- }), sn = 0;
101
+ return r > 1 && q(e, n[0], n[1]) ? n = [] : r > 2 && q(n[0], n[1], n[2]) && (n = [n[0]]), on(e, Se(n), []);
102
+ }), ln = 0;
100
103
  function H(e) {
101
- var n = ++sn;
104
+ var n = ++ln;
102
105
  return je(e) + n;
103
106
  }
104
- function fn(e, n, r) {
107
+ function hn(e, n, r) {
105
108
  for (var t = -1, a = e.length, i = n.length, o = {}; ++t < a; ) {
106
109
  var u = t < i ? n[t] : void 0;
107
110
  r(o, e[t], u);
108
111
  }
109
112
  return o;
110
113
  }
111
- function cn(e, n) {
112
- return fn(e || [], n || [], ze);
114
+ function vn(e, n) {
115
+ return hn(e || [], n || [], ze);
113
116
  }
114
- class ln {
117
+ class pn {
115
118
  constructor() {
116
119
  var n = {};
117
120
  n._next = n._prev = n, this._sentinel = n;
@@ -127,45 +130,45 @@ class ln {
127
130
  }
128
131
  toString() {
129
132
  for (var n = [], r = this._sentinel, t = r._prev; t !== r; )
130
- n.push(JSON.stringify(t, hn)), t = t._prev;
133
+ n.push(JSON.stringify(t, wn)), t = t._prev;
131
134
  return "[" + n.join(", ") + "]";
132
135
  }
133
136
  }
134
137
  function ne(e) {
135
138
  e._prev._next = e._next, e._next._prev = e._prev, delete e._next, delete e._prev;
136
139
  }
137
- function hn(e, n) {
140
+ function wn(e, n) {
138
141
  if (e !== "_next" && e !== "_prev")
139
142
  return n;
140
143
  }
141
- var vn = Xe(1);
142
- function pn(e, n) {
144
+ var bn = Ue(1);
145
+ function mn(e, n) {
143
146
  if (e.nodeCount() <= 1)
144
147
  return [];
145
- var r = bn(e, n || vn), t = wn(r.graph, r.buckets, r.zeroIdx);
148
+ var r = yn(e, n || bn), t = gn(r.graph, r.buckets, r.zeroIdx);
146
149
  return O(
147
150
  w(t, function(a) {
148
151
  return e.outEdges(a.v, a.w);
149
152
  })
150
153
  );
151
154
  }
152
- function wn(e, n, r) {
155
+ function gn(e, n, r) {
153
156
  for (var t = [], a = n[n.length - 1], i = n[0], o; e.nodeCount(); ) {
154
157
  for (; o = i.dequeue(); )
155
- B(e, n, r, o);
158
+ A(e, n, r, o);
156
159
  for (; o = a.dequeue(); )
157
- B(e, n, r, o);
160
+ A(e, n, r, o);
158
161
  if (e.nodeCount()) {
159
162
  for (var u = n.length - 2; u > 0; --u)
160
163
  if (o = n[u].dequeue(), o) {
161
- t = t.concat(B(e, n, r, o, !0));
164
+ t = t.concat(A(e, n, r, o, !0));
162
165
  break;
163
166
  }
164
167
  }
165
168
  }
166
169
  return t;
167
170
  }
168
- function B(e, n, r, t, a) {
171
+ function A(e, n, r, t, a) {
169
172
  var i = a ? [] : void 0;
170
173
  return f(e.inEdges(t.v), function(o) {
171
174
  var u = e.edge(o), d = e.node(o.v);
@@ -175,7 +178,7 @@ function B(e, n, r, t, a) {
175
178
  s.in -= u, W(n, r, s);
176
179
  }), e.removeNode(t.v), i;
177
180
  }
178
- function bn(e, n) {
181
+ function yn(e, n) {
179
182
  var r = new g(), t = 0, a = 0;
180
183
  f(e.nodes(), function(u) {
181
184
  r.setNode(u, { v: u, in: 0, out: 0 });
@@ -184,7 +187,7 @@ function bn(e, n) {
184
187
  r.setEdge(u.v, u.w, c), a = Math.max(a, r.node(u.v).out += s), t = Math.max(t, r.node(u.w).in += s);
185
188
  });
186
189
  var i = E(a + t + 3).map(function() {
187
- return new ln();
190
+ return new pn();
188
191
  }), o = t + 1;
189
192
  return f(r.nodes(), function(u) {
190
193
  W(i, o, r.node(u));
@@ -193,8 +196,8 @@ function bn(e, n) {
193
196
  function W(e, n, r) {
194
197
  r.out ? r.in ? e[r.out - r.in + n].enqueue(r) : e[e.length - 1].enqueue(r) : e[0].enqueue(r);
195
198
  }
196
- function mn(e) {
197
- var n = e.graph().acyclicer === "greedy" ? pn(e, r(e)) : gn(e);
199
+ function kn(e) {
200
+ var n = e.graph().acyclicer === "greedy" ? mn(e, r(e)) : xn(e);
198
201
  f(n, function(t) {
199
202
  var a = e.edge(t);
200
203
  e.removeEdge(t), a.forwardName = t.name, a.reversed = !0, e.setEdge(t.w, t.v, a, H("rev"));
@@ -205,7 +208,7 @@ function mn(e) {
205
208
  };
206
209
  }
207
210
  }
208
- function gn(e) {
211
+ function xn(e) {
209
212
  var n = [], r = {}, t = {};
210
213
  function a(i) {
211
214
  Object.prototype.hasOwnProperty.call(t, i) || (t[i] = !0, r[i] = !0, f(e.outEdges(i), function(o) {
@@ -214,7 +217,7 @@ function gn(e) {
214
217
  }
215
218
  return f(e.nodes(), a), n;
216
219
  }
217
- function yn(e) {
220
+ function En(e) {
218
221
  f(e.edges(), function(n) {
219
222
  var r = e.edge(n);
220
223
  if (r.reversed) {
@@ -224,14 +227,14 @@ function yn(e) {
224
227
  }
225
228
  });
226
229
  }
227
- function N(e, n, r, t) {
230
+ function L(e, n, r, t) {
228
231
  var a;
229
232
  do
230
233
  a = H(t);
231
234
  while (e.hasNode(a));
232
235
  return r.dummy = n, e.setNode(a, r), a;
233
236
  }
234
- function kn(e) {
237
+ function On(e) {
235
238
  var n = new g().setGraph(e.graph());
236
239
  return f(e.nodes(), function(r) {
237
240
  n.setNode(r, e.node(r));
@@ -258,7 +261,7 @@ function re(e, n) {
258
261
  var d, s;
259
262
  return Math.abs(i) * o > Math.abs(a) * u ? (i < 0 && (u = -u), d = u * a / i, s = u) : (a < 0 && (o = -o), d = o, s = o * i / a), { x: r + d, y: t + s };
260
263
  }
261
- function S(e) {
264
+ function j(e) {
262
265
  var n = w(E(me(e) + 1), function() {
263
266
  return [];
264
267
  });
@@ -267,7 +270,7 @@ function S(e) {
267
270
  m(a) || (n[a][t.order] = r);
268
271
  }), n;
269
272
  }
270
- function xn(e) {
273
+ function Ln(e) {
271
274
  var n = P(
272
275
  w(e.nodes(), function(r) {
273
276
  return e.node(r).rank;
@@ -278,7 +281,7 @@ function xn(e) {
278
281
  ve(t, "rank") && (t.rank -= n);
279
282
  });
280
283
  }
281
- function En(e) {
284
+ function Nn(e) {
282
285
  var n = P(
283
286
  w(e.nodes(), function(i) {
284
287
  return e.node(i).rank;
@@ -300,7 +303,7 @@ function te(e, n, r, t) {
300
303
  width: 0,
301
304
  height: 0
302
305
  };
303
- return arguments.length >= 4 && (a.rank = r, a.order = t), N(e, "border", a, n);
306
+ return arguments.length >= 4 && (a.rank = r, a.order = t), L(e, "border", a, n);
304
307
  }
305
308
  function me(e) {
306
309
  return y(
@@ -311,16 +314,16 @@ function me(e) {
311
314
  })
312
315
  );
313
316
  }
314
- function On(e, n) {
317
+ function Pn(e, n) {
315
318
  var r = { lhs: [], rhs: [] };
316
319
  return f(e, function(t) {
317
320
  n(t) ? r.lhs.push(t) : r.rhs.push(t);
318
321
  }), r;
319
322
  }
320
- function Nn(e, n) {
323
+ function Cn(e, n) {
321
324
  return n();
322
325
  }
323
- function Ln(e) {
326
+ function _n(e) {
324
327
  function n(r) {
325
328
  var t = e.children(r), a = e.node(r);
326
329
  if (t.length && f(t, n), Object.prototype.hasOwnProperty.call(a, "minRank")) {
@@ -332,16 +335,16 @@ function Ln(e) {
332
335
  f(e.children(), n);
333
336
  }
334
337
  function ae(e, n, r, t, a, i) {
335
- var o = { width: 0, height: 0, rank: i, borderType: n }, u = a[n][i - 1], d = N(e, "border", o, r);
338
+ var o = { width: 0, height: 0, rank: i, borderType: n }, u = a[n][i - 1], d = L(e, "border", o, r);
336
339
  a[n][i] = d, e.setParent(d, t), u && e.setEdge(u, d, { weight: 1 });
337
340
  }
338
- function Pn(e) {
341
+ function Rn(e) {
339
342
  var n = e.graph().rankdir.toLowerCase();
340
343
  (n === "lr" || n === "rl") && ge(e);
341
344
  }
342
- function Cn(e) {
345
+ function Tn(e) {
343
346
  var n = e.graph().rankdir.toLowerCase();
344
- (n === "bt" || n === "rl") && Rn(e), (n === "lr" || n === "rl") && (_n(e), ge(e));
347
+ (n === "bt" || n === "rl") && In(e), (n === "lr" || n === "rl") && (Mn(e), ge(e));
345
348
  }
346
349
  function ge(e) {
347
350
  f(e.nodes(), function(n) {
@@ -354,35 +357,35 @@ function ie(e) {
354
357
  var n = e.width;
355
358
  e.width = e.height, e.height = n;
356
359
  }
357
- function Rn(e) {
360
+ function In(e) {
358
361
  f(e.nodes(), function(n) {
359
- A(e.node(n));
362
+ B(e.node(n));
360
363
  }), f(e.edges(), function(n) {
361
364
  var r = e.edge(n);
362
- f(r.points, A), Object.prototype.hasOwnProperty.call(r, "y") && A(r);
365
+ f(r.points, B), Object.prototype.hasOwnProperty.call(r, "y") && B(r);
363
366
  });
364
367
  }
365
- function A(e) {
368
+ function B(e) {
366
369
  e.y = -e.y;
367
370
  }
368
- function _n(e) {
371
+ function Mn(e) {
369
372
  f(e.nodes(), function(n) {
370
- Y(e.node(n));
373
+ G(e.node(n));
371
374
  }), f(e.edges(), function(n) {
372
375
  var r = e.edge(n);
373
- f(r.points, Y), Object.prototype.hasOwnProperty.call(r, "x") && Y(r);
376
+ f(r.points, G), Object.prototype.hasOwnProperty.call(r, "x") && G(r);
374
377
  });
375
378
  }
376
- function Y(e) {
379
+ function G(e) {
377
380
  var n = e.x;
378
381
  e.x = e.y, e.y = n;
379
382
  }
380
- function Tn(e) {
383
+ function Sn(e) {
381
384
  e.graph().dummyChains = [], f(e.edges(), function(n) {
382
- In(e, n);
385
+ jn(e, n);
383
386
  });
384
387
  }
385
- function In(e, n) {
388
+ function jn(e, n) {
386
389
  var r = n.v, t = e.node(r).rank, a = n.w, i = e.node(a).rank, o = n.name, u = e.edge(n), d = u.labelRank;
387
390
  if (i !== t + 1) {
388
391
  e.removeEdge(n);
@@ -394,11 +397,11 @@ function In(e, n) {
394
397
  edgeLabel: u,
395
398
  edgeObj: n,
396
399
  rank: t
397
- }, c = N(e, "edge", s, "_d"), t === d && (s.width = u.width, s.height = u.height, s.dummy = "edge-label", s.labelpos = u.labelpos), e.setEdge(r, c, { weight: u.weight }, o), l === 0 && e.graph().dummyChains.push(c), r = c;
400
+ }, c = L(e, "edge", s, "_d"), t === d && (s.width = u.width, s.height = u.height, s.dummy = "edge-label", s.labelpos = u.labelpos), e.setEdge(r, c, { weight: u.weight }, o), l === 0 && e.graph().dummyChains.push(c), r = c;
398
401
  e.setEdge(r, a, { weight: u.weight }, o);
399
402
  }
400
403
  }
401
- function Mn(e) {
404
+ function Fn(e) {
402
405
  f(e.graph().dummyChains, function(n) {
403
406
  var r = e.node(n), t = r.edgeLabel, a;
404
407
  for (e.setEdge(r.edgeObj, t); r.dummy; )
@@ -429,11 +432,11 @@ function C(e, n) {
429
432
  function ye(e) {
430
433
  var n = new g({ directed: !1 }), r = e.nodes()[0], t = e.nodeCount();
431
434
  n.setNode(r, {});
432
- for (var a, i; jn(n, e) < t; )
433
- a = Sn(n, e), i = n.hasNode(a.v) ? C(e, a) : -C(e, a), Fn(n, e, i);
435
+ for (var a, i; Vn(n, e) < t; )
436
+ a = An(n, e), i = n.hasNode(a.v) ? C(e, a) : -C(e, a), Bn(n, e, i);
434
437
  return n;
435
438
  }
436
- function jn(e, n) {
439
+ function Vn(e, n) {
437
440
  function r(t) {
438
441
  f(n.nodeEdges(t), function(a) {
439
442
  var i = a.v, o = t === i ? a.w : i;
@@ -442,20 +445,20 @@ function jn(e, n) {
442
445
  }
443
446
  return f(e.nodes(), r), e.nodeCount();
444
447
  }
445
- function Sn(e, n) {
448
+ function An(e, n) {
446
449
  return U(n.edges(), function(r) {
447
450
  if (e.hasNode(r.v) !== e.hasNode(r.w))
448
451
  return C(n, r);
449
452
  });
450
453
  }
451
- function Fn(e, n, r) {
454
+ function Bn(e, n, r) {
452
455
  f(e.nodes(), function(t) {
453
456
  n.node(t).rank += r;
454
457
  });
455
458
  }
456
- function Vn() {
459
+ function Gn() {
457
460
  }
458
- Vn.prototype = new Error();
461
+ Gn.prototype = new Error();
459
462
  function ke(e, n, r) {
460
463
  we(n) || (n = [n]);
461
464
  var t = (e.isDirected() ? e.successors : e.neighbors).bind(e), a = [], i = {};
@@ -470,32 +473,32 @@ function xe(e, n, r, t, a, i) {
470
473
  xe(e, o, r, t, a, i);
471
474
  }), r && i.push(n));
472
475
  }
473
- function Bn(e, n) {
476
+ function Yn(e, n) {
474
477
  return ke(e, n, "post");
475
478
  }
476
- function An(e, n) {
479
+ function Dn(e, n) {
477
480
  return ke(e, n, "pre");
478
481
  }
479
482
  k.initLowLimValues = K;
480
483
  k.initCutValues = Z;
481
484
  k.calcCutValue = Ee;
482
- k.leaveEdge = Ne;
483
- k.enterEdge = Le;
485
+ k.leaveEdge = Le;
486
+ k.enterEdge = Ne;
484
487
  k.exchangeEdges = Pe;
485
488
  function k(e) {
486
- e = kn(e), J(e);
489
+ e = On(e), J(e);
487
490
  var n = ye(e);
488
491
  K(n), Z(n, e);
489
- for (var r, t; r = Ne(n); )
490
- t = Le(n, e, r), Pe(n, e, r, t);
492
+ for (var r, t; r = Le(n); )
493
+ t = Ne(n, e, r), Pe(n, e, r, t);
491
494
  }
492
495
  function Z(e, n) {
493
- var r = Bn(e, e.nodes());
496
+ var r = Yn(e, e.nodes());
494
497
  r = r.slice(0, r.length - 1), f(r, function(t) {
495
- Yn(e, n, t);
498
+ qn(e, n, t);
496
499
  });
497
500
  }
498
- function Yn(e, n, r) {
501
+ function qn(e, n, r) {
499
502
  var t = e.node(r), a = t.parent;
500
503
  e.edge(r, a).cutvalue = Ee(e, n, r);
501
504
  }
@@ -505,7 +508,7 @@ function Ee(e, n, r) {
505
508
  var s = d.v === r, c = s ? d.w : d.v;
506
509
  if (c !== a) {
507
510
  var l = s === i, h = n.edge(d).weight;
508
- if (u += l ? h : -h, Dn(e, r, c)) {
511
+ if (u += l ? h : -h, Wn(e, r, c)) {
509
512
  var v = e.edge(r, c).cutvalue;
510
513
  u += l ? -v : v;
511
514
  }
@@ -521,17 +524,17 @@ function Oe(e, n, r, t, a) {
521
524
  Object.prototype.hasOwnProperty.call(n, u) || (r = Oe(e, n, r, u, t));
522
525
  }), o.low = i, o.lim = r++, a ? o.parent = a : delete o.parent, r;
523
526
  }
524
- function Ne(e) {
525
- return X(e.edges(), function(n) {
527
+ function Le(e) {
528
+ return z(e.edges(), function(n) {
526
529
  return e.edge(n).cutvalue < 0;
527
530
  });
528
531
  }
529
- function Le(e, n, r) {
532
+ function Ne(e, n, r) {
530
533
  var t = r.v, a = r.w;
531
534
  n.hasEdge(t, a) || (t = r.w, a = r.v);
532
535
  var i = e.node(t), o = e.node(a), u = i, d = !1;
533
536
  i.lim > o.lim && (u = o, d = !0);
534
- var s = R(n.edges(), function(c) {
537
+ var s = _(n.edges(), function(c) {
535
538
  return d === oe(e, e.node(c.v), u) && d !== oe(e, e.node(c.w), u);
536
539
  });
537
540
  return U(s, function(c) {
@@ -540,51 +543,51 @@ function Le(e, n, r) {
540
543
  }
541
544
  function Pe(e, n, r, t) {
542
545
  var a = r.v, i = r.w;
543
- e.removeEdge(a, i), e.setEdge(t.v, t.w, {}), K(e), Z(e, n), Gn(e, n);
546
+ e.removeEdge(a, i), e.setEdge(t.v, t.w, {}), K(e), Z(e, n), $n(e, n);
544
547
  }
545
- function Gn(e, n) {
546
- var r = X(e.nodes(), function(a) {
548
+ function $n(e, n) {
549
+ var r = z(e.nodes(), function(a) {
547
550
  return !n.node(a).parent;
548
- }), t = An(e, r);
551
+ }), t = Dn(e, r);
549
552
  t = t.slice(1), f(t, function(a) {
550
553
  var i = e.node(a).parent, o = n.edge(a, i), u = !1;
551
554
  o || (o = n.edge(i, a), u = !0), n.node(a).rank = n.node(i).rank + (u ? o.minlen : -o.minlen);
552
555
  });
553
556
  }
554
- function Dn(e, n, r) {
557
+ function Wn(e, n, r) {
555
558
  return e.hasEdge(n, r);
556
559
  }
557
560
  function oe(e, n, r) {
558
561
  return r.low <= n.lim && n.lim <= r.lim;
559
562
  }
560
- function qn(e) {
563
+ function Xn(e) {
561
564
  switch (e.graph().ranker) {
562
565
  case "network-simplex":
563
566
  ue(e);
564
567
  break;
565
568
  case "tight-tree":
566
- Wn(e);
569
+ Un(e);
567
570
  break;
568
571
  case "longest-path":
569
- $n(e);
572
+ zn(e);
570
573
  break;
571
574
  default:
572
575
  ue(e);
573
576
  }
574
577
  }
575
- var $n = J;
576
- function Wn(e) {
578
+ var zn = J;
579
+ function Un(e) {
577
580
  J(e), ye(e);
578
581
  }
579
582
  function ue(e) {
580
583
  k(e);
581
584
  }
582
- function zn(e) {
583
- var n = N(e, "root", {}, "_root"), r = Xn(e), t = y(x(r)) - 1, a = 2 * t + 1;
585
+ function Hn(e) {
586
+ var n = L(e, "root", {}, "_root"), r = Jn(e), t = y(x(r)) - 1, a = 2 * t + 1;
584
587
  e.graph().nestingRoot = n, f(e.edges(), function(o) {
585
588
  e.edge(o).minlen *= a;
586
589
  });
587
- var i = Un(e) + 1;
590
+ var i = Zn(e) + 1;
588
591
  f(e.children(), function(o) {
589
592
  Ce(e, n, a, i, t, r, o);
590
593
  }), e.graph().nodeRankFactor = a;
@@ -598,19 +601,19 @@ function Ce(e, n, r, t, a, i, o) {
598
601
  var d = te(e, "_bt"), s = te(e, "_bb"), c = e.node(o);
599
602
  e.setParent(d, o), c.borderTop = d, e.setParent(s, o), c.borderBottom = s, f(u, function(l) {
600
603
  Ce(e, n, r, t, a, i, l);
601
- var h = e.node(l), v = h.borderTop ? h.borderTop : l, p = h.borderBottom ? h.borderBottom : l, b = h.borderTop ? t : 2 * t, L = v !== p ? 1 : a - i[o] + 1;
604
+ var h = e.node(l), v = h.borderTop ? h.borderTop : l, p = h.borderBottom ? h.borderBottom : l, b = h.borderTop ? t : 2 * t, N = v !== p ? 1 : a - i[o] + 1;
602
605
  e.setEdge(d, v, {
603
606
  weight: b,
604
- minlen: L,
607
+ minlen: N,
605
608
  nestingEdge: !0
606
609
  }), e.setEdge(p, s, {
607
610
  weight: b,
608
- minlen: L,
611
+ minlen: N,
609
612
  nestingEdge: !0
610
613
  });
611
614
  }), e.parent(o) || e.setEdge(n, d, { weight: 0, minlen: a + i[o] });
612
615
  }
613
- function Xn(e) {
616
+ function Jn(e) {
614
617
  var n = {};
615
618
  function r(t, a) {
616
619
  var i = e.children(t);
@@ -622,7 +625,7 @@ function Xn(e) {
622
625
  r(t, 1);
623
626
  }), n;
624
627
  }
625
- function Un(e) {
628
+ function Zn(e) {
626
629
  return M(
627
630
  e.edges(),
628
631
  function(n, r) {
@@ -631,14 +634,14 @@ function Un(e) {
631
634
  0
632
635
  );
633
636
  }
634
- function Hn(e) {
637
+ function Kn(e) {
635
638
  var n = e.graph();
636
639
  e.removeNode(n.nestingRoot), delete n.nestingRoot, f(e.edges(), function(r) {
637
640
  var t = e.edge(r);
638
641
  t.nestingEdge && e.removeEdge(r);
639
642
  });
640
643
  }
641
- function Jn(e, n, r) {
644
+ function Qn(e, n, r) {
642
645
  var t = {}, a;
643
646
  f(r, function(i) {
644
647
  for (var o = e.parent(i), u, d; o; ) {
@@ -650,8 +653,8 @@ function Jn(e, n, r) {
650
653
  }
651
654
  });
652
655
  }
653
- function Zn(e, n, r) {
654
- var t = Kn(e), a = new g({ compound: !0 }).setGraph({ root: t }).setDefaultNodeLabel(function(i) {
656
+ function er(e, n, r) {
657
+ var t = nr(e), a = new g({ compound: !0 }).setGraph({ root: t }).setDefaultNodeLabel(function(i) {
655
658
  return e.node(i);
656
659
  });
657
660
  return f(e.nodes(), function(i) {
@@ -665,24 +668,24 @@ function Zn(e, n, r) {
665
668
  }));
666
669
  }), a;
667
670
  }
668
- function Kn(e) {
671
+ function nr(e) {
669
672
  for (var n; e.hasNode(n = H("_root")); ) ;
670
673
  return n;
671
674
  }
672
- function Qn(e, n) {
675
+ function rr(e, n) {
673
676
  for (var r = 0, t = 1; t < n.length; ++t)
674
- r += er(e, n[t - 1], n[t]);
677
+ r += tr(e, n[t - 1], n[t]);
675
678
  return r;
676
679
  }
677
- function er(e, n, r) {
678
- for (var t = cn(
680
+ function tr(e, n, r) {
681
+ for (var t = vn(
679
682
  r,
680
683
  w(r, function(s, c) {
681
684
  return c;
682
685
  })
683
686
  ), a = O(
684
687
  w(n, function(s) {
685
- return _(
688
+ return R(
686
689
  w(e.outEdges(s), function(c) {
687
690
  return { pos: t[c.w], weight: e.edge(c).weight };
688
691
  }),
@@ -706,8 +709,8 @@ function er(e, n, r) {
706
709
  })
707
710
  ), d;
708
711
  }
709
- function nr(e) {
710
- var n = {}, r = R(e.nodes(), function(u) {
712
+ function ar(e) {
713
+ var n = {}, r = _(e.nodes(), function(u) {
711
714
  return !e.children(u).length;
712
715
  }), t = y(
713
716
  w(r, function(u) {
@@ -723,12 +726,12 @@ function nr(e) {
723
726
  a[d.rank].push(u), f(e.successors(u), i);
724
727
  }
725
728
  }
726
- var o = _(r, function(u) {
729
+ var o = R(r, function(u) {
727
730
  return e.node(u).rank;
728
731
  });
729
732
  return f(o, i), a;
730
733
  }
731
- function rr(e, n) {
734
+ function ir(e, n) {
732
735
  return w(n, function(r) {
733
736
  var t = e.inEdges(r);
734
737
  if (t.length) {
@@ -752,7 +755,7 @@ function rr(e, n) {
752
755
  return { v: r };
753
756
  });
754
757
  }
755
- function tr(e, n) {
758
+ function or(e, n) {
756
759
  var r = {};
757
760
  f(e, function(a, i) {
758
761
  var o = r[a.v] = {
@@ -767,16 +770,16 @@ function tr(e, n) {
767
770
  var i = r[a.v], o = r[a.w];
768
771
  !m(i) && !m(o) && (o.indegree++, i.out.push(r[a.w]));
769
772
  });
770
- var t = R(r, function(a) {
773
+ var t = _(r, function(a) {
771
774
  return !a.indegree;
772
775
  });
773
- return ar(t);
776
+ return ur(t);
774
777
  }
775
- function ar(e) {
778
+ function ur(e) {
776
779
  var n = [];
777
780
  function r(i) {
778
781
  return function(o) {
779
- o.merged || (m(o.barycenter) || m(i.barycenter) || o.barycenter >= i.barycenter) && ir(i, o);
782
+ o.merged || (m(o.barycenter) || m(i.barycenter) || o.barycenter >= i.barycenter) && dr(i, o);
780
783
  };
781
784
  }
782
785
  function t(i) {
@@ -789,7 +792,7 @@ function ar(e) {
789
792
  n.push(a), f(a.in.reverse(), r(a)), f(a.out, t(a));
790
793
  }
791
794
  return w(
792
- R(n, function(i) {
795
+ _(n, function(i) {
793
796
  return !i.merged;
794
797
  }),
795
798
  function(i) {
@@ -797,17 +800,17 @@ function ar(e) {
797
800
  }
798
801
  );
799
802
  }
800
- function ir(e, n) {
803
+ function dr(e, n) {
801
804
  var r = 0, t = 0;
802
805
  e.weight && (r += e.barycenter * e.weight, t += e.weight), n.weight && (r += n.barycenter * n.weight, t += n.weight), e.vs = n.vs.concat(e.vs), e.barycenter = r / t, e.weight = t, e.i = Math.min(n.i, e.i), n.merged = !0;
803
806
  }
804
- function or(e, n) {
805
- var r = On(e, function(c) {
807
+ function sr(e, n) {
808
+ var r = Pn(e, function(c) {
806
809
  return Object.prototype.hasOwnProperty.call(c, "barycenter");
807
- }), t = r.lhs, a = _(r.rhs, function(c) {
810
+ }), t = r.lhs, a = R(r.rhs, function(c) {
808
811
  return -c.i;
809
812
  }), i = [], o = 0, u = 0, d = 0;
810
- t.sort(ur(!!n)), d = de(i, a, d), f(t, function(c) {
813
+ t.sort(fr(!!n)), d = de(i, a, d), f(t, function(c) {
811
814
  d += c.vs.length, i.push(c.vs), o += c.barycenter * c.weight, u += c.weight, d = de(i, a, d);
812
815
  });
813
816
  var s = { vs: O(i) };
@@ -818,33 +821,33 @@ function de(e, n, r) {
818
821
  n.pop(), e.push(t.vs), r++;
819
822
  return r;
820
823
  }
821
- function ur(e) {
824
+ function fr(e) {
822
825
  return function(n, r) {
823
826
  return n.barycenter < r.barycenter ? -1 : n.barycenter > r.barycenter ? 1 : e ? r.i - n.i : n.i - r.i;
824
827
  };
825
828
  }
826
- function Re(e, n, r, t) {
829
+ function _e(e, n, r, t) {
827
830
  var a = e.children(n), i = e.node(n), o = i ? i.borderLeft : void 0, u = i ? i.borderRight : void 0, d = {};
828
- o && (a = R(a, function(p) {
831
+ o && (a = _(a, function(p) {
829
832
  return p !== o && p !== u;
830
833
  }));
831
- var s = rr(e, a);
834
+ var s = ir(e, a);
832
835
  f(s, function(p) {
833
836
  if (e.children(p.v).length) {
834
- var b = Re(e, p.v, r, t);
835
- d[p.v] = b, Object.prototype.hasOwnProperty.call(b, "barycenter") && sr(p, b);
837
+ var b = _e(e, p.v, r, t);
838
+ d[p.v] = b, Object.prototype.hasOwnProperty.call(b, "barycenter") && lr(p, b);
836
839
  }
837
840
  });
838
- var c = tr(s, r);
839
- dr(c, d);
840
- var l = or(c, t);
841
+ var c = or(s, r);
842
+ cr(c, d);
843
+ var l = sr(c, t);
841
844
  if (o && (l.vs = O([o, l.vs, u]), e.predecessors(o).length)) {
842
845
  var h = e.node(e.predecessors(o)[0]), v = e.node(e.predecessors(u)[0]);
843
846
  Object.prototype.hasOwnProperty.call(l, "barycenter") || (l.barycenter = 0, l.weight = 0), l.barycenter = (l.barycenter * l.weight + h.order + v.order) / (l.weight + 2), l.weight += 2;
844
847
  }
845
848
  return l;
846
849
  }
847
- function dr(e, n) {
850
+ function cr(e, n) {
848
851
  f(e, function(r) {
849
852
  r.vs = O(
850
853
  r.vs.map(function(t) {
@@ -853,31 +856,31 @@ function dr(e, n) {
853
856
  );
854
857
  });
855
858
  }
856
- function sr(e, n) {
859
+ function lr(e, n) {
857
860
  m(e.barycenter) ? (e.barycenter = n.barycenter, e.weight = n.weight) : (e.barycenter = (e.barycenter * e.weight + n.barycenter * n.weight) / (e.weight + n.weight), e.weight += n.weight);
858
861
  }
859
- function fr(e) {
860
- var n = me(e), r = se(e, E(1, n + 1), "inEdges"), t = se(e, E(n - 1, -1, -1), "outEdges"), a = nr(e);
862
+ function hr(e) {
863
+ var n = me(e), r = se(e, E(1, n + 1), "inEdges"), t = se(e, E(n - 1, -1, -1), "outEdges"), a = ar(e);
861
864
  fe(e, a);
862
865
  for (var i = Number.POSITIVE_INFINITY, o, u = 0, d = 0; d < 4; ++u, ++d) {
863
- cr(u % 2 ? r : t, u % 4 >= 2), a = S(e);
864
- var s = Qn(e, a);
865
- s < i && (d = 0, o = Ue(a), i = s);
866
+ vr(u % 2 ? r : t, u % 4 >= 2), a = j(e);
867
+ var s = rr(e, a);
868
+ s < i && (d = 0, o = Ke(a), i = s);
866
869
  }
867
870
  fe(e, o);
868
871
  }
869
872
  function se(e, n, r) {
870
873
  return w(n, function(t) {
871
- return Zn(e, t, r);
874
+ return er(e, t, r);
872
875
  });
873
876
  }
874
- function cr(e, n) {
877
+ function vr(e, n) {
875
878
  var r = new g();
876
879
  f(e, function(t) {
877
- var a = t.graph().root, i = Re(t, a, r, n);
880
+ var a = t.graph().root, i = _e(t, a, r, n);
878
881
  f(i.vs, function(o, u) {
879
882
  t.node(o).order = u;
880
- }), Jn(t, r, i.vs);
883
+ }), Qn(t, r, i.vs);
881
884
  });
882
885
  }
883
886
  function fe(e, n) {
@@ -887,10 +890,10 @@ function fe(e, n) {
887
890
  });
888
891
  });
889
892
  }
890
- function lr(e) {
891
- var n = vr(e);
893
+ function pr(e) {
894
+ var n = br(e);
892
895
  f(e.graph().dummyChains, function(r) {
893
- for (var t = e.node(r), a = t.edgeObj, i = hr(e, n, a.v, a.w), o = i.path, u = i.lca, d = 0, s = o[d], c = !0; r !== a.w; ) {
896
+ for (var t = e.node(r), a = t.edgeObj, i = wr(e, n, a.v, a.w), o = i.path, u = i.lca, d = 0, s = o[d], c = !0; r !== a.w; ) {
894
897
  if (t = e.node(r), c) {
895
898
  for (; (s = o[d]) !== u && e.node(s).maxRank < t.rank; )
896
899
  d++;
@@ -905,7 +908,7 @@ function lr(e) {
905
908
  }
906
909
  });
907
910
  }
908
- function hr(e, n, r, t) {
911
+ function wr(e, n, r, t) {
909
912
  var a = [], i = [], o = Math.min(n[r].low, n[t].low), u = Math.max(n[r].lim, n[t].lim), d, s;
910
913
  d = r;
911
914
  do
@@ -915,7 +918,7 @@ function hr(e, n, r, t) {
915
918
  i.push(d);
916
919
  return { path: a.concat(i.reverse()), lca: s };
917
920
  }
918
- function vr(e) {
921
+ function br(e) {
919
922
  var n = {}, r = 0;
920
923
  function t(a) {
921
924
  var i = r;
@@ -923,30 +926,30 @@ function vr(e) {
923
926
  }
924
927
  return f(e.children(), t), n;
925
928
  }
926
- function pr(e, n) {
929
+ function mr(e, n) {
927
930
  var r = {};
928
931
  function t(a, i) {
929
932
  var o = 0, u = 0, d = a.length, s = T(i);
930
933
  return f(i, function(c, l) {
931
- var h = br(e, c), v = h ? e.node(h).order : d;
934
+ var h = yr(e, c), v = h ? e.node(h).order : d;
932
935
  (h || c === s) && (f(i.slice(u, l + 1), function(p) {
933
936
  f(e.predecessors(p), function(b) {
934
- var L = e.node(b), Q = L.order;
935
- (Q < o || v < Q) && !(L.dummy && e.node(p).dummy) && _e(r, b, p);
937
+ var N = e.node(b), Q = N.order;
938
+ (Q < o || v < Q) && !(N.dummy && e.node(p).dummy) && Re(r, b, p);
936
939
  });
937
940
  }), u = l + 1, o = v);
938
941
  }), i;
939
942
  }
940
943
  return M(n, t), r;
941
944
  }
942
- function wr(e, n) {
945
+ function gr(e, n) {
943
946
  var r = {};
944
947
  function t(i, o, u, d, s) {
945
948
  var c;
946
949
  f(E(o, u), function(l) {
947
950
  c = i[l], e.node(c).dummy && f(e.predecessors(c), function(h) {
948
951
  var v = e.node(h);
949
- v.dummy && (v.order < d || v.order > s) && _e(r, h, c);
952
+ v.dummy && (v.order < d || v.order > s) && Re(r, h, c);
950
953
  });
951
954
  });
952
955
  }
@@ -962,13 +965,13 @@ function wr(e, n) {
962
965
  }
963
966
  return M(n, a), r;
964
967
  }
965
- function br(e, n) {
968
+ function yr(e, n) {
966
969
  if (e.node(n).dummy)
967
- return X(e.predecessors(n), function(r) {
970
+ return z(e.predecessors(n), function(r) {
968
971
  return e.node(r).dummy;
969
972
  });
970
973
  }
971
- function _e(e, n, r) {
974
+ function Re(e, n, r) {
972
975
  if (n > r) {
973
976
  var t = n;
974
977
  n = r, r = t;
@@ -987,14 +990,14 @@ function _e(e, n, r) {
987
990
  writable: !0
988
991
  });
989
992
  }
990
- function mr(e, n, r) {
993
+ function kr(e, n, r) {
991
994
  if (n > r) {
992
995
  var t = n;
993
996
  n = r, r = t;
994
997
  }
995
998
  return !!e[n] && Object.prototype.hasOwnProperty.call(e[n], r);
996
999
  }
997
- function gr(e, n, r, t) {
1000
+ function xr(e, n, r, t) {
998
1001
  var a = {}, i = {}, o = {};
999
1002
  return f(n, function(u) {
1000
1003
  f(u, function(d, s) {
@@ -1005,19 +1008,19 @@ function gr(e, n, r, t) {
1005
1008
  f(u, function(s) {
1006
1009
  var c = t(s);
1007
1010
  if (c.length) {
1008
- c = _(c, function(b) {
1011
+ c = R(c, function(b) {
1009
1012
  return o[b];
1010
1013
  });
1011
1014
  for (var l = (c.length - 1) / 2, h = Math.floor(l), v = Math.ceil(l); h <= v; ++h) {
1012
1015
  var p = c[h];
1013
- i[s] === s && d < o[p] && !mr(r, s, p) && (i[p] = s, i[s] = a[s] = a[p], d = o[p]);
1016
+ i[s] === s && d < o[p] && !kr(r, s, p) && (i[p] = s, i[s] = a[s] = a[p], d = o[p]);
1014
1017
  }
1015
1018
  }
1016
1019
  });
1017
1020
  }), { root: a, align: i };
1018
1021
  }
1019
- function yr(e, n, r, t, a) {
1020
- var i = {}, o = kr(e, n, r, a), u = a ? "borderLeft" : "borderRight";
1022
+ function Er(e, n, r, t, a) {
1023
+ var i = {}, o = Or(e, n, r, a), u = a ? "borderLeft" : "borderRight";
1021
1024
  function d(l, h) {
1022
1025
  for (var v = o.nodes(), p = v.pop(), b = {}; p; )
1023
1026
  b[p] ? l(p) : (b[p] = !0, v.push(p), v = v.concat(h(p))), p = v.pop();
@@ -1037,8 +1040,8 @@ function yr(e, n, r, t, a) {
1037
1040
  i[l] = i[r[l]];
1038
1041
  }), i;
1039
1042
  }
1040
- function kr(e, n, r, t) {
1041
- var a = new g(), i = e.graph(), o = Lr(i.nodesep, i.edgesep, t);
1043
+ function Or(e, n, r, t) {
1044
+ var a = new g(), i = e.graph(), o = _r(i.nodesep, i.edgesep, t);
1042
1045
  return f(n, function(u) {
1043
1046
  var d;
1044
1047
  f(u, function(s) {
@@ -1051,54 +1054,54 @@ function kr(e, n, r, t) {
1051
1054
  });
1052
1055
  }), a;
1053
1056
  }
1054
- function xr(e, n) {
1057
+ function Lr(e, n) {
1055
1058
  return U(x(n), function(r) {
1056
1059
  var t = Number.NEGATIVE_INFINITY, a = Number.POSITIVE_INFINITY;
1057
- return Je(r, function(i, o) {
1058
- var u = Pr(e, o) / 2;
1060
+ return Qe(r, function(i, o) {
1061
+ var u = Rr(e, o) / 2;
1059
1062
  t = Math.max(i + u, t), a = Math.min(i - u, a);
1060
1063
  }), t - a;
1061
1064
  });
1062
1065
  }
1063
- function Er(e, n) {
1066
+ function Nr(e, n) {
1064
1067
  var r = x(n), t = P(r), a = y(r);
1065
1068
  f(["u", "d"], function(i) {
1066
1069
  f(["l", "r"], function(o) {
1067
1070
  var u = i + o, d = e[u], s;
1068
1071
  if (d !== n) {
1069
1072
  var c = x(d);
1070
- s = o === "l" ? t - P(c) : a - y(c), s && (e[u] = j(d, function(l) {
1073
+ s = o === "l" ? t - P(c) : a - y(c), s && (e[u] = S(d, function(l) {
1071
1074
  return l + s;
1072
1075
  }));
1073
1076
  }
1074
1077
  });
1075
1078
  });
1076
1079
  }
1077
- function Or(e, n) {
1078
- return j(e.ul, function(r, t) {
1080
+ function Pr(e, n) {
1081
+ return S(e.ul, function(r, t) {
1079
1082
  if (n)
1080
1083
  return e[n.toLowerCase()][t];
1081
- var a = _(w(e, t));
1084
+ var a = R(w(e, t));
1082
1085
  return (a[1] + a[2]) / 2;
1083
1086
  });
1084
1087
  }
1085
- function Nr(e) {
1086
- var n = S(e), r = $(pr(e, n), wr(e, n)), t = {}, a;
1088
+ function Cr(e) {
1089
+ var n = j(e), r = $(mr(e, n), gr(e, n)), t = {}, a;
1087
1090
  f(["u", "d"], function(o) {
1088
1091
  a = o === "u" ? n : x(n).reverse(), f(["l", "r"], function(u) {
1089
1092
  u === "r" && (a = w(a, function(l) {
1090
1093
  return x(l).reverse();
1091
1094
  }));
1092
- var d = (o === "u" ? e.predecessors : e.successors).bind(e), s = gr(e, a, r, d), c = yr(e, a, s.root, s.align, u === "r");
1093
- u === "r" && (c = j(c, function(l) {
1095
+ var d = (o === "u" ? e.predecessors : e.successors).bind(e), s = xr(e, a, r, d), c = Er(e, a, s.root, s.align, u === "r");
1096
+ u === "r" && (c = S(c, function(l) {
1094
1097
  return -l;
1095
1098
  })), t[o + u] = c;
1096
1099
  });
1097
1100
  });
1098
- var i = xr(e, t);
1099
- return Er(t, i), Or(t, e.graph().align);
1101
+ var i = Lr(e, t);
1102
+ return Nr(t, i), Pr(t, e.graph().align);
1100
1103
  }
1101
- function Lr(e, n, r) {
1104
+ function _r(e, n, r) {
1102
1105
  return function(t, a, i) {
1103
1106
  var o = t.node(a), u = t.node(i), d = 0, s;
1104
1107
  if (d += o.width / 2, Object.prototype.hasOwnProperty.call(o, "labelpos"))
@@ -1122,16 +1125,16 @@ function Lr(e, n, r) {
1122
1125
  return s && (d += r ? s : -s), s = 0, d;
1123
1126
  };
1124
1127
  }
1125
- function Pr(e, n) {
1128
+ function Rr(e, n) {
1126
1129
  return e.node(n).width;
1127
1130
  }
1128
- function Cr(e) {
1129
- e = be(e), Rr(e), Ze(Nr(e), function(n, r) {
1131
+ function Tr(e) {
1132
+ e = be(e), Ir(e), en(Cr(e), function(n, r) {
1130
1133
  e.node(r).x = n;
1131
1134
  });
1132
1135
  }
1133
- function Rr(e) {
1134
- var n = S(e), r = e.graph().ranksep, t = 0;
1136
+ function Ir(e) {
1137
+ var n = j(e), r = e.graph().ranksep, t = 0;
1135
1138
  f(n, function(a) {
1136
1139
  var i = y(
1137
1140
  w(a, function(o) {
@@ -1143,17 +1146,17 @@ function Rr(e) {
1143
1146
  }), t += i + r;
1144
1147
  });
1145
1148
  }
1146
- function at(e, n) {
1147
- var r = Nn;
1149
+ function ot(e, n) {
1150
+ var r = Cn;
1148
1151
  r("layout", () => {
1149
- var t = r(" buildLayoutGraph", () => Yr(e));
1150
- r(" runLayout", () => _r(t, r)), r(" updateInputGraph", () => Tr(e, t));
1152
+ var t = r(" buildLayoutGraph", () => qr(e));
1153
+ r(" runLayout", () => Mr(t, r)), r(" updateInputGraph", () => Sr(e, t));
1151
1154
  });
1152
1155
  }
1153
- function _r(e, n) {
1154
- n(" makeSpaceForEdgeLabels", () => Gr(e)), n(" removeSelfEdges", () => Jr(e)), n(" acyclic", () => mn(e)), n(" nestingGraph.run", () => zn(e)), n(" rank", () => qn(be(e))), n(" injectEdgeLabelProxies", () => Dr(e)), n(" removeEmptyRanks", () => En(e)), n(" nestingGraph.cleanup", () => Hn(e)), n(" normalizeRanks", () => xn(e)), n(" assignRankMinMax", () => qr(e)), n(" removeEdgeLabelProxies", () => $r(e)), n(" normalize.run", () => Tn(e)), n(" parentDummyChains", () => lr(e)), n(" addBorderSegments", () => Ln(e)), n(" order", () => fr(e)), n(" insertSelfEdges", () => Zr(e)), n(" adjustCoordinateSystem", () => Pn(e)), n(" position", () => Cr(e)), n(" positionSelfEdges", () => Kr(e)), n(" removeBorderNodes", () => Hr(e)), n(" normalize.undo", () => Mn(e)), n(" fixupEdgeLabelCoords", () => Xr(e)), n(" undoCoordinateSystem", () => Cn(e)), n(" translateGraph", () => Wr(e)), n(" assignNodeIntersects", () => zr(e)), n(" reversePoints", () => Ur(e)), n(" acyclic.undo", () => yn(e));
1156
+ function Mr(e, n) {
1157
+ n(" makeSpaceForEdgeLabels", () => $r(e)), n(" removeSelfEdges", () => Qr(e)), n(" acyclic", () => kn(e)), n(" nestingGraph.run", () => Hn(e)), n(" rank", () => Xn(be(e))), n(" injectEdgeLabelProxies", () => Wr(e)), n(" removeEmptyRanks", () => Nn(e)), n(" nestingGraph.cleanup", () => Kn(e)), n(" normalizeRanks", () => Ln(e)), n(" assignRankMinMax", () => Xr(e)), n(" removeEdgeLabelProxies", () => zr(e)), n(" normalize.run", () => Sn(e)), n(" parentDummyChains", () => pr(e)), n(" addBorderSegments", () => _n(e)), n(" order", () => hr(e)), n(" insertSelfEdges", () => et(e)), n(" adjustCoordinateSystem", () => Rn(e)), n(" position", () => Tr(e)), n(" positionSelfEdges", () => nt(e)), n(" removeBorderNodes", () => Kr(e)), n(" normalize.undo", () => Fn(e)), n(" fixupEdgeLabelCoords", () => Jr(e)), n(" undoCoordinateSystem", () => Tn(e)), n(" translateGraph", () => Ur(e)), n(" assignNodeIntersects", () => Hr(e)), n(" reversePoints", () => Zr(e)), n(" acyclic.undo", () => En(e));
1155
1158
  }
1156
- function Tr(e, n) {
1159
+ function Sr(e, n) {
1157
1160
  f(e.nodes(), function(r) {
1158
1161
  var t = e.node(r), a = n.node(r);
1159
1162
  t && (t.x = a.x, t.y = a.y, n.children(r).length && (t.width = a.width, t.height = a.height));
@@ -1162,59 +1165,59 @@ function Tr(e, n) {
1162
1165
  t.points = a.points, Object.prototype.hasOwnProperty.call(a, "x") && (t.x = a.x, t.y = a.y);
1163
1166
  }), e.graph().width = n.graph().width, e.graph().height = n.graph().height;
1164
1167
  }
1165
- var Ir = ["nodesep", "edgesep", "ranksep", "marginx", "marginy"], Mr = { ranksep: 50, edgesep: 20, nodesep: 50, rankdir: "tb" }, jr = ["acyclicer", "ranker", "rankdir", "align"], Sr = ["width", "height"], Fr = { width: 0, height: 0 }, Vr = ["minlen", "weight", "width", "height", "labeloffset"], Br = {
1168
+ var jr = ["nodesep", "edgesep", "ranksep", "marginx", "marginy"], Fr = { ranksep: 50, edgesep: 20, nodesep: 50, rankdir: "tb" }, Vr = ["acyclicer", "ranker", "rankdir", "align"], Ar = ["width", "height"], Br = { width: 0, height: 0 }, Gr = ["minlen", "weight", "width", "height", "labeloffset"], Yr = {
1166
1169
  minlen: 1,
1167
1170
  weight: 1,
1168
1171
  width: 0,
1169
1172
  height: 0,
1170
1173
  labeloffset: 10,
1171
1174
  labelpos: "r"
1172
- }, Ar = ["labelpos"];
1173
- function Yr(e) {
1175
+ }, Dr = ["labelpos"];
1176
+ function qr(e) {
1174
1177
  var n = new g({ multigraph: !0, compound: !0 }), r = D(e.graph());
1175
1178
  return n.setGraph(
1176
- $({}, Mr, G(r, Ir), I(r, jr))
1179
+ $({}, Fr, Y(r, jr), I(r, Vr))
1177
1180
  ), f(e.nodes(), function(t) {
1178
1181
  var a = D(e.node(t));
1179
- n.setNode(t, Be(G(a, Sr), Fr)), n.setParent(t, e.parent(t));
1182
+ n.setNode(t, Be(Y(a, Ar), Br)), n.setParent(t, e.parent(t));
1180
1183
  }), f(e.edges(), function(t) {
1181
1184
  var a = D(e.edge(t));
1182
1185
  n.setEdge(
1183
1186
  t,
1184
- $({}, Br, G(a, Vr), I(a, Ar))
1187
+ $({}, Yr, Y(a, Gr), I(a, Dr))
1185
1188
  );
1186
1189
  }), n;
1187
1190
  }
1188
- function Gr(e) {
1191
+ function $r(e) {
1189
1192
  var n = e.graph();
1190
1193
  n.ranksep /= 2, f(e.edges(), function(r) {
1191
1194
  var t = e.edge(r);
1192
1195
  t.minlen *= 2, t.labelpos.toLowerCase() !== "c" && (n.rankdir === "TB" || n.rankdir === "BT" ? t.width += t.labeloffset : t.height += t.labeloffset);
1193
1196
  });
1194
1197
  }
1195
- function Dr(e) {
1198
+ function Wr(e) {
1196
1199
  f(e.edges(), function(n) {
1197
1200
  var r = e.edge(n);
1198
1201
  if (r.width && r.height) {
1199
1202
  var t = e.node(n.v), a = e.node(n.w), i = { rank: (a.rank - t.rank) / 2 + t.rank, e: n };
1200
- N(e, "edge-proxy", i, "_ep");
1203
+ L(e, "edge-proxy", i, "_ep");
1201
1204
  }
1202
1205
  });
1203
1206
  }
1204
- function qr(e) {
1207
+ function Xr(e) {
1205
1208
  var n = 0;
1206
1209
  f(e.nodes(), function(r) {
1207
1210
  var t = e.node(r);
1208
1211
  t.borderTop && (t.minRank = e.node(t.borderTop).rank, t.maxRank = e.node(t.borderBottom).rank, n = y(n, t.maxRank));
1209
1212
  }), e.graph().maxRank = n;
1210
1213
  }
1211
- function $r(e) {
1214
+ function zr(e) {
1212
1215
  f(e.nodes(), function(n) {
1213
1216
  var r = e.node(n);
1214
1217
  r.dummy === "edge-proxy" && (e.edge(r.e).labelRank = r.rank, e.removeNode(n));
1215
1218
  });
1216
1219
  }
1217
- function Wr(e) {
1220
+ function Ur(e) {
1218
1221
  var n = Number.POSITIVE_INFINITY, r = 0, t = Number.POSITIVE_INFINITY, a = 0, i = e.graph(), o = i.marginx || 0, u = i.marginy || 0;
1219
1222
  function d(s) {
1220
1223
  var c = s.x, l = s.y, h = s.width, v = s.height;
@@ -1235,13 +1238,13 @@ function Wr(e) {
1235
1238
  }), Object.prototype.hasOwnProperty.call(c, "x") && (c.x -= n), Object.prototype.hasOwnProperty.call(c, "y") && (c.y -= t);
1236
1239
  }), i.width = r - n + o, i.height = a - t + u;
1237
1240
  }
1238
- function zr(e) {
1241
+ function Hr(e) {
1239
1242
  f(e.edges(), function(n) {
1240
1243
  var r = e.edge(n), t = e.node(n.v), a = e.node(n.w), i, o;
1241
1244
  r.points ? (i = r.points[0], o = r.points[r.points.length - 1]) : (r.points = [], i = a, o = t), r.points.unshift(re(t, i)), r.points.push(re(a, o));
1242
1245
  });
1243
1246
  }
1244
- function Xr(e) {
1247
+ function Jr(e) {
1245
1248
  f(e.edges(), function(n) {
1246
1249
  var r = e.edge(n);
1247
1250
  if (Object.prototype.hasOwnProperty.call(r, "x"))
@@ -1255,13 +1258,13 @@ function Xr(e) {
1255
1258
  }
1256
1259
  });
1257
1260
  }
1258
- function Ur(e) {
1261
+ function Zr(e) {
1259
1262
  f(e.edges(), function(n) {
1260
1263
  var r = e.edge(n);
1261
1264
  r.reversed && r.points.reverse();
1262
1265
  });
1263
1266
  }
1264
- function Hr(e) {
1267
+ function Kr(e) {
1265
1268
  f(e.nodes(), function(n) {
1266
1269
  if (e.children(n).length) {
1267
1270
  var r = e.node(n), t = e.node(r.borderTop), a = e.node(r.borderBottom), i = e.node(T(r.borderLeft)), o = e.node(T(r.borderRight));
@@ -1271,7 +1274,7 @@ function Hr(e) {
1271
1274
  e.node(n).dummy === "border" && e.removeNode(n);
1272
1275
  });
1273
1276
  }
1274
- function Jr(e) {
1277
+ function Qr(e) {
1275
1278
  f(e.edges(), function(n) {
1276
1279
  if (n.v === n.w) {
1277
1280
  var r = e.node(n.v);
@@ -1279,14 +1282,14 @@ function Jr(e) {
1279
1282
  }
1280
1283
  });
1281
1284
  }
1282
- function Zr(e) {
1283
- var n = S(e);
1285
+ function et(e) {
1286
+ var n = j(e);
1284
1287
  f(n, function(r) {
1285
1288
  var t = 0;
1286
1289
  f(r, function(a, i) {
1287
1290
  var o = e.node(a);
1288
1291
  o.order = i + t, f(o.selfEdges, function(u) {
1289
- N(
1292
+ L(
1290
1293
  e,
1291
1294
  "selfedge",
1292
1295
  {
@@ -1303,7 +1306,7 @@ function Zr(e) {
1303
1306
  });
1304
1307
  });
1305
1308
  }
1306
- function Kr(e) {
1309
+ function nt(e) {
1307
1310
  f(e.nodes(), function(n) {
1308
1311
  var r = e.node(n);
1309
1312
  if (r.dummy === "selfedge") {
@@ -1318,8 +1321,8 @@ function Kr(e) {
1318
1321
  }
1319
1322
  });
1320
1323
  }
1321
- function G(e, n) {
1322
- return j(I(e, n), Number);
1324
+ function Y(e, n) {
1325
+ return S(I(e, n), Number);
1323
1326
  }
1324
1327
  function D(e) {
1325
1328
  var n = {};
@@ -1328,5 +1331,5 @@ function D(e) {
1328
1331
  }), n;
1329
1332
  }
1330
1333
  export {
1331
- at as l
1334
+ ot as l
1332
1335
  };