@antv/layout 1.2.0 → 1.2.2

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 (142) hide show
  1. package/dist/0229766b7896aada2515.worker.js +2 -0
  2. package/dist/0229766b7896aada2515.worker.js.map +1 -0
  3. package/dist/index.min.js +1 -1
  4. package/dist/index.min.js.map +1 -1
  5. package/lib/bundle-entry.d.ts +18 -0
  6. package/lib/bundle-entry.js +19 -0
  7. package/lib/bundle-entry.js.map +1 -0
  8. package/lib/bundle-supervisor.d.ts +51 -0
  9. package/lib/bundle-supervisor.js +93 -0
  10. package/lib/bundle-supervisor.js.map +1 -0
  11. package/lib/bundle-worker.d.ts +3 -0
  12. package/lib/bundle-worker.js +53 -0
  13. package/lib/bundle-worker.js.map +1 -0
  14. package/lib/circular.js +258 -0
  15. package/lib/circular.js.map +1 -0
  16. package/lib/concentric.js +221 -0
  17. package/lib/concentric.js.map +1 -0
  18. package/lib/d3Force/forceInBox.js +331 -0
  19. package/lib/d3Force/forceInBox.js.map +1 -0
  20. package/lib/d3Force/index.js +339 -0
  21. package/lib/d3Force/index.js.map +1 -0
  22. package/lib/dagre/acyclic.js +62 -0
  23. package/lib/dagre/acyclic.js.map +1 -0
  24. package/lib/dagre/add-border-segments.js +37 -0
  25. package/lib/dagre/add-border-segments.js.map +1 -0
  26. package/lib/dagre/coordinate-system.js +65 -0
  27. package/lib/dagre/coordinate-system.js.map +1 -0
  28. package/lib/dagre/data/list.js +50 -0
  29. package/lib/dagre/data/list.js.map +1 -0
  30. package/lib/dagre/greedy-fas.js +147 -0
  31. package/lib/dagre/greedy-fas.js.map +1 -0
  32. package/lib/dagre/layout.js +468 -0
  33. package/lib/dagre/layout.js.map +1 -0
  34. package/lib/dagre/nesting-graph.js +153 -0
  35. package/lib/dagre/nesting-graph.js.map +1 -0
  36. package/lib/dagre/normalize.js +98 -0
  37. package/lib/dagre/normalize.js.map +1 -0
  38. package/lib/dagre/order/add-subgraph-constraints.js +41 -0
  39. package/lib/dagre/order/add-subgraph-constraints.js.map +1 -0
  40. package/lib/dagre/order/barycenter.js +23 -0
  41. package/lib/dagre/order/barycenter.js.map +1 -0
  42. package/lib/dagre/order/build-layer-graph.js +96 -0
  43. package/lib/dagre/order/build-layer-graph.js.map +1 -0
  44. package/lib/dagre/order/cross-count.js +63 -0
  45. package/lib/dagre/order/cross-count.js.map +1 -0
  46. package/lib/dagre/order/index.js +91 -0
  47. package/lib/dagre/order/index.js.map +1 -0
  48. package/lib/dagre/order/init-data-order.js +28 -0
  49. package/lib/dagre/order/init-data-order.js.map +1 -0
  50. package/lib/dagre/order/init-order.js +50 -0
  51. package/lib/dagre/order/init-order.js.map +1 -0
  52. package/lib/dagre/order/resolve-conflicts.js +121 -0
  53. package/lib/dagre/order/resolve-conflicts.js.map +1 -0
  54. package/lib/dagre/order/sort-subgraph.js +84 -0
  55. package/lib/dagre/order/sort-subgraph.js.map +1 -0
  56. package/lib/dagre/order/sort.js +74 -0
  57. package/lib/dagre/order/sort.js.map +1 -0
  58. package/lib/dagre/parent-dummy-chains.js +80 -0
  59. package/lib/dagre/parent-dummy-chains.js.map +1 -0
  60. package/lib/dagre/position/bk.js +398 -0
  61. package/lib/dagre/position/bk.js.map +1 -0
  62. package/lib/dagre/position/index.js +54 -0
  63. package/lib/dagre/position/index.js.map +1 -0
  64. package/lib/dagre/rank/feasible-tree.js +164 -0
  65. package/lib/dagre/rank/feasible-tree.js.map +1 -0
  66. package/lib/dagre/rank/index.js +48 -0
  67. package/lib/dagre/rank/index.js.map +1 -0
  68. package/lib/dagre/rank/network-simplex.js +232 -0
  69. package/lib/dagre/rank/network-simplex.js.map +1 -0
  70. package/lib/dagre/rank/util.js +138 -0
  71. package/lib/dagre/rank/util.js.map +1 -0
  72. package/lib/dagre/util.js +289 -0
  73. package/lib/dagre/util.js.map +1 -0
  74. package/lib/dagre.d.ts +1 -2
  75. package/lib/dagre.js +543 -0
  76. package/lib/dagre.js.map +1 -0
  77. package/lib/force/forceNBody.js +103 -0
  78. package/lib/force/forceNBody.js.map +1 -0
  79. package/lib/force/index.js +797 -0
  80. package/lib/force/index.js.map +1 -0
  81. package/lib/force/types.js +2 -0
  82. package/lib/force/types.js.map +1 -0
  83. package/lib/forceAtlas2/body.js +91 -0
  84. package/lib/forceAtlas2/body.js.map +1 -0
  85. package/lib/forceAtlas2/index.js +562 -0
  86. package/lib/forceAtlas2/index.js.map +1 -0
  87. package/lib/forceAtlas2/quad.js +98 -0
  88. package/lib/forceAtlas2/quad.js.map +1 -0
  89. package/lib/forceAtlas2/quadTree.js +105 -0
  90. package/lib/forceAtlas2/quadTree.js.map +1 -0
  91. package/lib/fruchterman.js +376 -0
  92. package/lib/fruchterman.js.map +1 -0
  93. package/lib/grid.js +308 -0
  94. package/lib/grid.js.map +1 -0
  95. package/lib/index.js +16 -0
  96. package/lib/index.js.map +1 -0
  97. package/lib/mds.js +137 -0
  98. package/lib/mds.js.map +1 -0
  99. package/lib/radial/index.js +355 -0
  100. package/lib/radial/index.js.map +1 -0
  101. package/lib/radial/mds.js +29 -0
  102. package/lib/radial/mds.js.map +1 -0
  103. package/lib/radial/radial-nonoverlap-force.js +100 -0
  104. package/lib/radial/radial-nonoverlap-force.js.map +1 -0
  105. package/lib/random.js +98 -0
  106. package/lib/random.js.map +1 -0
  107. package/lib/registry.d.ts +0 -1
  108. package/lib/registry.js +25 -0
  109. package/lib/registry.js.map +1 -0
  110. package/lib/supervisor.js +86 -0
  111. package/lib/supervisor.js.map +1 -0
  112. package/lib/types.js +4 -0
  113. package/lib/types.js.map +1 -0
  114. package/lib/util/array.js +2 -0
  115. package/lib/util/array.js.map +1 -0
  116. package/lib/util/common.d.ts +12 -0
  117. package/lib/util/common.js +32 -0
  118. package/lib/util/common.js.map +1 -0
  119. package/lib/util/function.js +124 -0
  120. package/lib/util/function.js.map +1 -0
  121. package/lib/util/gpu.js +214 -0
  122. package/lib/util/gpu.js.map +1 -0
  123. package/lib/util/index.js +7 -0
  124. package/lib/util/index.js.map +1 -0
  125. package/lib/util/math.js +228 -0
  126. package/lib/util/math.js.map +1 -0
  127. package/lib/util/number.js +5 -0
  128. package/lib/util/number.js.map +1 -0
  129. package/lib/util/object.js +42 -0
  130. package/lib/util/object.js.map +1 -0
  131. package/lib/util/string.js +15 -0
  132. package/lib/util/string.js.map +1 -0
  133. package/lib/worker.d.ts +1 -3
  134. package/lib/worker.js +45 -0
  135. package/lib/worker.js.map +1 -0
  136. package/package.json +6 -5
  137. package/dist/5e37927bd3e57252658c.worker.js +0 -2
  138. package/dist/5e37927bd3e57252658c.worker.js.map +0 -1
  139. package/esm/5e37927bd3e57252658c.worker.js +0 -2
  140. package/esm/5e37927bd3e57252658c.worker.js.map +0 -1
  141. package/esm/index.esm.js +0 -2
  142. package/esm/index.esm.js.map +0 -1
package/esm/index.esm.js.map DELETED
@@ -1 +0,0 @@
1
- {"version":3,"sources":["webpack://@antv/layout/../node_modules/.pnpm/eventemitter3@4.0.0/node_modules/eventemitter3/index.js","webpack://@antv/layout/./src/worker.ts","webpack://@antv/layout/../node_modules/.pnpm/workerize-loader@2.0.2_webpack@5.38.1/node_modules/workerize-loader/dist/rpc-wrapper.js","webpack://@antv/layout/webpack/bootstrap","webpack://@antv/layout/webpack/runtime/compat get default export","webpack://@antv/layout/webpack/runtime/define property getters","webpack://@antv/layout/webpack/runtime/hasOwnProperty shorthand","webpack://@antv/layout/../node_modules/.pnpm/tslib@2.5.0/node_modules/tslib/tslib.es6.js","webpack://@antv/layout/./src/util/string.ts","webpack://@antv/layout/./src/util/array.ts","webpack://@antv/layout/./src/util/number.ts","webpack://@antv/layout/../node_modules/.pnpm/@antv+util@3.3.2/node_modules/@antv/util/esm/lodash/is-type.js","webpack://@antv/layout/../node_modules/.pnpm/@antv+util@3.3.2/node_modules/@antv/util/esm/lodash/is-number.js","webpack://@antv/layout/./src/util/math.ts","webpack://@antv/layout/./src/util/object.ts","webpack://@antv/layout/../node_modules/.pnpm/@antv+util@3.3.2/node_modules/@antv/util/esm/lodash/is-function.js","webpack://@antv/layout/../node_modules/.pnpm/@antv+util@3.3.2/node_modules/@antv/util/esm/lodash/is-object.js","webpack://@antv/layout/./src/util/function.ts","webpack://@antv/layout/./src/util/common.ts","webpack://@antv/layout/./src/circular.ts","webpack://@antv/layout/./src/supervisor.ts","webpack://@antv/layout/../node_modules/.pnpm/@antv+util@3.3.2/node_modules/@antv/util/esm/lodash/is-string.js","webpack://@antv/layout/./src/concentric.ts","webpack://@antv/layout/../node_modules/.pnpm/d3-quadtree@3.0.1/node_modules/d3-quadtree/src/add.js","webpack://@antv/layout/../node_modules/.pnpm/d3-quadtree@3.0.1/node_modules/d3-quadtree/src/quad.js","webpack://@antv/layout/../node_modules/.pnpm/d3-quadtree@3.0.1/node_modules/d3-quadtree/src/x.js","webpack://@antv/layout/../node_modules/.pnpm/d3-quadtree@3.0.1/node_modules/d3-quadtree/src/y.js","webpack://@antv/layout/../node_modules/.pnpm/d3-quadtree@3.0.1/node_modules/d3-quadtree/src/quadtree.js","webpack://@antv/layout/../node_modules/.pnpm/d3-force@3.0.0/node_modules/d3-force/src/constant.js","webpack://@antv/layout/../node_modules/.pnpm/d3-force@3.0.0/node_modules/d3-force/src/jiggle.js","webpack://@antv/layout/../node_modules/.pnpm/d3-quadtree@3.0.1/node_modules/d3-quadtree/src/cover.js","webpack://@antv/layout/../node_modules/.pnpm/d3-quadtree@3.0.1/node_modules/d3-quadtree/src/data.js","webpack://@antv/layout/../node_modules/.pnpm/d3-quadtree@3.0.1/node_modules/d3-quadtree/src/extent.js","webpack://@antv/layout/../node_modules/.pnpm/d3-quadtree@3.0.1/node_modules/d3-quadtree/src/find.js","webpack://@antv/layout/../node_modules/.pnpm/d3-quadtree@3.0.1/node_modules/d3-quadtree/src/remove.js","webpack://@antv/layout/../node_modules/.pnpm/d3-quadtree@3.0.1/node_modules/d3-quadtree/src/root.js","webpack://@antv/layout/../node_modules/.pnpm/d3-quadtree@3.0.1/node_modules/d3-quadtree/src/size.js","webpack://@antv/layout/../node_modules/.pnpm/d3-quadtree@3.0.1/node_modules/d3-quadtree/src/visit.js","webpack://@antv/layout/../node_modules/.pnpm/d3-quadtree@3.0.1/node_modules/d3-quadtree/src/visitAfter.js","webpack://@antv/layout/../node_modules/.pnpm/d3-dispatch@3.0.1/node_modules/d3-dispatch/src/dispatch.js","webpack://@antv/layout/../node_modules/.pnpm/d3-timer@3.0.1/node_modules/d3-timer/src/timer.js","webpack://@antv/layout/../node_modules/.pnpm/d3-force@3.0.0/node_modules/d3-force/src/lcg.js","webpack://@antv/layout/../node_modules/.pnpm/d3-force@3.0.0/node_modules/d3-force/src/simulation.js","webpack://@antv/layout/../node_modules/.pnpm/d3-force@3.0.0/node_modules/d3-force/src/manyBody.js","webpack://@antv/layout/../node_modules/.pnpm/d3-force@3.0.0/node_modules/d3-force/src/link.js","webpack://@antv/layout/../node_modules/.pnpm/d3-force@3.0.0/node_modules/d3-force/src/collide.js","webpack://@antv/layout/../node_modules/.pnpm/d3-force@3.0.0/node_modules/d3-force/src/x.js","webpack://@antv/layout/../node_modules/.pnpm/d3-force@3.0.0/node_modules/d3-force/src/y.js","webpack://@antv/layout/./src/d3Force/forceInBox.ts","webpack://@antv/layout/./src/d3Force/index.ts","webpack://@antv/layout/../node_modules/.pnpm/d3-force@3.0.0/node_modules/d3-force/src/center.js","webpack://@antv/layout/../node_modules/.pnpm/@antv+event-emitter@0.1.3/node_modules/@antv/event-emitter/esm/index.js","webpack://@antv/layout/../node_modules/.pnpm/@antv+graphlib@2.0.0/node_modules/@antv/graphlib/esm/utils/traverse.js","webpack://@antv/layout/../node_modules/.pnpm/@antv+graphlib@2.0.0/node_modules/@antv/graphlib/esm/graph.js","webpack://@antv/layout/./src/dagre/data/list.ts","webpack://@antv/layout/./src/dagre/greedy-fas.ts","webpack://@antv/layout/./src/dagre/acyclic.ts","webpack://@antv/layout/./src/dagre/util.ts","webpack://@antv/layout/./src/dagre/normalize.ts","webpack://@antv/layout/./src/dagre/rank/util.ts","webpack://@antv/layout/./src/dagre/rank/feasible-tree.ts","webpack://@antv/layout/./src/dagre/rank/network-simplex.ts","webpack://@antv/layout/./src/dagre/rank/index.ts","webpack://@antv/layout/./src/dagre/nesting-graph.ts","webpack://@antv/layout/./src/dagre/add-border-segments.ts","webpack://@antv/layout/./src/dagre/coordinate-system.ts","webpack://@antv/layout/./src/dagre/order/init-order.ts","webpack://@antv/layout/./src/dagre/order/cross-count.ts","webpack://@antv/layout/./src/dagre/order/resolve-conflicts.ts","webpack://@antv/layout/./src/dagre/order/sort.ts","webpack://@antv/layout/./src/dagre/order/sort-subgraph.ts","webpack://@antv/layout/./src/dagre/order/barycenter.ts","webpack://@antv/layout/../node_modules/.pnpm/@antv+util@3.3.2/node_modules/@antv/util/esm/lodash/clone.js","webpack://@antv/layout/../node_modules/.pnpm/@antv+util@3.3.2/node_modules/@antv/util/esm/lodash/is-array.js","webpack://@antv/layout/./src/dagre/order/index.ts","webpack://@antv/layout/./src/dagre/order/build-layer-graph.ts","webpack://@antv/layout/./src/dagre/order/add-subgraph-constraints.ts","webpack://@antv/layout/./src/dagre/position/bk.ts","webpack://@antv/layout/./src/dagre/position/index.ts","webpack://@antv/layout/./src/dagre/layout.ts","webpack://@antv/layout/./src/dagre/parent-dummy-chains.ts","webpack://@antv/layout/./src/dagre/order/init-data-order.ts","webpack://@antv/layout/./src/dagre.ts","webpack://@antv/layout/../node_modules/.pnpm/@antv+util@3.3.2/node_modules/@antv/util/esm/lodash/is-nil.js","webpack://@antv/layout/../node_modules/.pnpm/d3-octree@1.0.2/node_modules/d3-octree/src/add.js","webpack://@antv/layout/../node_modules/.pnpm/d3-octree@1.0.2/node_modules/d3-octree/src/octant.js","webpack://@antv/layout/../node_modules/.pnpm/d3-octree@1.0.2/node_modules/d3-octree/src/x.js","webpack://@antv/layout/../node_modules/.pnpm/d3-octree@1.0.2/node_modules/d3-octree/src/y.js","webpack://@antv/layout/../node_modules/.pnpm/d3-octree@1.0.2/node_modules/d3-octree/src/z.js","webpack://@antv/layout/../node_modules/.pnpm/d3-octree@1.0.2/node_modules/d3-octree/src/octree.js","webpack://@antv/layout/./src/force/forceNBody.ts","webpack://@antv/layout/../node_modules/.pnpm/d3-octree@1.0.2/node_modules/d3-octree/src/cover.js","webpack://@antv/layout/../node_modules/.pnpm/d3-octree@1.0.2/node_modules/d3-octree/src/data.js","webpack://@antv/layout/../node_modules/.pnpm/d3-octree@1.0.2/node_modules/d3-octree/src/extent.js","webpack://@antv/layout/../node_modules/.pnpm/d3-octree@1.0.2/node_modules/d3-octree/src/find.js","webpack://@antv/layout/../node_modules/.pnpm/d3-octree@1.0.2/node_modules/d3-octree/src/remove.js","webpack://@antv/layout/../node_modules/.pnpm/d3-octree@1.0.2/node_modules/d3-octree/src/root.js","webpack://@antv/layout/../node_modules/.pnpm/d3-octree@1.0.2/node_modules/d3-octree/src/size.js","webpack://@antv/layout/../node_modules/.pnpm/d3-octree@1.0.2/node_modules/d3-octree/src/visit.js","webpack://@antv/layout/../node_modules/.pnpm/d3-octree@1.0.2/node_modules/d3-octree/src/visitAfter.js","webpack://@antv/layout/./src/force/index.ts","webpack://@antv/layout/./src/forceAtlas2/body.ts","webpack://@antv/layout/./src/forceAtlas2/quad.ts","webpack://@antv/layout/./src/forceAtlas2/quadTree.ts","webpack://@antv/layout/./src/forceAtlas2/index.ts","webpack://@antv/layout/./src/fruchterman.ts","webpack://@antv/layout/./src/grid.ts","webpack://@antv/layout/../node_modules/.pnpm/is-any-array@2.0.1/node_modules/is-any-array/lib-esm/index.js","webpack://@antv/layout/../node_modules/.pnpm/ml-array-rescale@1.3.7/node_modules/ml-array-rescale/lib-es6/index.js","webpack://@antv/layout/../node_modules/.pnpm/ml-array-min@1.2.3/node_modules/ml-array-min/lib-es6/index.js","webpack://@antv/layout/../node_modules/.pnpm/ml-array-max@1.2.4/node_modules/ml-array-max/lib-es6/index.js","webpack://@antv/layout/../node_modules/.pnpm/ml-matrix@6.10.4/node_modules/ml-matrix/src/inspect.js","webpack://@antv/layout/../node_modules/.pnpm/ml-matrix@6.10.4/node_modules/ml-matrix/src/util.js","webpack://@antv/layout/../node_modules/.pnpm/ml-matrix@6.10.4/node_modules/ml-matrix/src/matrix.js","webpack://@antv/layout/../node_modules/.pnpm/ml-matrix@6.10.4/node_modules/ml-matrix/src/stat.js","webpack://@antv/layout/../node_modules/.pnpm/ml-matrix@6.10.4/node_modules/ml-matrix/src/mathOperations.js","webpack://@antv/layout/../node_modules/.pnpm/ml-matrix@6.10.4/node_modules/ml-matrix/src/wrap/WrapperMatrix2D.js","webpack://@antv/layout/../node_modules/.pnpm/ml-matrix@6.10.4/node_modules/ml-matrix/src/dc/util.js","webpack://@antv/layout/../node_modules/.pnpm/ml-matrix@6.10.4/node_modules/ml-matrix/src/dc/svd.js","webpack://@antv/layout/./src/mds.ts","webpack://@antv/layout/./src/radial/radial-nonoverlap-force.ts","webpack://@antv/layout/./src/radial/index.ts","webpack://@antv/layout/./src/radial/mds.ts","webpack://@antv/layout/./src/random.ts","webpack://@antv/layout/./src/registry.ts","webpack://@antv/layout/./src/types.ts"],"names":["has","Object","prototype","hasOwnProperty","prefix","Events","EE","fn","context","once","this","addListener","emitter","event","TypeError","listener","evt","_events","push","_eventsCount","clearEvent","EventEmitter","create","__proto__","eventNames","events","name","names","call","slice","getOwnPropertySymbols","concat","listeners","handlers","i","l","length","ee","Array","listenerCount","emit","a1","a2","a3","a4","a5","args","len","arguments","removeListener","undefined","apply","j","on","removeAllListeners","off","prefixed","module","exports","addMethods","methods","w","Worker","URL","createObjectURL","Blob","revokeObjectURL","worker","c","callbacks","addEventListener","e","d","data","type","id","f","error","assign","Error","message","result","document","createEvent","initEvent","method","params","dispatchEvent","forEach","_arguments","Promise","a","b","postMessage","__webpack_module_cache__","__webpack_require__","moduleId","cachedModule","__webpack_modules__","n","getter","__esModule","definition","key","o","defineProperty","enumerable","get","obj","prop","extendStatics","setPrototypeOf","p","__extends","String","__","constructor","__assign","t","s","__rest","indexOf","propertyIsEnumerable","__awaiter","thisArg","P","generator","resolve","reject","fulfilled","value","step","next","rejected","done","then","__generator","body","y","g","_","label","sent","trys","ops","verb","Symbol","iterator","v","op","pop","__read","m","r","ar","__spreadArray","to","from","pack","cache","camelizeRE","camelize","str","replace","toUpperCase","isArray","toNumber","val","parseFloat","isNaN","toString","floydWarshall","adjMatrix","dist","size","Infinity","k","getAdjMatrix","directed","nodes","edges","matrix","nodeMap","node","source","target","sIndex","tIndex","scaleMatrix","ratio","row","newRow","traverseUp","children","traverseTreeUp","getLayoutBBox","minX","minY","maxX","maxY","halfSize","left","x","right","top","bottom","getAvgNodePosition","totalNodes","getCoreNode","find","edge","getRelativeNodeIds","coreNode","relativeNodes","filter","map","set","Set","getCoreNodeAndRelativeLeafNodes","nodeClusterBy","degreesMap","inDegree","outDegree","relativeLeafNodes","nodeId","in","out","sameTypeLeafNodes","typeName","sameTypeNodes","item","getSameTypeNodes","getEuclideanDistance","p1","p2","Math","sqrt","clone","Date","getTime","keys","cloneFormatData","initRange","cloned","random","formatNumberFn","defaultValue","formatSizeFn","resultIsNumber","max","width","height","formatNodeSize","nodeSize","nodeSpacing","nodeSpacingFunc","bboxSize","dataSize","handleSingleNodeGraph","graph","center","getAllNodes","getAllEdges","mergeNodeData","DEFAULTS_LAYOUT_OPTIONS","radius","startRadius","endRadius","startAngle","endAngle","PI","clockwise","divisions","ordering","angleRatio","options","execute","genericCircularLayout","mergedOptions","paramNodeSpacing","paramNodeSize","calculateCenter","calculatedWidth","calculatedHeight","calculatedCenter","angleStep","nSize","min","astep","layoutNodes","topologyOrdering","orderedNodes","sort","nodeA","nodeB","getDegree","degreeOrdering","divN","ceil","angle","floor","cos","sin","orderedCNodes","pickFlags","areNeighbors","getSuccessors","getNeighbors","foundChild","child","ii","window","innerWidth","innerHeight","layout","spawnWorker","terminate","running","rest","payload","iterations","arraybufferWithNodesEdges","Float32Array","calculateLayout","stop","stopLayout","kill","isRunning","preventOverlap","sweep","equidistant","maxLevelDiff","sortBy","genericConcentricLayout","propsCenter","propsWidth","propsHeight","propsSortBy","propsMaxLevelDiff","propsSweep","maxNodeSpacing","maxNodeSize","cnode","nodeIdxMap","n1","n2","maxValueNode","currentLevel","levels","diff","abs","minDist","firstLvlHasMulti","maxR","rStep","level","dTheta","dcos","dsin","rMin","rDelta","rr","theta","tree","parent","xm","ym","xp","yp","_root","leaf","x0","_x0","y0","_y0","x1","_x1","y1","_y1","_x","_y","defaultX","defaultY","quadtree","Quadtree","NaN","addAll","leaf_copy","copy","treeProto","add","cover","xz","yz","z","visit","extent","x2","y2","q","x3","y3","quads","dx","dy","d2","remove","retainer","previous","removeAll","root","callback","visitAfter","noop","dispatch","test","Dispatch","typename","types","T","trim","split","that","taskHead","taskTail","timeout","interval","pokeDelay","clockLast","clockNow","clockSkew","clock","performance","now","setFrame","requestAnimationFrame","bind","setTimeout","clearNow","Timer","_call","_time","_next","timer","delay","time","restart","wake","timerFlush","t0","t2","t1","sleep","nap","poke","clearTimeout","clearInterval","setInterval","initialRadius","initialAngle","simulation","alpha","alphaMin","alphaDecay","pow","alphaTarget","velocityDecay","forces","Map","stepper","lcg","tick","force","fx","vx","fy","vy","initializeNodes","index","initializeForce","initialize","randomSource","delete","closest","strengths","strength","constant","distanceMin2","distanceMax2","theta2","accumulate","quad","weight","jiggle","_nodes","_random","distanceMin","distanceMax","nodeById","links","distances","count","bias","link","distance","initializeStrength","initializeDistance","radii","xi","yi","ri","ri2","prepare","rj","forceInBox","templateForce","groupBy","cluster","forceNodeSize","forceCharge","forceLinkDistance","forceLinkStrength","offset","nodesMap","centerX","centerY","foci","none","templateNodes","template","enableGrouping","getFocisFromTemplate","gnodes","glinks","dNodes","clustersCounts","clustersLinks","net","sumforceNodeSize","tmpCount","computeClustersNodeCounts","dClusterLinks","clusterLinks","sourceID","targetID","entries","computeClustersLinkCounts","sourceTerminal","targetTerminal","initializeWithForce","genNodesMap","getFocis","linkDistance","forceSimulation","collideStrength","clustering","clusterNodeStrength","clusterEdgeStrength","clusterEdgeDistance","clusterFociStrength","clusterNodeSize","genericForceLayout","formatOutNodes","lastLayoutNodes","formatOutEdges","lastLayoutEdges","lastAssign","lastGraph","layoutEdges","nodeStrength","edgeStrength","onTick","clusterForce","edgeForce","overlapProcess","outNodes","outEdges","nodeForce","sx","sy","console","warn","nodeSizeFunc","others","_this","_i","wildcardEvents","doEmit","es","_a","splice","length_1","getEvents","doBFS","queue","visited","navigator","shift","doDFS","Graph","edgeMap","inEdgesMap","outEdgesMap","bothEdgesMap","treeIndices","changes","batchCount","onChanged","super","addNodes","addEdges","addTree","batch","commit","reduceChanges","mergedChanges","change","isNewlyAdded","pastChange","sameId","existingChange","propertyName","newValue","treeKey","newParentId","checkNodeExistence","getNode","hasNode","firstNodeId","secondNodeId","some","neighbor","getRelatedEdges","direction","inEdges","bothEdges","targets","getPredecessors","sources","predecessors","successors","doAddNode","childrenMap","addNode","doRemoveNode","doRemoveEdge","parentMap","removeNodes","idList","removeNode","updateNodeDataProperty","oldValue","patch","updateNodeData","update","checkEdgeExistence","hasEdge","getEdge","getEdgeDetail","doAddEdge","bothEdgesOfSource","bothEdgesOfTarget","addEdge","removeEdges","removeEdge","updateEdgeSource","oldSource","newSource","updateEdgeTarget","oldTarget","newTarget","updateEdgeDataProperty","updateEdgeData","mergeEdgeData","checkTreeExistence","hasTreeStructure","attachTreeStructure","detachTreeStructure","stack","setParent","getRoots","getParent","getChildren","getAncestors","ancestors","current","oldParent","newParent","oldParentId","dfsTree","bfsTree","values","bfs","both","dfs","newNodes","oldNode","newEdges","oldEdge","newGraph","oldParentMap","oldChildrenMap","toJSON","JSON","stringify","filterOutLinks","unlink","entry","prev","shortcut","dequeue","enqueue","strs","sentinel","curr","join","DEFAULT_WEIGHT_FN","buckets","zeroIdx","collectPredecessors","results","uEntry","assignBucket","wEntry","run","acyclicer","fas","weightFn","state","fasGraph","maxIn","maxOut","rangeMax","buildState","sinks","doGreedyFAS","flat","greedyFAS","dfsFAS","forwardName","reversed","addDummyNode","dummy","asNonCompoundGraph","simplified","intersectRect","rect","point","Number","h","layeringNodes","rankMax","maxRank","rank","va","vb","valueA","order","valueB","addBorderNode","minBy","array","func","reduce","postorder","includes","isDirected","DUMMY_NODE_EDGE_LABEL","longestPath","minlen","slack","tightTree","edgeV","tightTreeWithLayer","layer","findMinSlackEdge","shiftRanks","delta","tn","initCutValues","vs","assignCutValue","cutvalue","calcCutValue","childIsTail","graphEdge","cutValue","isOutEdge","other","pointsToHead","otherWeight","isTreeEdge","otherCutValue","initLowLimValues","dfsAssignLowLim","nextLim","low","useNextLim","lim","leaveEdge","enterEdge","vLabel","wLabel","tailLabel","flip","candidates","isDescendant","exchangeEdges","existed","updateRanks","flipped","u","rootLabel","longestPathRanker","networkSimplexRanker","og","simplify","start","feasibleTree","networkSimplex","nodeSep","depths","borderTop","borderBottom","childNode","childTop","childBottom","thisWeight","nestingEdge","sg","sgNode","borderType","swapWidthHeight","swapWidthHeightOne","reverseYOne","swapXYOne","initOrder","simpleNodes","nodeRanks","layers","orderedVs","fixOrderNodes","fixorder","twoLayerCrossCount","northLayer","southLayer","southPos","zipObject","unflat","unsort","pos","southEntries","firstIndex","treeSize","fill","cc","weightSum","crossCount","layering","mergeEntries","sum","barycenter","merged","cg","mappedEntries","indegree","tmp","entryV","entryW","sourceSet","reverse","vEntry","filtered","picked","doResolveConflicts","consumeUnsortable","unsortable","last","iindex","sortSubgraph","biasRight","usePrev","keepNodeOrder","movable","bl","borderLeft","br","borderRight","subgraphs","barycenters","inV","nodeU","subgraphResult","mergeBarycenters","expandSubgraphs","parts","collection","lhs","rhs","hasFixOrder","partition","sortable","vsIndex","compareWithBias","blPred","brPred","vss","rst","buildLayerGraphs","ranks","createRootNode","minRank","buildLayerGraph","sweepLayerGraphs","layerGraphs","lg","sorted","lnode","rootPrev","prevChild","addSubgraphConstraints","assignOrder","findType2Conflicts","conflicts","scan","south","southEnd","prevNorthBorder","nextNorthBorder","uNode","addConflict","scanIfNeeded","scanCache","cacheKey","getScannedKey","north","nextNorthPos","prevNorthPos","scanned","southLookahead","findOtherInnerSegmentNode","vv","ww","conflictsV","hasConflict","buildBlockGraph","nodesep","edgesep","reverseSep","blockGraph","sepFn","sep","vRoot","uRoot","edgeSep","labelpos","toLowerCase","position","ng","ranksep","prevY","heights","maxHeight","positionY","xs","graphAlign","prevLayer","k0","scanPos","prevLayerLength","lastNode","k1","scanNode","uLabel","uPos","findType1Conflicts","xss","adjustedLayering","vert","horiz","inner","neighborFn","align","prevIdx","ws","mp","il","verticalAlignment","blockG","iterate","setXsFunc","nextNodesFunc","elem","acc","POSITIVE_INFINITY","horizontalCompaction","xsKey","smallestWidth","NEGATIVE_INFINITY","halfWidth","findSmallestWidthAlignment","alignTo","alignToVals","alignToMin","alignToMax","alignment","xsVals","alignCoordinates","ul","balance","runLayout","ranker","rankdir","nodeOrder","removeSelfEdges","depth","treeDepths","maxDepth","sumWeights","nestingRoot","nodeRankFactor","forwardVisited","dfsForward","nextRank","currRank","longestPathWithLayer","tightTreeRanker","injectEdgeLabelProxies","removeEmptyRanks","cleanup","normalizeRanks","assignRankMinMax","removeEdgeLabelProxies","dummyChains","vRank","wRank","labelRank","nodeData","points","originalEdge","normalizeEdge","postorderNums","dfsBothOrder","startV","pathData","lca","vPath","wPath","path","findPath","pathIdx","pathV","ascending","parentDummyChains","addBorderSegments","initDataOrder","mxRank","range1","range2","downLayerGraphs","upLayerGraphs","best","bestCC","lastBest","insertSelfEdges","rd","adjust","positionSelfEdges","removeBorderNodes","currentV","fixupEdgeLabelCoords","reverseY","swapXY","translateGraph","assignNodeIntersects","reversePointsForReversedEdges","undo","nodeNumAttrs","nodeDefaults","edgeNumAttrs","edgeDefaults","labeloffset","edgeAttrs","marginx","marginX","marginy","marginY","getExtremes","attrs","nodeV","nodeW","unshift","selfEdges","orderShift","selfEdge","selfNode","selectNumberAttrs","pickedProperties","canonicalize","newAttrs","edgeLabelSpace","controlPoints","radial","focusNode","layoutNode","genericDagreLayout","ranksepFunc","nodesepFunc","begin","ranksepfunc","nodesepfunc","horisep","vertisep","verti","currG","prevG","prevGraph","prevNode","_order","layoutGraph","inputGraph","defaultNode","defaultAttrs","buildLayoutGraph","makeSpaceForEdgeLabels","inputLabel","layoutLabel","_rank","updateInputGraph","layoutTopLeft","isHorizontal","layerCoordSort","point1","point2","ps","getControlPoints","sourceNode","targetNode","layerCoordsArr","isDifferentLayer","filterControlPointsOutOfBoundary","sourceX","sourceY","targetX","targetY","sourceLayer","sourceNextLayerCoord","firstControlPoint","insertStartControlPoint","targetLayer","layerDiff","targetLastLayerCoord","lastControlPoints","insertEndControlPoint","zm","zp","deep","z0","_z0","z1","_z1","_z","defaultZ","octree","Octree","treeNode","accWeight","accX","accY","accZ","numChildren","Float64Array","zz","z2","z3","octs","dz","arg1","arg2","arg3","dimensions","len2","len3","param","vz","maxIteration","gravity","factor","coulombDisScale","damping","maxSpeed","minMovement","distanceThresholdMode","timeInterval","judgingDistance","lastResult","lastOptions","runOneStep","lastCalcGraph","lastVelMap","updatePosition","formattedOptions","formatOptions","getMass","mass","velMap","calcGraph","formatCentripetal","iter","massWeight","degree","sameTypeLeafMap","centripetalOptions","leafCluster","calcNodes","basicCentripetal","single","clusters","getSameTypeLeafMap","siblingLeaves","sameTypeLeaves","centerPos","accMap","calcEdges","monitor","calRepulsive","calAttractive","calGravity","updateVelocity","energy","calTotalEnergy","speed2","coulombDisScale2","weightParam","calcNode","computeForce","forceNBody","vecX","vecY","vecZ","vecLength","direX","direY","direZ","sourceMassRatio","targetMassRatio","disX","disY","disZ","getCenter","defaultGravity","forceCenter","centriCenter","centerStrength","centriX","centriY","centriZ","singleStrength","leafStrength","othersStrength","vLength","param2","fz","distX","distY","distZ","distanceMagnitude","getCoreNodeAndSiblingLeaves","rx","ry","distanceTo","bo","hypot","setPos","resetForce","addForce","F","contains","nenwMass","Body","xmid","ymid","massCenter","getLength","halfLen","NW","Quad","NE","SW","SE","insert","_isExternal","QuadTree","_putBody","updateForce","kr","kg","mode","dissuadeHubs","ks","ksmax","tao","genericForceAtlas2Layout","prune","sizes","getSizes","sourceDegree","targetDegree","postOptions","barnesHut","nodeNum","iteration","preForces","bodies","oneStep","preventOverlapIters","krPrime","getAttrForces","getOptRepGraForces","getRepGraForces","updatePos","dir","eucliDis","fa1","fa2","log","minx","maxx","miny","maxy","quadTree","fg","nodei","degreei","nodej","degreej","fr","swgns","trans","swgG","traG","usingSg","minus","minusNorm","addNorm","preSG","sn","absForce","dnx","dny","speed","clusterGravity","genericFruchtermanLayout","lastClusterMap","clusterMap","clusterValue","cx","cy","propsClusterGravity","area","maxDisplace","k2","displacements","applyCalculate","distLength","gravityForce","limitedDist","vid","uid","lengthSqr","common","dispX","dispY","dispZ","preventOverlapPadding","condense","rows","cols","genericGridLayout","propsRows","propsCols","localeCompare","cells","rcs","splits","round","sm","small","large","cellWidth","cellHeight","nodeH","oNode","res","cellUsed","rc","col","id2manPos","rcPos","used","use","getPos","usedRows","usedCols","moveToNextCell","isAnyArray","tag","endsWith","rescale","input","output","currentMin","_options$fromIndex","fromIndex","_options$toIndex","toIndex","isInteger","minValue","currentMax","maxValue","RangeError","_options$min","autoMinMax","_options$max","indent","repeat","indentData","inspectMatrixWithOptions","maxRows","maxColumns","maxNumSize","padMinus","columns","maxI","maxJ","loop","line","formatNumber","inspectData","num","formatNumber2","padEnd","fix","toFixed","startsWith","exp","toExponential","checkRowIndex","outer","checkColumnIndex","checkRowVector","vector","to1DArray","checkColumnVector","checkRange","startRow","endRow","startColumn","endColumn","checkNumber","newArray","checkNonEmpty","isEmpty","AbstractMatrix","static","newRows","newColumns","newData","newMatrix","Matrix","column","zeros","matrix1","matrix2","checkMatrix","isMatrix","klass","to2DArray","isRowVector","isColumnVector","isVector","isSquare","isSymmetric","isEchelonForm","previousColumn","checked","isReducedEchelonForm","echelonForm","iMax","swapRows","reducedEchelonForm","maxRow","pivot","setSubMatrix","neg","mulS","getRow","getRowVector","rowVector","setRow","row1","row2","temp","getColumn","getColumnVector","columnVector","setColumn","swapColumns","column1","column2","addRowVector","subRowVector","mulRowVector","divRowVector","addColumnVector","subColumnVector","mulColumnVector","divColumnVector","mulRow","mulColumn","by","maxIndex","idx","minIndex","maxRowIndex","minRow","minRowIndex","maxColumn","maxColumnIndex","minColumn","minColumnIndex","diag","norm","cumulativeSum","dot","vector2","vector1","mmul","Bcolj","strassen2x2","a11","b11","a12","b12","a21","b21","a22","b22","m1","m2","m3","m4","m5","c00","c01","c10","c11","strassen3x3","a00","a01","a02","a10","a20","b00","b01","b02","b10","b20","m6","m7","m8","m9","m12","m13","m14","m15","m16","m17","m18","c02","c12","c20","c21","c22","mmulStrassen","r1","c1","r2","c2","embed","mat","resultat","blockMult","halfRows","parseInt","halfCols","subMatrix","sub","scaleRows","isFinite","scaleColumns","flipRows","middle","first","flipColumns","kroneckerProduct","kroneckerSum","AxI","eye","IxB","transpose","sortRows","compareFunction","compareNumbers","sortColumns","subMatrixRow","indices","subMatrixColumn","selection","rowIndices","columnIndices","checkRowIndices","checkColumnIndices","rowIndex","columnIndex","trace","sumByRow","sumByColumn","sumAll","product","productByRow","productByColumn","productAll","mean","variance","unbiased","sum1","sum2","varianceByRow","varianceByColumn","varianceAll","standardDeviation","centerByRow","centerByColumn","centerAll","scale","getScaleByRow","scaleByRow","getScaleByColumn","scaleByColumn","divider","getScaleAll","scaleAll","for","rand","randomInt","randInt","diagonal","identity","negate","tensorProduct","nRows","nColumns","arrayData","every","element","removeRow","addRow","removeColumn","addColumn","addS","addM","subS","subM","subtract","subtractS","subtractM","mul","mulM","multiply","multiplyS","multiplyM","div","divS","divM","divide","divideS","divideM","mod","modS","modM","modulus","modulusS","modulusM","and","andS","andM","or","orS","orM","xor","xorS","xorM","leftShift","leftShiftS","leftShiftM","signPropagatingRightShift","signPropagatingRightShiftS","signPropagatingRightShiftM","rightShift","rightShiftS","rightShiftM","zeroFillRightShift","zeroFillRightShiftS","zeroFillRightShiftM","not","acos","acosh","asin","asinh","atan","atanh","cbrt","clz32","cosh","expm1","fround","log1p","log10","log2","sign","sinh","tan","tanh","trunc","arg0","powS","powM","installMathOperations","WrapperMatrix2D","hypotenuse","SingularValueDecomposition","computeLeftSingularVectors","computeRightSingularVectors","autoTranspose","wantu","Boolean","wantv","swapped","aux","nu","ni","U","V","work","si","nct","nrt","mrc","pp","eps","EPSILON","kase","MIN_VALUE","cs","sp","spm1","epm1","sk","ek","solve","Y","threshold","scols","Ls","rightSingularVectors","VL","vrows","urows","VLU","solveForDiagonal","inverse","vcols","X","ucols","condition","norm2","tol","leftSingularVectors","diagonalMatrix","genericMDSLayout","handleInfinity","scaledD","positions","runMDS","maxDistance","M","rowMeans","colMeans","totalMean","ret","eigenValues","getRepulsion","disp","vecx","vecy","updatePositions","strictRadial","focusIdx","maxDisp","di","vpx","vpy","diLength","tdispLength","nfDis","unitRadius","maxPreventOverlapIteration","sortStrength","genericRadialLayout","propsFocusNode","propsUnitRadius","focusIndex","getIndexById","maxToFocus","focusNodeD","semiWidth","semiHeight","maxRadius","maxD","idealDistances","eIdealDisMatrix","weights","getWeightMatrix","mdsResult","dimension","mds","nonoverlapForceParams","radialNonoverlapForce","oneIteration","vparam","originDis","reciODis","xMolecule","yMolecule","denominator","edis","reciEdis","idealDis","reciR","iValue","jValue","charCodeAt","genericRandomLayout","registry","circular","CircularLayout","concentric","ConcentricLayout","MDSLayout","RandomLayout","grid","GridLayout","RadialLayout","ForceLayout","d3force","D3ForceLayout","fruchterman","FruchtermanLayout","forceAtlas2","ForceAtlas2Layout","dagre","DagreLayout","registerLayout","isLayoutWithIterations"],"mappings":"eAEA,IAAIA,EAAMC,OAAOC,UAAUC,eACvBC,EAAS,IASb,SAASC,IAAU,CA4BnB,SAASC,EAAGC,EAAIC,EAASC,GACvBC,KAAKH,GAAKA,EACVG,KAAKF,QAAUA,EACfE,KAAKD,KAAOA,IAAQ,CACtB,CAaA,SAASE,EAAYC,EAASC,EAAON,EAAIC,EAASC,GAChD,GAAkB,mBAAPF,EACT,MAAM,IAAIO,UAAU,mCAGtB,IAAIC,EAAW,IAAIT,EAAGC,EAAIC,GAAWI,EAASH,GAC1CO,EAAMZ,EAASA,EAASS,EAAQA,EAMpC,OAJKD,EAAQK,QAAQD,GACXJ,EAAQK,QAAQD,GAAKT,GAC1BK,EAAQK,QAAQD,GAAO,CAACJ,EAAQK,QAAQD,GAAMD,GADhBH,EAAQK,QAAQD,GAAKE,KAAKH,IADlCH,EAAQK,QAAQD,GAAOD,EAAUH,EAAQO,gBAI7DP,CACT,CASA,SAASQ,EAAWR,EAASI,GACI,KAAzBJ,EAAQO,aAAoBP,EAAQK,QAAU,IAAIZ,SAC5CO,EAAQK,QAAQD,EAC9B,CASA,SAASK,IACPX,KAAKO,QAAU,IAAIZ,EACnBK,KAAKS,aAAe,CACtB,CAzEIlB,OAAOqB,SACTjB,EAAOH,UAAYD,OAAOqB,OAAO,OAM5B,IAAIjB,GAASkB,YAAWnB,GAAS,IA2ExCiB,EAAanB,UAAUsB,WAAa,WAClC,IACIC,EACAC,EAFAC,EAAQ,GAIZ,GAA0B,IAAtBjB,KAAKS,aAAoB,OAAOQ,EAEpC,IAAKD,KAASD,EAASf,KAAKO,QACtBjB,EAAI4B,KAAKH,EAAQC,IAAOC,EAAMT,KAAKd,EAASsB,EAAKG,MAAM,GAAKH,GAGlE,OAAIzB,OAAO6B,sBACFH,EAAMI,OAAO9B,OAAO6B,sBAAsBL,IAG5CE,CACT,EASAN,EAAanB,UAAU8B,UAAY,SAAmBnB,GACpD,IAAIG,EAAMZ,EAASA,EAASS,EAAQA,EAChCoB,EAAWvB,KAAKO,QAAQD,GAE5B,IAAKiB,EAAU,MAAO,GACtB,GAAIA,EAAS1B,GAAI,MAAO,CAAC0B,EAAS1B,IAElC,IAAK,IAAI2B,EAAI,EAAGC,EAAIF,EAASG,OAAQC,EAAK,IAAIC,MAAMH,GAAID,EAAIC,EAAGD,IAC7DG,EAAGH,GAAKD,EAASC,GAAG3B,GAGtB,OAAO8B,CACT,EASAhB,EAAanB,UAAUqC,cAAgB,SAAuB1B,GAC5D,IAAIG,EAAMZ,EAASA,EAASS,EAAQA,EAChCmB,EAAYtB,KAAKO,QAAQD,GAE7B,OAAKgB,EACDA,EAAUzB,GAAW,EAClByB,EAAUI,OAFM,CAGzB,EASAf,EAAanB,UAAUsC,KAAO,SAAc3B,EAAO4B,EAAIC,EAAIC,EAAIC,EAAIC,GACjE,IAAI7B,EAAMZ,EAASA,EAASS,EAAQA,EAEpC,IAAKH,KAAKO,QAAQD,GAAM,OAAO,EAE/B,IAEI8B,EACAZ,EAHAF,EAAYtB,KAAKO,QAAQD,GACzB+B,EAAMC,UAAUZ,OAIpB,GAAIJ,EAAUzB,GAAI,CAGhB,OAFIyB,EAAUvB,MAAMC,KAAKuC,eAAepC,EAAOmB,EAAUzB,QAAI2C,GAAW,GAEhEH,GACN,KAAK,EAAG,OAAOf,EAAUzB,GAAGqB,KAAKI,EAAUxB,UAAU,EACrD,KAAK,EAAG,OAAOwB,EAAUzB,GAAGqB,KAAKI,EAAUxB,QAASiC,IAAK,EACzD,KAAK,EAAG,OAAOT,EAAUzB,GAAGqB,KAAKI,EAAUxB,QAASiC,EAAIC,IAAK,EAC7D,KAAK,EAAG,OAAOV,EAAUzB,GAAGqB,KAAKI,EAAUxB,QAASiC,EAAIC,EAAIC,IAAK,EACjE,KAAK,EAAG,OAAOX,EAAUzB,GAAGqB,KAAKI,EAAUxB,QAASiC,EAAIC,EAAIC,EAAIC,IAAK,EACrE,KAAK,EAAG,OAAOZ,EAAUzB,GAAGqB,KAAKI,EAAUxB,QAASiC,EAAIC,EAAIC,EAAIC,EAAIC,IAAK,EAG3E,IAAKX,EAAI,EAAGY,EAAO,IAAIR,MAAMS,EAAK,GAAIb,EAAIa,EAAKb,IAC7CY,EAAKZ,EAAI,GAAKc,UAAUd,GAG1BF,EAAUzB,GAAG4C,MAAMnB,EAAUxB,QAASsC,EACxC,KAAO,CACL,IACIM,EADAhB,EAASJ,EAAUI,OAGvB,IAAKF,EAAI,EAAGA,EAAIE,EAAQF,IAGtB,OAFIF,EAAUE,GAAGzB,MAAMC,KAAKuC,eAAepC,EAAOmB,EAAUE,GAAG3B,QAAI2C,GAAW,GAEtEH,GACN,KAAK,EAAGf,EAAUE,GAAG3B,GAAGqB,KAAKI,EAAUE,GAAG1B,SAAU,MACpD,KAAK,EAAGwB,EAAUE,GAAG3B,GAAGqB,KAAKI,EAAUE,GAAG1B,QAASiC,GAAK,MACxD,KAAK,EAAGT,EAAUE,GAAG3B,GAAGqB,KAAKI,EAAUE,GAAG1B,QAASiC,EAAIC,GAAK,MAC5D,KAAK,EAAGV,EAAUE,GAAG3B,GAAGqB,KAAKI,EAAUE,GAAG1B,QAASiC,EAAIC,EAAIC,GAAK,MAChE,QACE,IAAKG,EAAM,IAAKM,EAAI,EAAGN,EAAO,IAAIR,MAAMS,EAAK,GAAIK,EAAIL,EAAKK,IACxDN,EAAKM,EAAI,GAAKJ,UAAUI,GAG1BpB,EAAUE,GAAG3B,GAAG4C,MAAMnB,EAAUE,GAAG1B,QAASsC,GAGpD,CAEA,OAAO,CACT,EAWAzB,EAAanB,UAAUmD,GAAK,SAAYxC,EAAON,EAAIC,GACjD,OAAOG,EAAYD,KAAMG,EAAON,EAAIC,GAAS,EAC/C,EAWAa,EAAanB,UAAUO,KAAO,SAAcI,EAAON,EAAIC,GACrD,OAAOG,EAAYD,KAAMG,EAAON,EAAIC,GAAS,EAC/C,EAYAa,EAAanB,UAAU+C,eAAiB,SAAwBpC,EAAON,EAAIC,EAASC,GAClF,IAAIO,EAAMZ,EAASA,EAASS,EAAQA,EAEpC,IAAKH,KAAKO,QAAQD,GAAM,OAAON,KAC/B,IAAKH,EAEH,OADAa,EAAWV,KAAMM,GACVN,KAGT,IAAIsB,EAAYtB,KAAKO,QAAQD,GAE7B,GAAIgB,EAAUzB,GAEVyB,EAAUzB,KAAOA,GACfE,IAAQuB,EAAUvB,MAClBD,GAAWwB,EAAUxB,UAAYA,GAEnCY,EAAWV,KAAMM,OAEd,CACL,IAAK,IAAIkB,EAAI,EAAGT,EAAS,GAAIW,EAASJ,EAAUI,OAAQF,EAAIE,EAAQF,KAEhEF,EAAUE,GAAG3B,KAAOA,GACnBE,IAASuB,EAAUE,GAAGzB,MACtBD,GAAWwB,EAAUE,GAAG1B,UAAYA,IAErCiB,EAAOP,KAAKc,EAAUE,IAOtBT,EAAOW,OAAQ1B,KAAKO,QAAQD,GAAyB,IAAlBS,EAAOW,OAAeX,EAAO,GAAKA,EACpEL,EAAWV,KAAMM,EACxB,CAEA,OAAON,IACT,EASAW,EAAanB,UAAUoD,mBAAqB,SAA4BzC,GACtE,IAAIG,EAUJ,OARIH,GACFG,EAAMZ,EAASA,EAASS,EAAQA,EAC5BH,KAAKO,QAAQD,IAAMI,EAAWV,KAAMM,KAExCN,KAAKO,QAAU,IAAIZ,EACnBK,KAAKS,aAAe,GAGfT,IACT,EAKAW,EAAanB,UAAUqD,IAAMlC,EAAanB,UAAU+C,eACpD5B,EAAanB,UAAUS,YAAcU,EAAanB,UAAUmD,GAK5DhC,EAAamC,SAAWpD,EAKxBiB,EAAaA,aAAeA,EAM1BoC,EAAOC,QAAUrC,C,gBC7Uf,IAAIsC,EAAa,EAAQ,KACrBC,EAAU,CAAC,aAAa,mBAC5BH,EAAOC,QAAU,WAChB,IAAIG,EAAI,IAAIC,OAAOC,IAAIC,gBAAgB,IAAIC,KAAK,CAAC,2j1KAAyn3K,CAAEvC,KAAM,yBAIlr3K,OAHAqC,IAAIG,gBAAgBH,IAAIC,gBAAgB,IAAIC,KAAK,CAAC,4j1KAClDN,EAAWE,EAAGD,GAEPC,CACR,C,UCkCJJ,EAAOC,QA3CP,SAAoBS,EAAQP,GAC1B,IAAIQ,EAAI,EACJC,EAAY,CAAC,EACjBF,EAAOG,iBAAiB,WAAW,SAAUC,GAC3C,IAAIC,EAAID,EAAEE,KACV,GAAe,QAAXD,EAAEE,KAEN,GAAIF,EAAEG,GAAI,CACR,IAAIC,EAAIP,EAAUG,EAAEG,IAEhBC,WACKP,EAAUG,EAAEG,IAEfH,EAAEK,MACJD,EAAE,GAAG3E,OAAO6E,OAAOC,MAAMP,EAAEK,MAAMG,SAAUR,EAAEK,QAE7CD,EAAE,GAAGJ,EAAES,QAGb,KAAO,CACL,IAAIjE,EAAMkE,SAASC,YAAY,SAC/BnE,EAAIoE,UAAUZ,EAAEa,QAAQ,GAAO,GAC/BrE,EAAIyD,KAAOD,EAAEc,OACbnB,EAAOoB,cAAcvE,EACvB,CACF,IACA4C,EAAQ4B,SAAQ,SAAUH,GACxBlB,EAAOkB,GAAU,WACf,IAAII,EAAazC,UACjB,OAAO,IAAI0C,SAAQ,SAAUC,EAAGC,GAC9B,IAAIjB,IAAOP,EACXC,EAAUM,GAAM,CAACgB,EAAGC,GACpBzB,EAAO0B,YAAY,CACjBnB,KAAM,MACNC,GAAIA,EACJU,OAAQA,EACRC,OAAQ,GAAGzD,MAAMD,KAAK6D,IAE1B,GACF,CACF,GACF,C,GCxCIK,EAA2B,CAAC,EAGhC,SAASC,EAAoBC,GAE5B,IAAIC,EAAeH,EAAyBE,GAC5C,QAAqB9C,IAAjB+C,EACH,OAAOA,EAAavC,QAGrB,IAAID,EAASqC,EAAyBE,GAAY,CAGjDtC,QAAS,CAAC,GAOX,OAHAwC,EAAoBF,GAAUvC,EAAQA,EAAOC,QAASqC,GAG/CtC,EAAOC,OACf,CCrBAqC,EAAoBI,EAAK1C,IACxB,IAAI2C,EAAS3C,GAAUA,EAAO4C,WAC7B,IAAO5C,EAAiB,QACxB,IAAM,EAEP,OADAsC,EAAoBvB,EAAE4B,EAAQ,CAAET,EAAGS,IAC5BA,CAAM,ECLdL,EAAoBvB,EAAI,CAACd,EAAS4C,KACjC,IAAI,IAAIC,KAAOD,EACXP,EAAoBS,EAAEF,EAAYC,KAASR,EAAoBS,EAAE9C,EAAS6C,IAC5EtG,OAAOwG,eAAe/C,EAAS6C,EAAK,CAAEG,YAAY,EAAMC,IAAKL,EAAWC,IAE1E,ECNDR,EAAoBS,EAAI,CAACI,EAAKC,IAAU5G,OAAOC,UAAUC,eAAeyB,KAAKgF,EAAKC,G,2TCgBlF,IAAIC,EAAgB,SAAStC,EAAGoB,GAI5B,OAHAkB,EAAgB7G,OAAO8G,gBAClB,CAAExF,UAAW,cAAgBe,OAAS,SAAUkC,EAAGoB,GAAKpB,EAAEjD,UAAYqE,CAAG,GAC1E,SAAUpB,EAAGoB,GAAK,IAAK,IAAIoB,KAAKpB,EAAO3F,OAAOC,UAAUC,eAAeyB,KAAKgE,EAAGoB,KAAIxC,EAAEwC,GAAKpB,EAAEoB,GAAI,EAC7FF,EAActC,EAAGoB,EAC5B,EAEO,SAASqB,EAAUzC,EAAGoB,GACzB,GAAiB,mBAANA,GAA0B,OAANA,EAC3B,MAAM,IAAI9E,UAAU,uBAAyBoG,OAAOtB,GAAK,iCAE7D,SAASuB,IAAOzG,KAAK0G,YAAc5C,CAAG,CADtCsC,EAActC,EAAGoB,GAEjBpB,EAAEtE,UAAkB,OAAN0F,EAAa3F,OAAOqB,OAAOsE,IAAMuB,EAAGjH,UAAY0F,EAAE1F,UAAW,IAAIiH,EACnF,CAEO,IAAIE,EAAW,WAQlB,OAPAA,EAAWpH,OAAO6E,QAAU,SAAkBwC,GAC1C,IAAK,IAAIC,EAAGrF,EAAI,EAAGiE,EAAInD,UAAUZ,OAAQF,EAAIiE,EAAGjE,IAE5C,IAAK,IAAI8E,KADTO,EAAIvE,UAAUd,GACOjC,OAAOC,UAAUC,eAAeyB,KAAK2F,EAAGP,KAAIM,EAAEN,GAAKO,EAAEP,IAE9E,OAAOM,CACX,EACOD,EAASlE,MAAMzC,KAAMsC,UAChC,EAEO,SAASwE,EAAOD,EAAGhD,GACtB,IAAI+C,EAAI,CAAC,EACT,IAAK,IAAIN,KAAKO,EAAOtH,OAAOC,UAAUC,eAAeyB,KAAK2F,EAAGP,IAAMzC,EAAEkD,QAAQT,GAAK,IAC9EM,EAAEN,GAAKO,EAAEP,IACb,GAAS,MAALO,GAAqD,mBAAjCtH,OAAO6B,sBACtB,KAAII,EAAI,EAAb,IAAgB8E,EAAI/G,OAAO6B,sBAAsByF,GAAIrF,EAAI8E,EAAE5E,OAAQF,IAC3DqC,EAAEkD,QAAQT,EAAE9E,IAAM,GAAKjC,OAAOC,UAAUwH,qBAAqB9F,KAAK2F,EAAGP,EAAE9E,MACvEoF,EAAEN,EAAE9E,IAAMqF,EAAEP,EAAE9E,IAF4B,CAItD,OAAOoF,CACX,CA8DO,SAASK,EAAUC,EAASnC,EAAYoC,EAAGC,GAE9C,OAAO,IAAKD,IAAMA,EAAInC,WAAU,SAAUqC,EAASC,GAC/C,SAASC,EAAUC,GAAS,IAAMC,EAAKL,EAAUM,KAAKF,GAAS,CAAE,MAAO3D,GAAKyD,EAAOzD,EAAI,CAAE,CAC1F,SAAS8D,EAASH,GAAS,IAAMC,EAAKL,EAAiB,MAAEI,GAAS,CAAE,MAAO3D,GAAKyD,EAAOzD,EAAI,CAAE,CAC7F,SAAS4D,EAAKlD,GAJlB,IAAeiD,EAIajD,EAAOqD,KAAOP,EAAQ9C,EAAOiD,QAJ1CA,EAIyDjD,EAAOiD,MAJhDA,aAAiBL,EAAIK,EAAQ,IAAIL,GAAE,SAAUE,GAAWA,EAAQG,EAAQ,KAIjBK,KAAKN,EAAWI,EAAW,CAC7GF,GAAML,EAAYA,EAAU3E,MAAMyE,EAASnC,GAAc,KAAK2C,OAClE,GACJ,CAEO,SAASI,EAAYZ,EAASa,GACjC,IAAsG7D,EAAG8D,EAAGpB,EAAGqB,EAA3GC,EAAI,CAAEC,MAAO,EAAGC,KAAM,WAAa,GAAW,EAAPxB,EAAE,GAAQ,MAAMA,EAAE,GAAI,OAAOA,EAAE,EAAI,EAAGyB,KAAM,GAAIC,IAAK,IAChG,OAAOL,EAAI,CAAEP,KAAMa,EAAK,GAAI,MAASA,EAAK,GAAI,OAAUA,EAAK,IAAwB,mBAAXC,SAA0BP,EAAEO,OAAOC,UAAY,WAAa,OAAOzI,IAAM,GAAIiI,EACvJ,SAASM,EAAK9C,GAAK,OAAO,SAAUiD,GAAK,OACzC,SAAcC,GACV,GAAIzE,EAAG,MAAM,IAAI9D,UAAU,mCAC3B,KAAO6H,IAAMA,EAAI,EAAGU,EAAG,KAAOT,EAAI,IAAKA,OACnC,GAAIhE,EAAI,EAAG8D,IAAMpB,EAAY,EAAR+B,EAAG,GAASX,EAAU,OAAIW,EAAG,GAAKX,EAAS,SAAOpB,EAAIoB,EAAU,SAAMpB,EAAE1F,KAAK8G,GAAI,GAAKA,EAAEN,SAAWd,EAAIA,EAAE1F,KAAK8G,EAAGW,EAAG,KAAKf,KAAM,OAAOhB,EAE3J,OADIoB,EAAI,EAAGpB,IAAG+B,EAAK,CAAS,EAARA,EAAG,GAAQ/B,EAAEY,QACzBmB,EAAG,IACP,KAAK,EAAG,KAAK,EAAG/B,EAAI+B,EAAI,MACxB,KAAK,EAAc,OAAXT,EAAEC,QAAgB,CAAEX,MAAOmB,EAAG,GAAIf,MAAM,GAChD,KAAK,EAAGM,EAAEC,QAASH,EAAIW,EAAG,GAAIA,EAAK,CAAC,GAAI,SACxC,KAAK,EAAGA,EAAKT,EAAEI,IAAIM,MAAOV,EAAEG,KAAKO,MAAO,SACxC,QACI,MAAkBhC,GAAZA,EAAIsB,EAAEG,MAAY3G,OAAS,GAAKkF,EAAEA,EAAElF,OAAS,KAAkB,IAAViH,EAAG,IAAsB,IAAVA,EAAG,IAAW,CAAET,EAAI,EAAG,QAAU,CAC3G,GAAc,IAAVS,EAAG,MAAc/B,GAAM+B,EAAG,GAAK/B,EAAE,IAAM+B,EAAG,GAAK/B,EAAE,IAAM,CAAEsB,EAAEC,MAAQQ,EAAG,GAAI,KAAO,CACrF,GAAc,IAAVA,EAAG,IAAYT,EAAEC,MAAQvB,EAAE,GAAI,CAAEsB,EAAEC,MAAQvB,EAAE,GAAIA,EAAI+B,EAAI,KAAO,CACpE,GAAI/B,GAAKsB,EAAEC,MAAQvB,EAAE,GAAI,CAAEsB,EAAEC,MAAQvB,EAAE,GAAIsB,EAAEI,IAAI9H,KAAKmI,GAAK,KAAO,CAC9D/B,EAAE,IAAIsB,EAAEI,IAAIM,MAChBV,EAAEG,KAAKO,MAAO,SAEtBD,EAAKZ,EAAK7G,KAAKgG,EAASgB,EAC5B,CAAE,MAAOrE,GAAK8E,EAAK,CAAC,EAAG9E,GAAImE,EAAI,CAAG,CAAE,QAAU9D,EAAI0C,EAAI,CAAG,CACzD,GAAY,EAAR+B,EAAG,GAAQ,MAAMA,EAAG,GAAI,MAAO,CAAEnB,MAAOmB,EAAG,GAAKA,EAAG,QAAK,EAAQf,MAAM,EAC9E,CAtBgDH,CAAK,CAAChC,EAAGiD,GAAK,CAAG,CAuBrE,CA8BO,SAASG,EAAO/C,EAAGL,GACtB,IAAIqD,EAAsB,mBAAXN,QAAyB1C,EAAE0C,OAAOC,UACjD,IAAKK,EAAG,OAAOhD,EACf,IAAmBiD,EAAYlF,EAA3BrC,EAAIsH,EAAE5H,KAAK4E,GAAOkD,EAAK,GAC3B,IACI,WAAc,IAANvD,GAAgBA,KAAM,MAAQsD,EAAIvH,EAAEkG,QAAQE,MAAMoB,EAAGxI,KAAKuI,EAAEvB,MACxE,CACA,MAAOrD,GAASN,EAAI,CAAEM,MAAOA,EAAS,CACtC,QACI,IACQ4E,IAAMA,EAAEnB,OAASkB,EAAItH,EAAU,SAAIsH,EAAE5H,KAAKM,EAClD,CACA,QAAU,GAAIqC,EAAG,MAAMA,EAAEM,KAAO,CACpC,CACA,OAAO6E,CACX,CAkBO,SAASC,EAAcC,EAAIC,EAAMC,GACpC,GAAIA,GAA6B,IAArB9G,UAAUZ,OAAc,IAAK,IAA4BsH,EAAxBxH,EAAI,EAAGC,EAAI0H,EAAKzH,OAAYF,EAAIC,EAAGD,KACxEwH,GAAQxH,KAAK2H,IACRH,IAAIA,EAAKpH,MAAMpC,UAAU2B,MAAMD,KAAKiI,EAAM,EAAG3H,IAClDwH,EAAGxH,GAAK2H,EAAK3H,IAGrB,OAAO0H,EAAG7H,OAAO2H,GAAMpH,MAAMpC,UAAU2B,MAAMD,KAAKiI,GACtD,CArE6B5J,OAAOqB,OA0GXrB,OAAOqB,OClQhC,IAAgEf,EACxDwJ,EAOFC,EAAa,SACNC,GATmD1J,EASpB,SAAC2J,GAC3C,OAAOA,EAAIC,QAAQH,GAAY,SAACpB,EAAGxE,GAAM,OAACA,EAAIA,EAAEgG,cAAgB,EAAvB,GAC3C,EAVQL,EAAgC9J,OAAOqB,OAAO,MAC7C,SAAE4I,GAEP,OADYH,EAAMG,KACHH,EAAMG,GAAO3J,EAAG2J,GAChC,GCLUG,EAAU/H,MAAM+H,QCAhBC,EAAW,SAACC,GACvB,IAAMpE,EAAIqE,WAAWD,GACrB,OAAOE,MAAMtE,GAAKoE,EAAMpE,CAC1B,ECHI,EAAW,CAAC,EAAEuE,SAElB,QADa,SAAUxC,EAAOxD,GAAQ,OAAO,EAAS9C,KAAKsG,KAAW,WAAaxD,EAAO,GAAK,ECO/F,EAHe,SAAUwD,GACrB,OAAO,EAAOA,EAAO,SACzB,ECHO,IAAMyC,EAAgB,SAACC,GAI5B,IAFA,IAAMC,EAAiB,GACjBC,EAAOF,EAAUxI,OACdF,EAAI,EAAGA,EAAI4I,EAAM5I,GAAK,EAAG,CAChC2I,EAAK3I,GAAK,GACV,IAAK,IAAIkB,EAAI,EAAGA,EAAI0H,EAAM1H,GAAK,EACzBlB,IAAMkB,EACRyH,EAAK3I,GAAGkB,GAAK,EACgB,IAApBwH,EAAU1I,GAAGkB,IAAawH,EAAU1I,GAAGkB,GAGhDyH,EAAK3I,GAAGkB,GAAKwH,EAAU1I,GAAGkB,GAF1ByH,EAAK3I,GAAGkB,GAAK2H,G,CAOnB,IAAK,IAAIC,EAAI,EAAGA,EAAIF,EAAME,GAAK,EAC7B,IAAS9I,EAAI,EAAGA,EAAI4I,EAAM5I,GAAK,EAC7B,IAASkB,EAAI,EAAGA,EAAI0H,EAAM1H,GAAK,EACzByH,EAAK3I,GAAGkB,GAAKyH,EAAK3I,GAAG8I,GAAKH,EAAKG,GAAG5H,KACpCyH,EAAK3I,GAAGkB,GAAKyH,EAAK3I,GAAG8I,GAAKH,EAAKG,GAAG5H,IAK1C,OAAOyH,CACT,EAEaI,EAAe,SAC1BxG,EACAyG,GAEQ,IAAAC,EAAiB1G,EAAI,MAAd2G,EAAU3G,EAAI,MACvB4G,EAAmB,GAEnBC,EAEF,CAAC,EAEL,IAAKH,EACH,MAAM,IAAIpG,MAAM,uBAoBlB,OAlBIoG,GACFA,EAAM3F,SAAQ,SAAC+F,EAAMrJ,GACnBoJ,EAAQC,EAAK5G,IAAMzC,EAEnBmJ,EAAOnK,KADe,GAExB,IAGFkK,WAAO5F,SAAQ,SAACjB,GACN,IAAAiH,EAAmBjH,EAAC,OAAZkH,EAAWlH,EAAC,OACtBmH,EAASJ,EAAQE,GACjBG,EAASL,EAAQG,QACRvI,IAAXwI,QAAmCxI,IAAXyI,IAC5BN,EAAOK,GAAQC,GAAU,EACpBT,IACHG,EAAOM,GAAQD,GAAU,GAE7B,IACOL,CACT,EAOaO,EAAc,SAACP,EAAkBQ,GAC5C,IAAM5G,EAAmB,GAQzB,OAPAoG,EAAO7F,SAAQ,SAACsG,GACd,IAAMC,EAAmB,GACzBD,EAAItG,SAAQ,SAAC4D,GACX2C,EAAO7K,KAAKkI,EAAIyC,EAClB,IACA5G,EAAO/D,KAAK6K,EACd,IACO9G,CACT,EAMM+G,EAAa,SACjBvH,EACAlE,GAEA,GAAIkE,GAAQA,EAAKwH,SACf,IAAK,IAAI/J,EAAIuC,EAAKwH,SAAS7J,OAAS,EAAGF,GAAK,EAAGA,IAC7C,IAAK8J,EAAWvH,EAAKwH,SAAS/J,GAAI3B,GAAK,OAI3C,QAAKA,EAAGkE,EAIV,EAMayH,EAAiB,SAC5BzH,EACAlE,GAEkB,mBAAPA,GAGXyL,EAAWvH,EAAMlE,EACnB,EAOa4L,EAAgB,SAAChB,GAC5B,IAAIiB,EAAOrB,IACPsB,EAAOtB,IACPuB,GAAO,IACPC,GAAO,IAsBX,OArBApB,EAAM3F,SAAQ,SAAC+F,GACb,IAAIT,EAAOS,EAAK9G,KAAKqG,KACjBT,EAAQS,GACU,IAAhBA,EAAK1I,SAAc0I,EAAO,CAACA,EAAK,GAAIA,EAAK,KACpC,EAASA,GAClBA,EAAO,CAACA,EAAMA,SACI5H,IAAT4H,GAAsBL,MAAMK,MACrCA,EAAO,CAAC,GAAI,KAGd,IAAM0B,EAAW,CAAC1B,EAAK,GAAK,EAAGA,EAAK,GAAK,GACnC2B,EAAOlB,EAAK9G,KAAKiI,EAAIF,EAAS,GAC9BG,EAAQpB,EAAK9G,KAAKiI,EAAIF,EAAS,GAC/BI,EAAMrB,EAAK9G,KAAKiE,EAAI8D,EAAS,GAC7BK,EAAStB,EAAK9G,KAAKiE,EAAI8D,EAAS,GAElCJ,EAAOK,IAAML,EAAOK,GACpBJ,EAAOO,IAAKP,EAAOO,GACnBN,EAAOK,IAAOL,EAAOK,GACrBJ,EAAOM,IAAQN,EAAOM,EAC5B,IACO,CAAET,KAAI,EAAEC,KAAI,EAAEC,KAAI,EAAEC,KAAI,EACjC,EAOaO,EAAqB,SAAC3B,GACjC,IAAM4B,EAAa,CAAEL,EAAG,EAAGhE,EAAG,GAC9ByC,EAAM3F,SAAQ,SAAC+F,GACbwB,EAAWL,GAAKnB,EAAK9G,KAAKiI,GAAK,EAC/BK,EAAWrE,GAAK6C,EAAK9G,KAAKiE,GAAK,CACjC,IAEA,IAAMtG,EAAS+I,EAAM/I,QAAU,EAC/B,MAAO,CACLsK,EAAGK,EAAWL,EAAItK,EAClBsG,EAAGqE,EAAWrE,EAAItG,EAEtB,EAGM4K,EAAc,SAACtI,EAA2B6G,EAAYH,G,QAC1D,MAAa,WAAT1G,GACoD,QAA9C,EAAA0G,aAAK,EAALA,EAAO6B,MAAK,SAACC,GAAS,OAAAA,EAAKzB,SAAWF,EAAK5G,EAArB,WAAwB,eAAE6G,SACtD,CAAC,GAEiD,QAA9C,EAAAJ,aAAK,EAALA,EAAO6B,MAAK,SAACC,GAAS,OAAAA,EAAK1B,SAAWD,EAAK5G,EAArB,WAAwB,eAAE8G,SAAU,CAAC,CACrE,EAGM0B,EAAqB,SACzBzI,EACA0I,EACAhC,GAEA,IAAIiC,EAAqC,GACzC,OAAQ3I,GACN,IAAK,SACH2I,EAAgBjC,aAAK,EAALA,EACZkC,QAAO,SAACJ,GAAS,OAAAA,EAAK1B,SAAW4B,EAASzI,EAAzB,IAClB4I,KAAI,SAACL,GAAS,OAAAA,EAAKzB,MAAL,IACjB,MACF,IAAK,SACH4B,EAAgBjC,aAAK,EAALA,EACZkC,QAAO,SAACJ,GAAS,OAAAA,EAAKzB,SAAW2B,EAASzI,EAAzB,IAClB4I,KAAI,SAACL,GAAS,OAAAA,EAAK1B,MAAL,IACjB,MACF,IAAK,OACH6B,EAAgBjC,aAAK,EAALA,EACZkC,QAAO,SAACJ,GAAS,OAAAA,EAAK1B,SAAW4B,EAASzI,EAAzB,IAClB4I,KAAI,SAACL,GAAS,OAAAA,EAAKzB,MAAL,IACd1J,OACCqJ,aAAK,EAALA,EACIkC,QAAO,SAACJ,GAAS,OAAAA,EAAKzB,SAAW2B,EAASzI,EAAzB,IAClB4I,KAAI,SAACL,GAAS,OAAAA,EAAK1B,MAAL,KAOzB,IAAMgC,EAAM,IAAIC,IAAIJ,GACpB,OAAO/K,MAAMuH,KAAK2D,EACpB,EAuBaE,EAAkC,SAC7ChJ,EACA6G,EACAH,EACAuC,EACAC,EACAtC,GAEM,MAAmCsC,EAAWrC,EAAK5G,IAA7CkJ,EAAQ,KAAOC,EAAS,MAChCV,EAAiB7B,EACjBwC,EAA4B,GACf,IAAbF,GAEFT,EAAWJ,EAAY,SAAUzB,EAAMH,GACvC2C,EAAoBZ,EAAmB,OAAQC,EAAUhC,GAAOmC,KAC9D,SAACS,GAAW,OAAA1C,EAAQ0C,EAAR,KAES,IAAdF,IAETV,EAAWJ,EAAY,SAAUzB,EAAMH,GACvC2C,EAAoBZ,EAAmB,OAAQC,EAAUhC,GAAOmC,KAC9D,SAACS,GAAW,OAAA1C,EAAQ0C,EAAR,KAGhBD,EAAoBA,EAAkBT,QACpC,SAAC/B,GACC,OAAAqC,EAAWrC,EAAK5G,MACY,IAA3BiJ,EAAWrC,EAAK5G,IAAIsJ,IAAwC,IAA5BL,EAAWrC,EAAK5G,IAAIuJ,IADrD,IAGJ,IAAMC,EAlDiB,SACvBzJ,EACAiJ,EACApC,EACA8B,EACAO,GAEA,IAAMQ,EAAW7C,EAAKoC,IAAgC,GAClDU,GACFhB,aAAa,EAAbA,EAAeC,QACb,SAACgB,GAAS,OAAAA,EAAKX,KAAiCS,CAAtC,MACP,GAMP,MALa,SAAT1J,IACF2J,EAAgBA,EAAcf,QAC5B,SAAC/B,GAAI,QAAK,OAA4B,KAAT,QAAnB,EAAAqC,EAAWrC,EAAK5G,WAAG,eAAEsJ,KAAyC,KAAV,QAAnB,EAAAL,EAAWrC,EAAK5G,WAAG,eAAEuJ,IAAS,KAGtEG,CACT,CAgC4BE,CACxB7J,EACAiJ,EACApC,EACAwC,EACAH,GAEF,MAAO,CAAER,SAAQ,EAAEW,kBAAiB,EAAEI,kBAAiB,EACzD,EAQaK,EAAuB,SAACC,EAAWC,GAC9C,OAAAC,KAAKC,MAAMH,EAAG/B,EAAIgC,EAAGhC,IAAM+B,EAAG/B,EAAIgC,EAAGhC,IAAM+B,EAAG/F,EAAIgG,EAAGhG,IAAM+F,EAAG/F,EAAIgG,EAAGhG,GAArE,ECzRWmG,EAAQ,SAAIpD,GACvB,GAAe,OAAXA,EACF,OAAOA,EAET,GAAIA,aAAkBqD,KACpB,OAAO,IAAIA,KAAKrD,EAAOsD,WAEzB,GAAItD,aAAkBnJ,MAAO,CAC3B,IAAM,EAAK,GAIX,OAHCmJ,EAAiBjG,SAAQ,SAAC4D,GACzB,EAAGlI,KAAKkI,EACV,IACO,EAAGmE,KAAI,SAACpH,GAAW,OAAA0I,EAAW1I,EAAX,G,CAE5B,GAAsB,iBAAXsF,EAAqB,CAC9B,IAAM,EAAK,CAAC,EAIZ,OAHAxL,OAAO+O,KAAKvD,GAAQjG,SAAQ,SAACwF,GAC3B,EAAGA,GAAK6D,EAAYpD,EAAeT,GACrC,IACO,C,CAET,OAAOS,CACT,EAQawD,EAAkB,SAC7BxD,EACAyD,GAEA,IAAMC,EAASN,EAAMpD,GAMrB,OALA0D,EAAO1K,KAAO0K,EAAO1K,MAAQ,CAAC,EAC1ByK,IACG,EAASC,EAAO1K,KAAKiI,KAAIyC,EAAO1K,KAAKiI,EAAIiC,KAAKS,SAAWF,EAAU,IACnE,EAASC,EAAO1K,KAAKiE,KAAIyG,EAAO1K,KAAKiE,EAAIiG,KAAKS,SAAWF,EAAU,KAEnEC,CACT,ECzCA,iBAA0BjH,GACtB,MAAwB,mBAAVA,CACjB,ECLD,WAA0BA,GAOtB,IAAIxD,SAAcwD,EAClB,OAAkB,OAAVA,GAA2B,WAATxD,GAA+B,aAATA,CACnD,ECCM,SAAS2K,EACdC,EACApH,GAYA,OATI,EAAWA,GACAA,EACJ,EAASA,GAEL,WAAM,OAAAA,CAAA,EAGN,WAAM,OAAAoH,CAAA,CAGvB,CASO,SAASC,EACdD,EACApH,EAMAsH,GAEA,YAFA,IAAAA,OAAA,GAEKtH,GAAmB,IAAVA,EAeV,EAAWA,GACNA,EAEL,EAASA,GACJ,WAAM,OAAAA,CAAA,EAEXmC,EAAQnC,GACH,WACL,GAAIsH,EAAgB,CAClB,IAAMC,EAAMd,KAAKc,IAAG,MAARd,KAAI,OAAQzG,KACxB,OAAOuC,MAAMgF,GAAOH,EAAeG,C,CAErC,OAAOvH,CACT,EAEE,EAASA,GACJ,WACL,GAAIsH,EAAgB,CAClB,IAAMC,EAAMd,KAAKc,IAAIvH,EAAMwH,MAAOxH,EAAMyH,QACxC,OAAOlF,MAAMgF,GAAOH,EAAeG,C,CAErC,MAAO,CAACvH,EAAMwH,MAAOxH,EAAMyH,OAC7B,EAEK,WAAM,OAAAL,CAAA,EAtCJ,SAAC9K,GACE,IAAAsG,GAAStG,EAAEC,MAAQ,CAAC,GAAC,KAC7B,OAAIqG,EACET,EAAQS,GACHA,EAAK,GAAKA,EAAK,GAAKA,EAAK,GAAKA,EAAK,GAExC,EAA4CA,GACvCA,EAAK4E,MAAQ5E,EAAK6E,OAAS7E,EAAK4E,MAAQ5E,EAAK6E,OAE/C7E,EAEFwE,CACT,CA2BJ,CAQO,IAAMM,EAAiB,SAC5BC,EACAC,GAEA,IACIC,EAsCJ,OApCEA,EADE,EAASD,GACO,WAAM,OAAAA,CAAA,EACf,EAAWA,GACFA,EAEA,WAAM,UAGrBD,EAqBMxF,EAAQwF,GACF,SAACrL,GAEd,OADYqL,EAAS,GAAKA,EAAS,GAAKA,EAAS,GAAKA,EAAS,IAClDE,EAAgBvL,EAC/B,EAEe,SAACA,GAAY,OAAAqL,EAAWE,EAAgBvL,EAA3B,EA1Bb,SAACA,G,QACd,GAAU,QAAN,EAAAA,EAAEC,YAAI,eAAEuL,SACV,OACErB,KAAKc,IAAIjL,EAAEC,KAAKuL,SAAS,GAAIxL,EAAEC,KAAKuL,SAAS,IAAMD,EAAgBvL,GAGvE,GAAU,QAAN,EAAAA,EAAEC,YAAI,eAAEqG,KAAM,CAChB,GAAIT,EAAQ7F,EAAEC,KAAKqG,MACjB,OAAO6D,KAAKc,IAAIjL,EAAEC,KAAKqG,KAAK,GAAItG,EAAEC,KAAKqG,KAAK,IAAMiF,EAAgBvL,GAEpE,IAAMyL,EAAWzL,EAAEC,KAAKqG,KACxB,OAAI,EAA4CmF,IAE5CA,EAASP,MAAQO,EAASN,OAASM,EAASP,MAAQO,EAASN,QAClDI,EAAgBvL,GAExByL,EAAWF,EAAgBvL,E,CAEpC,OAAO,GAAKuL,EAAgBvL,EAC9B,CAUJ,EC/Ha0L,EAAwB,SACnCC,EACArL,EACAsL,GAEA,IAAMjF,EAAQgF,EAAME,cACdjF,EAAQ+E,EAAMG,cACpB,OAAKnF,aAAK,EAALA,EAAO/I,QAIS,IAAjB+I,EAAM/I,QACJ0C,GACFqL,EAAMI,cAAcpF,EAAM,GAAGxG,GAAI,CAC/B+H,EAAG0D,EAAO,GACV1H,EAAG0H,EAAO,KAGC,CACbjF,MAAO,C,OAEAA,EAAM,IAAE,CACX1G,KAAM,OACD0G,EAAM,GAAG1G,MAAI,CAChBiI,EAAG0D,EAAO,GACV1H,EAAG0H,EAAO,QAIhBhF,MAAK,SAlBT,EAHiB,CAAED,MAAO,GAAaC,MAAK,EAyB9C,EC7BMoF,EAA0D,CAC9DC,OAAQ,KACRC,YAAa,KACbC,UAAW,KACXC,WAAY,EACZC,SAAU,EAAIlC,KAAKmC,GACnBC,WAAW,EACXC,UAAW,EACXC,SAAU,KACVC,WAAY,GAkBd,aAGE,WACSC,QAAA,IAAAA,MAAiC,CAAC,GAAlC,KAAAA,UAHT,KAAAxM,GAAK,WAKHjE,KAAKyQ,QAAU,OACVX,GACAW,EAEP,CA0IF,OArIQ,YAAAC,QAAN,SAAcjB,EAAcgB,G,mEAC1B,MAAO,CAAP,EAAOzQ,KAAK2Q,uBAAsB,EAAOlB,EAAOgB,G,QAM5C,YAAArM,OAAN,SAAaqL,EAAcgB,G,0FACzB,SAAMzQ,KAAK2Q,uBAAsB,EAAMlB,EAAOgB,I,cAA9C,S,YAaY,YAAAE,sBAAd,SACEvM,EACAqL,EACAgB,G,6IAwBA,GAtBMG,EAAgB,OAAK5Q,KAAKyQ,SAAYA,GAE1CzB,EAWE4B,EAAa,MAVf3B,EAUE2B,EAAa,OATflB,EASEkB,EAAa,OARfN,EAQEM,EAAa,UAPf,EAOEA,EAAa,WAPfV,OAAU,IAAG,IAAC,EACd,EAMEU,EAAa,SANfT,OAAQ,IAAG,IAAIlC,KAAKmC,GAAE,EACtBI,EAKEI,EAAa,WAJfL,EAIEK,EAAa,SAHfP,EAGEO,EAAa,UAFFC,EAEXD,EAAa,YADLE,EACRF,EAAa,SAEXnG,EAAgBgF,EAAME,cACtBjF,EAAgB+E,EAAMG,cAGtB,IACJmB,EAAgB/B,EAAOC,EAAQS,GAAO,GADjCsB,EAAe,KAAEC,EAAgB,KAAEC,EAAgB,OAEpDzL,EAAIgF,aAAK,EAALA,EAAO/I,SACD,IAAN+D,EACR,MAAO,CAAP,EAAO+J,EAAsBC,EAAOrL,EAAQ8M,IA8C9C,IA3CMC,GAAahB,EAAWD,GAAczK,EAEtCsK,EAAmCa,EAAa,OAAxCZ,EAA2BY,EAAa,YAA3BX,EAAcW,EAAa,UAClDC,GACI,EAAwBlC,EAAe,GAAIkC,GAC3C,EAAqBhC,EAAa,GAAIiC,GACxC,GAAc,IAClBrG,EAAM3F,SAAQ,SAAC+F,GACb,IAAMuG,EAAQ,EAASvG,GACnB,EAAcuG,IAAO,EAAcA,EACzC,IACI,EAAY,EAChB3G,EAAM3F,SAAQ,SAAC+F,EAAMrJ,GACN,GAAH,IAANA,EAAsB,GAAe,IACtB,EAAYqJ,IAAS,IAAM,GAAe,GAC/D,IACAkF,EAAS,GAAa,EAAI9B,KAAKmC,KACrBL,GAAWC,GAAgBC,GAE3BD,GAAeC,EACzBD,EAAcC,EACLD,IAAgBC,IACzBA,EAAYD,GAJZD,EAAS9B,KAAKoD,IAAIJ,EAAkBD,GAAmB,EAMnDM,EAAQH,EAAYX,EAGtBe,EAAyB,GAG3BA,EAFe,aAAbhB,EAEYiB,EAAiB/B,EAAOhF,GAChB,sBAAb8F,EAEKiB,EAAiB/B,EAAOhF,GAAO,GACvB,WAAb8F,EAwHf,SAAwBd,EAAchF,GACpC,IAAMgH,EAA0B,GAQhC,OAPAhH,EAAM3F,SAAQ,SAAC+F,EAAMrJ,GACnBiQ,EAAajR,KAAK+N,EAAgB1D,GACpC,IACA4G,EAAaC,MACX,SAACC,EAAaC,GACZ,OAAAnC,EAAMoC,UAAUF,EAAM1N,GAAI,QAAUwL,EAAMoC,UAAUD,EAAM3N,GAAI,OAA9D,IAEGwN,CACT,CAhIoBK,CAAerC,EAAOhF,GAGtBA,EAAMoC,KAAI,SAAChC,GAAS,OAAA0D,EAAgB1D,EAAhB,IAG9BkH,EAAO9D,KAAK+D,KAAKvM,EAAI6K,GAClB9O,EAAI,EAAGA,EAAIiE,IAAKjE,GACnBuH,EAAIgH,IACkB,OAAhBC,GAAsC,OAAdC,IAChClH,EAAIiH,EAAgBxO,GAAKyO,EAAaD,IAAkBvK,EAAI,IAEzDsD,IACHA,EAAI,GAAU,IAAJvH,GAAYiE,EAAI,IAExBwM,EACF/B,EACC1O,EAAIuQ,EAAQT,EACX,EAAIrD,KAAKmC,GAAME,EAAcrC,KAAKiE,MAAM1Q,EAAIuQ,GAC3C1B,IACH4B,EACE9B,EACC3O,EAAIuQ,EAAQT,EACX,EAAIrD,KAAKmC,GAAME,EAAcrC,KAAKiE,MAAM1Q,EAAIuQ,IAElDR,EAAY/P,GAAGuC,KAAKiI,EAAIkF,EAAiB,GAAKjD,KAAKkE,IAAIF,GAASlJ,EAChEwI,EAAY/P,GAAGuC,KAAKiE,EAAIkJ,EAAiB,GAAKjD,KAAKmE,IAAIH,GAASlJ,EAiBlE,OAdI3E,GACFmN,EAAYzM,SAAQ,SAAC+F,GACnB4E,EAAMI,cAAchF,EAAK5G,GAAI,CAC3B+H,EAAGnB,EAAK9G,KAAKiI,EACbhE,EAAG6C,EAAK9G,KAAKiE,GAEjB,IAQK,CAAP,EALe,CACbyC,MAAO8G,EACP7G,MAAK,G,QAKX,EApJA,GA6JM8G,EAAmB,SACvB/B,EACAhF,EACAD,QAAA,IAAAA,OAAA,GAEA,IAAM6H,EAA2B,CAAC9D,EAAgB9D,EAAM,KAClD6H,EAAuC,CAAC,EACxC7M,EAAIgF,EAAM/I,OAChB4Q,EAAU7H,EAAM,GAAGxG,KAAM,EAEzB,IAAIqG,EAAI,EA6CR,OA5CAG,EAAM3F,SAAQ,SAAC+F,EAAMrJ,GACnB,GAAU,IAANA,EACF,GACGA,IAAMiE,EAAI,GACTgK,EAAMoC,UAAUhH,EAAK5G,GAAI,UACvBwL,EAAMoC,UAAUpH,EAAMjJ,EAAI,GAAGyC,GAAI,UACnCwL,EAAM8C,aAAaF,EAAc/H,GAAGrG,GAAI4G,EAAK5G,KAC9CqO,EAAUzH,EAAK5G,IAKX,CAKL,IAJA,IAAMsH,EAAWf,EACbiF,EAAM+C,cAAcH,EAAc/H,GAAGrG,IACrCwL,EAAMgD,aAAaJ,EAAc/H,GAAGrG,IACpCyO,GAAa,EACRhQ,EAAI,EAAGA,EAAI6I,EAAS7J,OAAQgB,IAAK,CACxC,IAAMiQ,EAAQpH,EAAS7I,GACvB,GACE+M,EAAMoC,UAAUc,EAAM1O,MAAQwL,EAAMoC,UAAUhH,EAAK5G,MAClDqO,EAAUK,EAAM1O,IACjB,CACAoO,EAAc7R,KAAK+N,EAAgBoE,IACnCL,EAAUK,EAAM1O,KAAM,EACtByO,GAAa,EACb,K,EAIJ,IADA,IAAIE,EAAK,GACDF,IACDJ,EAAU7H,EAAMmI,GAAI3O,MACvBoO,EAAc7R,KAAK+N,EAAgB9D,EAAMmI,KACzCN,EAAU7H,EAAMmI,GAAI3O,KAAM,EAC1ByO,GAAa,KAEfE,IACWnN,K,MA5Bb4M,EAAc7R,KAAK+N,EAAgB1D,IACnCyH,EAAUzH,EAAK5G,KAAM,EACrBqG,GAgCN,IACO+H,CACT,EA2BMtB,EAAkB,SACtB/B,EACAC,EACAS,GAEA,IAAIsB,EAAkBhC,EAClBiC,EAAmBhC,EACnBiC,EAAmBxB,EAUvB,OATKsB,GAAqC,oBAAX6B,SAC7B7B,EAAkB6B,OAAOC,YAEtB7B,GAAsC,oBAAX4B,SAC9B5B,EAAmB4B,OAAOE,aAEvB7B,IACHA,EAAmB,CAACF,EAAmB,EAAGC,EAAoB,IAEzD,CAACD,EAAkBC,EAAmBC,EAC/C,E,oCCpQA,cAWE,WACUzB,EACAuD,EACAvC,GAHV,MAKE,cAAO,K,OAJC,EAAAhB,QACA,EAAAuD,SACA,EAAAvC,UAIR,EAAKwC,c,CACP,CAqFF,OAxGgC,OAqB9B,YAAAA,YAAA,WACMjT,KAAKyD,QACPzD,KAAKyD,OAAOyP,YAWdlT,KAAKyD,OAAS,MAEVzD,KAAKmT,UACPnT,KAAKmT,SAAU,EACfnT,KAAK0Q,UAET,EAEM,YAAAA,QAAN,W,4GACE,OAAI1Q,KAAKmT,QAAgB,CAAP,EAAOnT,OAEzBA,KAAKmT,SAAU,GAGT,EAAsBnT,KAAKgT,OAAOvC,SAA1B,OAAK2C,EAAI,IAAjB,YACAC,EAAU,CACdL,OAAQ,CACN/O,GAAIjE,KAAKgT,OAAO/O,GAChBwM,QAAS2C,EACTE,WAAwB,QAAZ,EAAAtT,KAAKyQ,eAAO,eAAE6C,YAE5B7I,MAAOzK,KAAKyP,MAAME,cAClBjF,MAAO1K,KAAKyP,MAAMG,eAQd2D,EAA4B,IAAIC,aAAa,CAAC,IAWhC,GAAMxT,KAAKyD,OAAOgQ,gBAAgBJ,EAAS,CAC7DE,M,OAGF,MAAO,CAAP,EAJM,gBAAc,SAElB,IAFc,I,QAOlB,YAAAG,KAAA,WAME,OALA1T,KAAKmT,SAAU,EAGfnT,KAAKyD,OAAOkQ,aAEL3T,IACT,EAEA,YAAA4T,KAAA,WACM5T,KAAKyD,QACPzD,KAAKyD,OAAOyP,WAMhB,EAEA,YAAAW,UAAA,WACE,OAAO7T,KAAKmT,OACd,EACF,EAxGA,CAAgC,KCrChC,iBAA0B3J,GACtB,OAAO,EAAOA,EAAK,SACtB,ECWD,IAAM,EAA4D,CAChE2F,SAAU,GACVC,YAAa,GACb0E,gBAAgB,EAChBC,WAAOvR,EACPwR,aAAa,EACb9D,WAAY,IAAUjC,KAAKmC,GAC3BC,WAAW,EACX4D,kBAAczR,EACd0R,OAAQ,UAkBV,aAGE,WACSzD,QAAA,IAAAA,MAAmC,CAAC,GAApC,KAAAA,UAHT,KAAAxM,GAAK,aAKHjE,KAAKyQ,QAAU,OACV,GACAA,EAEP,CAkPF,OA7OQ,YAAAC,QAAN,SAAcjB,EAAcgB,G,mEAC1B,MAAO,CAAP,EAAOzQ,KAAKmU,yBAAwB,EAAO1E,EAAOgB,G,QAK9C,YAAArM,OAAN,SAAaqL,EAAcgB,G,0EACzBzQ,KAAKmU,yBAAwB,EAAM1E,EAAOgB,G,WAa9B,YAAA0D,wBAAd,SACE/P,EACAqL,EACAgB,G,mJAiCA,GA/BMG,EAAgB,OAAK5Q,KAAKyQ,SAAYA,GAElC2D,EAYNxD,EAAa,OAXRyD,EAWLzD,EAAa,MAVP0D,EAUN1D,EAAa,OATP2D,EASN3D,EAAa,OARD4D,EAQZ5D,EAAa,aAPR6D,EAOL7D,EAAa,MANfP,EAMEO,EAAa,UALfoD,EAKEpD,EAAa,YAJfkD,EAIElD,EAAa,eAHf,EAGEA,EAAa,WAHfV,OAAU,IAAG,MAAUjC,KAAKmC,GAAE,EAC9BjB,EAEEyB,EAAa,SADfxB,EACEwB,EAAa,YAEXnG,EAAQgF,EAAME,cACdjF,EAAQ+E,EAAMG,cAEdZ,EACHqF,GAAgC,oBAAXxB,OAEjBwB,EADDxB,OAAOC,WAEP7D,EACHqF,GAAiC,oBAAXzB,OAElByB,EADDzB,OAAOE,YAEPrD,EACH0E,GAAc,CAACpF,EAAQ,EAAGC,EAAS,KAGjCxE,aAAK,EAALA,EAAO/I,SAA2B,IAAjB+I,EAAM/I,OAC1B,MAAO,CAAP,EAAO8N,EAAsBC,EAAOrL,EAAQsL,IAuI9C,GApIM6B,EAAyB,GAE3BmD,EAAyB,EAE3BC,EADEhL,EAAQwF,GACIlB,KAAKc,IAAII,EAAS,GAAIA,EAAS,IAE/BA,EAEZxF,EAAQyF,GACVsF,EAAiBzG,KAAKc,IAAIK,EAAY,GAAIA,EAAY,IAC7C,EAASA,KAClBsF,EAAiBtF,GAEnB3E,EAAM3F,SAAQ,SAAC+F,GACb,IAAM+J,EAAQrG,EAAgB1D,GAC9B0G,EAAY/Q,KAAKoU,GACjB,IAAIzF,EAAmBwF,EACf5Q,EAAS6Q,EAAK,KAClBjL,EAAQ5F,EAAKqG,MACf+E,EAAWlB,KAAKc,IAAIhL,EAAKqG,KAAK,GAAIrG,EAAKqG,KAAK,IACnC,EAASrG,EAAKqG,MACvB+E,EAAWpL,EAAKqG,KACP,EAASrG,EAAKqG,QACvB+E,EAAWlB,KAAKc,IACbhL,EAAKqG,KAAa4E,MAClBjL,EAAKqG,KAAa6E,SAGvB0F,EAAc1G,KAAKc,IAAI4F,EAAaxF,GAEhC,EAAWC,KACbsF,EAAiBzG,KAAKc,IAAIK,EAAYvE,GAAO6J,GAEjD,IAGMG,EAAuB,CAAC,EAC9BtD,EAAYzM,SAAQ,SAAC+F,EAAMrJ,GACzBqT,EAAWhK,EAAK5G,IAAMzC,CACxB,IAKG,EAFC0S,EAASK,SAG8B/R,IAAxC+O,EAAY,GAAWxN,KAAKmQ,KAE7BA,EAAS,UAEI,WAAXA,EACF3C,EAAYG,MACV,SAACoD,EAAUC,GACT,OAAAtF,EAAMoC,UAAUkD,EAAG9Q,GAAI,QAAUwL,EAAMoC,UAAUiD,EAAG7Q,GAAI,OAAxD,IAIJsN,EAAYG,MACV,SAACoD,EAAUC,GACT,OAACA,EAAWhR,KAAKmQ,GAAWY,EAAW/Q,KAAKmQ,EAA5C,IAIAc,EAAezD,EAAY,GAC3B0C,GACHO,IACa,WAAXN,EACGzE,EAAMoC,UAAUmD,EAAa/Q,GAAI,QAChC+Q,EAAqBjR,KAAKmQ,KAAY,EAQ3Ce,GALEC,EAIA,CAAC,CAAEzK,MAAO,MACU,GAC1B8G,EAAYzM,SAAQ,SAAC+F,GACnB,GAAIoK,EAAaxK,MAAM/I,OAAS,EAAG,CACjC,IAAMyT,EACO,WAAXjB,EACIjG,KAAKmH,IACH3F,EAAMoC,UAAUoD,EAAaxK,MAAM,GAAGxG,GAAI,QACxCwL,EAAMoC,UAAUhH,EAAK5G,GAAI,SAE7BgK,KAAKmH,IACFH,EAAaxK,MAAM,GAAG1G,KAAKmQ,GACzBrJ,EAAa9G,KAAKmQ,IAGzBD,GAAgBkB,GAAQlB,IAC1BgB,EAAe,CAAExK,MAAO,IACxByK,EAAO1U,KAAKyU,G,CAGhBA,EAAaxK,MAAMjK,KAAKqK,EAC1B,IAGIwK,EAAUV,EAAcD,EACvBZ,IAEGwB,EAAmBJ,EAAOxT,OAAS,GAAKwT,EAAO,GAAGzK,MAAM/I,OAAS,EACjE6T,EAAOtH,KAAKoD,IAAIrC,EAAOC,GAAU,EAAIoG,EACrCG,EAAQD,GAAQL,EAAOxT,QAAU4T,EAAmB,EAAI,IAE9DD,EAAUpH,KAAKoD,IAAIgE,EAASG,IAI1BzM,EAAI,EACRmM,EAAOpQ,SAAQ,SAAC2Q,GACd,IAAM1B,OACWvR,IAAfiS,EACI,EAAIxG,KAAKmC,GAAM,EAAInC,KAAKmC,GAAMqF,EAAMhL,MAAM/I,OAC1C+S,EAIN,GAHAgB,EAAMC,OAAS3B,EAAQ9F,KAAKc,IAAI,EAAG0G,EAAMhL,MAAM/I,OAAS,GAGpD+T,EAAMhL,MAAM/I,OAAS,GAAKoS,EAAgB,CAE5C,IAAM6B,EAAO1H,KAAKkE,IAAIsD,EAAMC,QAAUzH,KAAKkE,IAAI,GACzCyD,EAAO3H,KAAKmE,IAAIqD,EAAMC,QAAUzH,KAAKmE,IAAI,GACzCyD,EAAO5H,KAAKC,KACfmH,EAAUA,GAAYM,EAAOA,EAAOC,EAAOA,IAG9C7M,EAAIkF,KAAKc,IAAI8G,EAAM9M,E,CAErB0M,EAAM1M,EAAIA,EACVA,GAAKsM,CACP,IAEIrB,EAAa,CAGf,IAFI,EAAY,EACZ,EAAK,EACAxS,EAAI,EAAGA,EAAI0T,EAAOxT,OAAQF,IAC3BiU,EAAQP,EAAO1T,GACfsU,GAAUL,EAAM1M,GAAK,GAAK,EAChC,EAAYkF,KAAKc,IAAI,EAAW+G,GAElC,EAAK,EACLZ,EAAOpQ,SAAQ,SAAC2Q,EAAOjU,GACX,IAANA,IACF,EAAKiU,EAAM1M,GAAK,GAElB0M,EAAM1M,EAAI,EACV,GAAM,CACR,G,CA4BF,OAxBAmM,EAAOpQ,SAAQ,SAAC2Q,GACd,IAAMC,EAASD,EAAMC,QAAU,EACzBK,EAAKN,EAAM1M,GAAK,EACtB0M,EAAMhL,MAAM3F,SAAQ,SAAC+F,EAAenI,GAClC,IAAMsT,EAAQ9F,GAAcG,EAAY,GAAK,GAAKqF,EAAShT,EAC3DmI,EAAK9G,KAAKiI,EAAI0D,EAAO,GAAKqG,EAAK9H,KAAKkE,IAAI6D,GACxCnL,EAAK9G,KAAKiE,EAAI0H,EAAO,GAAKqG,EAAK9H,KAAKmE,IAAI4D,EAC1C,GACF,IAEI5R,GACFmN,EAAYzM,SAAQ,SAAC+F,GACnB,OAAA4E,EAAMI,cAAchF,EAAK5G,GAAI,CAC3B+H,EAAGnB,EAAK9G,KAAKiI,EACbhE,EAAG6C,EAAK9G,KAAKiE,GAFf,IAYG,CAAP,EALe,CACbyC,MAAO8G,EACP7G,MAAK,G,QAKX,EA5PA,GCnCA,SAAS,EAAIuL,EAAMjK,EAAGhE,EAAGlE,GACvB,GAAIiG,MAAMiC,IAAMjC,MAAM/B,GAAI,OAAOiO,EAEjC,IAAIC,EAOAC,EACAC,EACAC,EACAC,EACArK,EACAE,EACA3K,EACAkB,EAbAmI,EAAOoL,EAAKM,MACZC,EAAO,CAACzS,KAAMD,GACd2S,EAAKR,EAAKS,IACVC,EAAKV,EAAKW,IACVC,EAAKZ,EAAKa,IACVC,EAAKd,EAAKe,IAWd,IAAKnM,EAAM,OAAOoL,EAAKM,MAAQC,EAAMP,EAGrC,KAAOpL,EAAKnJ,QAGV,IAFIuK,EAAQD,IAAMmK,GAAMM,EAAKI,GAAM,IAAIJ,EAAKN,EAASU,EAAKV,GACtDhK,EAASnE,IAAMoO,GAAMO,EAAKI,GAAM,IAAIJ,EAAKP,EAASW,EAAKX,EACvDF,EAASrL,IAAQA,EAAOA,EAAKrJ,EAAI2K,GAAU,EAAIF,IAAS,OAAOiK,EAAO1U,GAAKgV,EAAMP,EAMvF,GAFAI,GAAMJ,EAAKgB,GAAG/V,KAAK,KAAM2J,EAAK9G,MAC9BuS,GAAML,EAAKiB,GAAGhW,KAAK,KAAM2J,EAAK9G,MAC1BiI,IAAMqK,GAAMrO,IAAMsO,EAAI,OAAOE,EAAK9O,KAAOmD,EAAMqL,EAASA,EAAO1U,GAAKgV,EAAOP,EAAKM,MAAQC,EAAMP,EAGlG,GACEC,EAASA,EAASA,EAAO1U,GAAK,IAAII,MAAM,GAAKqU,EAAKM,MAAQ,IAAI3U,MAAM,IAChEqK,EAAQD,IAAMmK,GAAMM,EAAKI,GAAM,IAAIJ,EAAKN,EAASU,EAAKV,GACtDhK,EAASnE,IAAMoO,GAAMO,EAAKI,GAAM,IAAIJ,EAAKP,EAASW,EAAKX,SACnD5U,EAAI2K,GAAU,EAAIF,KAAYvJ,GAAK4T,GAAMF,IAAO,EAAKC,GAAMF,IACrE,OAAOD,EAAOxT,GAAKmI,EAAMqL,EAAO1U,GAAKgV,EAAMP,CAC7C,CC/Ce,WAASpL,EAAM4L,EAAIE,EAAIE,EAAIE,GACxC/W,KAAK6K,KAAOA,EACZ7K,KAAKyW,GAAKA,EACVzW,KAAK2W,GAAKA,EACV3W,KAAK6W,GAAKA,EACV7W,KAAK+W,GAAKA,CACZ,CCNO,SAASI,EAASrT,GACvB,OAAOA,EAAE,EACX,CCFO,SAASsT,EAAStT,GACvB,OAAOA,EAAE,EACX,CCWe,SAASuT,GAAS5M,EAAOuB,EAAGhE,GACzC,IAAIiO,EAAO,IAAIqB,GAAc,MAALtL,EAAYmL,EAAWnL,EAAQ,MAALhE,EAAYoP,EAAWpP,EAAGuP,IAAKA,IAAKA,IAAKA,KAC3F,OAAgB,MAAT9M,EAAgBwL,EAAOA,EAAKuB,OAAO/M,EAC5C,CAEA,SAAS6M,GAAStL,EAAGhE,EAAGyO,EAAIE,EAAIE,EAAIE,GAClC/W,KAAKiX,GAAKjL,EACVhM,KAAKkX,GAAKlP,EACVhI,KAAK0W,IAAMD,EACXzW,KAAK4W,IAAMD,EACX3W,KAAK8W,IAAMD,EACX7W,KAAKgX,IAAMD,EACX/W,KAAKuW,WAAQ/T,CACf,CAEA,SAASiV,GAAUjB,GAEjB,IADA,IAAIkB,EAAO,CAAC3T,KAAMyS,EAAKzS,MAAO2D,EAAOgQ,EAC9BlB,EAAOA,EAAK9O,MAAMA,EAAOA,EAAKA,KAAO,CAAC3D,KAAMyS,EAAKzS,MACxD,OAAO2T,CACT,CAEA,IAAIC,GAAYN,GAAS7X,UAAY8X,GAAS9X,UClC/B,YAASwM,GACtB,OAAO,WACL,OAAOA,CACT,CACF,CCJe,YAAS0C,GACtB,OAA0B,MAAlBA,IAAW,GACrB,CFkCAiJ,GAAUD,KAAO,WACf,IAEIjN,EACAkI,EAHA+E,EAAO,IAAIJ,GAAStX,KAAKiX,GAAIjX,KAAKkX,GAAIlX,KAAK0W,IAAK1W,KAAK4W,IAAK5W,KAAK8W,IAAK9W,KAAKgX,KACzEnM,EAAO7K,KAAKuW,MAIhB,IAAK1L,EAAM,OAAO6M,EAElB,IAAK7M,EAAKnJ,OAAQ,OAAOgW,EAAKnB,MAAQkB,GAAU5M,GAAO6M,EAGvD,IADAjN,EAAQ,CAAC,CAACK,OAAQD,EAAME,OAAQ2M,EAAKnB,MAAQ,IAAI3U,MAAM,KAChDiJ,EAAOJ,EAAM7B,OAClB,IAAK,IAAIpH,EAAI,EAAGA,EAAI,IAAKA,GACnBmR,EAAQ9H,EAAKC,OAAOtJ,MAClBmR,EAAMjR,OAAQ+I,EAAMjK,KAAK,CAACsK,OAAQ6H,EAAO5H,OAAQF,EAAKE,OAAOvJ,GAAK,IAAII,MAAM,KAC3EiJ,EAAKE,OAAOvJ,GAAKiW,GAAU9E,IAKtC,OAAO+E,CACT,EAEAC,GAAUC,IJ3DK,SAAS9T,GACtB,MAAMkI,GAAKhM,KAAKiX,GAAG/V,KAAK,KAAM4C,GAC1BkE,GAAKhI,KAAKkX,GAAGhW,KAAK,KAAM4C,GAC5B,OAAO,EAAI9D,KAAK6X,MAAM7L,EAAGhE,GAAIgE,EAAGhE,EAAGlE,EACrC,EIwDA6T,GAAUH,OJXH,SAAgBzT,GACrB,IAAID,EAAGtC,EACHwK,EACAhE,EAFMvC,EAAI1B,EAAKrC,OAGfoW,EAAK,IAAIlW,MAAM6D,GACfsS,EAAK,IAAInW,MAAM6D,GACfgR,EAAKpM,IACLsM,EAAKtM,IACLwM,GAAK,IACLE,GAAK,IAGT,IAAKvV,EAAI,EAAGA,EAAIiE,IAAKjE,EACfuI,MAAMiC,GAAKhM,KAAKiX,GAAG/V,KAAK,KAAM4C,EAAIC,EAAKvC,MAAQuI,MAAM/B,GAAKhI,KAAKkX,GAAGhW,KAAK,KAAM4C,MACjFgU,EAAGtW,GAAKwK,EACR+L,EAAGvW,GAAKwG,EACJgE,EAAIyK,IAAIA,EAAKzK,GACbA,EAAI6K,IAAIA,EAAK7K,GACbhE,EAAI2O,IAAIA,EAAK3O,GACbA,EAAI+O,IAAIA,EAAK/O,IAInB,GAAIyO,EAAKI,GAAMF,EAAKI,EAAI,OAAO/W,KAM/B,IAHAA,KAAK6X,MAAMpB,EAAIE,GAAIkB,MAAMhB,EAAIE,GAGxBvV,EAAI,EAAGA,EAAIiE,IAAKjE,EACnB,EAAIxB,KAAM8X,EAAGtW,GAAIuW,EAAGvW,GAAIuC,EAAKvC,IAG/B,OAAOxB,IACT,EItBA2X,GAAUE,MG7DK,SAAS7L,EAAGhE,GACzB,GAAI+B,MAAMiC,GAAKA,IAAMjC,MAAM/B,GAAKA,GAAI,OAAOhI,KAE3C,IAAIyW,EAAKzW,KAAK0W,IACVC,EAAK3W,KAAK4W,IACVC,EAAK7W,KAAK8W,IACVC,EAAK/W,KAAKgX,IAKd,GAAIjN,MAAM0M,GACRI,GAAMJ,EAAKxI,KAAKiE,MAAMlG,IAAM,EAC5B+K,GAAMJ,EAAK1I,KAAKiE,MAAMlK,IAAM,MAIzB,CAMH,IALA,IAEIkO,EACA1U,EAHAwW,EAAInB,EAAKJ,GAAM,EACf5L,EAAO7K,KAAKuW,MAITE,EAAKzK,GAAKA,GAAK6K,GAAMF,EAAK3O,GAAKA,GAAK+O,GAGzC,OAFAvV,GAAKwG,EAAI2O,IAAO,EAAK3K,EAAIyK,GACzBP,EAAS,IAAItU,MAAM,IAAWJ,GAAKqJ,EAAMA,EAAOqL,EAAQ8B,GAAK,EACrDxW,GACN,KAAK,EAAGqV,EAAKJ,EAAKuB,EAAGjB,EAAKJ,EAAKqB,EAAG,MAClC,KAAK,EAAGvB,EAAKI,EAAKmB,EAAGjB,EAAKJ,EAAKqB,EAAG,MAClC,KAAK,EAAGnB,EAAKJ,EAAKuB,EAAGrB,EAAKI,EAAKiB,EAAG,MAClC,KAAK,EAAGvB,EAAKI,EAAKmB,EAAGrB,EAAKI,EAAKiB,EAI/BhY,KAAKuW,OAASvW,KAAKuW,MAAM7U,SAAQ1B,KAAKuW,MAAQ1L,EACpD,CAMA,OAJA7K,KAAK0W,IAAMD,EACXzW,KAAK4W,IAAMD,EACX3W,KAAK8W,IAAMD,EACX7W,KAAKgX,IAAMD,EACJ/W,IACT,EHoBA2X,GAAU5T,KI9DK,WACb,IAAIA,EAAO,GAIX,OAHA/D,KAAKiY,OAAM,SAASpN,GAClB,IAAKA,EAAKnJ,OAAQ,GAAGqC,EAAKvD,KAAKqK,EAAK9G,YAAc8G,EAAOA,EAAKnD,KAChE,IACO3D,CACT,EJyDA4T,GAAUO,OK/DK,SAAShQ,GACtB,OAAO5F,UAAUZ,OACX1B,KAAK6X,OAAO3P,EAAE,GAAG,IAAKA,EAAE,GAAG,IAAI2P,OAAO3P,EAAE,GAAG,IAAKA,EAAE,GAAG,IACrD6B,MAAM/J,KAAK0W,UAAOlU,EAAY,CAAC,CAACxC,KAAK0W,IAAK1W,KAAK4W,KAAM,CAAC5W,KAAK8W,IAAK9W,KAAKgX,KAC7E,EL4DAW,GAAUpL,KM9DK,SAASP,EAAGhE,EAAG+H,GAC5B,IAAIhM,EAGA8S,EACAE,EACAoB,EACAC,EAKAC,EACA7W,EAXAiV,EAAKzW,KAAK0W,IACVC,EAAK3W,KAAK4W,IAKV0B,EAAKtY,KAAK8W,IACVyB,EAAKvY,KAAKgX,IACVwB,EAAQ,GACR3N,EAAO7K,KAAKuW,MAYhB,IARI1L,GAAM2N,EAAMhY,KAAK,IAAI,EAAKqK,EAAM4L,EAAIE,EAAI2B,EAAIC,IAClC,MAAVxI,EAAgBA,EAAS1F,KAE3BoM,EAAKzK,EAAI+D,EAAQ4G,EAAK3O,EAAI+H,EAC1BuI,EAAKtM,EAAI+D,EAAQwI,EAAKvQ,EAAI+H,EAC1BA,GAAUA,GAGLsI,EAAIG,EAAM5P,OAGf,OAAMiC,EAAOwN,EAAExN,QACPgM,EAAKwB,EAAE5B,IAAM6B,IACbvB,EAAKsB,EAAE1B,IAAM4B,IACbJ,EAAKE,EAAExB,IAAMJ,IACb2B,EAAKC,EAAEtB,IAAMJ,GAGrB,GAAI9L,EAAKnJ,OAAQ,CACf,IAAIyU,GAAMU,EAAKsB,GAAM,EACjB/B,GAAMW,EAAKqB,GAAM,EAErBI,EAAMhY,KACJ,IAAI,EAAKqK,EAAK,GAAIsL,EAAIC,EAAI+B,EAAIC,GAC9B,IAAI,EAAKvN,EAAK,GAAIgM,EAAIT,EAAID,EAAIiC,GAC9B,IAAI,EAAKvN,EAAK,GAAIsL,EAAIY,EAAIoB,EAAI/B,GAC9B,IAAI,EAAKvL,EAAK,GAAIgM,EAAIE,EAAIZ,EAAIC,KAI5B5U,GAAKwG,GAAKoO,IAAO,EAAKpK,GAAKmK,KAC7BkC,EAAIG,EAAMA,EAAM9W,OAAS,GACzB8W,EAAMA,EAAM9W,OAAS,GAAK8W,EAAMA,EAAM9W,OAAS,EAAIF,GACnDgX,EAAMA,EAAM9W,OAAS,EAAIF,GAAK6W,EAElC,KAGK,CACH,IAAII,EAAKzM,GAAKhM,KAAKiX,GAAG/V,KAAK,KAAM2J,EAAK9G,MAClC2U,EAAK1Q,GAAKhI,KAAKkX,GAAGhW,KAAK,KAAM2J,EAAK9G,MAClC4U,EAAKF,EAAKA,EAAKC,EAAKA,EACxB,GAAIC,EAAK5I,EAAQ,CACf,IAAIjM,EAAImK,KAAKC,KAAK6B,EAAS4I,GAC3BlC,EAAKzK,EAAIlI,EAAG6S,EAAK3O,EAAIlE,EACrBwU,EAAKtM,EAAIlI,EAAGyU,EAAKvQ,EAAIlE,EACrBC,EAAO8G,EAAK9G,IACd,CACF,CAGF,OAAOA,CACT,ENJA4T,GAAUiB,OOjEK,SAAS9U,GACtB,GAAIiG,MAAMiC,GAAKhM,KAAKiX,GAAG/V,KAAK,KAAM4C,KAAOiG,MAAM/B,GAAKhI,KAAKkX,GAAGhW,KAAK,KAAM4C,IAAK,OAAO9D,KAEnF,IAAIkW,EAEA2C,EACAC,EACApR,EAKAsE,EACAhE,EACAmO,EACAC,EACAnK,EACAE,EACA3K,EACAkB,EAfAmI,EAAO7K,KAAKuW,MAIZE,EAAKzW,KAAK0W,IACVC,EAAK3W,KAAK4W,IACVC,EAAK7W,KAAK8W,IACVC,EAAK/W,KAAKgX,IAWd,IAAKnM,EAAM,OAAO7K,KAIlB,GAAI6K,EAAKnJ,OAAQ,OAAa,CAG5B,IAFIuK,EAAQD,IAAMmK,GAAMM,EAAKI,GAAM,IAAIJ,EAAKN,EAASU,EAAKV,GACtDhK,EAASnE,IAAMoO,GAAMO,EAAKI,GAAM,IAAIJ,EAAKP,EAASW,EAAKX,EACrDF,EAASrL,IAAMA,EAAOA,EAAKrJ,EAAI2K,GAAU,EAAIF,IAAS,OAAOjM,KACnE,IAAK6K,EAAKnJ,OAAQ,OACdwU,EAAQ1U,EAAI,EAAK,IAAM0U,EAAQ1U,EAAI,EAAK,IAAM0U,EAAQ1U,EAAI,EAAK,MAAIqX,EAAW3C,EAAQxT,EAAIlB,EAChG,CAGA,KAAOqJ,EAAK9G,OAASD,MAASgV,EAAWjO,IAAMA,EAAOA,EAAKnD,MAAO,OAAO1H,KAIzE,OAHI0H,EAAOmD,EAAKnD,cAAamD,EAAKnD,KAG9BoR,GAAkBpR,EAAOoR,EAASpR,KAAOA,SAAcoR,EAASpR,KAAO1H,MAGtEkW,GAGLxO,EAAOwO,EAAO1U,GAAKkG,SAAcwO,EAAO1U,IAGnCqJ,EAAOqL,EAAO,IAAMA,EAAO,IAAMA,EAAO,IAAMA,EAAO,KACnDrL,KAAUqL,EAAO,IAAMA,EAAO,IAAMA,EAAO,IAAMA,EAAO,MACvDrL,EAAKnJ,SACPmX,EAAUA,EAASnW,GAAKmI,EACvB7K,KAAKuW,MAAQ1L,GAGb7K,OAbaA,KAAKuW,MAAQ7O,EAAM1H,KAczC,EPUA2X,GAAUoB,UORH,SAAmBhV,GACxB,IAAK,IAAIvC,EAAI,EAAGiE,EAAI1B,EAAKrC,OAAQF,EAAIiE,IAAKjE,EAAGxB,KAAK4Y,OAAO7U,EAAKvC,IAC9D,OAAOxB,IACT,EPMA2X,GAAUqB,KQnEK,WACb,OAAOhZ,KAAKuW,KACd,ERkEAoB,GAAUvN,KSpEK,WACb,IAAIA,EAAO,EAIX,OAHApK,KAAKiY,OAAM,SAASpN,GAClB,IAAKA,EAAKnJ,OAAQ,KAAK0I,QAAaS,EAAOA,EAAKnD,KAClD,IACO0C,CACT,ET+DAuN,GAAUM,MUnEK,SAASgB,GACtB,IAAgBZ,EAAsB1F,EAAO8D,EAAIE,EAAIE,EAAIE,EAArDyB,EAAQ,GAAO3N,EAAO7K,KAAKuW,MAE/B,IADI1L,GAAM2N,EAAMhY,KAAK,IAAI,EAAKqK,EAAM7K,KAAK0W,IAAK1W,KAAK4W,IAAK5W,KAAK8W,IAAK9W,KAAKgX,MAChEqB,EAAIG,EAAM5P,OACf,IAAKqQ,EAASpO,EAAOwN,EAAExN,KAAM4L,EAAK4B,EAAE5B,GAAIE,EAAK0B,EAAE1B,GAAIE,EAAKwB,EAAExB,GAAIE,EAAKsB,EAAEtB,KAAOlM,EAAKnJ,OAAQ,CACvF,IAAIyU,GAAMM,EAAKI,GAAM,EAAGT,GAAMO,EAAKI,GAAM,GACrCpE,EAAQ9H,EAAK,KAAI2N,EAAMhY,KAAK,IAAI,EAAKmS,EAAOwD,EAAIC,EAAIS,EAAIE,KACxDpE,EAAQ9H,EAAK,KAAI2N,EAAMhY,KAAK,IAAI,EAAKmS,EAAO8D,EAAIL,EAAID,EAAIY,KACxDpE,EAAQ9H,EAAK,KAAI2N,EAAMhY,KAAK,IAAI,EAAKmS,EAAOwD,EAAIQ,EAAIE,EAAIT,KACxDzD,EAAQ9H,EAAK,KAAI2N,EAAMhY,KAAK,IAAI,EAAKmS,EAAO8D,EAAIE,EAAIR,EAAIC,GAC9D,CAEF,OAAOpW,IACT,EVuDA2X,GAAUuB,WWpEK,SAASD,GACtB,IAA2BZ,EAAvBG,EAAQ,GAAI9Q,EAAO,GAEvB,IADI1H,KAAKuW,OAAOiC,EAAMhY,KAAK,IAAI,EAAKR,KAAKuW,MAAOvW,KAAK0W,IAAK1W,KAAK4W,IAAK5W,KAAK8W,IAAK9W,KAAKgX,MAC5EqB,EAAIG,EAAM5P,OAAO,CACtB,IAAIiC,EAAOwN,EAAExN,KACb,GAAIA,EAAKnJ,OAAQ,CACf,IAAIiR,EAAO8D,EAAK4B,EAAE5B,GAAIE,EAAK0B,EAAE1B,GAAIE,EAAKwB,EAAExB,GAAIE,EAAKsB,EAAEtB,GAAIZ,GAAMM,EAAKI,GAAM,EAAGT,GAAMO,EAAKI,GAAM,GACxFpE,EAAQ9H,EAAK,KAAI2N,EAAMhY,KAAK,IAAI,EAAKmS,EAAO8D,EAAIE,EAAIR,EAAIC,KACxDzD,EAAQ9H,EAAK,KAAI2N,EAAMhY,KAAK,IAAI,EAAKmS,EAAOwD,EAAIQ,EAAIE,EAAIT,KACxDzD,EAAQ9H,EAAK,KAAI2N,EAAMhY,KAAK,IAAI,EAAKmS,EAAO8D,EAAIL,EAAID,EAAIY,KACxDpE,EAAQ9H,EAAK,KAAI2N,EAAMhY,KAAK,IAAI,EAAKmS,EAAOwD,EAAIC,EAAIS,EAAIE,GAC9D,CACArP,EAAKlH,KAAK6X,EACZ,CACA,KAAOA,EAAI3Q,EAAKkB,OACdqQ,EAASZ,EAAExN,KAAMwN,EAAE5B,GAAI4B,EAAE1B,GAAI0B,EAAExB,GAAIwB,EAAEtB,IAEvC,OAAO/W,IACT,EXmDA2X,GAAU3L,EFnEK,SAAS9D,GACtB,OAAO5F,UAAUZ,QAAU1B,KAAKiX,GAAK/O,EAAGlI,MAAQA,KAAKiX,EACvD,EEkEAU,GAAU3P,EDpEK,SAASE,GACtB,OAAO5F,UAAUZ,QAAU1B,KAAKkX,GAAKhP,EAAGlI,MAAQA,KAAKkX,EACvD,EaNA,IAAIiC,GAAO,CAAC3R,MAAO,QAEnB,SAAS4R,KACP,IAAK,IAAyCxS,EAArCpF,EAAI,EAAGiE,EAAInD,UAAUZ,OAAQwG,EAAI,CAAC,EAAM1G,EAAIiE,IAAKjE,EAAG,CAC3D,KAAMoF,EAAItE,UAAUd,GAAK,KAAQoF,KAAKsB,GAAM,QAAQmR,KAAKzS,GAAI,MAAM,IAAIvC,MAAM,iBAAmBuC,GAChGsB,EAAEtB,GAAK,EACT,CACA,OAAO,IAAI0S,GAASpR,EACtB,CAEA,SAASoR,GAASpR,GAChBlI,KAAKkI,EAAIA,CACX,CAoDA,SAASjC,GAAIjC,EAAMhD,GACjB,IAAK,IAA4B0C,EAAxBlC,EAAI,EAAGiE,EAAIzB,EAAKtC,OAAWF,EAAIiE,IAAKjE,EAC3C,IAAKkC,EAAIM,EAAKxC,IAAIR,OAASA,EACzB,OAAO0C,EAAE8D,KAGf,CAEA,SAASsF,GAAI9I,EAAMhD,EAAMiY,GACvB,IAAK,IAAIzX,EAAI,EAAGiE,EAAIzB,EAAKtC,OAAQF,EAAIiE,IAAKjE,EACxC,GAAIwC,EAAKxC,GAAGR,OAASA,EAAM,CACzBgD,EAAKxC,GAAK2X,GAAMnV,EAAOA,EAAK7C,MAAM,EAAGK,GAAGH,OAAO2C,EAAK7C,MAAMK,EAAI,IAC9D,KACF,CAGF,OADgB,MAAZyX,GAAkBjV,EAAKxD,KAAK,CAACQ,KAAMA,EAAMwG,MAAOyR,IAC7CjV,CACT,CA1DAsV,GAAS9Z,UAAY4Z,GAAS5Z,UAAY,CACxCkH,YAAa4S,GACb3W,GAAI,SAAS4W,EAAUN,GACrB,IAEIrS,EAd2B4S,EAY3BtR,EAAIlI,KAAKkI,EACTuR,GAb2BD,EAaOtR,GAAfqR,EAAW,IAZnBG,OAAOC,MAAM,SAAS9M,KAAI,SAASjG,GAClD,IAAI5F,EAAO,GAAIQ,EAAIoF,EAAEG,QAAQ,KAE7B,GADIvF,GAAK,IAAGR,EAAO4F,EAAEzF,MAAMK,EAAI,GAAIoF,EAAIA,EAAEzF,MAAM,EAAGK,IAC9CoF,IAAM4S,EAAM/Z,eAAemH,GAAI,MAAM,IAAIvC,MAAM,iBAAmBuC,GACtE,MAAO,CAAC5C,KAAM4C,EAAG5F,KAAMA,EACzB,KASMQ,GAAK,EACLiE,EAAIgU,EAAE/X,OAGV,KAAIY,UAAUZ,OAAS,GAAvB,CAOA,GAAgB,MAAZuX,GAAwC,mBAAbA,EAAyB,MAAM,IAAI5U,MAAM,qBAAuB4U,GAC/F,OAASzX,EAAIiE,GACX,GAAImB,GAAK2S,EAAWE,EAAEjY,IAAIwC,KAAMkE,EAAEtB,GAAKkG,GAAI5E,EAAEtB,GAAI2S,EAASvY,KAAMiY,QAC3D,GAAgB,MAAZA,EAAkB,IAAKrS,KAAKsB,EAAGA,EAAEtB,GAAKkG,GAAI5E,EAAEtB,GAAI2S,EAASvY,KAAM,MAG1E,OAAOhB,IAVP,CAFE,OAASwB,EAAIiE,OAAQmB,GAAK2S,EAAWE,EAAEjY,IAAIwC,QAAU4C,EAAIX,GAAIiC,EAAEtB,GAAI2S,EAASvY,OAAQ,OAAO4F,CAa/F,EACA8Q,KAAM,WACJ,IAAIA,EAAO,CAAC,EAAGxP,EAAIlI,KAAKkI,EACxB,IAAK,IAAItB,KAAKsB,EAAGwP,EAAK9Q,GAAKsB,EAAEtB,GAAGzF,QAChC,OAAO,IAAImY,GAAS5B,EACtB,EACAxW,KAAM,SAAS8C,EAAM4V,GACnB,IAAKnU,EAAInD,UAAUZ,OAAS,GAAK,EAAG,IAAK,IAAgC+D,EAAGmB,EAA/BxE,EAAO,IAAIR,MAAM6D,GAAIjE,EAAI,EAASA,EAAIiE,IAAKjE,EAAGY,EAAKZ,GAAKc,UAAUd,EAAI,GACnH,IAAKxB,KAAKkI,EAAEzI,eAAeuE,GAAO,MAAM,IAAIK,MAAM,iBAAmBL,GACrE,IAAuBxC,EAAI,EAAGiE,GAAzBmB,EAAI5G,KAAKkI,EAAElE,IAAoBtC,OAAQF,EAAIiE,IAAKjE,EAAGoF,EAAEpF,GAAGgG,MAAM/E,MAAMmX,EAAMxX,EACjF,EACAK,MAAO,SAASuB,EAAM4V,EAAMxX,GAC1B,IAAKpC,KAAKkI,EAAEzI,eAAeuE,GAAO,MAAM,IAAIK,MAAM,iBAAmBL,GACrE,IAAK,IAAI4C,EAAI5G,KAAKkI,EAAElE,GAAOxC,EAAI,EAAGiE,EAAImB,EAAElF,OAAQF,EAAIiE,IAAKjE,EAAGoF,EAAEpF,GAAGgG,MAAM/E,MAAMmX,EAAMxX,EACrF,GAsBF,YCnFA,IAIIyX,GACAC,GALA,GAAQ,EACRC,GAAU,EACVC,GAAW,EACXC,GAAY,IAGZC,GAAY,EACZC,GAAW,EACXC,GAAY,EACZC,GAA+B,iBAAhBC,aAA4BA,YAAYC,IAAMD,YAAclM,KAC3EoM,GAA6B,iBAAX3H,QAAuBA,OAAO4H,sBAAwB5H,OAAO4H,sBAAsBC,KAAK7H,QAAU,SAAS3O,GAAKyW,WAAWzW,EAAG,GAAK,EAElJ,SAASqW,KACd,OAAOJ,KAAaK,GAASI,IAAWT,GAAWE,GAAME,MAAQH,GACnE,CAEA,SAASQ,KACPT,GAAW,CACb,CAEO,SAASU,KACd7a,KAAK8a,MACL9a,KAAK+a,MACL/a,KAAKgb,MAAQ,IACf,CAyBO,SAASC,GAAMhC,EAAUiC,EAAOC,GACrC,IAAIvU,EAAI,IAAIiU,GAEZ,OADAjU,EAAEwU,QAAQnC,EAAUiC,EAAOC,GACpBvU,CACT,CAaA,SAASyU,KACPlB,IAAYD,GAAYG,GAAME,OAASH,GACvC,GAAQL,GAAU,EAClB,KAdK,WACLQ,OACE,GAEF,IADA,IAAkB1W,EAAd+C,EAAIiT,GACDjT,IACA/C,EAAIsW,GAAWvT,EAAEmU,QAAU,GAAGnU,EAAEkU,MAAM5Z,UAAKsB,EAAWqB,GAC3D+C,EAAIA,EAAEoU,QAEN,EACJ,CAMIM,EACF,CAAE,QACA,GAAQ,EAWZ,WAEE,IADA,IAAIC,EAAmBC,EAAfC,EAAK5B,GAAcsB,EAAO9Q,IAC3BoR,GACDA,EAAGX,OACDK,EAAOM,EAAGV,QAAOI,EAAOM,EAAGV,OAC/BQ,EAAKE,EAAIA,EAAKA,EAAGT,QAEjBQ,EAAKC,EAAGT,MAAOS,EAAGT,MAAQ,KAC1BS,EAAKF,EAAKA,EAAGP,MAAQQ,EAAK3B,GAAW2B,GAGzC1B,GAAWyB,EACXG,GAAMP,EACR,CAvBIQ,GACAxB,GAAW,CACb,CACF,CAEA,SAASyB,KACP,IAAIrB,EAAMF,GAAME,MAAOW,EAAQX,EAAML,GACjCgB,EAAQjB,KAAWG,IAAac,EAAOhB,GAAYK,EACzD,CAiBA,SAASmB,GAAMP,GACT,KACApB,KAASA,GAAU8B,aAAa9B,KACxBoB,EAAOhB,GACP,IACNgB,EAAO9Q,MAAU0P,GAAUY,WAAWU,GAAMF,EAAOd,GAAME,MAAQH,KACjEJ,KAAUA,GAAW8B,cAAc9B,OAElCA,KAAUE,GAAYG,GAAME,MAAOP,GAAW+B,YAAYH,GAAM3B,KACrE,GAAQ,EAAGO,GAASa,KAExB,CAnFAR,GAAMrb,UAAYyb,GAAMzb,UAAY,CAClCkH,YAAamU,GACbO,QAAS,SAASnC,EAAUiC,EAAOC,GACjC,GAAwB,mBAAblC,EAAyB,MAAM,IAAI7Y,UAAU,8BACxD+a,GAAgB,MAARA,EAAeZ,MAASY,IAAkB,MAATD,EAAgB,GAAKA,GACzDlb,KAAKgb,OAASlB,KAAa9Z,OAC1B8Z,GAAUA,GAASkB,MAAQhb,KAC1B6Z,GAAW7Z,KAChB8Z,GAAW9Z,MAEbA,KAAK8a,MAAQ7B,EACbjZ,KAAK+a,MAAQI,EACbO,IACF,EACAhI,KAAM,WACA1T,KAAK8a,QACP9a,KAAK8a,MAAQ,KACb9a,KAAK+a,MAAQ1Q,IACbqR,KAEJ,GC7CF,MAAMzW,GAAI,QACJvB,GAAI,WACJoF,GAAI,WCCH,SAAS,GAAEhF,GAChB,OAAOA,EAAEkI,CACX,CAEO,SAAS,GAAElI,GAChB,OAAOA,EAAEkE,CACX,CAEA,IAAIgU,GAAgB,GAChBC,GAAehO,KAAKmC,IAAM,EAAInC,KAAKC,KAAK,IAE7B,YAASzD,GACtB,IAAIyR,EACAC,EAAQ,EACRC,EAAW,KACXC,EAAa,EAAIpO,KAAKqO,IAAIF,EAAU,EAAI,KACxCG,EAAc,EACdC,EAAgB,GAChBC,EAAS,IAAIC,IACbC,EAAU1B,GAAMxT,GAChBtH,EAAQ,GAAS,OAAQ,OACzBuO,EDpBS,WACb,IAAI7H,EAAI,EACR,MAAO,KAAOA,GAAK5B,GAAI4B,EAAInD,IAAKoF,IAAKA,EACvC,CCiBe8T,GAIb,SAASnV,IACPoV,IACA1c,EAAMe,KAAK,OAAQgb,GACfC,EAAQC,IACVO,EAAQjJ,OACRvT,EAAMe,KAAK,MAAOgb,GAEtB,CAEA,SAASW,EAAKvJ,GACZ,IAAI9R,EAAqBqJ,EAAlBpF,EAAIgF,EAAM/I,YAEEc,IAAf8Q,IAA0BA,EAAa,GAE3C,IAAK,IAAIhJ,EAAI,EAAGA,EAAIgJ,IAAchJ,EAOhC,IANA6R,IAAUI,EAAcJ,GAASE,EAEjCI,EAAO3X,SAAQ,SAASgY,GACtBA,EAAMX,EACR,IAEK3a,EAAI,EAAGA,EAAIiE,IAAKjE,EAEJ,OADfqJ,EAAOJ,EAAMjJ,IACJub,GAAYlS,EAAKmB,GAAKnB,EAAKmS,IAAMR,GACrC3R,EAAKmB,EAAInB,EAAKkS,GAAIlS,EAAKmS,GAAK,GAClB,MAAXnS,EAAKoS,GAAYpS,EAAK7C,GAAK6C,EAAKqS,IAAMV,GACrC3R,EAAK7C,EAAI6C,EAAKoS,GAAIpS,EAAKqS,GAAK,GAIrC,OAAOhB,CACT,CAEA,SAASiB,IACP,IAAK,IAA6BtS,EAAzBrJ,EAAI,EAAGiE,EAAIgF,EAAM/I,OAAcF,EAAIiE,IAAKjE,EAAG,CAIlD,IAHAqJ,EAAOJ,EAAMjJ,IAAS4b,MAAQ5b,EACf,MAAXqJ,EAAKkS,KAAYlS,EAAKmB,EAAInB,EAAKkS,IACpB,MAAXlS,EAAKoS,KAAYpS,EAAK7C,EAAI6C,EAAKoS,IAC/BlT,MAAMc,EAAKmB,IAAMjC,MAAMc,EAAK7C,GAAI,CAClC,IAAI+H,EAASiM,GAAgB/N,KAAKC,KAAK,GAAM1M,GAAIyQ,EAAQzQ,EAAIya,GAC7DpR,EAAKmB,EAAI+D,EAAS9B,KAAKkE,IAAIF,GAC3BpH,EAAK7C,EAAI+H,EAAS9B,KAAKmE,IAAIH,EAC7B,EACIlI,MAAMc,EAAKmS,KAAOjT,MAAMc,EAAKqS,OAC/BrS,EAAKmS,GAAKnS,EAAKqS,GAAK,EAExB,CACF,CAEA,SAASG,EAAgBP,GAEvB,OADIA,EAAMQ,YAAYR,EAAMQ,WAAW7S,EAAOiE,GACvCoO,CACT,CAIA,OA1Da,MAATrS,IAAeA,EAAQ,IAwD3B0S,IAEOjB,EAAa,CAClBW,KAAMA,EAENzB,QAAS,WACP,OAAOuB,EAAQvB,QAAQ3T,GAAOyU,CAChC,EAEAxI,KAAM,WACJ,OAAOiJ,EAAQjJ,OAAQwI,CACzB,EAEAzR,MAAO,SAASvC,GACd,OAAO5F,UAAUZ,QAAU+I,EAAQvC,EAAGiV,IAAmBV,EAAO3X,QAAQuY,GAAkBnB,GAAczR,CAC1G,EAEA0R,MAAO,SAASjU,GACd,OAAO5F,UAAUZ,QAAUya,GAASjU,EAAGgU,GAAcC,CACvD,EAEAC,SAAU,SAASlU,GACjB,OAAO5F,UAAUZ,QAAU0a,GAAYlU,EAAGgU,GAAcE,CAC1D,EAEAC,WAAY,SAASnU,GACnB,OAAO5F,UAAUZ,QAAU2a,GAAcnU,EAAGgU,IAAeG,CAC7D,EAEAE,YAAa,SAASrU,GACpB,OAAO5F,UAAUZ,QAAU6a,GAAerU,EAAGgU,GAAcK,CAC7D,EAEAC,cAAe,SAAStU,GACtB,OAAO5F,UAAUZ,QAAU8a,EAAgB,EAAItU,EAAGgU,GAAc,EAAIM,CACtE,EAEAe,aAAc,SAASrV,GACrB,OAAO5F,UAAUZ,QAAUgN,EAASxG,EAAGuU,EAAO3X,QAAQuY,GAAkBnB,GAAcxN,CACxF,EAEAoO,MAAO,SAAS9b,EAAMkH,GACpB,OAAO5F,UAAUZ,OAAS,GAAW,MAALwG,EAAYuU,EAAOe,OAAOxc,GAAQyb,EAAO3P,IAAI9L,EAAMqc,EAAgBnV,IAAMgU,GAAcO,EAAOxW,IAAIjF,EACpI,EAEAuL,KAAM,SAASP,EAAGhE,EAAG+H,GACnB,IAEI0I,EACAC,EACAC,EACA9N,EACA4S,EANAjc,EAAI,EACJiE,EAAIgF,EAAM/I,OAUd,IAHc,MAAVqO,EAAgBA,EAAS1F,IACxB0F,GAAUA,EAEVvO,EAAI,EAAGA,EAAIiE,IAAKjE,GAInBmX,GAFAF,EAAKzM,GADLnB,EAAOJ,EAAMjJ,IACCwK,GAEJyM,GADVC,EAAK1Q,EAAI6C,EAAK7C,GACM0Q,GACX3I,IAAQ0N,EAAU5S,EAAMkF,EAAS4I,GAG5C,OAAO8E,CACT,EAEA9a,GAAI,SAAS3B,EAAMkH,GACjB,OAAO5F,UAAUZ,OAAS,GAAKvB,EAAMwC,GAAG3B,EAAMkH,GAAIgU,GAAc/b,EAAMwC,GAAG3B,EAC3E,EAEJ,CCtJe,cACb,IAAIyJ,EACAI,EACA6D,EACAyN,EAEAuB,EADAC,EAAWC,IAAU,IAErBC,EAAe,EACfC,EAAezT,IACf0T,EAAS,IAEb,SAASjB,EAAM5U,GACb,IAAI1G,EAAGiE,EAAIgF,EAAM/I,OAAQuU,EAAOoB,GAAS5M,EAAO,GAAG,IAAGyO,WAAW8E,GACjE,IAAK7B,EAAQjU,EAAG1G,EAAI,EAAGA,EAAIiE,IAAKjE,EAAGqJ,EAAOJ,EAAMjJ,GAAIyU,EAAKgC,MAAMxV,EACjE,CAEA,SAAS6a,IACP,GAAK7S,EAAL,CACA,IAAIjJ,EAAqBqJ,EAAlBpF,EAAIgF,EAAM/I,OAEjB,IADAgc,EAAY,IAAI9b,MAAM6D,GACjBjE,EAAI,EAAGA,EAAIiE,IAAKjE,EAAGqJ,EAAOJ,EAAMjJ,GAAIkc,EAAU7S,EAAKuS,QAAUO,EAAS9S,EAAMrJ,EAAGiJ,EAHlE,CAIpB,CAEA,SAASuT,EAAWC,GAClB,IAAkB5F,EAAG3U,EAAesI,EAAGhE,EAAGxG,EAAtCmc,EAAW,EAASO,EAAS,EAGjC,GAAID,EAAKvc,OAAQ,CACf,IAAKsK,EAAIhE,EAAIxG,EAAI,EAAGA,EAAI,IAAKA,GACtB6W,EAAI4F,EAAKzc,MAAQkC,EAAIuK,KAAKmH,IAAIiD,EAAE7Q,UACnCmW,GAAYtF,EAAE7Q,MAAO0W,GAAUxa,EAAGsI,GAAKtI,EAAI2U,EAAErM,EAAGhE,GAAKtE,EAAI2U,EAAErQ,GAG/DiW,EAAKjS,EAAIA,EAAIkS,EACbD,EAAKjW,EAAIA,EAAIkW,CACf,KAGK,EACH7F,EAAI4F,GACFjS,EAAIqM,EAAEtU,KAAKiI,EACbqM,EAAErQ,EAAIqQ,EAAEtU,KAAKiE,EACb,GAAG2V,GAAYD,EAAUrF,EAAEtU,KAAKqZ,aACzB/E,EAAIA,EAAE3Q,KACf,CAEAuW,EAAKzW,MAAQmW,CACf,CAEA,SAASlb,EAAMwb,EAAMpH,EAAI3O,EAAGiQ,GAC1B,IAAK8F,EAAKzW,MAAO,OAAO,EAExB,IAAIwE,EAAIiS,EAAKjS,EAAInB,EAAKmB,EAClBhE,EAAIiW,EAAKjW,EAAI6C,EAAK7C,EAClB7E,EAAIgV,EAAKtB,EACTpV,EAAIuK,EAAIA,EAAIhE,EAAIA,EAIpB,GAAI7E,EAAIA,EAAI4a,EAAStc,EAQnB,OAPIA,EAAIqc,IACI,IAAN9R,IAA6BvK,IAApBuK,EAAImS,GAAOzP,IAAkB1C,GAChC,IAANhE,IAA6BvG,IAApBuG,EAAImW,GAAOzP,IAAkB1G,GACtCvG,EAAIoc,IAAcpc,EAAIwM,KAAKC,KAAK2P,EAAepc,IACnDoJ,EAAKmS,IAAMhR,EAAIiS,EAAKzW,MAAQ2U,EAAQ1a,EACpCoJ,EAAKqS,IAAMlV,EAAIiW,EAAKzW,MAAQ2U,EAAQ1a,IAE/B,EAIJ,KAAIwc,EAAKvc,QAAUD,GAAKqc,GAAxB,EAGDG,EAAKla,OAAS8G,GAAQoT,EAAKvW,QACnB,IAANsE,IAA6BvK,IAApBuK,EAAImS,GAAOzP,IAAkB1C,GAChC,IAANhE,IAA6BvG,IAApBuG,EAAImW,GAAOzP,IAAkB1G,GACtCvG,EAAIoc,IAAcpc,EAAIwM,KAAKC,KAAK2P,EAAepc,KAGrD,GAAOwc,EAAKla,OAAS8G,IACnB1H,EAAIua,EAAUO,EAAKla,KAAKqZ,OAASjB,EAAQ1a,EACzCoJ,EAAKmS,IAAMhR,EAAI7I,EACf0H,EAAKqS,IAAMlV,EAAI7E,SACR8a,EAAOA,EAAKvW,KAb4B,CAcnD,CAwBA,OAtBAoV,EAAMQ,WAAa,SAASc,EAAQC,GAClC5T,EAAQ2T,EACR1P,EAAS2P,EACTf,GACF,EAEAR,EAAMa,SAAW,SAASzV,GACxB,OAAO5F,UAAUZ,QAAUic,EAAwB,mBAANzV,EAAmBA,EAAI0V,IAAU1V,GAAIoV,IAAcR,GAASa,CAC3G,EAEAb,EAAMwB,YAAc,SAASpW,GAC3B,OAAO5F,UAAUZ,QAAUmc,EAAe3V,EAAIA,EAAG4U,GAAS7O,KAAKC,KAAK2P,EACtE,EAEAf,EAAMyB,YAAc,SAASrW,GAC3B,OAAO5F,UAAUZ,QAAUoc,EAAe5V,EAAIA,EAAG4U,GAAS7O,KAAKC,KAAK4P,EACtE,EAEAhB,EAAM9G,MAAQ,SAAS9N,GACrB,OAAO5F,UAAUZ,QAAUqc,EAAS7V,EAAIA,EAAG4U,GAAS7O,KAAKC,KAAK6P,EAChE,EAEOjB,CACT,CChHA,SAASM,GAAMtZ,GACb,OAAOA,EAAEsZ,KACX,CAEA,SAAS,GAAKoB,EAAUlR,GACtB,IAAIzC,EAAO2T,EAASvY,IAAIqH,GACxB,IAAKzC,EAAM,MAAM,IAAIxG,MAAM,mBAAqBiJ,GAChD,OAAOzC,CACT,CAEe,YAAS4T,GACtB,IAEIf,EAEAgB,EACAjU,EACAkU,EACAC,EACAlQ,EARAzK,EAAKmZ,GACLO,EAYJ,SAAyBkB,GACvB,OAAO,EAAI5Q,KAAKoD,IAAIsN,EAAME,EAAK/T,OAAOsS,OAAQuB,EAAME,EAAK9T,OAAOqS,OAClE,EAZI0B,EAAWlB,GAAS,IAMpBtK,EAAa,EAQjB,SAASwJ,EAAMX,GACb,IAAK,IAAI7R,EAAI,EAAG7E,EAAIgZ,EAAM/c,OAAQ4I,EAAIgJ,IAAchJ,EAClD,IAAK,IAAWuU,EAAM/T,EAAQC,EAAQiB,EAAGhE,EAAGvG,EAAGyD,EAAtC1D,EAAI,EAAqCA,EAAIiE,IAAKjE,EACxCsJ,GAAjB+T,EAAOJ,EAAMjd,IAAkBsJ,OAC/BkB,GADuCjB,EAAS8T,EAAK9T,QAC1CiB,EAAIjB,EAAOiS,GAAKlS,EAAOkB,EAAIlB,EAAOkS,IAAMmB,GAAOzP,GAC1D1G,EAAI+C,EAAO/C,EAAI+C,EAAOmS,GAAKpS,EAAO9C,EAAI8C,EAAOoS,IAAMiB,GAAOzP,GAG1D1C,GADAvK,IADAA,EAAIwM,KAAKC,KAAKlC,EAAIA,EAAIhE,EAAIA,IACjB0W,EAAUld,IAAMC,EAAI0a,EAAQuB,EAAUlc,GACvCwG,GAAKvG,EACbsJ,EAAOiS,IAAMhR,GAAK9G,EAAI0Z,EAAKpd,IAC3BuJ,EAAOmS,IAAMlV,EAAI9C,EACjB4F,EAAOkS,IAAMhR,GAAK9G,EAAI,EAAIA,GAC1B4F,EAAOoS,IAAMlV,EAAI9C,CAGvB,CAEA,SAASoY,IACP,GAAK7S,EAAL,CAEA,IAAIjJ,EAIAqd,EAHApZ,EAAIgF,EAAM/I,OACVoH,EAAI2V,EAAM/c,OACV8c,EAAW,IAAI9B,IAAIjS,EAAMoC,KAAI,CAAC/I,EAAGtC,IAAM,CAACyC,EAAGH,EAAGtC,EAAGiJ,GAAQ3G,MAG7D,IAAKtC,EAAI,EAAGmd,EAAQ,IAAI/c,MAAM6D,GAAIjE,EAAIsH,IAAKtH,GACzCqd,EAAOJ,EAAMjd,IAAS4b,MAAQ5b,EACH,iBAAhBqd,EAAK/T,SAAqB+T,EAAK/T,OAAS,GAAK0T,EAAUK,EAAK/T,SAC5C,iBAAhB+T,EAAK9T,SAAqB8T,EAAK9T,OAAS,GAAKyT,EAAUK,EAAK9T,SACvE4T,EAAME,EAAK/T,OAAOsS,QAAUuB,EAAME,EAAK/T,OAAOsS,QAAU,GAAK,EAC7DuB,EAAME,EAAK9T,OAAOqS,QAAUuB,EAAME,EAAK9T,OAAOqS,QAAU,GAAK,EAG/D,IAAK5b,EAAI,EAAGod,EAAO,IAAIhd,MAAMkH,GAAItH,EAAIsH,IAAKtH,EACxCqd,EAAOJ,EAAMjd,GAAIod,EAAKpd,GAAKmd,EAAME,EAAK/T,OAAOsS,QAAUuB,EAAME,EAAK/T,OAAOsS,OAASuB,EAAME,EAAK9T,OAAOqS,QAGtGM,EAAY,IAAI9b,MAAMkH,GAAIiW,IAC1BL,EAAY,IAAI9c,MAAMkH,GAAIkW,GArBR,CAsBpB,CAEA,SAASD,IACP,GAAKtU,EAEL,IAAK,IAAIjJ,EAAI,EAAGiE,EAAIgZ,EAAM/c,OAAQF,EAAIiE,IAAKjE,EACzCkc,EAAUlc,IAAMmc,EAASc,EAAMjd,GAAIA,EAAGid,EAE1C,CAEA,SAASO,IACP,GAAKvU,EAEL,IAAK,IAAIjJ,EAAI,EAAGiE,EAAIgZ,EAAM/c,OAAQF,EAAIiE,IAAKjE,EACzCkd,EAAUld,IAAMsd,EAASL,EAAMjd,GAAIA,EAAGid,EAE1C,CA4BA,OA1Fa,MAATA,IAAeA,EAAQ,IAgE3B3B,EAAMQ,WAAa,SAASc,EAAQC,GAClC5T,EAAQ2T,EACR1P,EAAS2P,EACTf,GACF,EAEAR,EAAM2B,MAAQ,SAASvW,GACrB,OAAO5F,UAAUZ,QAAU+c,EAAQvW,EAAGoV,IAAcR,GAAS2B,CAC/D,EAEA3B,EAAM7Y,GAAK,SAASiE,GAClB,OAAO5F,UAAUZ,QAAUuC,EAAKiE,EAAG4U,GAAS7Y,CAC9C,EAEA6Y,EAAMxJ,WAAa,SAASpL,GAC1B,OAAO5F,UAAUZ,QAAU4R,GAAcpL,EAAG4U,GAASxJ,CACvD,EAEAwJ,EAAMa,SAAW,SAASzV,GACxB,OAAO5F,UAAUZ,QAAUic,EAAwB,mBAANzV,EAAmBA,EAAI0V,IAAU1V,GAAI6W,IAAsBjC,GAASa,CACnH,EAEAb,EAAMgC,SAAW,SAAS5W,GACxB,OAAO5F,UAAUZ,QAAUod,EAAwB,mBAAN5W,EAAmBA,EAAI0V,IAAU1V,GAAI8W,IAAsBlC,GAASgC,CACnH,EAEOhC,CACT,CChHA,SAAS,GAAEhZ,GACT,OAAOA,EAAEkI,EAAIlI,EAAEkZ,EACjB,CAEA,SAAS,GAAElZ,GACT,OAAOA,EAAEkE,EAAIlE,EAAEoZ,EACjB,CAEe,YAASnN,GACtB,IAAItF,EACAwU,EACAvQ,EACAiP,EAAW,EACXrK,EAAa,EAIjB,SAASwJ,IASP,IARA,IAAItb,EACAyU,EACApL,EACAqU,EACAC,EACAC,EACAC,EANG5Z,EAAIgF,EAAM/I,OAQR4I,EAAI,EAAGA,EAAIgJ,IAAchJ,EAEhC,IADA2L,EAAOoB,GAAS5M,EAAO,GAAG,IAAGyO,WAAWoG,GACnC9d,EAAI,EAAGA,EAAIiE,IAAKjE,EACnBqJ,EAAOJ,EAAMjJ,GACb4d,EAAKH,EAAMpU,EAAKuS,OAAQiC,EAAMD,EAAKA,EACnCF,EAAKrU,EAAKmB,EAAInB,EAAKmS,GACnBmC,EAAKtU,EAAK7C,EAAI6C,EAAKqS,GACnBjH,EAAKgC,MAAMxV,GAIf,SAASA,EAAMwb,EAAMxH,EAAIE,EAAIE,EAAIE,GAC/B,IAAIhT,EAAOka,EAAKla,KAAMwb,EAAKtB,EAAKlV,EAAGA,EAAIqW,EAAKG,EAC5C,IAAIxb,EAiBJ,OAAO0S,EAAKyI,EAAKnW,GAAK8N,EAAKqI,EAAKnW,GAAK4N,EAAKwI,EAAKpW,GAAKgO,EAAKoI,EAAKpW,EAhB5D,GAAIhF,EAAKqZ,MAAQvS,EAAKuS,MAAO,CAC3B,IAAIpR,EAAIkT,EAAKnb,EAAKiI,EAAIjI,EAAKiZ,GACvBhV,EAAImX,EAAKpb,EAAKiE,EAAIjE,EAAKmZ,GACvBzb,EAAIuK,EAAIA,EAAIhE,EAAIA,EAChBvG,EAAIsH,EAAIA,IACA,IAANiD,IAA6BvK,IAApBuK,EAAImS,GAAOzP,IAAkB1C,GAChC,IAANhE,IAA6BvG,IAApBuG,EAAImW,GAAOzP,IAAkB1G,GAC1CvG,GAAKsH,GAAKtH,EAAIwM,KAAKC,KAAKzM,KAAOA,EAAIkc,EACnC9S,EAAKmS,KAAOhR,GAAKvK,IAAMsH,GAAKwW,GAAMA,IAAOF,EAAME,IAC/C1U,EAAKqS,KAAOlV,GAAKvG,GAAKsH,EACtBhF,EAAKiZ,IAAMhR,GAAKjD,EAAI,EAAIA,GACxBhF,EAAKmZ,IAAMlV,EAAIe,EAEnB,CAIJ,CACF,CAEA,SAASuW,EAAQrB,GACf,GAAIA,EAAKla,KAAM,OAAOka,EAAKlV,EAAIkW,EAAMhB,EAAKla,KAAKqZ,OAC/C,IAAK,IAAI5b,EAAIyc,EAAKlV,EAAI,EAAGvH,EAAI,IAAKA,EAC5Byc,EAAKzc,IAAMyc,EAAKzc,GAAGuH,EAAIkV,EAAKlV,IAC9BkV,EAAKlV,EAAIkV,EAAKzc,GAAGuH,EAGvB,CAEA,SAASuU,IACP,GAAK7S,EAAL,CACA,IAAIjJ,EAAqBqJ,EAAlBpF,EAAIgF,EAAM/I,OAEjB,IADAud,EAAQ,IAAIrd,MAAM6D,GACbjE,EAAI,EAAGA,EAAIiE,IAAKjE,EAAGqJ,EAAOJ,EAAMjJ,GAAIyd,EAAMpU,EAAKuS,QAAUrN,EAAOlF,EAAMrJ,EAAGiJ,EAH5D,CAIpB,CAoBA,MA/EsB,mBAAXsF,IAAuBA,EAAS6N,GAAmB,MAAV7N,EAAiB,GAAKA,IA6D1E+M,EAAMQ,WAAa,SAASc,EAAQC,GAClC5T,EAAQ2T,EACR1P,EAAS2P,EACTf,GACF,EAEAR,EAAMxJ,WAAa,SAASpL,GAC1B,OAAO5F,UAAUZ,QAAU4R,GAAcpL,EAAG4U,GAASxJ,CACvD,EAEAwJ,EAAMa,SAAW,SAASzV,GACxB,OAAO5F,UAAUZ,QAAUic,GAAYzV,EAAG4U,GAASa,CACrD,EAEAb,EAAM/M,OAAS,SAAS7H,GACtB,OAAO5F,UAAUZ,QAAUqO,EAAsB,mBAAN7H,EAAmBA,EAAI0V,IAAU1V,GAAIoV,IAAcR,GAAS/M,CACzG,EAEO+M,CACT,CCjGe,YAAS9Q,GACtB,IACIvB,EACAiT,EACA5F,EAHA6F,EAAWC,GAAS,IAOxB,SAASd,EAAMX,GACb,IAAK,IAA6BtR,EAAzBrJ,EAAI,EAAGiE,EAAIgF,EAAM/I,OAAcF,EAAIiE,IAAKjE,GAC/CqJ,EAAOJ,EAAMjJ,IAASwb,KAAOlF,EAAGtW,GAAKqJ,EAAKmB,GAAK0R,EAAUlc,GAAK2a,CAElE,CAEA,SAASmB,IACP,GAAK7S,EAAL,CACA,IAAIjJ,EAAGiE,EAAIgF,EAAM/I,OAGjB,IAFAgc,EAAY,IAAI9b,MAAM6D,GACtBqS,EAAK,IAAIlW,MAAM6D,GACVjE,EAAI,EAAGA,EAAIiE,IAAKjE,EACnBkc,EAAUlc,GAAKuI,MAAM+N,EAAGtW,IAAMwK,EAAEvB,EAAMjJ,GAAIA,EAAGiJ,IAAU,GAAKkT,EAASlT,EAAMjJ,GAAIA,EAAGiJ,EALlE,CAOpB,CAeA,MA/BiB,mBAANuB,IAAkBA,EAAI4R,GAAc,MAAL5R,EAAY,GAAKA,IAkB3D8Q,EAAMQ,WAAa,SAASpV,GAC1BuC,EAAQvC,EACRoV,GACF,EAEAR,EAAMa,SAAW,SAASzV,GACxB,OAAO5F,UAAUZ,QAAUic,EAAwB,mBAANzV,EAAmBA,EAAI0V,IAAU1V,GAAIoV,IAAcR,GAASa,CAC3G,EAEAb,EAAM9Q,EAAI,SAAS9D,GACjB,OAAO5F,UAAUZ,QAAUsK,EAAiB,mBAAN9D,EAAmBA,EAAI0V,IAAU1V,GAAIoV,IAAcR,GAAS9Q,CACpG,EAEO8Q,CACT,CCtCe,YAAS9U,GACtB,IACIyC,EACAiT,EACA3F,EAHA4F,EAAWC,GAAS,IAOxB,SAASd,EAAMX,GACb,IAAK,IAA6BtR,EAAzBrJ,EAAI,EAAGiE,EAAIgF,EAAM/I,OAAcF,EAAIiE,IAAKjE,GAC/CqJ,EAAOJ,EAAMjJ,IAAS0b,KAAOnF,EAAGvW,GAAKqJ,EAAK7C,GAAK0V,EAAUlc,GAAK2a,CAElE,CAEA,SAASmB,IACP,GAAK7S,EAAL,CACA,IAAIjJ,EAAGiE,EAAIgF,EAAM/I,OAGjB,IAFAgc,EAAY,IAAI9b,MAAM6D,GACtBsS,EAAK,IAAInW,MAAM6D,GACVjE,EAAI,EAAGA,EAAIiE,IAAKjE,EACnBkc,EAAUlc,GAAKuI,MAAMgO,EAAGvW,IAAMwG,EAAEyC,EAAMjJ,GAAIA,EAAGiJ,IAAU,GAAKkT,EAASlT,EAAMjJ,GAAIA,EAAGiJ,EALlE,CAOpB,CAeA,MA/BiB,mBAANzC,IAAkBA,EAAI4V,GAAc,MAAL5V,EAAY,GAAKA,IAkB3D8U,EAAMQ,WAAa,SAASpV,GAC1BuC,EAAQvC,EACRoV,GACF,EAEAR,EAAMa,SAAW,SAASzV,GACxB,OAAO5F,UAAUZ,QAAUic,EAAwB,mBAANzV,EAAmBA,EAAI0V,IAAU1V,GAAIoV,IAAcR,GAASa,CAC3G,EAEAb,EAAM9U,EAAI,SAASE,GACjB,OAAO5F,UAAUZ,QAAUsG,EAAiB,mBAANE,EAAmBA,EAAI0V,IAAU1V,GAAIoV,IAAcR,GAAS9U,CACpG,EAEO8U,CACT,CC5Be,SAAS0C,KACtB,SAAS5B,EAAS1V,GAChB,OAAO,WAAM,OAAAA,CAAA,CACf,CAEA,IAqBIuX,EArBAC,EAAU,SAAC5b,GACb,OAAOA,EAAE6b,OACX,EACIC,EAAuDhC,EAAS,GAChEiC,EAAqDjC,GAAU,GAC/DkC,EAA2DlC,EAAS,KACpEmC,EAA2DnC,EAAS,IACpEoC,EAAS,CAAC,EAAG,GAEbvV,EAAiB,GACjBwV,EAAgB,CAAC,EACjBxB,EAAe,GACfyB,EAAU,IACVC,EAAU,IACVC,EAAY,CACdC,KAAM,CACJrU,EAAG,EACHhE,EAAG,IAGHsY,EAAyB,GAEzBC,EAAW,QACXC,GAAiB,EACjB7C,EAAW,GAEf,SAASb,EAAMX,GACb,IAAKqE,EACH,OAAO1D,EAET2C,EAAc5C,OACd4D,IAEA,IAAK,IAAIjf,EAAI,EAAGiE,EAAIgF,EAAM/I,OAAQmJ,OAAI,EAAEP,EAAI6R,EAAQwB,EAAUnc,EAAIiE,IAAKjE,GACrEqJ,EAAOJ,EAAMjJ,IACRwb,KAAOoD,EAAKV,EAAQ7U,IAAOmB,EAAInB,EAAKmB,GAAK1B,EAC9CO,EAAKqS,KAAOkD,EAAKV,EAAQ7U,IAAO7C,EAAI6C,EAAK7C,GAAKsC,CAElD,CAEA,SAASgT,IACF7S,GAIP,WACE,GAAKA,GAAUA,EAAM/I,OAArB,CAIA,QAA0Bc,IAAtBkd,EAAQjV,EAAM,IAChB,MAAMpG,MACJ,4IAMJ,IAqBMqc,EACAC,EACAC,EAEFC,EACAC,EA1BEC,GAqBAL,EAAc,GACdC,EAAc,GACdC,EAAc,CAAC,EAEK,CAAC,EACvBE,EAAqB,GAEzBD,EAoCF,SAAmCpW,GACjC,IAAMoW,EAAsB,CAAC,EAqB7B,OAnBApW,EAAM3F,SAAQ,SAAChB,GACb,IAAM+B,EAAM6Z,EAAQ5b,GACf+c,EAAehb,KAClBgb,EAAehb,GAAO,CACpB8Y,MAAO,EACPqC,iBAAkB,GAGxB,IACAvW,EAAM3F,SAAQ,SAAChB,GACb,IAAM+B,EAAM6Z,EAAQ5b,GACdqL,EAAWyQ,EAAc9b,GACzBmd,EAAWJ,EAAehb,GAChCob,EAAStC,MAAQsC,EAAStC,MAAQ,EAClCsC,EAASD,iBACPC,EAASD,iBAAmB/S,KAAKmC,IAAMjB,EAAWA,GAAY,IAChE0R,EAAehb,GAAOob,CACxB,IAEOJ,CACT,CA3DmBK,CAA0BzW,GAC3CqW,EA4DF,SAAmCrC,GACjC,IAAM0C,EAAqB,CAAC,EACtBC,EAAoB,GA0B1B,OAzBA3C,EAAM3Z,SAAQ,SAACrD,GACb,IA2CgBod,EACZ/T,EACAC,EACAsW,EACAC,EA/CEzb,GA4CFiF,GADY+T,EA3COpd,GA4CLqJ,OACdC,EAAS8T,EAAK9T,QACdsW,EAAW3B,EAAQO,EAASnV,OAC5BwW,EAAW5B,EAAQO,EAASlV,KAG3BsW,EAAQ,IAAIC,EACZA,EAAQ,IAAID,GAlDb1C,EAAQ,OACenc,IAAvB2e,EAActb,KAChB8Y,EAAQwC,EAActb,IAExB8Y,GAAS,EACTwC,EAActb,GAAO8Y,CACvB,IAGgBpf,OAAOgiB,QAAQJ,GAEvBrc,SAAQ,SAAC,G,IAAA,SAACe,EAAG,KAAE8Y,EAAK,KACpB7T,EAASjF,EAAI8T,MAAM,KAAK,GACxB5O,EAASlF,EAAI8T,MAAM,KAAK,QACfnX,IAAXsI,QAAmCtI,IAAXuI,GAC1BqW,EAAa5gB,KAAK,CAChBsK,OAAM,EACNC,OAAM,EACN4T,MAAK,GAGX,IAEOyC,CACT,CAzFkBI,CAA0B/C,GAE3Blf,OAAO+O,KAAKuS,GAEd/b,SAAQ,SAACe,EAAKuX,GACzB,IAAMvT,EAAMgX,EAAehb,GAE3B6a,EAAOlgB,KAAK,CACVyD,GAAI4B,EACJuE,KAAMP,EAAI8U,MACV5V,EAAGkF,KAAKC,KAAKrE,EAAImX,iBAAmB/S,KAAKmC,MAE3CwQ,EAAO/a,GAAOuX,CAChB,IAEA0D,EAAchc,SAAQ,SAAC+Z,GACrB,IAAM4C,EAAiB5C,EAAK/T,OACtB4W,EAAiB7C,EAAK9T,OACtBD,EAAS8V,EAAOa,GAChB1W,EAAS6V,EAAOc,QACPlf,IAAXsI,QAAmCtI,IAAXuI,GAC1B4V,EAAOngB,KAAK,CACVsK,OAAM,EACNC,OAAM,EACN4T,MAAOE,EAAKF,OAGlB,IAEO,CACLlU,MAAOiW,EACPjC,MAAOkC,IA3DTlB,EAAgB,GACGsB,EAAItW,OACpBqS,MAAM,IAAK,GAAeoD,GAASvC,SAAS,KAC5Cb,MAAM,IAAK,GAAeqD,GAASxC,SAAS,KAC5Cb,MAAM,UAAW,IAAqB,SAAChZ,GAAW,OAAAA,EAAEiF,CAAF,IAAKuK,WAAW,IAClEwJ,MAAM,SAAU,KAAwBa,SAASkC,IACjD/C,MACC,QACA,GACaiE,EAAItW,MAAM/I,OAASqf,EAAItC,MAAQ,IACzCK,SAASgB,GACTnC,SAASoC,IAGhBO,EAAgBb,EAAchV,QAE9BgW,G,CACF,CAlCEkB,EACF,CAuIA,SAASlB,IAaP,OAZAL,EAAO,CACLC,KAAM,CACJrU,EAAG,EACHhE,EAAG,IAGPsY,EAAcxb,SAAQ,SAAChB,GACrBsc,EAAKtc,EAAEG,IAAM,CACX+H,EAAGlI,EAAEkI,EAAIgU,EAAO,GAChBhY,EAAGlE,EAAEkE,EAAIgY,EAAO,GAEpB,IACOI,CACT,CA4LA,OApCAtD,EAAMQ,WAAa,SAACpV,GAClBuC,EAAQvC,EACRoV,GACF,EAEAR,EAAMyD,SAzIN,SAAqBvU,GACnB,OAAK1J,UAAUZ,QACf6e,EAAWvU,EACXsR,IACOR,GAHuByD,CAIhC,EAsIAzD,EAAM4C,QApIN,SAAoB1T,GAClB,OAAK1J,UAAUZ,OACE,iBAANsK,GACT0T,EAAU,SAAC5b,GACT,OAAOA,EAAEkI,EACX,EACO8Q,IAET4C,EAAU1T,EACH8Q,GARuB4C,CAShC,EA4HA5C,EAAM0D,eA1HN,SAA2BxU,GACzB,OAAK1J,UAAUZ,QACf8e,EAAiBxU,EACV8Q,GAFuB0D,CAGhC,EAwHA1D,EAAMa,SAtHN,SAAqB3R,GACnB,OAAK1J,UAAUZ,QACfic,EAAW3R,EACJ8Q,GAFuBa,CAGhC,EAoHAb,EAAMoD,QAlHN,SAAoBhY,GAClB,OAAI5F,UAAUZ,QACZwe,EAAUhY,EACH4U,GAGFoD,CACT,EA6GApD,EAAMqD,QA3GN,SAAoBjY,GAClB,OAAI5F,UAAUZ,QACZye,EAAUjY,EACH4U,GAGFqD,CACT,EAsGArD,EAAMrS,MApGN,SAAkBvC,GAChB,OAAI5F,UAAUZ,QAzDhB,SAAqB+I,GACnBwV,EAAW,CAAC,EACZxV,EAAM3F,SAAQ,SAAC+F,GACboV,EAASpV,EAAK5G,IAAM4G,CACtB,GACF,CAqDI+W,CAAY1Z,GAAK,IACjBuC,EAAQvC,GAAK,GACN4U,GAEFrS,CACT,EA+FAqS,EAAM2B,MA7FN,SAAkBvW,GAChB,OAAI5F,UAAUZ,QACZ+c,EAAQvW,GAAK,GACboV,IACOR,GAEF2B,CACT,EAwFA3B,EAAM8C,cAtFN,SAA0B1X,GACxB,OAAI5F,UAAUZ,QAEVke,EADe,mBAAN1X,EACOA,EAEA0V,GAAU1V,GAE5BoV,IACOR,GAGF8C,CACT,EA6EA9C,EAAM3N,SAAW2N,EAAM8C,cAEvB9C,EAAM+C,YA7EN,SAAwB3X,GACtB,OAAI5F,UAAUZ,QAEVme,EADe,mBAAN3X,EACKA,EAEA0V,GAAU1V,GAE1BoV,IACOR,GAGF+C,CACT,EAmEA/C,EAAMgD,kBAjEN,SAA8B5X,GAC5B,OAAI5F,UAAUZ,QAEVoe,EADe,mBAAN5X,EACWA,EAEA0V,GAAU1V,GAEhCoV,IACOR,GAGFgD,CACT,EAuDAhD,EAAMiD,kBArDN,SAA8B7X,GAC5B,OAAI5F,UAAUZ,QAEVqe,EADe,mBAAN7X,EACWA,EAEA0V,GAAU1V,GAEhCoV,IACOR,GAGFiD,CACT,EA2CAjD,EAAMkD,OAzCN,SAAmB9X,GACjB,OAAI5F,UAAUZ,QACZse,EAAS9X,EACF4U,GAGFkD,CACT,EAoCAlD,EAAM+E,SAAWpB,EAEV3D,CACT,CCxXA,IAAM,GAAyD,CAC7DpN,OAAQ,CAAC,EAAG,GACZoE,gBAAgB,EAChB3E,cAAU3M,EACV4M,iBAAa5M,EACbsf,aAAc,GACdC,gBAAiB,KACjB1F,WAAY,KACZD,SAAU,KACVD,MAAO,GACP6F,gBAAiB,EACjBC,YAAY,EACZC,qBAAsB,EACtBC,oBAAqB,GACrBC,oBAAqB,IACrBC,oBAAqB,GACrBC,gBAAiB,IAkBnB,cAYE,WACS7R,QAAA,IAAAA,MAAgC,CAAC,GAAjC,KAAAA,UAVT,KAAAxM,GAAK,UAYHjE,KAAKyQ,QAAU,OACV,IACAA,EAEP,CA6TF,OAxTQ,YAAAC,QAAN,SAAcjB,EAAcgB,G,mEAC1B,MAAO,CAAP,EAAOzQ,KAAKuiB,oBAAmB,EAAO9S,EAAOgB,G,QAKzC,YAAArM,OAAN,SAAaqL,EAAcgB,G,0EACzBzQ,KAAKuiB,oBAAmB,EAAM9S,EAAOgB,G,WAMvC,YAAAiD,KAAA,W,MACsB,QAApB,EAAA1T,KAAK+hB,uBAAe,SAAErO,MACxB,EAMA,YAAAmJ,KAAA,SAAKvJ,GAAL,gBAAK,IAAAA,MAAA,GACHtT,KAAK+hB,gBAAgBlF,KAAKvJ,GAE1B,IAAM/O,EAAS,CACbkG,MAAO+X,GAAexiB,KAAKyiB,iBAC3B/X,MAAOgY,GAAe1iB,KAAK2iB,kBAY7B,OATI3iB,KAAK4iB,YACPre,EAAOkG,MAAM3F,SAAQ,SAAC+F,GACpB,SAAKgY,UAAUhT,cAAchF,EAAK5G,GAAI,CACpC+H,EAAGnB,EAAK9G,KAAKiI,EACbhE,EAAG6C,EAAK9G,KAAKiE,GAFf,IAOGzD,CACT,EAYc,YAAAge,mBAAd,SACEne,EACAqL,EACAgB,G,kIA4CA,OA1CMG,EAAgB,OAAK5Q,KAAKyQ,SAAYA,GAEtChG,EAAQgF,EAAME,cACdjF,EAAQ+E,EAAMG,cACd2B,EAA0B9G,EAAMoC,KACpC,SAAChC,G,QACC,OAAC,OACI0D,EAAgB1D,IAAK,CACxBmB,EAAY,QAAT,EAAAnB,EAAK9G,YAAI,eAAEiI,EACdhE,EAAY,QAAT,EAAA6C,EAAK9G,YAAI,eAAEiE,G,IAGd8a,EAAsBpY,EAAMmC,KAAI,SAACL,GAAS,OAAA+B,EAAgB/B,EAAhB,IAGhDxM,KAAKyiB,gBAAkBlR,EACvBvR,KAAK2iB,gBAAkBG,EACvB9iB,KAAK4iB,WAAaxe,EAClBpE,KAAK6iB,UAAYpT,EAGf2M,EAkBExL,EAAa,SAjBfyL,EAiBEzL,EAAa,WAhBfuL,EAgBEvL,EAAa,MAffmS,EAeEnS,EAAa,aAdfoS,EAcEpS,EAAa,aAbfkR,EAaElR,EAAa,aAZfqR,EAYErR,EAAa,WAXfyR,EAWEzR,EAAa,oBAVfwR,EAUExR,EAAa,oBATfuR,EASEvR,EAAa,oBARfsR,EAQEtR,EAAa,oBAPf0R,EAOE1R,EAAa,gBANf,EAMEA,EAAa,gBANfoR,OAAe,IAAG,IAAC,EACnB,EAKEpR,EAAa,OALflB,OAAM,IAAG,GAAC,EAAG,GAAE,EACfoE,EAIElD,EAAa,eAHfzB,EAGEyB,EAAa,SAFfxB,EAEEwB,EAAa,YADfqS,EACErS,EAAa,OACXmR,EAAoBnR,EAAa,gBAEhC,CAAP,EAAO,IAAI5L,SAAQ,SAACqC,GAClB,GAAK0a,EAiGE,CAEDE,KACIiB,EAAe1D,MACR/U,MAAM8G,GACnB2R,EAAazE,MAAMqE,IAErBf,EAAgBtX,MAAM8G,GAClBuR,IAEIK,EAAY,KAEflf,IAAG,SAACH,GAAW,OAAAA,EAAEG,EAAF,IACfwa,MAAMqE,GACLE,GACFG,EAAUxF,SAASqF,GAEjBlB,GACFqB,EAAUrE,SAASgD,GAErBC,EAAgBjF,MAAM,OAAQqG,IAE5BrP,GACF,EAAKsP,eAAerB,EAAiB,CACnC5S,SAAQ,EACRC,YAAW,EACX4S,gBAAe,IAGnBD,EAAgB5F,MAAMA,GAAOf,UAG7B,IAAMiI,EAAWb,GAAejR,GAC1B+R,EAAWZ,GAAeI,GAE5B1e,GACFif,EAASve,SAAQ,SAAC+F,GAChB,OAAA4E,EAAMI,cAAchF,EAAK5G,GAAI,CAC3B+H,EAAGnB,EAAK9G,KAAKiI,EACbhE,EAAG6C,EAAK9G,KAAKiE,GAFf,IAOJX,EAAQ,CACNoD,MAAO4Y,EACP3Y,MAAO4Y,G,MA9IT,IAEE,IAOQJ,EAPFK,EAAY,KA0ClB,GAzCIR,GACFQ,EAAU5F,SAASoF,GAErBhB,EAAkB,KAA0BtX,MAAM8G,GAE9C0Q,KACIiB,EAAe1D,MAElBU,QAAQxQ,EAAO,IACfyQ,QAAQzQ,EAAO,IACf6Q,SAAS,SACT5C,SAAS0E,GACRS,GACFI,EAAazE,MAAMqE,GAEjBvR,GACF2R,EAAazY,MAAM8G,GAErB2R,EACGpD,kBAAkBsC,GAClBrC,kBAAkBoC,GAClBtC,YAAYqC,GACZtC,cAAc0C,GAEjBP,EAAgBjF,MAAM,QAASoG,IAEjCnB,EACGjF,MAAM,SClNJ,SAAS9Q,EAAGhE,GACzB,IAAIyC,EAAOkT,EAAW,EAKtB,SAASb,IACP,IAAItb,EAEAqJ,EADApF,EAAIgF,EAAM/I,OAEV8hB,EAAK,EACLC,EAAK,EAET,IAAKjiB,EAAI,EAAGA,EAAIiE,IAAKjE,EACFgiB,IAAjB3Y,EAAOJ,EAAMjJ,IAAewK,EAAGyX,GAAM5Y,EAAK7C,EAG5C,IAAKwb,GAAMA,EAAK/d,EAAIuG,GAAK2R,EAAU8F,GAAMA,EAAKhe,EAAIuC,GAAK2V,EAAUnc,EAAI,EAAGA,EAAIiE,IAAKjE,GAC/EqJ,EAAOJ,EAAMjJ,IAASwK,GAAKwX,EAAI3Y,EAAK7C,GAAKyb,CAE7C,CAkBA,OAnCS,MAALzX,IAAWA,EAAI,GACV,MAALhE,IAAWA,EAAI,GAkBnB8U,EAAMQ,WAAa,SAASpV,GAC1BuC,EAAQvC,CACV,EAEA4U,EAAM9Q,EAAI,SAAS9D,GACjB,OAAO5F,UAAUZ,QAAUsK,GAAK9D,EAAG4U,GAAS9Q,CAC9C,EAEA8Q,EAAM9U,EAAI,SAASE,GACjB,OAAO5F,UAAUZ,QAAUsG,GAAKE,EAAG4U,GAAS9U,CAC9C,EAEA8U,EAAMa,SAAW,SAASzV,GACxB,OAAO5F,UAAUZ,QAAUic,GAAYzV,EAAG4U,GAASa,CACrD,EAEOb,CACT,CD2K6B,CAAoBpN,EAAO,GAAIA,EAAO,KACtDoN,MAAM,SAAUyG,GAChBpH,MAAMA,GACNE,WAAWA,GACXD,SAASA,GAERtI,GACF,EAAKsP,eAAerB,EAAiB,CACnC5S,SAAQ,EACRC,YAAW,EACX4S,gBAAe,IAIfc,EAAa,CAEf,IAAMK,EAAY,KAEflf,IAAG,SAACH,GAAW,OAAAA,EAAEG,EAAF,IACfwa,MAAMqE,GACLE,GACFG,EAAUxF,SAASqF,GAEjBlB,GACFqB,EAAUrE,SAASgD,GAErBC,EAAgBjF,MAAM,OAAQqG,E,CAGhCpB,EACGpf,GAAG,QAAQ,WACV,IAAM0gB,EAAWb,GAAejR,GAChC0R,WAAS,CACPxY,MAAO4Y,EACP3Y,MAAOgY,GAAeI,KAGpB1e,GACFif,EAASve,SAAQ,SAAC+F,GAChB,OAAA4E,EAAMI,cAAchF,EAAK5G,GAAI,CAC3B+H,EAAGnB,EAAK9G,KAAKiI,EACbhE,EAAG6C,EAAK9G,KAAKiE,GAFf,GAMN,IACCrF,GAAG,OAAO,WACT,IAAM0gB,EAAWb,GAAejR,GAE5BnN,GACFif,EAASve,SAAQ,SAAC+F,GAChB,OAAA4E,EAAMI,cAAchF,EAAK5G,GAAI,CAC3B+H,EAAGnB,EAAK9G,KAAKiI,EACbhE,EAAG6C,EAAK9G,KAAKiE,GAFf,IAOJX,EAAQ,CACNoD,MAAO4Y,EACP3Y,MAAOgY,GAAeI,IAE1B,G,CACF,MAAOjf,GACP6f,QAAQC,KAAK9f,E,CAoDjB,EAAKke,gBAAkBA,CACzB,I,QAOK,YAAAqB,eAAP,SACElH,EACAzL,GAMQ,IACJmT,EACAvU,EAFIF,EAA2CsB,EAAO,SAAxCrB,EAAiCqB,EAAO,YAA3BuR,EAAoBvR,EAAO,gBAY1D,GAPEpB,EADE,EAASD,GACO,WAAM,OAAAA,CAAA,EACf,EAAWA,GACFA,EAEA,WAAM,UAGrBD,EAgBE,GAAI,EAAWA,GACpByU,EAAe,SAAC9f,GAEd,OADaqL,EAASrL,GACRuL,EAAgBvL,EAChC,OACK,GAAI6F,EAAQwF,GAAW,CAC5B,IACM,GADSA,EAAS,GAAKA,EAAS,GAAKA,EAAS,GAAKA,EAAS,IAC1C,EACxByU,EAAe,SAAC9f,GAAM,SAASuL,EAAgBvL,EAAzB,C,MACjB,GAAI,EAASqL,GAAW,CAC7B,IAAM,EAAUA,EAAsB,EACtCyU,EAAe,SAAC9f,GAAM,SAASuL,EAAgBvL,EAAzB,C,MAEtB8f,EAAe,WAAM,gBA5BrBA,EAAe,SAAC9f,GACd,OAAIA,EAAEsG,KACAT,EAAQ7F,EAAEsG,OACAtG,EAAEsG,KAAK,GAAKtG,EAAEsG,KAAK,GAAKtG,EAAEsG,KAAK,GAAKtG,EAAEsG,KAAK,IAC1C,EAAIiF,EAAgBvL,GAE/B,EAASA,EAAEsG,OAEXtG,EAAEsG,KAAK4E,MAAQlL,EAAEsG,KAAK6E,OAASnL,EAAEsG,KAAK4E,MAAQlL,EAAEsG,KAAK6E,QAC1C,EAAII,EAAgBvL,GAE5BA,EAAEsG,KAAO,EAAIiF,EAAgBvL,GAE/B,GAAKuL,EAAgBvL,EAC9B,EAkBFoY,EAAWY,MACT,iBACA,GAAqB8G,GAAcjG,SAASqE,GAEhD,EACF,EAhVA,GAwVMQ,GAAiB,SAACjR,GACtB,OAAAA,EAAY1E,KAAI,SAAChC,GACP,IAAAmB,EAAoBnB,EAAI,EAArB7C,EAAiB6C,EAAI,EAAfgZ,EAAM,EAAKhZ,EAAtB,WACN,OAAO,OACFgZ,GAAM,CACT9f,KAAM,OACD8f,EAAO9f,MAAI,CACdiI,EAAC,EACDhE,EAAC,KAGP,GAVA,EAeI0a,GAAiB,SAAChY,GACtB,OAAAA,EAAMmC,KAAI,SAACL,GACD,IAAA1B,EAA4B0B,EAAI,OAAxBzB,EAAoByB,EAAI,OAAb4G,EAAI,EAAK5G,EAA9B,qBACN,OAAO,OACF4G,GAAI,CACPtI,OAAQA,EAAO7G,GACf8G,OAAQA,EAAO9G,IAEnB,GAPA,EEzTF,SAtGkC,WAC9B,SAAStD,IACLX,KAAKO,QAAU,CAAC,CACpB,CAiGA,OA1FAI,EAAanB,UAAUmD,GAAK,SAAUrC,EAAK2Y,EAAUlZ,GAQjD,OAPKC,KAAKO,QAAQD,KACdN,KAAKO,QAAQD,GAAO,IAExBN,KAAKO,QAAQD,GAAKE,KAAK,CACnByY,SAAUA,EACVlZ,OAAQA,IAELC,IACX,EAMAW,EAAanB,UAAUO,KAAO,SAAUO,EAAK2Y,GACzC,OAAOjZ,KAAK2C,GAAGrC,EAAK2Y,GAAU,EAClC,EAMAtY,EAAanB,UAAUsC,KAAO,SAAUxB,GAGpC,IAFA,IAAIwjB,EAAQ9jB,KACRoC,EAAO,GACF2hB,EAAK,EAAGA,EAAKzhB,UAAUZ,OAAQqiB,IACpC3hB,EAAK2hB,EAAK,GAAKzhB,UAAUyhB,GAE7B,IAAIhjB,EAASf,KAAKO,QAAQD,IAAQ,GAC9B0jB,EAAiBhkB,KAAKO,QA1CnB,MA0CwC,GAE3C0jB,EAAS,SAAUC,GAEnB,IADA,IAAIxiB,EAASwiB,EAAGxiB,OACPF,EAAI,EAAGA,EAAIE,EAAQF,IACxB,GAAK0iB,EAAG1iB,GAAR,CAGA,IAAI2iB,EAAKD,EAAG1iB,GAAIyX,EAAWkL,EAAGlL,SAAiBkL,EAAGpkB,OAE9CmkB,EAAGE,OAAO5iB,EAAG,GACK,IAAd0iB,EAAGxiB,eACIoiB,EAAMvjB,QAAQD,GAEzBoB,IACAF,KAEJyX,EAASxW,MAAMqhB,EAAO1hB,EAVtB,CAYR,EACA6hB,EAAOljB,GACPkjB,EAAOD,EACX,EAMArjB,EAAanB,UAAUqD,IAAM,SAAUvC,EAAK2Y,GACxC,GAAK3Y,EAKD,GAAK2Y,EAIA,CAID,IAFA,IAAIlY,EAASf,KAAKO,QAAQD,IAAQ,GAC9B+jB,EAAWtjB,EAAOW,OACbF,EAAI,EAAGA,EAAI6iB,EAAU7iB,IACtBT,EAAOS,GAAGyX,WAAaA,IACvBlY,EAAOqjB,OAAO5iB,EAAG,GACjB6iB,IACA7iB,KAGc,IAAlBT,EAAOW,eACA1B,KAAKO,QAAQD,EAE5B,aAhBWN,KAAKO,QAAQD,QALxBN,KAAKO,QAAU,CAAC,EAuBpB,OAAOP,IACX,EAEAW,EAAanB,UAAU8kB,UAAY,WAC/B,OAAOtkB,KAAKO,OAChB,EACOI,CACX,CArGiC,GCF1B,SAAS4jB,GAAMC,EAAOC,EAAS5kB,EAAI6kB,GACtC,KAAOF,EAAM9iB,QAAQ,CACjB,MAAMmJ,EAAO2Z,EAAMG,QAEnB,GADc9kB,EAAGgL,GAEb,OAAO,EAEX4Z,EAAQ7M,IAAI/M,EAAK5G,IACjBygB,EAAU7Z,EAAK5G,IAAIa,SAASW,IACnBgf,EAAQnlB,IAAImG,EAAExB,MACfwgB,EAAQ7M,IAAInS,EAAExB,IACdugB,EAAMhkB,KAAKiF,GACf,GAER,CACA,OAAO,CACX,CACO,SAASmf,GAAM/Z,EAAM4Z,EAAS5kB,EAAI6kB,GAErC,GADc7kB,EAAGgL,GAEb,OAAO,EAEX4Z,EAAQ7M,IAAI/M,EAAK5G,IACjB,IAAK,MAAMwB,KAAKif,EAAU7Z,EAAK5G,IAC3B,IAAKwgB,EAAQnlB,IAAImG,EAAExB,KACX2gB,GAAMnf,EAAGgf,EAAS5kB,EAAI6kB,GACtB,OAAO,EAInB,OAAO,CACX,CC7BO,MAAMG,WAAc,GACvBja,QAAU,IAAI8R,IACdoI,QAAU,IAAIpI,IACdqI,WAAa,IAAIrI,IACjBsI,YAAc,IAAItI,IAClBuI,aAAe,IAAIvI,IACnBwI,YAAc,IAAIxI,IAClByI,QAAU,GACVC,WAAa,EAMbC,UAAY,OA0BZ3e,YAAY+J,GACR6U,QACK7U,IAEDA,EAAQhG,OACRzK,KAAKulB,SAAS9U,EAAQhG,OACtBgG,EAAQ/F,OACR1K,KAAKwlB,SAAS/U,EAAQ/F,OACtB+F,EAAQwF,MACRjW,KAAKylB,QAAQhV,EAAQwF,MACrBxF,EAAQ4U,YACRrlB,KAAKqlB,UAAY5U,EAAQ4U,WACjC,CAsBAK,MAAS7lB,IACLG,KAAKolB,YAAc,EACnBvlB,IACAG,KAAKolB,YAAc,EACdplB,KAAKolB,YACNplB,KAAK2lB,QACT,EAKJA,SACI,MAAMR,EAAUnlB,KAAKmlB,QACrBnlB,KAAKmlB,QAAU,GACf,MAAMhlB,EAAQ,CACVsP,MAAOzP,KACPmlB,WAEJnlB,KAAK8B,KAAK,UAAW3B,GACrBH,KAAKqlB,UAAUllB,EACnB,CA0BAylB,cAAcT,GACV,IAAIU,EAAgB,GA8GpB,OA7GAV,EAAQrgB,SAASghB,IACb,OAAQA,EAAO9hB,MACX,IAAK,cAAe,CAKhB,IAAI+hB,GAAe,EACnBF,EAAgBA,EAAcjZ,QAAQoZ,IAClC,GAAwB,cAApBA,EAAWhiB,KAAsB,CACjC,MAAMiiB,EAASD,EAAWxe,MAAMvD,KAAO6hB,EAAOte,MAAMvD,GAIpD,OAHIgiB,IACAF,GAAe,IAEXE,CACZ,CACK,MAAwB,oBAApBD,EAAWhiB,KACTgiB,EAAW/hB,KAAO6hB,EAAOte,MAAMvD,GAEb,yBAApB+hB,EAAWhiB,MACTgiB,EAAW1Y,SAAWwY,EAAOte,MAAMvD,EAEnC,IAEV8hB,GACDF,EAAcrlB,KAAKslB,GAEvB,KACJ,CACA,IAAK,cAAe,CAKhB,IAAIC,GAAe,EACnBF,EAAgBA,EAAcjZ,QAAQoZ,IAClC,GAAwB,cAApBA,EAAWhiB,KAAsB,CACjC,MAAMiiB,EAASD,EAAWxe,MAAMvD,KAAO6hB,EAAOte,MAAMvD,GAIpD,OAHIgiB,IACAF,GAAe,IAEXE,CACZ,CACK,MAAwB,oBAApBD,EAAWhiB,MACI,gBAApBgiB,EAAWhiB,MACJgiB,EAAW/hB,KAAO6hB,EAAOte,MAAMvD,EAE/B,IAEV8hB,GACDF,EAAcrlB,KAAKslB,GAEvB,KACJ,CACA,IAAK,kBACL,IAAK,kBACL,IAAK,cAAe,CAIhB,MAAMI,EAAiBL,EAActZ,MAAMyZ,GAC/BA,EAAWhiB,OAAS8hB,EAAO9hB,MAC/BgiB,EAAW/hB,KAAO6hB,EAAO7hB,IACzB+hB,EAAWG,eAAiBL,EAAOK,eAEvCD,EACAA,EAAeE,SAAWN,EAAOM,SAGjCP,EAAcrlB,KAAKslB,GAEvB,KACJ,CACA,IAAK,wBAIDD,EAAgBA,EAAcjZ,QAAQoZ,GACV,0BAApBA,EAAWhiB,KACJgiB,EAAWK,UAAYP,EAAOO,QAEZ,yBAApBL,EAAWhiB,MACTgiB,EAAWK,UAAYP,EAAOO,UAI7CR,EAAcrlB,KAAKslB,GACnB,MAEJ,IAAK,uBAAwB,CACzB,MAAMI,EAAiBL,EAActZ,MAAMyZ,GACX,yBAApBA,EAAWhiB,MACfgiB,EAAWK,UAAYP,EAAOO,SAC9BL,EAAW1Y,SAAWwY,EAAOxY,SAEjC4Y,EACAA,EAAeI,YACXR,EAAOQ,YAGXT,EAAcrlB,KAAKslB,GAEvB,KACJ,CACA,QACID,EAAcrlB,KAAKslB,GAE3B,IAEGD,CACX,CAEAU,mBAAmBtiB,GACfjE,KAAKwmB,QAAQviB,EACjB,CAKAwiB,QAAQxiB,GACJ,OAAOjE,KAAK4K,QAAQtL,IAAI2E,EAC5B,CAKAsO,aAAamU,EAAaC,GACtB,OAAO3mB,KAAKyS,aAAakU,GAAcC,MAAMC,GAAaA,EAAS5iB,KAAOyiB,GAC9E,CAKAF,QAAQviB,GACJ,MAAM4G,EAAO7K,KAAK4K,QAAQ3E,IAAIhC,GAC9B,IAAK4G,EACD,MAAM,IAAIxG,MAAM,0BAA4BJ,GAEhD,OAAO4G,CACX,CAOAic,gBAAgB7iB,EAAI8iB,GAEhB,GADA/mB,KAAKumB,mBAAmBtiB,GACN,OAAd8iB,EAAoB,CACpB,MAAMC,EAAUhnB,KAAK+kB,WAAW9e,IAAIhC,GACpC,OAAOrC,MAAMuH,KAAK6d,EACtB,CACK,GAAkB,QAAdD,EAAqB,CAC1B,MAAMzD,EAAWtjB,KAAKglB,YAAY/e,IAAIhC,GACtC,OAAOrC,MAAMuH,KAAKma,EACtB,CACK,CACD,MAAM2D,EAAYjnB,KAAKilB,aAAahf,IAAIhC,GACxC,OAAOrC,MAAMuH,KAAK8d,EACtB,CACJ,CAKApV,UAAU5N,EAAI8iB,GACV,OAAO/mB,KAAK8mB,gBAAgB7iB,EAAI8iB,GAAWrlB,MAC/C,CAIA8Q,cAAcvO,GACV,MACMijB,EADWlnB,KAAK8mB,gBAAgB7iB,EAAI,OACjB4I,KAAKL,GAASxM,KAAKwmB,QAAQha,EAAKzB,UACzD,OAAOnJ,MAAMuH,KAAK,IAAI4D,IAAIma,GAC9B,CAIAC,gBAAgBljB,GACZ,MACMmjB,EADUpnB,KAAK8mB,gBAAgB7iB,EAAI,MACjB4I,KAAKL,GAASxM,KAAKwmB,QAAQha,EAAK1B,UACxD,OAAOlJ,MAAMuH,KAAK,IAAI4D,IAAIqa,GAC9B,CAMA3U,aAAaxO,GACT,MAAMojB,EAAernB,KAAKmnB,gBAAgBljB,GACpCqjB,EAAatnB,KAAKwS,cAAcvO,GACtC,OAAOrC,MAAMuH,KAAK,IAAI4D,IAAI,IAAIsa,KAAiBC,IACnD,CACAC,UAAU1c,GACN,GAAI7K,KAAKymB,QAAQ5b,EAAK5G,IAClB,MAAM,IAAII,MAAM,wBAA0BwG,EAAK5G,IAEnDjE,KAAK4K,QAAQkC,IAAIjC,EAAK5G,GAAI4G,GAC1B7K,KAAK+kB,WAAWjY,IAAIjC,EAAK5G,GAAI,IAAI8I,KACjC/M,KAAKglB,YAAYlY,IAAIjC,EAAK5G,GAAI,IAAI8I,KAClC/M,KAAKilB,aAAanY,IAAIjC,EAAK5G,GAAI,IAAI8I,KACnC/M,KAAKklB,YAAYpgB,SAASmR,IACtBA,EAAKuR,YAAY1a,IAAIjC,EAAK5G,GAAI,IAAI8I,IAAM,IAE5C/M,KAAKmlB,QAAQ3kB,KAAK,CAAEwD,KAAM,YAAawD,MAAOqD,GAClD,CAKA0a,SAAS9a,GACLzK,KAAK0lB,OAAM,KACP,IAAK,MAAM7a,KAAQJ,EACfzK,KAAKunB,UAAU1c,EACnB,GAER,CAKA4c,QAAQ5c,GACJ7K,KAAKulB,SAAS,CAAC1a,GACnB,CACA6c,aAAazjB,GACT,MAAM4G,EAAO7K,KAAKwmB,QAAQviB,GACpBgjB,EAAYjnB,KAAKilB,aAAahf,IAAIhC,GACxCgjB,GAAWniB,SAAS0H,GAASxM,KAAK2nB,aAAanb,EAAKvI,MACpDjE,KAAK4K,QAAQ4S,OAAOvZ,GACpBjE,KAAKklB,YAAYpgB,SAASmR,IACtBA,EAAKuR,YAAYvhB,IAAIhC,IAAKa,SAAS6N,IAC/BsD,EAAK2R,UAAUpK,OAAO7K,EAAM1O,GAAG,IAEnCgS,EAAK2R,UAAUpK,OAAOvZ,GACtBgS,EAAKuR,YAAYhK,OAAOvZ,EAAG,IAE/BjE,KAAKmlB,QAAQ3kB,KAAK,CAAEwD,KAAM,cAAewD,MAAOqD,GACpD,CAKAgd,YAAYC,GACR9nB,KAAK0lB,OAAM,KACPoC,EAAOhjB,SAASb,GAAOjE,KAAK0nB,aAAazjB,IAAI,GAErD,CAKA8jB,WAAW9jB,GACPjE,KAAK6nB,YAAY,CAAC5jB,GACtB,CACA+jB,uBAAuB/jB,EAAIkiB,EAAc3e,GACrC,MAAMqD,EAAO7K,KAAKwmB,QAAQviB,GAC1BjE,KAAK0lB,OAAM,KACP,MAAMuC,EAAWpd,EAAK9G,KAAKoiB,GACrBC,EAAW5e,EACjBqD,EAAK9G,KAAKoiB,GAAgBC,EAC1BpmB,KAAKmlB,QAAQ3kB,KAAK,CACdwD,KAAM,kBACNC,KACAkiB,eACA8B,WACA7B,YACF,GAEV,CAMAvW,cAAc5L,EAAIikB,GACdloB,KAAK0lB,OAAM,KACPnmB,OAAOgiB,QAAQ2G,GAAOpjB,SAAQ,EAAEqhB,EAAc3e,MAC1CxH,KAAKgoB,uBAAuB/jB,EAAIkiB,EAAc3e,EAAM,GACtD,GAEV,CACA2gB,kBAAkB/lB,GACd,MAAM6B,EAAK7B,EAAK,GACVyI,EAAO7K,KAAKwmB,QAAQviB,GAC1B,GAAuB,iBAAZ7B,EAAK,GAGZ,YADApC,KAAKgoB,uBAAuB/jB,EAAI7B,EAAK,GAAIA,EAAK,IAGlD,IAAI2B,EACJ,GAAuB,mBAAZ3B,EAAK,GAAmB,CAE/B,MAAMgmB,EAAShmB,EAAK,GACpB2B,EAAOqkB,EAAOvd,EAAK9G,KACvB,KAC4B,iBAAZ3B,EAAK,KAEjB2B,EAAO3B,EAAK,IAEhBpC,KAAK0lB,OAAM,KACP,MAAMuC,EAAWpd,EAAK9G,KAChBqiB,EAAWriB,EACjB8G,EAAK9G,KAAOA,EACZ/D,KAAKmlB,QAAQ3kB,KAAK,CACdwD,KAAM,kBACNC,KACAgkB,WACA7B,YACF,GAEV,CAEAiC,mBAAmBpkB,GACf,IAAKjE,KAAKsoB,QAAQrkB,GACd,MAAM,IAAII,MAAM,0BAA4BJ,EAEpD,CAKAqkB,QAAQrkB,GACJ,OAAOjE,KAAK8kB,QAAQxlB,IAAI2E,EAC5B,CAKAskB,QAAQtkB,GAEJ,OADAjE,KAAKqoB,mBAAmBpkB,GACjBjE,KAAK8kB,QAAQ7e,IAAIhC,EAC5B,CAKAukB,cAAcvkB,GACV,MAAMuI,EAAOxM,KAAKuoB,QAAQtkB,GAC1B,MAAO,CACHuI,OACA1B,OAAQ9K,KAAKwmB,QAAQha,EAAK1B,QAC1BC,OAAQ/K,KAAKwmB,QAAQha,EAAKzB,QAElC,CACA0d,UAAUjc,GACN,GAAIxM,KAAKsoB,QAAQ9b,EAAKvI,IAClB,MAAM,IAAII,MAAM,wBAA0BmI,EAAKvI,IAEnDjE,KAAKumB,mBAAmB/Z,EAAK1B,QAC7B9K,KAAKumB,mBAAmB/Z,EAAKzB,QAC7B/K,KAAK8kB,QAAQhY,IAAIN,EAAKvI,GAAIuI,GAC1B,MAAMwa,EAAUhnB,KAAK+kB,WAAW9e,IAAIuG,EAAKzB,QACnCuY,EAAWtjB,KAAKglB,YAAY/e,IAAIuG,EAAK1B,QACrC4d,EAAoB1oB,KAAKilB,aAAahf,IAAIuG,EAAK1B,QAC/C6d,EAAoB3oB,KAAKilB,aAAahf,IAAIuG,EAAKzB,QACrDic,EAAQpP,IAAIpL,GACZ8W,EAAS1L,IAAIpL,GACbkc,EAAkB9Q,IAAIpL,GACtBmc,EAAkB/Q,IAAIpL,GACtBxM,KAAKmlB,QAAQ3kB,KAAK,CAAEwD,KAAM,YAAawD,MAAOgF,GAClD,CAKAgZ,SAAS9a,GACL1K,KAAK0lB,OAAM,KACP,IAAK,MAAMlZ,KAAQ9B,EACf1K,KAAKyoB,UAAUjc,EACnB,GAER,CAaAoc,QAAQpc,GACJxM,KAAKwlB,SAAS,CAAChZ,GACnB,CACAmb,aAAa1jB,GACT,MAAMuI,EAAOxM,KAAKuoB,QAAQtkB,GACpBqf,EAAWtjB,KAAKglB,YAAY/e,IAAIuG,EAAK1B,QACrCkc,EAAUhnB,KAAK+kB,WAAW9e,IAAIuG,EAAKzB,QACnC2d,EAAoB1oB,KAAKilB,aAAahf,IAAIuG,EAAK1B,QAC/C6d,EAAoB3oB,KAAKilB,aAAahf,IAAIuG,EAAKzB,QACrDuY,EAAS9F,OAAOhR,GAChBwa,EAAQxJ,OAAOhR,GACfkc,EAAkBlL,OAAOhR,GACzBmc,EAAkBnL,OAAOhR,GACzBxM,KAAK8kB,QAAQtH,OAAOvZ,GACpBjE,KAAKmlB,QAAQ3kB,KAAK,CAAEwD,KAAM,cAAewD,MAAOgF,GACpD,CAKAqc,YAAYf,GACR9nB,KAAK0lB,OAAM,KACPoC,EAAOhjB,SAASb,GAAOjE,KAAK2nB,aAAa1jB,IAAI,GAErD,CAKA6kB,WAAW7kB,GACPjE,KAAK6oB,YAAY,CAAC5kB,GACtB,CAKA8kB,iBAAiB9kB,EAAI6G,GACjB,MAAM0B,EAAOxM,KAAKuoB,QAAQtkB,GAC1BjE,KAAKumB,mBAAmBzb,GACxB,MAAMke,EAAYxc,EAAK1B,OACjBme,EAAYne,EAClB9K,KAAKglB,YAAY/e,IAAI+iB,GAAWxL,OAAOhR,GACvCxM,KAAKilB,aAAahf,IAAI+iB,GAAWxL,OAAOhR,GACxCxM,KAAKglB,YAAY/e,IAAIgjB,GAAWrR,IAAIpL,GACpCxM,KAAKilB,aAAahf,IAAIgjB,GAAWrR,IAAIpL,GACrCA,EAAK1B,OAASA,EACd9K,KAAK0lB,OAAM,KACP1lB,KAAKmlB,QAAQ3kB,KAAK,CACdwD,KAAM,cACNC,KACAkiB,aAAc,SACd8B,SAAUe,EACV5C,SAAU6C,GACZ,GAEV,CAKAC,iBAAiBjlB,EAAI8G,GACjB,MAAMyB,EAAOxM,KAAKuoB,QAAQtkB,GAC1BjE,KAAKumB,mBAAmBxb,GACxB,MAAMoe,EAAY3c,EAAKzB,OACjBqe,EAAYre,EAClB/K,KAAK+kB,WAAW9e,IAAIkjB,GAAW3L,OAAOhR,GACtCxM,KAAKilB,aAAahf,IAAIkjB,GAAW3L,OAAOhR,GACxCxM,KAAK+kB,WAAW9e,IAAImjB,GAAWxR,IAAIpL,GACnCxM,KAAKilB,aAAahf,IAAImjB,GAAWxR,IAAIpL,GACrCA,EAAKzB,OAASA,EACd/K,KAAK0lB,OAAM,KACP1lB,KAAKmlB,QAAQ3kB,KAAK,CACdwD,KAAM,cACNC,KACAkiB,aAAc,SACd8B,SAAUkB,EACV/C,SAAUgD,GACZ,GAEV,CACAC,uBAAuBplB,EAAIkiB,EAAc3e,GACrC,MAAMgF,EAAOxM,KAAKuoB,QAAQtkB,GAC1BjE,KAAK0lB,OAAM,KACP,MAAMuC,EAAWzb,EAAKzI,KAAKoiB,GACrBC,EAAW5e,EACjBgF,EAAKzI,KAAKoiB,GAAgBC,EAC1BpmB,KAAKmlB,QAAQ3kB,KAAK,CACdwD,KAAM,kBACNC,KACAkiB,eACA8B,WACA7B,YACF,GAEV,CACAkD,kBAAkBlnB,GACd,MAAM6B,EAAK7B,EAAK,GACVoK,EAAOxM,KAAKuoB,QAAQtkB,GAC1B,GAAuB,iBAAZ7B,EAAK,GAGZ,YADApC,KAAKqpB,uBAAuBplB,EAAI7B,EAAK,GAAIA,EAAK,IAGlD,IAAI2B,EACJ,GAAuB,mBAAZ3B,EAAK,GAAmB,CAE/B,MAAMgmB,EAAShmB,EAAK,GACpB2B,EAAOqkB,EAAO5b,EAAKzI,KACvB,KAC4B,iBAAZ3B,EAAK,KAEjB2B,EAAO3B,EAAK,IAEhBpC,KAAK0lB,OAAM,KACP,MAAMuC,EAAWzb,EAAKzI,KAChBqiB,EAAWriB,EACjByI,EAAKzI,KAAOA,EACZ/D,KAAKmlB,QAAQ3kB,KAAK,CACdwD,KAAM,kBACNC,KACAgkB,WACA7B,YACF,GAEV,CAIAmD,cAActlB,EAAIikB,GACdloB,KAAK0lB,OAAM,KACPnmB,OAAOgiB,QAAQ2G,GAAOpjB,SAAQ,EAAEqhB,EAAc3e,MAC1CxH,KAAKqpB,uBAAuBplB,EAAIkiB,EAAc3e,EAAM,GACtD,GAEV,CAEAgiB,mBAAmBnD,GACf,IAAKrmB,KAAKypB,iBAAiBpD,GACvB,MAAM,IAAIhiB,MAAM,yCAA2CgiB,EAEnE,CACAoD,iBAAiBpD,GACb,OAAOrmB,KAAKklB,YAAY5lB,IAAI+mB,EAChC,CAiBAqD,oBAAoBrD,GACZrmB,KAAKklB,YAAY5lB,IAAI+mB,KAIzBrmB,KAAKklB,YAAYpY,IAAIuZ,EAAS,CAC1BuB,UAAW,IAAIlL,IACf8K,YAAa,IAAI9K,MAErB1c,KAAK0lB,OAAM,KACP1lB,KAAKmlB,QAAQ3kB,KAAK,CACdwD,KAAM,wBACNqiB,WACF,IAEV,CAUAsD,oBAAoBtD,GAChBrmB,KAAKwpB,mBAAmBnD,GACxBrmB,KAAKklB,YAAY1H,OAAO6I,GACxBrmB,KAAK0lB,OAAM,KACP1lB,KAAKmlB,QAAQ3kB,KAAK,CACdwD,KAAM,wBACNqiB,WACF,GAEV,CAmBAZ,QAAQxP,EAAMoQ,GACVrmB,KAAK0lB,OAAM,KACP1lB,KAAK0pB,oBAAoBrD,GAEzB,MAAM5b,EAAQ,GACRmf,EAAQhoB,MAAM+H,QAAQsM,GAAQA,EAAO,CAACA,GAC5C,KAAO2T,EAAMloB,QAAQ,CACjB,MAAMmJ,EAAO+e,EAAMjF,QACnBla,EAAMjK,KAAKqK,GACPA,EAAKU,UACLqe,EAAMppB,QAAQqK,EAAKU,SAE3B,CACAvL,KAAKulB,SAAS9a,GAEdA,EAAM3F,SAASoR,IACXA,EAAO3K,UAAUzG,SAAS6N,IACtB3S,KAAK6pB,UAAUlX,EAAM1O,GAAIiS,EAAOjS,GAAIoiB,EAAQ,GAC9C,GACJ,GAEV,CA0DAyD,SAASzD,GAEL,OADArmB,KAAKwpB,mBAAmBnD,GACjBrmB,KAAK2P,cAAc/C,QAAQ/B,IAAU7K,KAAK+pB,UAAUlf,EAAK5G,GAAIoiB,IACxE,CAKA2D,YAAY/lB,EAAIoiB,GACZrmB,KAAKumB,mBAAmBtiB,GACxBjE,KAAKwpB,mBAAmBnD,GACxB,MACM9a,EADOvL,KAAKklB,YAAYjf,IAAIogB,GACZmB,YAAYvhB,IAAIhC,GACtC,OAAOrC,MAAMuH,KAAKoC,GAAY,GAClC,CAMAwe,UAAU9lB,EAAIoiB,GAIV,OAHArmB,KAAKumB,mBAAmBtiB,GACxBjE,KAAKwpB,mBAAmBnD,GACXrmB,KAAKklB,YAAYjf,IAAIogB,GACtBuB,UAAU3hB,IAAIhC,IAAO,IACrC,CAIAgmB,aAAahmB,EAAIoiB,GACb,MAAM6D,EAAY,GAClB,IACIhU,EADAiU,EAAUnqB,KAAKwmB,QAAQviB,GAE3B,KAAOiS,EAASlW,KAAK+pB,UAAUI,EAAQlmB,GAAIoiB,IACvC6D,EAAU1pB,KAAK0V,GACfiU,EAAUjU,EAEd,OAAOgU,CACX,CAQAL,UAAU5lB,EAAIiS,EAAQmQ,GAClBrmB,KAAKwpB,mBAAmBnD,GACxB,MAAMpQ,EAAOjW,KAAKklB,YAAYjf,IAAIogB,GAC5Bxb,EAAO7K,KAAKwmB,QAAQviB,GACpBmmB,EAAYnU,EAAK2R,UAAU3hB,IAAIhC,GAC/BomB,EAAYrqB,KAAKwmB,QAAQtQ,GAE/BD,EAAK2R,UAAU9a,IAAI7I,EAAIomB,GAEnBD,GACAnU,EAAKuR,YAAYvhB,IAAImkB,EAAUnmB,KAAKuZ,OAAO3S,GAE/C,IAAIU,EAAW0K,EAAKuR,YAAYvhB,IAAIokB,EAAUpmB,IACzCsH,IACDA,EAAW,IAAIwB,IACfkJ,EAAKuR,YAAY1a,IAAIud,EAAUpmB,GAAIsH,IAEvCA,EAASqM,IAAI/M,GACb7K,KAAK0lB,OAAM,KACP1lB,KAAKmlB,QAAQ3kB,KAAK,CACdwD,KAAM,uBACNqiB,UACA/Y,OAAQrJ,EACRqmB,YAAaF,GAAWnmB,GACxBqiB,YAAa+D,EAAUpmB,IACzB,GAEV,CACAsmB,QAAQtmB,EAAIpE,EAAIwmB,GAEZ,OAAOzB,GAAM5kB,KAAKwmB,QAAQviB,GAAK,IAAI8I,IAAOlN,GADvByN,GAAWtN,KAAKgqB,YAAY1c,EAAQ+Y,IAE3D,CACAmE,QAAQvmB,EAAIpE,EAAIwmB,GAEZ,OAAO9B,GAAM,CAACvkB,KAAKwmB,QAAQviB,IAAM,IAAI8I,IAAOlN,GADzByN,GAAWtN,KAAKgqB,YAAY1c,EAAQ+Y,IAE3D,CAKA1W,cACI,OAAO/N,MAAMuH,KAAKnJ,KAAK4K,QAAQ6f,SACnC,CAIA7a,cACI,OAAOhO,MAAMuH,KAAKnJ,KAAK8kB,QAAQ2F,SACnC,CACAC,IAAIzmB,EAAIpE,EAAIknB,EAAY,OACpB,MAAMrC,EAAY,CACdnX,GAAIvN,KAAKmnB,gBAAgBzM,KAAK1a,MAC9BwN,IAAKxN,KAAKwS,cAAckI,KAAK1a,MAC7B2qB,KAAM3qB,KAAKyS,aAAaiI,KAAK1a,OAC/B+mB,GACF,OAAOxC,GAAM,CAACvkB,KAAKwmB,QAAQviB,IAAM,IAAI8I,IAAOlN,EAAI6kB,EACpD,CACAkG,IAAI3mB,EAAIpE,EAAIknB,EAAY,OACpB,MAAMrC,EAAY,CACdnX,GAAIvN,KAAKmnB,gBAAgBzM,KAAK1a,MAC9BwN,IAAKxN,KAAKwS,cAAckI,KAAK1a,MAC7B2qB,KAAM3qB,KAAKyS,aAAaiI,KAAK1a,OAC/B+mB,GACF,OAAOnC,GAAM5kB,KAAKwmB,QAAQviB,GAAK,IAAI8I,IAAOlN,EAAI6kB,EAClD,CACAvW,QAEI,MAAM0c,EAAW7qB,KAAK2P,cAAc9C,KAAKie,IAC9B,IAAKA,EAAS/mB,KAAM,IAAK+mB,EAAQ/mB,UAEtCgnB,EAAW/qB,KAAK4P,cAAc/C,KAAKme,IAC9B,IAAKA,EAASjnB,KAAM,IAAKinB,EAAQjnB,UAGtCknB,EAAW,IAAIpG,GAAM,CACvBpa,MAAOogB,EACPngB,MAAOqgB,IAiBX,OAdA/qB,KAAKklB,YAAYpgB,SAAQ,EAAG8iB,UAAWsD,EAAc1D,YAAa2D,GAAkB9E,KAChF,MAAMuB,EAAY,IAAIlL,IACtBwO,EAAapmB,SAAQ,CAACoR,EAAQrQ,KAC1B+hB,EAAU9a,IAAIjH,EAAKolB,EAASzE,QAAQtQ,EAAOjS,IAAI,IAEnD,MAAMujB,EAAc,IAAI9K,IACxByO,EAAermB,SAAQ,CAACyG,EAAU1F,KAC9B2hB,EAAY1a,IAAIjH,EAAK,IAAIkH,IAAInL,MAAMuH,KAAKoC,GAAUsB,KAAKpH,GAAMwlB,EAASzE,QAAQ/gB,EAAExB,OAAM,IAE1FgnB,EAAS/F,YAAYpY,IAAIuZ,EAAS,CAC9BuB,UAAWA,EACXJ,YAAaA,GACf,IAECyD,CACX,CACAG,SACI,OAAOC,KAAKC,UAAU,CAClB7gB,MAAOzK,KAAK2P,cACZjF,MAAO1K,KAAK4P,eAGpB,ECp7BJ,IAAM2b,GAAiB,SAACjhB,EAAW5B,GACjC,GAAU,SAAN4B,GAAsB,SAANA,EAClB,OAAO5B,CAEX,EAOM8iB,GAAS,SAAIC,GACjBA,EAAMC,KAAMhkB,KAAO+jB,EAAM/jB,KACzB+jB,EAAM/jB,KAAMgkB,KAAOD,EAAMC,YAClBD,EAAM/jB,YACN+jB,EAAMC,IACf,ECMA,4B,8CAAuC,QAApB,OAAoB,EAAvC,CDJA,WAIE,aACE,IAAMC,EAA4B,CAAC,EACnCA,EAASD,KAAOC,EAChBA,EAASjkB,KAAOikB,EAASD,KACzB1rB,KAAK2rB,SAAWA,CAClB,CAgCF,OA9BS,YAAAC,QAAP,WACE,IAAMD,EAAW3rB,KAAK2rB,SAChBF,EAAQE,EAASD,KACvB,GAAID,GAASA,IAAUE,EAErB,OADAH,GAAOC,GACAA,CAEX,EAEO,YAAAI,QAAP,SAAeJ,GACb,IAAME,EAAW3rB,KAAK2rB,SAClBF,EAAMC,MAAQD,EAAM/jB,MACtB8jB,GAAOC,GAETA,EAAM/jB,KAAOikB,EAASjkB,KACtBikB,EAASjkB,KAAMgkB,KAAOD,EACtBE,EAASjkB,KAAO+jB,EAChBA,EAAMC,KAAOC,CACf,EAEO,YAAA3hB,SAAP,WAIE,IAHA,IAAM8hB,EAAO,GACPC,EAAW/rB,KAAK2rB,SAClBK,EAAOD,EAASL,KACbM,IAASD,GACdD,EAAKtrB,KAAK6qB,KAAKC,UAAUU,EAAMT,KAC/BS,EAAOA,aAAI,EAAJA,EAAMN,KAEf,MAAO,IAAII,EAAKG,KAAK,MAAK,GAC5B,EACF,EAzCA,ICMMC,GAAoB,WAAM,UA8C1BnE,GAAa,SACjB9f,EACAkkB,EACAC,EACAX,EACAY,G,QAEMC,EAAuB,GAoC7B,OAlCIrkB,EAAEwe,QAAQgF,EAAM/iB,KACc,QAAhC,EAAAT,EAAE6e,gBAAgB2E,EAAM/iB,EAAG,aAAK,SAAE5D,SAAQ,SAAC0H,GACzC,IAAM0R,EAAS1R,EAAKzI,KAAKma,OACnBqO,EAAStkB,EAAEue,QAAQha,EAAK1B,QAE1BuhB,GAEFC,EAAQ9rB,KAAK,CAAEkI,EAAG8D,EAAK1B,OAAQ3H,EAAGqJ,EAAKzB,OAAQwC,GAAI,EAAGC,IAAK,SAErChL,IAApB+pB,EAAOxoB,KAAKyJ,MAAmB+e,EAAOxoB,KAAKyJ,IAAM,GAErD+e,EAAOxoB,KAAKyJ,KAAO0Q,EACnBsO,GAAaL,EAASC,EAAS,GAC7B1jB,EAAG6jB,EAAOtoB,IACPsoB,EAAOxoB,MAEd,IAEiC,QAAjC,EAAAkE,EAAE6e,gBAAgB2E,EAAM/iB,EAAG,cAAM,SAAE5D,SAAQ,SAAC0H,GAC1C,IAAM0R,EAAS1R,EAAKzI,KAAKma,OACnB/a,EAAIqJ,EAAKzB,OACT0hB,EAASxkB,EAAEue,QAAQrjB,QACFX,IAAnBiqB,EAAO1oB,KAAKwJ,KAAkBkf,EAAO1oB,KAAKwJ,GAAK,GAEnDkf,EAAO1oB,KAAKwJ,IAAM2Q,EAClBsO,GAAaL,EAASC,EAAS,GAC7B1jB,EAAG+jB,EAAOxoB,IACPwoB,EAAO1oB,MAEd,IAEAkE,EAAE8f,WAAW0D,EAAM/iB,IAGd2jB,EAAsBC,OAAU9pB,CACzC,EA2DMgqB,GAAe,SAACL,EAAiBC,EAAiBX,GACjDA,EAAMje,IAECie,EAAU,GAGpBU,EAAQV,EAAMje,IAAMie,EAAU,GAAIW,GAASP,QAAQJ,GAFnDU,EAAQA,EAAQzqB,OAAS,GAAGmqB,QAAQJ,GAFpCU,EAAQ,GAAGN,QAAQJ,EAMvB,ECjLMiB,GAAM,SAACzkB,EAAU0kB,GACrB,IAGMC,EAAoB,WAAdD,EDkBW,SACvB1kB,EACA4kB,G,MAEA,GAAI5kB,EAAE0H,cAAcjO,QAAU,EAAG,MAAO,GACxC,IAAMorB,EAqFW,SAAC7kB,EAAW4kB,GAC7B,IAAME,EAAW,IAAIlI,GACjBmI,EAAQ,EACRC,EAAS,EAEbhlB,EAAE0H,cAAc7K,SAAQ,SAAC4D,GACvBqkB,EAAStF,QAAQ,CACfxjB,GAAIyE,EAAEzE,GACNF,KAAM,CAAE2E,EAAGA,EAAEzE,GAAIsJ,GAAI,EAAGC,IAAK,IAEjC,IAIAvF,EAAE2H,cAAc9K,SAAQ,SAACjB,GACvB,IAAM2I,EAAOugB,EACVjG,gBAAgBjjB,EAAEiH,OAAQ,OAC1ByB,MAAK,SAACC,GAAS,OAAAA,EAAKzB,SAAWlH,EAAEkH,MAAlB,IACZmT,GAAS2O,aAAQ,EAARA,EAAWhpB,KAAM,EAC3B2I,EAUHugB,EAASzD,eAAe9c,aAAI,EAAJA,EAAMvI,GAAK,OAC9BuI,EAAKzI,MAAI,CACZma,OAAQ1R,EAAKzI,KAAKma,OAAUA,KAX9B6O,EAASnE,QAAQ,CACf3kB,GAAIJ,EAAEI,GACN6G,OAAQjH,EAAEiH,OACVC,OAAQlH,EAAEkH,OACVhH,KAAM,CACJma,OAAM,KAUZ+O,EAAShf,KAAKc,IAAIke,EAASF,EAASvG,QAAQ3iB,EAAEiH,QAAS/G,KAAKyJ,KAAO0Q,GAEnE8O,EAAQ/e,KAAKc,IAAIie,EAAQD,EAASvG,QAAQ3iB,EAAEkH,QAAShH,KAAKwJ,IAAM2Q,EAClE,IAIA,IAFA,IAAMiO,EAAkB,GAClBe,EAAWD,EAASD,EAAQ,EACzBxrB,EAAI,EAAGA,EAAI0rB,EAAU1rB,IAC5B2qB,EAAQ3rB,KAAK,IAAI,IAEnB,IAAM4rB,EAAUY,EAAQ,EASxB,OAPAD,EAASpd,cAAc7K,SAAQ,SAAC4D,GAC9B8jB,GAAaL,EAASC,EAAS,GAC7B1jB,EAAGA,EAAEzE,IACF8oB,EAASvG,QAAQ9d,EAAEzE,IAAIF,MAE9B,IAEO,CAAEooB,QAAO,EAAEC,QAAO,EAAE3c,MAAOsd,EACpC,CA5IgBI,CAAWllB,ECzBhB,SAACpE,GAAsB,OAAAA,EAAEE,KAAKma,QAAU,CAAjB,GDyBQgO,IAGxC,OAGG,QAHI,EAOW,SAACjkB,EAAWkkB,EAAiBC,GAM/C,IALA,IAIIX,EAJAa,EAAuB,GACrBlF,EAAU+E,EAAQA,EAAQzqB,OAAS,GACnC0rB,EAAQjB,EAAQ,GAGflkB,EAAE0H,cAAcjO,QAAQ,CAC7B,KAAQ+pB,EAAQ2B,EAAMxB,WACpB7D,GAAW9f,EAAGkkB,EAASC,EAASX,GAElC,KAAQA,EAAQrE,EAAQwE,WACtB7D,GAAW9f,EAAGkkB,EAASC,EAASX,GAElC,GAAIxjB,EAAE0H,cAAcjO,OAClB,IAAK,IAAIF,EAAI2qB,EAAQzqB,OAAS,EAAGF,EAAI,IAAKA,EAExC,GADAiqB,EAAQU,EAAQ3qB,GAAGoqB,UACR,CACTU,EAAUA,EAAQjrB,OAChB0mB,GAAW9f,EAAGkkB,EAASC,EAASX,GAAO,IAEzC,K,EAMR,OAAOa,CACT,CApCkBe,CAAYP,EAAMrd,MAAOqd,EAAMX,QAASW,EAAMV,SAG3Dvf,KAAI,SAAChJ,GACJ,OAAAoE,EAAE6e,gBAAgBjjB,EAAE6E,EAAG,OAAOkE,QAAO,SAAC,GAAe,OAAP,WAAkB/I,EAAEV,CAAb,GAArD,WACD,eACCmqB,MACN,CC/BuCC,CAAUtlB,GAAkBulB,GAAOvlB,GACxE2kB,WAAK9nB,SAAQ,SAACjB,GACZ,IAAMsE,EAAQtE,EAAEE,KAChBkE,EAAE6gB,WAAWjlB,EAAEI,IACfkE,EAAMslB,YAAc5pB,EAAEE,KAAK/C,KAC3BmH,EAAMulB,UAAW,EACjBzlB,EAAE2gB,QAAQ,CACR3kB,GAAIJ,EAAEI,GACN6G,OAAQjH,EAAEkH,OACVA,OAAQlH,EAAEiH,OACV/G,KAAM,KACDoE,IAGT,GACF,EAEMqlB,GAAS,SAACvlB,GACd,IAAM2kB,EAAwB,GACxBhD,EAA6B,CAAC,EAC9BnF,EAA+B,CAAC,EAEhCmG,EAAM,SAACliB,GACP+b,EAAQ/b,KAGZ+b,EAAQ/b,IAAK,EACbkhB,EAAMlhB,IAAK,EACXT,EAAE6e,gBAAgBpe,EAAG,OAAO5D,SAAQ,SAACjB,GAC/B+lB,EAAM/lB,EAAEkH,QACV6hB,EAAIpsB,KAAKqD,GAET+mB,EAAI/mB,EAAEkH,OAEV,WACO6e,EAAMlhB,GACf,EAGA,OADAT,EAAE0H,cAAc7K,SAAQ,SAACW,GAAM,OAAAmlB,EAAInlB,EAAExB,GAAN,IACxB2oB,CACT,ECrCae,GAAe,SAC1B1lB,EACAjE,EACAD,EACA/C,GAEA,IAAI0H,EACJ,GACEA,EAAI,GAAG1H,EAAOiN,KAAKS,eACZzG,EAAEwe,QAAQ/d,IAQnB,OANA3E,EAAK6pB,MAAQ5pB,EACbiE,EAAEwf,QAAQ,CACRxjB,GAAIyE,EACJ3E,KAAI,IAGC2E,CACT,EAoCamlB,GAAqB,SAAC5lB,GACjC,IAAM6lB,EAAa,IAAIjJ,GAYvB,OAVA5c,EAAE0H,cAAc7K,SAAQ,SAAC+F,GAClB5C,EAAE+hB,YAAYnf,EAAK5G,IAAIvC,QAC1BosB,EAAWrG,QAAQ,KAAK5c,GAE5B,IAEA5C,EAAE2H,cAAc9K,SAAQ,SAAC0H,GACvBshB,EAAWlF,QAAQpc,EACrB,IAEOshB,CACT,EA2CaC,GAAgB,SAC3BC,EACAC,GAEA,IAeIzK,EACAC,EAhBEzX,EAAIkiB,OAAOF,EAAKhiB,GAChBhE,EAAIkmB,OAAOF,EAAKhmB,GAIhByQ,EAAKyV,OAAOD,EAAMjiB,GAAKA,EACvB0M,EAAKwV,OAAOD,EAAMjmB,GAAKA,EACzB7E,EAAI+qB,OAAOF,EAAKhf,OAAS,EACzBmf,EAAID,OAAOF,EAAK/e,QAAU,EAE9B,OAAKwJ,GAAOC,GAQRzK,KAAKmH,IAAIsD,GAAMvV,EAAI8K,KAAKmH,IAAIqD,GAAM0V,GAEhCzV,EAAK,IACPyV,GAAKA,GAEP3K,EAAM2K,EAAI1V,EAAMC,EAChB+K,EAAK0K,IAGD1V,EAAK,IACPtV,GAAKA,GAEPqgB,EAAKrgB,EACLsgB,EAAMtgB,EAAIuV,EAAMD,GAGX,CAAEzM,EAAGA,EAAIwX,EAAIxb,EAAGA,EAAIyb,IAtBlB,CAAEzX,EAAG,EAAGhE,EAAG,EAuBtB,EAMa,GAAmB,SAACC,GAG/B,IAFA,IAAMmmB,EAAwB,GACxBC,EAAUC,GAAQrmB,GAAK,EACpBzG,EAAI,EAAGA,EAAI6sB,EAAS7sB,IAC3B4sB,EAAc5tB,KAAK,IAWrB,IAPAyH,EAAE0H,cAAc7K,SAAQ,SAAC+F,GACvB,IAAM0jB,EAAO1jB,EAAK9G,KAAKwqB,UACV/rB,IAAT+rB,GAAsBH,EAAcG,IACtCH,EAAcG,GAAM/tB,KAAKqK,EAAK5G,GAElC,IAESzC,EAAI,EAAGA,EAAI6sB,EAAS7sB,IAC3B4sB,EAAc5sB,GAAK4sB,EAAc5sB,GAAGkQ,MAAK,SAAC8c,EAAQC,GAChD,OApLYC,EAoLHzmB,EAAEue,QAAQgI,GAAIzqB,KAAK4qB,MApLCC,EAoLO3mB,EAAEue,QAAQiI,GAAI1qB,KAAK4qB,MAnLpDT,OAAOQ,GAAUR,OAAOU,GADhB,IAACF,EAAiBE,CAoL7B,IAIJ,OAAOR,CACT,EAyDaS,GAAgB,SAC3B5mB,EACAvI,EACA6uB,EACAI,GAEA,IAAM9jB,EAAiB,CACrBmE,MAAO,EACPC,OAAQ,GAMV,OAJI,EAASsf,IAAS,EAASI,KAC7B9jB,EAAK0jB,KAAOA,EACZ1jB,EAAK8jB,MAAQA,GAERhB,GAAa1lB,EAAG,SAAU4C,EAAMnL,EACzC,EAEa4uB,GAAU,SAACrmB,GACtB,IAAIqmB,EAaJ,OAZArmB,EAAE0H,cAAc7K,SAAQ,SAAC4D,GACvB,IAAM6lB,EAAO7lB,EAAE3E,KAAKwqB,UACP/rB,IAAT+rB,SACc/rB,IAAZ8rB,GAAyBC,EAAOD,KAClCA,EAAUC,EAGhB,IAEKD,IACHA,EAAU,GAELA,CACT,EAsBaQ,GAAQ,SAAUC,EAAYC,GACzC,OAAOD,EAAME,QAAO,SAAChqB,EAAGC,GAGtB,OAFa8pB,EAAK/pB,GACL+pB,EAAK9pB,GACGA,EAAID,CAC3B,GACF,EAEM,GAAQ,SACZwK,EACA5E,EACAqkB,EACAzK,EACAC,EACAngB,GAEKkgB,EAAQ0K,SAAStkB,EAAK5G,MACzBwgB,EAAQjkB,KAAKqK,EAAK5G,IACbirB,GACH3qB,EAAO/D,KAAKqK,EAAK5G,IAEnBygB,EAAU7Z,EAAK5G,IAAIa,SAAQ,SAACW,GAC1B,UAAMgK,EAAOhK,EAAGypB,EAAWzK,EAASC,EAAWngB,EAA/C,IAEE2qB,GACF3qB,EAAO/D,KAAKqK,EAAK5G,IAGvB,EAMa2mB,GAAM,SACjBnb,EACA5E,EACA8jB,EACAS,GAEA,IAAM3kB,EAAQ7I,MAAM+H,QAAQkB,GAAQA,EAAO,CAACA,GACtC6Z,EAAY,SAACjf,GACjB,OAAC2pB,EAAa3f,EAAM+C,cAAc/M,GAAKgK,EAAMgD,aAAahN,EAA1D,EACI6mB,EAAgB,GAChB7H,EAAgB,GAStB,OARAha,EAAM3F,SAAQ,SAAC+F,GACb,IAAK4E,EAAMgX,QAAQ5b,EAAK5G,IACtB,MAAM,IAAII,MAAM,6BAA6BwG,GAE7C,GAAM4E,EAAO5E,EAAgB,SAAV8jB,EAAkBlK,EAASC,EAAW4H,EAE7D,IAEOA,CACT,EC5UM+C,GAAwB,aCExBC,GAAc,SAACrnB,GACnB,IAAMwc,EAA+B,CAAC,EAEhCmG,EAAM,SAACliB,G,MAQP6lB,EAPEpmB,EAAQF,EAAEue,QAAQ9d,GACxB,OAAKP,EACDsc,EAAQ/b,GACHP,EAAMpE,KAAKwqB,MAEpB9J,EAAQ/b,IAAK,EAIc,QAA3B,EAAAT,EAAE6e,gBAAgBpe,EAAG,cAAM,SAAE5D,SAAQ,SAACjB,GACpC,IAEMkF,EAFQ6hB,EAAI/mB,EAAEkH,QACLlH,EAAEE,KAAKwrB,OAElBxmB,SACWvG,IAAT+rB,GAAsBxlB,EAAIwlB,KAC5BA,EAAOxlB,EAGb,IAEKwlB,IACHA,EAAO,GAGTpmB,EAAMpE,KAAKwqB,KAAOA,EACXA,GAxBY,CAyBrB,EAEAtmB,EAAE0H,cACC/C,QAAO,SAACnH,GAAM,OAAyC,IAAzCwC,EAAE6e,gBAAgBrhB,EAAExB,GAAI,MAAMvC,MAA9B,IACdoD,SAAQ,SAACgG,GAAW,OAAA8f,EAAI9f,EAAO7G,GAAX,GACzB,EAyFMurB,GAAQ,SAACvnB,EAAUpE,GACvB,OACEoE,EAAEue,QAAQ3iB,EAAEkH,QAAQhH,KAAKwqB,KACzBtmB,EAAEue,QAAQ3iB,EAAEiH,QAAQ/G,KAAKwqB,KACzB1qB,EAAEE,KAAKwrB,MAEX,ECnGME,GAAY,SAAC7oB,EAAWqB,GAC5B,IAAM2iB,EAAM,SAACliB,GACXT,EAAE6e,gBAAgBpe,EAAG,QAAQ5D,SAAQ,SAACjB,GACpC,IAAM6rB,EAAQ7rB,EAAEiH,OACV3H,EAAIuF,IAAMgnB,EAAQ7rB,EAAEkH,OAAS2kB,EAC9B9oB,EAAE6f,QAAQtjB,IAAOqsB,GAAMvnB,EAAGpE,KAC7B+C,EAAE6gB,QAAQ,CACRxjB,GAAId,EACJY,KAAM,CAAC,IAET6C,EAAEgiB,QAAQ,CACR3kB,GAAIJ,EAAEI,GACN6G,OAAQpC,EACRqC,OAAQ5H,EACRY,KAAM,CAAC,IAET6mB,EAAIznB,GAER,GACF,EAGA,OADAyD,EAAE+I,cAAc7K,SAAQ,SAACW,GAAM,OAAAmlB,EAAInlB,EAAExB,GAAN,IACxB2C,EAAE+I,cAAcjO,MACzB,EAkDMiuB,GAAqB,SAAC/oB,EAAWqB,GACrC,IAAM2iB,EAAM,SAACliB,G,MACiB,QAA5B,EAAAT,EAAE6e,gBAAgBpe,EAAG,eAAO,SAAE5D,SAAQ,SAACjB,GACrC,IAAM6rB,EAAQ7rB,EAAEiH,OACV3H,EAAIuF,IAAMgnB,EAAQ7rB,EAAEkH,OAAS2kB,EAGhC9oB,EAAE6f,QAAQtjB,SACmBX,IAA7ByF,EAAEue,QAAQrjB,GAAIY,KAAK6rB,OAAwBJ,GAAMvnB,EAAGpE,KAErD+C,EAAE6gB,QAAQ,CACRxjB,GAAId,EACJY,KAAM,CAAC,IAET6C,EAAEgiB,QAAQ,CACR3kB,GAAIJ,EAAEI,GACN6G,OAAQpC,EACRqC,OAAQ5H,EACRY,KAAM,CAAC,IAET6mB,EAAIznB,GAER,GACF,EAGA,OADAyD,EAAE+I,cAAc7K,SAAQ,SAACW,GAAM,OAAAmlB,EAAInlB,EAAExB,GAAN,IACxB2C,EAAE+I,cAAcjO,MACzB,EAMMmuB,GAAmB,SAACjpB,EAAWqB,GACnC,OAAO6mB,GAAM7mB,EAAE2H,eAAe,SAAC/L,GAC7B,OAAI+C,EAAE6f,QAAQ5iB,EAAEiH,UAAYlE,EAAE6f,QAAQ5iB,EAAEkH,QAC/BykB,GAAMvnB,EAAGpE,GAEXwG,GACT,GACF,EAEMylB,GAAa,SAAClpB,EAAWqB,EAAW8nB,GACxCnpB,EAAE+I,cAAc7K,SAAQ,SAACkrB,GACvB,IAAMtnB,EAAIT,EAAEue,QAAQwJ,EAAG/rB,IAClByE,EAAE3E,KAAKwqB,OAAM7lB,EAAE3E,KAAKwqB,KAAO,GAChC7lB,EAAE3E,KAAKwqB,MAASwB,CAClB,GACF,ECvHaE,GAAgB,SAACrpB,EAAWqB,GACvC,IAAIioB,EAAKtF,GAAIhkB,EAAGA,EAAE+I,cAAe,QAAQ,IACzCugB,EAAKA,EAAG/uB,MAAM,GAAG+uB,aAAE,EAAFA,EAAIxuB,QAAS,IAC3BoD,SAAQ,SAAC4D,GACVynB,GAAevpB,EAAGqB,EAAGS,EACvB,GACF,EAEMynB,GAAiB,SAACvpB,EAAWqB,EAAW0K,GAC5C,IACMuD,EADWtP,EAAE4f,QAAQ7T,GACH5O,KAAKmS,OAGhBtP,EACVkgB,gBAAgBnU,EAAO,QACvBpG,MAAK,SAAC1I,GAAM,OAAAA,EAAEkH,SAAWmL,GAAUrS,EAAEiH,SAAWoL,CAApC,IACVnS,KAAKqsB,SAAWC,GAAazpB,EAAGqB,EAAG0K,EAC1C,EAMa0d,GAAe,SAACzpB,EAAWqB,EAAW0K,GACjD,IACMuD,EADWtP,EAAE4f,QAAQ7T,GACH5O,KAAKmS,OAEzBoa,GAAc,EAGdC,EAAYtoB,EACb6e,gBAAgBnU,EAAO,OACvBpG,MAAK,SAAC1I,GAAM,OAAAA,EAAEkH,SAAWmL,CAAb,IAEXsa,EAAW,EA+Bf,OA7BKD,IACHD,GAAc,EACdC,EAAYtoB,EACT6e,gBAAgB5Q,EAAQ,OACxB3J,MAAK,SAAC1I,GAAM,OAAAA,EAAEkH,SAAW4H,CAAb,KAGjB6d,EAAWD,EAAUxsB,KAAKma,OAE1BjW,EAAE6e,gBAAgBnU,EAAO,QAAQ7N,SAAQ,SAACjB,GACxC,IAAM4sB,EAAY5sB,EAAEiH,SAAW6H,EACzB+d,EAAQD,EAAY5sB,EAAEkH,OAASlH,EAAEiH,OAEvC,GAAI4lB,IAAUxa,EAAQ,CACpB,IAAMya,EAAeF,IAAcH,EAC7BM,EAAc/sB,EAAEE,KAAKma,OAG3B,GADAsS,GAAYG,EAAeC,GAAeA,EACtCC,GAAWjqB,EAAG+L,EAAO+d,GAAQ,CAE/B,IAAMI,EAAgBlqB,EACnBkgB,gBAAgBnU,EAAO,QACvBpG,MAAK,SAAC1I,GAAM,OAAAA,EAAEiH,SAAW4lB,GAAS7sB,EAAEkH,SAAW2lB,CAAnC,IAA2C3sB,KACvDqsB,SACHI,GAAYG,GAAgBG,EAAgBA,C,EAGlD,IAEON,CACT,EAEaO,GAAmB,SAC9B9a,EACA+C,QAAA,IAAAA,MAAW/C,EAAKtG,cAAc,GAAG1L,IAEjC+sB,GAAgB/a,EAAM,CAAC,EAAG,EAAG+C,EAC/B,EAEMgY,GAAkB,SACtB/a,EACAwO,EACAwM,EACAvoB,EACAwN,G,MAEMgb,EAAMD,EACRE,EAAaF,EACX9oB,EAAQ8N,EAAKuQ,QAAQ9d,GAkB3B,OAhBA+b,EAAQ/b,IAAK,EACO,QAApB,EAAAuN,EAAKxD,aAAa/J,UAAE,SAAE5D,SAAQ,SAAC3B,GACxBshB,EAAQthB,EAAEc,MACbktB,EAAaH,GAAgB/a,EAAMwO,EAAS0M,EAAYhuB,EAAEc,GAAIyE,GAElE,IAEAP,EAAMpE,KAAKmtB,IAAMA,EACjB/oB,EAAMpE,KAAKqtB,IAAMD,IACbjb,EACF/N,EAAMpE,KAAKmS,OAASA,SAGb/N,EAAMpE,KAAKmS,OAGbib,CACT,EAEaE,GAAY,SAACpb,GACxB,OAAOA,EAAKrG,cAAcrD,MAAK,SAAC1I,GAC9B,OAAOA,EAAEE,KAAKqsB,SAAY,CAC5B,GACF,EAEakB,GAAY,SAAC1qB,EAAWqB,EAAWuE,GAC9C,IAAI9D,EAAI8D,EAAK1B,OACT3H,EAAIqJ,EAAKzB,OAKR9C,EAAE6e,gBAAgBpe,EAAG,OAAO6D,MAAK,SAAC1I,GAAM,OAAAA,EAAEkH,SAAW5H,CAAb,MAC3CuF,EAAI8D,EAAKzB,OACT5H,EAAIqJ,EAAK1B,QAGX,IAAMymB,EAAS3qB,EAAE4f,QAAQ9d,GACnB8oB,EAAS5qB,EAAE4f,QAAQrjB,GACrBsuB,EAAYF,EACZG,GAAO,EAIPH,EAAOxtB,KAAKqtB,IAAOI,EAAOztB,KAAKqtB,MACjCK,EAAYD,EACZE,GAAO,GAGT,IAAMC,EAAa1pB,EAAE2H,cAAchD,QAAO,SAACJ,GACzC,OACEklB,IAASE,GAAahrB,EAAE4f,QAAQha,EAAK1B,QAAS2mB,IAC9CC,IAASE,GAAahrB,EAAE4f,QAAQha,EAAKzB,QAAS0mB,EAElD,IAEA,OAAO3C,GAAM6C,GAAY,SAACnlB,GACxB,OAAOgjB,GAAMvnB,EAAGuE,EAClB,GACF,EASaqlB,GAAgB,SAC3BjrB,EACAqB,EACApE,EACAK,GAGA,IAAM4tB,EAAUlrB,EACbkgB,gBAAgBjjB,EAAEiH,OAAQ,QAC1ByB,MAAK,SAACC,GAAS,OAAAA,EAAK1B,SAAWjH,EAAEkH,QAAUyB,EAAKzB,SAAWlH,EAAEkH,MAA9C,IACd+mB,GACFlrB,EAAEkiB,WAAWgJ,EAAQ7tB,IAGvB2C,EAAEgiB,QAAQ,CACR3kB,GAAI,IAAIgK,KAAKS,SACb5D,OAAQ5G,EAAE4G,OACVC,OAAQ7G,EAAE6G,OACVhH,KAAM,CAAC,IAGTgtB,GAAiBnqB,GACjBqpB,GAAcrpB,EAAGqB,GACjB8pB,GAAYnrB,EAAGqB,EACjB,EAEM8pB,GAAc,SAACnrB,EAAWqB,GAC9B,IAAM+Q,EAAOpS,EAAE+I,cAAcpD,MAAK,SAAC7D,GACjC,OAAQA,EAAE3E,KAAKmS,MACjB,IAEIga,EAAKtF,GAAIhkB,EAAGoS,EAAM,OAAO,IAC7BkX,EAAKA,EAAG/uB,MAAM,IACX2D,SAAQ,SAAC4D,GACV,IAAMwN,EAAStP,EAAE4f,QAAQ9d,GAAG3E,KAAKmS,OAC7B1J,EAAOvE,EAAE6e,gBAAgBpe,EAAG,OAAO6D,MAAK,SAAC1I,GAAM,OAAAA,EAAEkH,SAAWmL,CAAb,IAE/C8b,GAAU,GAETxlB,GAAQvE,EAAEwe,QAAQvQ,KAErB1J,EAAOvE,EAAE6e,gBAAgB5Q,EAAQ,OAAO3J,MAAK,SAAC1I,GAAM,OAAAA,EAAEkH,SAAWrC,CAAb,IACpDspB,GAAU,GAGZ/pB,EAAEue,QAAQ9d,GAAG3E,KAAKwqB,MACdtmB,EAAEwe,QAAQvQ,IAAWjO,EAAEue,QAAQtQ,GAAQnS,KAAKwqB,MAAU,IACvDyD,EAAUxlB,aAAI,EAAJA,EAAMzI,KAAKwrB,SAAW/iB,aAAI,EAAJA,EAAMzI,KAAKwrB,QAChD,GACF,EAKMsB,GAAa,SAAC5a,EAAcgc,EAAOvpB,GAEvC,OAAOuN,EACJ6Q,gBAAgBmL,EAAG,QACnB1lB,MAAK,SAAC1I,GAAM,OAAAA,EAAEiH,SAAWpC,GAAK7E,EAAEkH,SAAWrC,CAA/B,GACjB,EAMMkpB,GAAe,SAACL,EAAwBW,GAC5C,OACEA,EAAUnuB,KAAKmtB,KAAQK,EAAOxtB,KAAKqtB,KACnCG,EAAOxtB,KAAKqtB,KAAQc,EAAUnuB,KAAKqtB,GAEvC,EC5OMe,GAAoB7C,GAOpB8C,GAAuB,SAACnqB,IDbA,SAACoqB,GAC7B,IAAMpqB,EJLgB,SAACA,GACvB,IAAM6lB,EAAa,IAAIjJ,GA0BvB,OAzBA5c,EAAE0H,cAAc7K,SAAQ,SAAC4D,GACvBolB,EAAWrG,QAAQ,KAAK/e,GAC1B,IACAT,EAAE2H,cAAc9K,SAAQ,SAACjB,GACvB,IAAM2I,EAAOshB,EACVhH,gBAAgBjjB,EAAEiH,OAAQ,OAC1ByB,MAAK,SAACC,GAAS,OAAAA,EAAKzB,SAAWlH,EAAEkH,MAAlB,IACbyB,EAWHshB,EAAWxE,eAAe9c,aAAI,EAAJA,EAAMvI,GAAK,OAChCuI,EAAKzI,MAAI,CACZma,OAAQ1R,EAAKzI,KAAKma,OAAUra,EAAEE,KAAKma,QAAW,EAC9CqR,OAAQthB,KAAKc,IAAIvC,EAAKzI,KAAKwrB,OAAS1rB,EAAEE,KAAKwrB,QAAW,MAbxDzB,EAAWlF,QAAQ,CACjB3kB,GAAIJ,EAAEI,GACN6G,OAAQjH,EAAEiH,OACVC,OAAQlH,EAAEkH,OACVhH,KAAM,CACJma,OAAQra,EAAEE,KAAKma,QAAW,EAC1BqR,OAAQ1rB,EAAEE,KAAKwrB,QAAW,IAUlC,IACOzB,CACT,CIvBYwE,CAASD,GACnB,GAASpqB,GACT,IAIIpE,EACAK,EALE0C,EDZa,SAACqB,GACpB,IASIuE,EACAujB,EAVEnpB,EAAI,IAAIie,GAAM,CAClB5O,KAAM,KAIFsc,EAAQtqB,EAAE0H,cAAc,GACxBvF,EAAOnC,EAAE0H,cAAcjO,OAK7B,IAJAkF,EAAE6gB,QAAQ8K,GAIH9C,GAAU7oB,EAAGqB,GAAKmC,GACvBoC,EAAOqjB,GAAiBjpB,EAAGqB,GAC3B8nB,EAAQnpB,EAAE6f,QAAQja,EAAK1B,QAAU0kB,GAAMvnB,EAAGuE,IAASgjB,GAAMvnB,EAAGuE,GAC5DsjB,GAAWlpB,EAAGqB,EAAG8nB,GAGnB,OAAOnpB,CACT,CCPY4rB,CAAavqB,GAMvB,IALA8oB,GAAiBnqB,GACjBqpB,GAAcrpB,EAAGqB,GAITpE,EAAIwtB,GAAUzqB,IACpB1C,EAAIotB,GAAU1qB,EAAGqB,EAAGpE,GACpBguB,GAAcjrB,EAAGqB,EAAGpE,EAAGK,EAE3B,CCCEuuB,CAAexqB,EACjB,ECaM,GAAM,SACVA,EACA+Q,EACA0Z,EACAxU,EACAjP,EACA0jB,EACAjqB,GAEA,IAAM6C,EAAWtD,EAAE+hB,YAAYthB,GAC/B,GAAK6C,aAAQ,EAARA,EAAU7J,OAAf,CAaA,IAAMwK,EAAM2iB,GAAc5mB,EAAG,OACvBkE,EAAS0iB,GAAc5mB,EAAG,OAC1BE,EAAQF,EAAEue,QAAQ9d,GAExBT,EAAE4hB,UAAU3d,EAAKxD,GACjBP,EAAMpE,KAAK6uB,UAAY1mB,EACvBjE,EAAE4hB,UAAU1d,EAAQzD,GACpBP,EAAMpE,KAAK8uB,aAAe1mB,EAE1BZ,WAAUzG,SAAQ,SAACguB,GACjB,GAAI7qB,EAAG+Q,EAAM0Z,EAASxU,EAAQjP,EAAQ0jB,EAAQG,EAAU7uB,IAExD,IAAM8uB,EAAWD,EAAU/uB,KAAK6uB,UAC3BE,EAAU/uB,KAAK6uB,UAChBE,EAAU7uB,GACR+uB,EAAcF,EAAU/uB,KAAK8uB,aAC9BC,EAAU/uB,KAAK8uB,aAChBC,EAAU7uB,GACRgvB,EAAaH,EAAU/uB,KAAK6uB,UAAY1U,EAAS,EAAIA,EACrDqR,EAASwD,IAAaC,EAAc,EAAI/jB,EAAS0jB,EAAOjqB,GAAK,EAEnET,EAAE2gB,QAAQ,CACR3kB,GAAI,IAAIgK,KAAKS,SACb5D,OAAQoB,EACRnB,OAAQgoB,EACRhvB,KAAM,CACJwrB,OAAM,EACNrR,OAAQ+U,EACRC,aAAa,KAIjBjrB,EAAE2gB,QAAQ,CACR3kB,GAAI,IAAIgK,KAAKS,SACb5D,OAAQkoB,EACRjoB,OAAQoB,EACRpI,KAAM,CACJwrB,OAAM,EACNrR,OAAQ+U,EACRC,aAAa,IAGnB,IAEKjrB,EAAE8hB,UAAUrhB,IACfT,EAAE2gB,QAAQ,CACR3kB,GAAI,IAAIgK,KAAKS,SACb5D,OAAQkO,EACRjO,OAAQmB,EACRnI,KAAM,CACJma,OAAQ,EACRqR,OAAQtgB,EAAS0jB,EAAOjqB,K,MA/DxBA,IAAMsQ,GAER/Q,EAAE2gB,QAAQ,CACR3kB,GAAI,IAAIgK,KAAKS,SACb5D,OAAQkO,EACRjO,OAAQrC,EACR3E,KAAM,CAAEma,OAAQ,EAAGqR,OAAQmD,IA6DnC,ECpHM,GAAgB,SACpBzqB,EACA9B,EACAzG,EACAyzB,EACAC,EACA7E,GAEA,IAAMpmB,EAAkB,CAAEomB,KAAI,EAAE8E,WAAYltB,EAAM6I,MAAO,EAAGC,OAAQ,GAE9Dyc,EAAO0H,EAAOrvB,KAAKoC,GAAMooB,EAAO,GAChCvC,EAAO2B,GAAa1lB,EAAG,SAAUE,EAAOzI,GAE9C0zB,EAAOrvB,KAAKoC,GAAMooB,GAAQvC,EAC1B/jB,EAAE4hB,UAAUmC,EAAMmH,GACdzH,GACFzjB,EAAE2gB,QAAQ,CACR3kB,GAAI,IAAIgK,KAAKS,SACb5D,OAAQ4gB,EACR3gB,OAAQihB,EACRjoB,KAAM,CAAEma,OAAQ,IAGtB,EC9BMoV,GAAkB,SAACrrB,GACvBA,EAAE0H,cAAc7K,SAAQ,SAAC4D,GACvB6qB,GAAmB7qB,EACrB,IACAT,EAAE2H,cAAc9K,SAAQ,SAACjB,GACvB0vB,GAAmB1vB,EACrB,GACF,EAEM0vB,GAAqB,SAAC1oB,GAC1B,IAAM1H,EAAI0H,EAAK9G,KAAKiL,MACpBnE,EAAK9G,KAAKiL,MAAQnE,EAAK9G,KAAKkL,OAC5BpE,EAAK9G,KAAKkL,OAAS9L,CACrB,EAeMqwB,GAAc,SAAC3oB,IACfA,aAAI,EAAJA,EAAM7C,KACR6C,EAAK7C,GAAK6C,EAAK7C,EAEnB,EAeMyrB,GAAY,SAAC5oB,GACjB,IAAMmB,EAAInB,EAAKmB,EACfnB,EAAKmB,EAAInB,EAAK7C,EACd6C,EAAK7C,EAAIgE,CACX,EC3Da0nB,GAAY,SAACzrB,GAUxB,IATA,IAAMwc,EAAmC,CAAC,EAIpCkP,EAAc1rB,EAAE0H,cAChBikB,EAAYD,EAAY9mB,KAAI,SAACnE,GAAC,MAAK,OAAY,QAAZ,EAAAA,EAAE3E,KAAKwqB,YAAK,SAAI,GAAS,IAE5DD,EAAUrgB,KAAKc,IAAG,MAARd,KAAI,OAAQ2lB,KACtBC,EAAiB,GACdryB,EAAI,EAAGA,EAAI8sB,EAAU,EAAG9sB,IAC/BqyB,EAAOrzB,KAAK,IAGd,IAAMszB,EAAYH,EAAYjiB,MAC5B,SAACzM,EAAGC,GAAM,OAAA+C,EAAEue,QAAQvhB,EAAEhB,IAAIF,KAAKwqB,KAAQtmB,EAAEue,QAAQthB,EAAEjB,IAAIF,KAAKwqB,IAAlD,IAQNwF,EAHaD,EAAUlnB,QAAO,SAACnH,GACnC,YAAyCjD,IAAlCyF,EAAEue,QAAQ/gB,EAAExB,IAAIF,KAAKiwB,QAC9B,IACiCtiB,MAC/B,SAACzM,EAAGC,GAAM,OAAA+C,EAAEue,QAAQvhB,EAAEhB,IAAIF,KAAKiwB,SAAY/rB,EAAEue,QAAQthB,EAAEjB,IAAIF,KAAKiwB,QAAtD,IAmBZ,OAjBAD,WAAejvB,SAAQ,SAACW,GACjBsE,MAAM9B,EAAEue,QAAQ/gB,EAAExB,IAAIF,KAAKwqB,OAC9BsF,EAAO5rB,EAAEue,QAAQ/gB,EAAExB,IAAIF,KAAKwqB,MAAO/tB,KAAKiF,EAAExB,IAE5CwgB,EAAQhf,EAAExB,KAAM,CAClB,IAEA6vB,WAAWhvB,SAAQ,SAACW,GAClB,OAAAwC,EAAEsiB,QAAQ9kB,EAAExB,IAAI,SAAC4G,GACf,GAAI4Z,EAAQhlB,eAAeoL,EAAK5G,IAAK,OAAO,EAC5CwgB,EAAQ5Z,EAAK5G,KAAM,EACd8F,MAAMc,EAAK9G,KAAKwqB,OACnBsF,EAAOhpB,EAAK9G,KAAKwqB,MAAO/tB,KAAKqK,EAAK5G,GAEtC,GANA,IASK4vB,CACT,ECrCMI,GAAqB,SAAChsB,EAAUisB,EAAkBC,GAkBtD,IAdA,IAAMC,EVwDiB,SAAU9lB,EAAYmc,GAC7C,OAAOnc,aAAI,EAAJA,EAAM2gB,QAAO,SAAC/oB,EAAKL,EAAKrE,GAE7B,OADA0E,EAAIL,GAAO4kB,EAAOjpB,GACX0E,CACT,GAAG,CAAC,EACN,CU7DmBmuB,CACfF,EACAA,EAAWtnB,KAAI,SAACnE,EAAGlH,GAAM,OAAAA,CAAA,KAErB8yB,EAASJ,EAAWrnB,KAAI,SAACnE,GAC7B,IAAM6rB,EAAStsB,EAAE6e,gBAAgBpe,EAAG,OAAOmE,KAAI,SAAChJ,GAC9C,MAAO,CAAE2wB,IAAKJ,EAASvwB,EAAEkH,SAAW,EAAGmT,OAAQra,EAAEE,KAAKma,OACxD,IACA,OAAOqW,aAAM,EAANA,EAAQ7iB,MAAK,SAACzM,EAAGC,GAAM,OAAAD,EAAEuvB,IAAMtvB,EAAEsvB,GAAV,GAChC,IACMC,EAAeH,EAAOhH,OAAO1gB,QAAO,SAAC6e,GAAU,YAAUjpB,IAAVipB,CAAA,IAGjDiJ,EAAa,EACVA,EAAaP,EAAWzyB,QAAQgzB,IAAe,EACtD,IAAMC,EAAW,EAAID,EAAa,EAClCA,GAAc,EACd,IAAMze,EAAOrU,MAAM+yB,GAAUC,KAAK,EAAG,EAAGD,GAGpCE,EAAK,EAiBT,OAhBAJ,WAAc3vB,SAAQ,SAAC2mB,GACrB,GAAIA,EAAO,CACT,IAAIrO,EAAQqO,EAAM+I,IAAME,EACxBze,EAAKmH,IAAUqO,EAAMvN,OAErB,IADA,IAAI4W,EAAY,EACT1X,EAAQ,GACTA,EAAQ,IACV0X,GAAa7e,EAAKmH,EAAQ,IAG5BnH,EADAmH,EAASA,EAAQ,GAAM,IACRqO,EAAMvN,OAEvB2W,GAAMpJ,EAAMvN,OAAU4W,C,CAE1B,IAEOD,CACT,EAEaE,GAAa,SAAC9sB,EAAU+sB,GAEnC,IADA,IAAIH,EAAK,EACArzB,EAAI,EAAGA,GAAIwzB,aAAQ,EAARA,EAAUtzB,QAAQF,GAAK,EACzCqzB,GAAMZ,GAAmBhsB,EAAG+sB,EAASxzB,EAAI,GAAIwzB,EAASxzB,IAExD,OAAOqzB,CACT,EC4DMI,GAAe,SAAClqB,EAAuBD,G,MACvCoqB,EAAM,EACNhX,EAAS,EAETnT,EAAOmT,SACTgX,GAAOnqB,EAAOoqB,WAAcpqB,EAAOmT,OACnCA,GAAUnT,EAAOmT,QAGfpT,EAAOoT,SACTgX,GAAOpqB,EAAOqqB,WAAcrqB,EAAOoT,OACnCA,GAAUpT,EAAOoT,QAGnBnT,EAAOmlB,GAAc,QAAT,EAAAplB,EAAOolB,UAAE,eAAE7uB,OAAO0J,EAAOmlB,IACrCnlB,EAAOoqB,WAAaD,EAAMhX,EAC1BnT,EAAOmT,OAASA,EAChBnT,EAAOvJ,EAAIyM,KAAKoD,IAAIvG,EAAOtJ,EAAGuJ,EAAOvJ,GACrCsJ,EAAOsqB,QAAS,CAClB,EAEA,SA9GyB,SACvB7T,EAKA8T,G,UAEMC,EAA+C,CAAC,EA6BtD,OA5BA/T,WAASzc,SAAQ,SAAC2mB,EAAOjqB,GACvB8zB,EAAc7J,EAAM/iB,GAAK,CACvBlH,EAAC,EACD+zB,SAAU,EACVhoB,GAAI,GACJC,IAAK,GACL0iB,GAAI,CAACzE,EAAM/iB,IAEb,IAAM8sB,EAAMF,EAAc7J,EAAM/iB,QACPlG,IAArBipB,EAAM0J,aACRK,EAAIL,WAAa1J,EAAM0J,WACvBK,EAAItX,OAASuN,EAAMvN,OAEvB,IAEgB,QAAhB,EAAAmX,EAAGzlB,qBAAa,SAAE9K,SAAQ,SAACjB,GACzB,IAAM4xB,EAASH,EAAczxB,EAAEiH,QACzB4qB,EAASJ,EAAczxB,EAAEkH,aAChBvI,IAAXizB,QAAmCjzB,IAAXkzB,IAC1BA,EAAOH,WACPE,EAAOjoB,IAAKhN,KAAK80B,EAAczxB,EAAEkH,SAErC,IASyB,SAAC4qB,GAyB1B,I,QAxBMpU,EAAU,G,aAyBd,IAAMkK,EAAQkK,EAAU/sB,MACxB2Y,EAAQ/gB,KAAKirB,GACS,QAAtB,EAAAA,EAAU,GAAGmK,iBAAS,SAAE9wB,SAAQ,SAACjB,GAAqB,OAzBtCgyB,EAyB+CpK,EAxBxD,SAACc,GACFA,EAAO6I,cAEa5yB,IAAtB+pB,EAAO4I,iBACe3yB,IAAtBqzB,EAAOV,YACP5I,EAAO4I,YAAcU,EAAOV,aAE5BF,GAAaY,EAAQtJ,EAEzB,GAesE1oB,GAzBvD,IAACgyB,CAyBsC,IAC7C,QAAT,EAAApK,EAAMje,WAAG,SAAE1I,SAAQ,SAACjB,GAAqB,OAbxBgyB,EAakCpK,EAZ5C,SAACgB,GACNA,EAAW,GAAGjsB,KAAKq1B,GACQ,KAArBpJ,EAAO8I,UACXI,EAAUn1B,KAAKisB,EAEnB,GAO0D5oB,GAb1C,IAACgyB,CAawB,G,EAJpCF,aAAS,EAATA,EAAWj0B,Q,IAOlB,IAAMo0B,EAAWvU,EAAQ3U,QAAO,SAAC6e,GAAU,OAACA,EAAM2J,MAAP,IACrC9mB,EAAiD,CACrD,KACA,IACA,aACA,UAEF,OAAOwnB,EAASjpB,KAAI,SAAC4e,GACnB,IAAMsK,EAA8B,CAAC,EAKrC,OAJAznB,WAAMxJ,SAAQ,SAACe,QACMrD,IAAfipB,EAAM5lB,KACVkwB,EAAOlwB,GAAO4lB,EAAM5lB,GACtB,IACOkwB,CACT,GACF,CAlDSC,CAJ8C,QAAnC,KAAAz2B,OAAOkrB,OAAO6K,IAAe1oB,cAAM,uBACnD,SAAC6e,GAAyB,OAACA,EAAM8J,QAAP,IAI9B,EC5EO,IA4CDU,GAAoB,SACxB/F,EACAgG,EACA9Y,GAIA,IAFA,IACI+Y,EADAC,EAAShZ,EAGX8Y,EAAWx0B,SACVy0B,EAAOD,EAAWA,EAAWx0B,OAAS,IAAIF,GAAK40B,GAEhDF,EAAWttB,MACXsnB,WAAI1vB,KAAK21B,EAAKjG,IACdkG,IAEF,OAAOA,CACT,EC1DaC,GAAe,SAC1BpuB,EACAS,EACA2sB,EACAiB,EACAC,EACAC,G,YAEIC,EAAUxuB,EAAE+hB,YAAYthB,GAAGmE,KAAI,SAACpH,GAAM,OAAAA,EAAExB,EAAF,IAEpC4G,EAAO5C,EAAEue,QAAQ9d,GACjBguB,EAAK7rB,EAAQA,EAAK9G,KAAK4yB,gBAAoBn0B,EAC3Co0B,EAAK/rB,EAAQA,EAAK9G,KAAK8yB,iBAAqBr0B,EAC5Cs0B,EAAoD,CAAC,EAEvDJ,IACFD,EAAUA,aAAO,EAAPA,EAAS7pB,QAAO,SAACzJ,GACzB,OAAOA,IAAMuzB,GAAMvzB,IAAMyzB,CAC3B,KAGF,IAAMG,ECrBkB,SAAC9uB,EAAUwuB,GACnC,OAAOA,EAAQ5pB,KAAI,SAACnE,GAClB,IAAMsuB,EAAM/uB,EAAE6e,gBAAgBpe,EAAG,MACjC,KAAKsuB,aAAG,EAAHA,EAAKt1B,QACR,MAAO,CAAEgH,EAAC,GAGZ,IAAMnE,EAAS,CAAE2wB,IAAK,EAAGhX,OAAQ,GAMjC,OALA8Y,WAAKlyB,SAAQ,SAACjB,GACZ,IAAMozB,EAAQhvB,EAAEue,QAAQ3iB,EAAEiH,QAC1BvG,EAAO2wB,KAAOrxB,EAAEE,KAAKma,OAAU+Y,EAAMlzB,KAAK4qB,MAC1CpqB,EAAO2Z,QAAUra,EAAEE,KAAKma,MAC1B,IACO,CACLxV,EAAC,EACDysB,WAAY5wB,EAAO2wB,IAAM3wB,EAAO2Z,OAChCA,OAAQ3Z,EAAO2Z,OAEnB,GACF,CDEsBiX,CAAWltB,EAAGwuB,GAAW,IAC7CM,WAAajyB,SAAQ,SAAC2mB,G,MACpB,GAA0B,QAAtB,EAAAxjB,EAAE+hB,YAAYyB,EAAM/iB,UAAE,eAAEhH,OAAQ,CAClC,IAAMw1B,EAAiBb,GACrBpuB,EACAwjB,EAAM/iB,EACN2sB,EACAiB,EACAE,GAEFM,EAAUrL,EAAM/iB,GAAKwuB,EACjBA,EAAez3B,eAAe,eAChC03B,GAAiB1L,EAAOyL,E,CAG9B,IAEA,IAAM3V,EAAU,GAAiBwV,EAAa1B,GAC9C+B,GAAgB7V,EAASuV,GAKQ,QADjC,EAAAvV,EACG3U,QAAO,SAAC/I,GAAM,OAAAA,EAAEqsB,GAAGxuB,OAAS,CAAd,WAAgB,SAC7BoD,SAAQ,SAACjB,GACT,IAAMgH,EAAO5C,EAAEue,QAAQ3iB,EAAEqsB,GAAG,IACxBrlB,IACFhH,EAAEmwB,SAAWnpB,EAAK9G,KAAKiwB,SACvBnwB,EAAE8qB,MAAQ9jB,EAAK9G,KAAK4qB,MAExB,IAEF,IAAMpqB,EDvDY,SAClBgd,EACA+U,EACAC,EACAC,GAEA,IAAMa,EZmRiB,SACvBC,EACAz3B,GAEA,IAAM0E,EAAS,CAAEgzB,IAAK,GAAWC,IAAK,IAQtC,OAPAF,WAAYxyB,SAAQ,SAAC0C,GYxRY,IAACikB,EAC1BgM,KAD0BhM,EZyRzBjkB,GYvRC/H,eAAe,cAAgBsK,MAAM0hB,EAAMuI,WAC/CwC,GACMiB,GAAehM,EAAMhsB,eAAe,cAGvCg4B,GAAehM,EAAMhsB,eAAe,eZmRzC8E,EAAOgzB,IAAI/2B,KAAKgH,GAEhBjD,EAAOizB,IAAIh3B,KAAKgH,EAEpB,IACOjD,CACT,CYhSgBmzB,CAAUnW,GASlBoW,EAAWN,EAAME,IACjBrB,EAAamB,EAAMG,IAAI9lB,MAAK,SAACzM,EAAGC,GAAM,OAACD,EAAEzD,IAAK0D,EAAE1D,CAAV,IACtC0uB,EAAa,GACfgF,EAAM,EACNhX,EAAS,EACT0Z,EAAU,EAEdD,WAAUjmB,KA2CY,SAACkN,EAAe2X,GACtC,OAAO,SAACd,EAAuBC,GAE7B,QAAwBlzB,IAApBizB,EAAOzB,eAA8CxxB,IAApBkzB,EAAO1B,SAC1C,OAAOyB,EAAOzB,SAAW0B,EAAO1B,SAElC,GAAIyB,EAAON,WAAcO,EAAOP,WAC9B,OAAQ,EAEV,GAAIM,EAAON,WAAcO,EAAOP,WAC9B,OAAO,EAGT,GAAIoB,QAA4B/zB,IAAjBizB,EAAO9G,YAAwCnsB,IAAjBkzB,EAAO/G,MAAqB,CACvE,GAAI8G,EAAO9G,MAAQ+G,EAAO/G,MACxB,OAAQ,EAEV,GAAI8G,EAAO9G,MAAQ+G,EAAO/G,MACxB,OAAO,C,CAIX,OAAQ/P,EAA6B8W,EAAOl0B,EAAIi0B,EAAOj0B,EAAxCi0B,EAAOj0B,EAAIk0B,EAAOl0B,CACnC,CACF,CAnEiBq2B,GAAkBvB,IAAaC,IAE9CqB,EAAU3B,GAAkB/F,EAAIgG,EAAY0B,GAE5CD,WAAU7yB,SAAQ,SAAC2mB,G,MACjBmM,GAAmB,QAAR,EAAAnM,EAAMyE,UAAE,eAAExuB,OACrBwuB,EAAG1vB,KAAKirB,EAAMyE,IACdgF,GAAOzJ,EAAM0J,WAAc1J,EAAMvN,OACjCA,GAAUuN,EAAMvN,OAChB0Z,EAAU3B,GAAkB/F,EAAIgG,EAAY0B,EAC9C,IAEA,IAAMrzB,EAA6D,CACjE2rB,GAAIA,EAAG5C,QAMT,OAJIpP,IACF3Z,EAAO4wB,WAAaD,EAAMhX,EAC1B3Z,EAAO2Z,OAASA,GAEX3Z,CACT,CCaiBmN,CAAK6P,EAAS+U,EAAWC,EAASC,GAEjD,GAAIE,IACFnyB,EAAO2rB,GAAK,CAACwG,EAAInyB,EAAO2rB,GAAI0G,GAAItJ,OACP,QAArB,EAAArlB,EAAEkf,gBAAgBuP,UAAG,eAAEh1B,QAAQ,CACjC,IAAMo2B,EAAS7vB,EAAEue,SAA6B,QAArB,EAAAve,EAAEkf,gBAAgBuP,UAAG,eAAG,GAAGzyB,KAAM,IACpD8zB,EAAS9vB,EAAEue,SAA8B,QAAtB,EAAAve,EAAEkf,gBAAgByP,UAAI,eAAG,GAAG3yB,KAAM,IACtDM,EAAO9E,eAAe,gBACzB8E,EAAO4wB,WAAa,EACpB5wB,EAAO2Z,OAAS,GAElB3Z,EAAO4wB,YACJ5wB,EAAO4wB,WAAc5wB,EAAO2Z,OAC3B4Z,EAAO/zB,KAAK4qB,MACZoJ,EAAOh0B,KAAK4qB,QACbpqB,EAAO2Z,OAAU,GACpB3Z,EAAO2Z,QAAW,C,CAItB,OAAO3Z,CACT,EAEM6yB,GAAkB,SACtB7V,EACAuV,GAEAvV,WAASzc,SAAQ,SAAC2mB,G,MACVuM,EAAc,QAAR,EAAAvM,EAAMyE,UAAE,eAAErjB,KAAI,SAACnE,GACzB,OAAIouB,EAAUpuB,GACLouB,EAAUpuB,GAAGwnB,GAEfxnB,CACT,IACA+iB,EAAMyE,GAAK8H,EAAI1K,MACjB,GACF,EAEM6J,GAAmB,SACvBpsB,EACA2lB,QAE0BluB,IAAtBuI,EAAOoqB,YACTpqB,EAAOoqB,YACJpqB,EAAOoqB,WAAapqB,EAAOmT,OAAUwS,EAAMyE,WAAczE,EAAMxS,SAC/DnT,EAAOmT,OAAUwS,EAAMxS,QAC1BnT,EAAOmT,QAAWwS,EAAMxS,SAExBnT,EAAOoqB,WAAazE,EAAMyE,WAC1BpqB,EAAOmT,OAASwS,EAAMxS,OAE1B,EE7GI,GAAQ,SAAUhY,GAClB,GAAmB,iBAARA,GAA4B,OAARA,EAC3B,OAAOA,EAEX,IAAI+xB,ECJkBzwB,EDKtB,GCLsBA,EDKVtB,ECJLtE,MAAM+H,QAAU/H,MAAM+H,QAAQnC,GAAS,EAAOA,EAAO,SDI1C,CACdywB,EAAM,GACN,IAAK,IAAIz2B,EAAI,EAAGC,EAAIyE,EAAIxE,OAAQF,EAAIC,EAAGD,IACb,iBAAX0E,EAAI1E,IAA6B,MAAV0E,EAAI1E,GAClCy2B,EAAIz2B,GAAK,GAAM0E,EAAI1E,IAGnBy2B,EAAIz2B,GAAK0E,EAAI1E,EAGzB,MAGI,IAAK,IAAI8I,KADT2tB,EAAM,CAAC,EACO/xB,EACY,iBAAXA,EAAIoE,IAA6B,MAAVpE,EAAIoE,GAClC2tB,EAAI3tB,GAAK,GAAMpE,EAAIoE,IAGnB2tB,EAAI3tB,GAAKpE,EAAIoE,GAIzB,OAAO2tB,CACX,EACA,YELO,IAqDDC,GAAmB,SACvBjwB,EACAkwB,EACApR,GAEA,OAAOoR,EAAMtrB,KAAI,SAAC0hB,GAChB,OCnD2B,SAC7BtmB,EACAsmB,EACAxH,GAEA,IAAM/N,EAwEe,SAAC/Q,GAEtB,IADA,IAAIS,EACGT,EAAEwe,QAAS/d,EAAI,QAAQuF,KAAKS,YACnC,OAAOhG,CACT,CA5Ee0vB,CAAenwB,GACtB1D,EAAS,IAAIsgB,GAA0B,CAC3C5O,KAAM,CACJ,CACEhS,GAAI+U,EACJzN,SAAU,GACVxH,KAAM,CAAC,MA+Db,OA1DAkE,EAAE0H,cAAc7K,SAAQ,SAAC4D,GACvB,IAAMwN,EAASjO,EAAE8hB,UAAUrhB,EAAEzE,KAG3ByE,EAAE3E,KAAKwqB,OAASA,GACf7lB,EAAE3E,KAAKs0B,SAAY9J,GAAQA,GAAQ7lB,EAAE3E,KAAKuqB,WAEtC/pB,EAAOkiB,QAAQ/d,EAAEzE,KACpBM,EAAOkjB,QAAQ,KAAK/e,KAGlBwN,aAAM,EAANA,EAAQjS,MAAOM,EAAOkiB,QAAQvQ,aAAM,EAANA,EAAQjS,KACxCM,EAAOkjB,QAAQ,KAAKvR,IAGtB3R,EAAOslB,UAAUnhB,EAAEzE,IAAIiS,aAAM,EAANA,EAAQjS,KAAM+U,GAGrC/Q,EAAE6e,gBAAgBpe,EAAEzE,GAAI8iB,GAAWjiB,SAAQ,SAACjB,GAC1C,IAAMouB,EAAIpuB,EAAEiH,SAAWpC,EAAEzE,GAAKJ,EAAEkH,OAASlH,EAAEiH,OACtCvG,EAAOkiB,QAAQwL,IAClB1tB,EAAOkjB,QAAQ,KAAKxf,EAAEue,QAAQyL,KAGhC,IAAMzlB,EAAOjI,EACVuiB,gBAAgBmL,EAAG,OACnB1lB,MAAK,SAAC,GAAe,OAAP,WAAkB7D,EAAEzE,EAAb,IAClBia,OAAkB1b,IAATgK,EAAqBA,EAAKzI,KAAKma,OAAU,EAEnD1R,EAUHjI,EAAO+kB,eAAe9c,EAAKvI,GAAI,OAC1BuI,EAAKzI,MAAI,CACZma,OAAQra,EAAEE,KAAKma,OAAUA,KAX3B3Z,EAAOqkB,QAAQ,CACb3kB,GAAIJ,EAAEI,GACN6G,OAAQmnB,EACRlnB,OAAQrC,EAAEzE,GACVF,KAAM,CACJma,OAAQra,EAAEE,KAAKma,OAAUA,IASjC,IAIIxV,EAAE3E,KAAKtE,eAAe,YACxB8E,EAAO4jB,eAAezf,EAAEzE,GAAI,OACvByE,EAAE3E,MAAI,CACT4yB,WAAajuB,EAAE3E,KAAK4yB,WAAoBpI,GACxCsI,YAAcnuB,EAAE3E,KAAK8yB,YAAqBtI,MAIlD,IAEOhqB,CACT,CDxBW+zB,CAAgBrwB,EAAGsmB,EAAMxH,EAClC,GACF,EAEMwR,GAAmB,SACvBC,EACAlC,EACAC,EACAC,GAEA,IAAMnB,EAAK,IAAIxQ,GACf2T,WAAa1zB,SAAQ,SAAC2zB,GAWpB,I,MATMzf,EAAOyf,EAAG3O,WAAW,GAAG7lB,GACxBy0B,EAASrC,GACboC,EACAzf,EACAqc,EACAiB,EACAC,EACAC,GAEOh1B,EAAI,EAAGA,GAAa,QAAT,EAAAk3B,EAAOxI,UAAE,eAAExuB,QAAaF,IAAK,CAC/C,IAAMm3B,EAAQF,EAAGjS,QAAQkS,EAAOxI,GAAG1uB,IAC/Bm3B,IACFA,EAAM50B,KAAK4qB,MAAQntB,E,EE1GW,SAACyG,EAAUotB,EAAWnF,GAC1D,IACI0I,EADElN,EAAuB,CAAC,EAG9BwE,WAAIprB,SAAQ,SAAC4D,GAIX,IAHA,IACIwN,EACA2iB,EAFAlmB,EAAQ1K,EAAE8hB,UAAUrhB,GAGjBiK,GAAO,CASZ,IARAuD,EAASjO,EAAE8hB,UAAUpX,EAAM1O,MAEzB40B,EAAYnN,EAAKxV,EAAOjS,IACxBynB,EAAKxV,EAAOjS,IAAM0O,EAAM1O,KAExB40B,EAAYD,EACZA,EAAWjmB,EAAM1O,IAEf40B,GAAaA,IAAclmB,EAAM1O,GAiBnC,OAhBAoxB,EAAG9P,SAAS,CACV,CACEthB,GAAI40B,EACJ90B,KAAM,CAAC,GAET,CACEE,GAAI0O,EAAM1O,GACVF,KAAM,CAAC,UAGXsxB,EAAGzM,QAAQ,CACT3kB,GAAI,IAAI40B,EAAS,IAAIlmB,EAAM1O,GAC3B6G,OAAQ+tB,EACR9tB,OAAQ4H,EAAM1O,GACdF,KAAM,CAAC,IAIX4O,EAAQuD,C,CAEZ,GACF,CFsEI4iB,CAAuBL,EAAIpD,EAAIqD,EAAOxI,GACxC,GACF,EAEM6I,GAAc,SAAC9wB,EAAW+sB,GAC9BA,WAAUlwB,SAAQ,SAAC8qB,GACjBA,WAAO9qB,SAAQ,SAAC4D,EAAOlH,GACrByG,EAAEue,QAAQ9d,GAAG3E,KAAK4qB,MAAQntB,CAC5B,GACF,GACF,EGlDaw3B,GAAqB,SAAC/wB,EAAW+sB,GAC5C,IAAMiE,EAAY,CAAC,EAEnB,SAASC,EACPC,EACA/E,EACAgF,EACAC,EACAC,GAGA,I,QADI5wB,EACKlH,EAAI4yB,EAAU5yB,EAAI43B,EAAU53B,IACnCkH,EAAIywB,EAAM33B,IACM,QAAZ,EAAAyG,EAAEue,QAAQ9d,UAAE,eAAE3E,KAAK6pB,SACD,QAApB,EAAA3lB,EAAEkf,gBAAgBze,UAAE,SAAE5D,SAAQ,SAACmtB,GAC7B,IAAMsH,EAAQtxB,EAAEue,QAAQyL,EAAEhuB,IAExBs1B,EAAMx1B,KAAK6pB,QACV2L,EAAMx1B,KAAK4qB,MAAS0K,GACnBE,EAAMx1B,KAAK4qB,MAAS2K,IAEtBE,GAAYP,EAAWhH,EAAEhuB,GAAIyE,EAEjC,IAGN,CAOA,SAAS+wB,EACP70B,EACA80B,GAEA,IAAMC,EATR,SAAuB/0B,GAErB,OAAOymB,KAAKC,UAAU1mB,EAAOzD,MAAM,GACrC,CAMmBy4B,CAAch1B,GAE3B80B,EAAUzzB,IAAI0zB,KAElBT,EAAI,oBAAIt0B,KACR80B,EAAU5sB,IAAI6sB,GAAU,GAC1B,CAkCA,OAHI3E,aAAQ,EAARA,EAAUtzB,SACZszB,EAAS/F,QA9BQ,SAAC4K,EAAiBV,GACnC,IACIW,EADAC,GAAgB,EAEhB3F,EAAW,EAET4F,EAAU,IAAItd,IAqBpB,OAnBAyc,WAAOr0B,SAAQ,SAAC4D,EAAWuxB,G,MACzB,GAAiC,YAAjB,QAAZ,EAAAhyB,EAAEue,QAAQ9d,UAAE,eAAE3E,KAAK6pB,OAAoB,CACzC,IAAMvG,EAAepf,EAAEkf,gBAAgBze,IAAM,GACzC2e,EAAa3lB,SACfo4B,EAAe7xB,EAAEue,QAAQa,EAAa,GAAGpjB,IAAKF,KAAK4qB,MACnD8K,EACE,CAACN,EAAO/E,EAAU6F,EAAgBF,EAAcD,GAChDE,GAEF5F,EAAW6F,EACXF,EAAeD,E,CAGnBL,EACE,CAACN,EAAO/E,EAAU+E,EAAMz3B,OAAQo4B,EAAcD,EAAMn4B,QACpDs4B,EAEJ,IAEOb,CACT,IAKOF,CACT,EAEaiB,GAA4B,SAACjyB,EAAWS,G,QACnD,GAAgB,QAAZ,EAAAT,EAAEue,QAAQ9d,UAAE,eAAE3E,KAAK6pB,MACrB,OAA2B,QAApB,EAAA3lB,EAAEkf,gBAAgBze,UAAE,eAAE6D,MAAK,SAAC0lB,GAAM,OAAAhqB,EAAEue,QAAQyL,EAAEhuB,IAAIF,KAAK6pB,KAArB,GAE7C,EAEa4L,GAAc,SAACP,EAAsBvwB,EAAOvF,GACvD,IAAIg3B,EAAKzxB,EACL0xB,EAAKj3B,EACT,GAAIg3B,EAAKC,EAAI,CACX,IAAM5E,EAAM2E,EACZA,EAAKC,EACLA,EAAK5E,C,CAGP,IAAI6E,EAAapB,EAAUkB,GACtBE,IACHpB,EAAUkB,GAAME,EAAa,CAAC,GAEhCA,EAAWD,IAAM,CACnB,EAEaE,GAAc,SAACrB,EAAsBvwB,EAAOvF,GACvD,IAAIg3B,EAAKzxB,EAOT,OALIyxB,EADKh3B,IAGPg3B,EAHOh3B,KAMA81B,EAAUkB,EACrB,EA8IaI,GAAkB,SAC7BtyB,EACA+sB,EACAhc,EACAwhB,EACAC,EACAC,GAEA,IAAMC,EAAa,IAAI9V,GACjB+V,EAAQC,GAAIL,EAASC,EAASC,GAsCpC,OApCA1F,WAAUlwB,SAAQ,SAAC8qB,GACjB,IAAIqC,EACJrC,WAAO9qB,SAAQ,SAAC4D,GACd,IAAMoyB,EAAQ9hB,EAAKtQ,GAOnB,GANKiyB,EAAWlU,QAAQqU,IACtBH,EAAWlT,QAAQ,CACjBxjB,GAAI62B,EACJ/2B,KAAM,CAAC,IAGPkuB,EAAG,CACL,IAAM8I,EAAQ/hB,EAAKiZ,GAEbzlB,EAAOmuB,EACV7T,gBAAgBiU,EAAO,OACvBxuB,MAAK,SAACC,GAAS,OAAAA,EAAKzB,SAAW+vB,CAAhB,IACbtuB,EAUHmuB,EAAWrR,eAAe9c,EAAKvI,GAAI,OAC9BuI,EAAKzI,MAAI,CACZma,OAAQjQ,KAAKc,IAAI6rB,EAAM3yB,EAAGS,EAAGupB,GAAIzlB,EAAKzI,KAAKma,QAAW,MAXxDyc,EAAW/R,QAAQ,CACjB3kB,GAAI,IAAIgK,KAAKS,SACb5D,OAAQiwB,EACRhwB,OAAQ+vB,EACR/2B,KAAM,CACJma,OAAQjQ,KAAKc,IAAI6rB,EAAM3yB,EAAGS,EAAGupB,GAAI,K,CAUzCA,EAAIvpB,CACN,GACF,IAEOiyB,CACT,EA8DO,IA4EME,GAAM,SAACnI,EAAiBsI,EAAiBN,GACpD,OAAO,SAACzyB,EAAWS,EAAOvF,GACxB,IAAMouB,EAAStpB,EAAEue,QAAQ9d,GACnB8oB,EAASvpB,EAAEue,QAAQrjB,GACrB+xB,EAAM,EACNnF,EAAgB,EAGpB,GADAmF,GAAO3D,EAAOxtB,KAAKiL,MAAS,EACxBuiB,EAAOxtB,KAAKtE,eAAe,YAC7B,QAAU8xB,EAAOxtB,KAAKk3B,UAAuB,IAAIC,eAC/C,IAAK,IACHnL,GAASwB,EAAOxtB,KAAKiL,MAAS,EAC9B,MACF,IAAK,IACH+gB,EAAQwB,EAAOxtB,KAAKiL,MAAS,EAanC,GATI+gB,IACFmF,GAAOwF,EAAa3K,GAASA,GAE/BA,EAAQ,EAERmF,IAAQ3D,EAAOxtB,KAAK6pB,MAAQoN,EAAUtI,GAAW,EACjDwC,IAAQ1D,EAAOztB,KAAK6pB,MAAQoN,EAAUtI,GAAW,EAEjDwC,GAAO1D,EAAOztB,KAAKiL,MAAS,EACxBwiB,EAAOztB,KAAKk3B,SACd,QAAUzJ,EAAOztB,KAAKk3B,UAAuB,IAAIC,eAC/C,IAAK,IACHnL,EAAQyB,EAAOztB,KAAKiL,MAAS,EAC7B,MACF,IAAK,IACH+gB,GAASyB,EAAOztB,KAAKiL,MAAS,EASpC,OALI+gB,IACFmF,GAAOwF,EAAa3K,GAASA,GAE/BA,EAAQ,EAEDmF,CACT,CACF,EAEalmB,GAAQ,SAAC/G,EAAWS,GAAU,OAAAT,EAAEue,QAAQ9d,GAAI3E,KAAKiL,OAAU,CAA7B,ECld9BmsB,GAAW,SACtBlzB,EACAwI,G,MAOM2qB,EAAKvN,GAAmB5lB,IAvFd,SAChBA,EACAwI,GAIQ,OAAgBA,GAAW,CAAC,GAAC,QAA7B4qB,OAAO,IAAG,IAAC,EACbrG,EAAW,GAAiB/sB,GAE9BqzB,EAAQ,EACZtG,WAAUlwB,SAAQ,SAAC8qB,GACjB,IAAM2L,EAAU3L,EAAM/iB,KAAI,SAACnE,GAAM,OAAAT,EAAEue,QAAQ9d,GAAG3E,KAAKkL,MAAlB,IAC3BusB,EAAYvtB,KAAKc,IAAG,MAARd,KAAI,SAAQstB,IAAO,CAAE,KACvC3L,WAAO9qB,SAAQ,SAAC4D,GACdT,EAAEue,QAAQ9d,GAAG3E,KAAKiE,EAAIszB,EAAQE,EAAY,CAC5C,IACAF,GAASE,EAAYH,CACvB,GACF,CAuEEI,CAAUL,EAAI3qB,GACd,IAAMirB,EAtEU,SAChBzzB,EACAwI,GAMM,MAAkDA,GAAW,CAAC,EAArDkrB,EAAU,QAAE,IAAAnB,eAAO,IAAG,IAAC,EAAE,IAAAC,eAAO,IAAG,IAAC,EAE7CzF,EAAW,GAAiB/sB,GAC5BgxB,EAAY15B,OAAO6E,ODhBO,SAAC6D,EAAW+sB,GAC5C,IAAMiE,EAAY,CAAC,EAwCnB,OAHIjE,aAAQ,EAARA,EAAUtzB,SACZszB,EAAS/F,QApCQ,SAAC2M,EAAiBhM,GAGnC,IAAIiM,EAAK,EAGLC,EAAU,EACRC,EAAkBH,EAAUl6B,OAC5Bs6B,EAAWpM,aAAK,EAALA,GAAQA,aAAK,EAALA,EAAOluB,QAAS,GAwBzC,OAtBAkuB,WAAO9qB,SAAQ,SAAC4D,EAAOlH,G,MACf2B,EAAI+2B,GAA0BjyB,EAAGS,GACjCuzB,EAAK94B,EAAI8E,EAAEue,QAAQrjB,EAAEc,IAAKF,KAAK4qB,MAASoN,GAE1C54B,GAAKuF,IAAMszB,KACc,QAA3B,EAAApM,EAAMzuB,MAAM26B,EAASt6B,EAAI,UAAE,SAAEsD,SAAQ,SAACo3B,G,MACT,QAA3B,EAAAj0B,EAAEkf,gBAAgB+U,UAAS,SAAEp3B,SAAQ,SAACmtB,G,MAC9BkK,EAASl0B,EAAEue,QAAQyL,EAAEhuB,IACrBm4B,EAAOD,EAAOp4B,KAAK4qB,QAEtByN,EAAOP,GAAMI,EAAKG,IACjBD,EAAOp4B,KAAK6pB,QAA4B,QAAnB,EAAA3lB,EAAEue,QAAQ0V,UAAS,eAAEn4B,KAAK6pB,QAEjD4L,GAAYP,EAAWhH,EAAEhuB,GAAIi4B,EAEjC,GACF,IACAJ,EAAUt6B,EAAI,EACdq6B,EAAKI,EAET,IAEOrM,CACT,IAKOqJ,CACT,CCzBIoD,CAAmBp0B,EAAG+sB,GACtBgE,GAAmB/wB,EAAG+sB,IAGlBsH,EAA8C,CAAC,EACjDC,EAA2B,GAC/B,CAAC,IAAK,KAAKz3B,SAAQ,SAAC03B,GAClBD,EACW,MAATC,EAAexH,EAAWz1B,OAAOkrB,OAAOuK,GAAUY,UACpD,CAAC,IAAK,KAAK9wB,SAAQ,SAAC23B,GACJ,MAAVA,IACFF,EAAmBA,EAAiB1vB,KAAI,SAAC6vB,GACvC,OAAAn9B,OAAOkrB,OAAOiS,GAAO9G,SAArB,KAIJ,IAAM+G,GACK,MAATH,EAAev0B,EAAEkf,gBAAkBlf,EAAEuK,eACrCkI,KAAKzS,GACD20B,EDiIqB,SAC/B30B,EACA+sB,EACAiE,EACA0D,GAEA,IAAM3jB,EAAuB,CAAC,EACxB4jB,EAAwB,CAAC,EACzBpI,EAA0B,CAAC,EAqCjC,OAhCAQ,WAAUlwB,SAAQ,SAAC8qB,GACjBA,WAAO9qB,SAAQ,SAAC4D,EAAGimB,GACjB3V,EAAKtQ,GAAKA,EACVk0B,EAAMl0B,GAAKA,EACX8rB,EAAI9rB,GAAKimB,CACX,GACF,IAEAqG,WAAUlwB,SAAQ,SAAC8qB,GACjB,IAAIiN,GAAW,EACfjN,WAAO9qB,SAAQ,SAAC4D,GACd,IAAIo0B,EAAKH,EAAWj0B,GAAGmE,KAAI,SAACpH,GAAM,OAAAA,EAAExB,EAAF,IAElC,GAAI64B,EAAGp7B,OAAQ,CACbo7B,EAAKA,EAAGprB,MAAK,SAACzM,EAAOC,GAAU,OAAAsvB,EAAIvvB,GAAKuvB,EAAItvB,EAAb,IAE/B,IADA,IAAM63B,GAAMD,EAAGp7B,OAAS,GAAK,EACpBF,EAAIyM,KAAKiE,MAAM6qB,GAAKC,EAAK/uB,KAAK+D,KAAK+qB,GAAKv7B,GAAKw7B,IAAMx7B,EAAG,CAC7D,IAAM2B,EAAI25B,EAAGt7B,GAEXo7B,EAAMl0B,KAAOA,GACbm0B,EAAUrI,EAAIrxB,KACbm3B,GAAYrB,EAAWvwB,EAAGvF,KAE3By5B,EAAMz5B,GAAKuF,EACXk0B,EAAMl0B,GAAKsQ,EAAKtQ,GAAKsQ,EAAK7V,GAC1B05B,EAAUrI,EAAIrxB,G,EAItB,GACF,IAEO,CAAE6V,KAAI,EAAE4jB,MAAK,EACtB,CC/KoBK,CACZh1B,EACAs0B,EACAtD,EACA0D,GAEIjB,ED2KwB,SAClCzzB,EACA+sB,EACAhc,EACA4jB,EACApC,EACAC,EACAC,G,MAOMgB,EAAyB,CAAC,EAC1BwB,EAAS3C,GACbtyB,EACA+sB,EACAhc,EACAwhB,EACAC,EACAC,GAEIrH,EAAaqH,EAAa,aAAe,cAEzCyC,EAAU,SACdC,EACAC,GAKA,IAHA,IAAIzT,EAAQsT,EAAOvtB,cACf2tB,EAAO1T,EAAMhhB,MACX6b,EAA+B,CAAC,EAC/B6Y,GACD7Y,EAAQ6Y,EAAKr5B,IACfm5B,EAAUE,EAAKr5B,KAEfwgB,EAAQ6Y,EAAKr5B,KAAM,EACnB2lB,EAAMppB,KAAK88B,GACX1T,EAAQA,EAAMvoB,OAAOg8B,EAAcC,EAAKr5B,MAG1Cq5B,EAAO1T,EAAMhhB,KAEjB,EAsCA,OARAu0B,GA3Bc,SAACG,GACb5B,EAAG4B,IAASJ,EAAOpW,gBAAgBwW,EAAM,OAAS,IAAIrO,QACpD,SAACsO,EAAa15B,GACZ,OAAOoK,KAAKc,IAAIwuB,GAAM7B,EAAG73B,EAAEiH,SAAW,GAAKjH,EAAEE,KAAKma,OACpD,GACA,EAEJ,GAoBegf,EAAO/V,gBAAgBzM,KAAKwiB,IAC3CC,GAlBc,SAACG,GACb,IAAMjsB,GAAO6rB,EAAOpW,gBAAgBwW,EAAM,QAAU,IAAIrO,QACtD,SAACsO,EAAa15B,GACZ,OAAOoK,KAAKoD,IAAIksB,GAAM7B,EAAG73B,EAAEkH,SAAW,GAAKlH,EAAEE,KAAKma,OACpD,GACAgQ,OAAOsP,mBAGH3yB,EAAO5C,EAAEue,QAAQ8W,GAErBjsB,IAAQ6c,OAAOsP,mBACf3yB,EAAK9G,KAAKsvB,aAAeA,IAEzBqI,EAAG4B,GAAQrvB,KAAKc,IAAI2sB,EAAG4B,GAAOjsB,GAElC,GAGe6rB,EAAO1qB,cAAckI,KAAKwiB,IAGrB,QAApB,EAAA39B,OAAOkrB,OAAOmS,UAAM,SAAE93B,SAAQ,SAAC4D,GAC7BgzB,EAAGhzB,GAAKgzB,EAAG1iB,EAAKtQ,GAClB,IAEOgzB,CACT,CC7PiB+B,CACTx1B,EACAs0B,EACAK,EAAM5jB,KACN4jB,EAAMA,MACNpC,EACAC,EACU,MAAVgC,GAEY,MAAVA,GACFl9B,OAAO+O,KAAKotB,GAAI52B,SAAQ,SAAC44B,GAAU,OAAChC,EAAGgC,IAAUhC,EAAGgC,EAAjB,IAErCpB,EAAIE,EAAOC,GAASf,CACtB,GACF,IAEA,IAAMiC,EDmSkC,SACxC11B,EACAq0B,GAEA,OAAOxN,GAAMvvB,OAAOkrB,OAAO6R,IAAM,SAACZ,G,MAC5B3sB,EAAMmf,OAAO0P,kBACbvsB,EAAM6c,OAAOsP,kBAUjB,OARe,QAAf,EAAAj+B,OAAO+O,KAAKotB,UAAG,SAAE52B,SAAQ,SAAC4D,GACxB,IAAMsD,EAAI0vB,EAAGhzB,GACPm1B,EAAY7uB,GAAM/G,EAAGS,GAAK,EAEhCqG,EAAMd,KAAKc,IAAI/C,EAAI6xB,EAAW9uB,GAC9BsC,EAAMpD,KAAKoD,IAAIrF,EAAI6xB,EAAWxsB,EAChC,IAEOtC,EAAMsC,CACf,GACF,CCrTwBysB,CAA2B71B,EAAGq0B,GAEpD,OADAqB,GD6TK,SACLrB,EACAyB,GAEA,IAAMC,EAAcz+B,OAAOkrB,OAAOsT,GAC5BE,EAAahwB,KAAKoD,IAAG,MAARpD,KAAI,OAAQ+vB,KACzBE,EAAajwB,KAAKc,IAAG,MAARd,KAAI,OAAQ+vB,KAE/B,CAAC,IAAK,KAAKl5B,SAAQ,SAAC03B,GAClB,CAAC,IAAK,KAAK13B,SAAQ,SAAC23B,GAClB,IAEI1M,EAFEoO,EAAY3B,EAAOC,EACnBf,EAAKY,EAAI6B,GAEf,GAAIzC,IAAOqC,EAAX,CAEA,IAAMK,EAAS7+B,OAAOkrB,OAAOiR,IAC7B3L,EACY,MAAV0M,EACIwB,EAAahwB,KAAKoD,IAAG,MAARpD,KAAI,OAAQmwB,KACzBF,EAAajwB,KAAKc,IAAG,MAARd,KAAI,OAAQmwB,QAG7B9B,EAAI6B,GAAa,CAAC,EAClB5+B,OAAO+O,KAAKotB,GAAI52B,SAAQ,SAACe,GACvBy2B,EAAI6B,GAAWt4B,GAAO61B,EAAG71B,GAAOkqB,CAClC,IAZwB,CAc5B,GACF,GACF,CC1VmBsO,CAAiB/B,EAAKqB,GD4VlB,SACrBrB,EACAM,GAEA,IAAMr4B,EAAiC,CAAC,EASxC,OARAhF,OAAO+O,KAAKguB,EAAIgC,IAAIx5B,SAAQ,SAACe,GAC3B,GAAI+2B,EACFr4B,EAAOsB,GAAOy2B,EAAIM,EAAM1B,eAAer1B,OAClC,CACL,IAAM4kB,EAASlrB,OAAOkrB,OAAO6R,GAAKzvB,KAAI,SAACb,GAAM,OAAAA,EAAEnG,EAAF,IAC7CtB,EAAOsB,IAAQ4kB,EAAO,GAAKA,EAAO,IAAM,C,CAE5C,IACOlmB,CACT,CCzWSg6B,CAAQjC,EAAKX,EACtB,CAca,CAAUP,EAAI3qB,GACV,QAAf,EAAAlR,OAAO+O,KAAKotB,UAAG,SAAE52B,SAAQ,SAACe,GACxBu1B,EAAG5U,QAAQ3gB,GAAK9B,KAAKiI,EAAI0vB,EAAG71B,EAC9B,GACF,ECjBM24B,GAAY,SAChBv2B,EACAwI,GAaE,IAAAkc,EASElc,EAAO,UARTguB,EAQEhuB,EAAO,OAPT,EAOEA,EAAO,QAPTiuB,OAAO,IAAG,OAAI,EACdC,EAMEluB,EAAO,UALT+lB,EAKE/lB,EAAO,cAJTmsB,EAIEnsB,EAAO,MAHT,EAGEA,EAAO,QAHT+pB,OAAO,IAAG,KAAE,EACZ,EAEE/pB,EAAO,QAFTgqB,OAAO,IAAG,KAAE,EACZ,EACEhqB,EAAO,QADT4qB,OAAO,IAAG,KAAE,EAGduD,GAAgB32B,GAEhBykB,GAAWzkB,EAAG0kB,GAER,MhB7FI,SAAC1kB,GACX,IAAM+Q,EAAO2U,GAAa1lB,EAAG,OAAQ,CAAC,EAAG,SACnC0qB,EAsHW,SAAC1qB,GAClB,IAAM0qB,EAA6B,CAAC,EAC9B/H,EAAM,SAACliB,EAAOm2B,GAClB,IAAMtzB,EAAWtD,EAAE+hB,YAAYthB,GAC/B6C,WAAUzG,SAAQ,SAAC6N,GAAU,OAAAiY,EAAIjY,EAAM1O,GAAI46B,EAAQ,EAAtB,IAC7BlM,EAAOjqB,GAAKm2B,CACd,EAIA,OADA52B,EAAE6hB,WAAWhlB,SAAQ,SAAC4D,GAAM,OAAAkiB,EAAIliB,EAAEzE,GAAI,EAAV,IACrB0uB,CACT,CAjIiBmM,CAAW72B,GACtB82B,EAAW9wB,KAAKc,IAAG,MAARd,KAAI,OAAQ1O,OAAOkrB,OAAOkI,MAErC1kB,KAAKmH,IAAI2pB,KAAc10B,MACzB00B,EAAW,GAGb,IAAM9vB,EAAS8vB,EAAW,EACpBrM,EAAU,EAAIzjB,EAAS,EAK7BhH,EAAE2H,cAAc9K,SAAQ,SAACjB,GACvBA,EAAEE,KAAKwrB,QAAWmD,CACpB,IAGA,IAAMxU,EAiHW,SAACjW,GAClB,IAAI1D,EAAS,EAIb,OAHA0D,EAAE2H,cAAc9K,SAAQ,SAACjB,GACvBU,GAAUV,EAAEE,KAAKma,MACnB,IACO3Z,CACT,CAvHiBy6B,CAAW/2B,GAAK,EAc/B,OARAA,EAAE6hB,WAAWhlB,SAAQ,SAAC6N,GACpB,GAAI1K,EAAG+Q,EAAM0Z,EAASxU,EAAQjP,EAAQ0jB,EAAQhgB,EAAM1O,GACtD,IAMO,CACLg7B,YAAajmB,EACbkmB,eAAgBxM,EAEpB,CgBuD0C,CAAgBzqB,GAAhDg3B,EAAW,cAAEC,EAAc,kBjBhGjB,SAClBj3B,EACAw2B,GAEA,OAAQA,GACN,IAAK,kBACHrM,GAAqBnqB,GACrB,MACF,IAAK,aAOL,SAQoB,SAACA,IHcI,SAACA,GAE5B,IACIowB,EADE5T,EAA+B,CAAC,EAGhCmG,EAAM,SAACliB,G,MAQP6lB,EAPEpmB,EAAQF,EAAEue,QAAQ9d,GACxB,OAAKP,EACDsc,EAAQ/b,GACHP,EAAMpE,KAAKwqB,MAEpB9J,EAAQ/b,IAAK,EAIc,QAA3B,EAAAT,EAAE6e,gBAAgBpe,EAAG,cAAM,SAAE5D,SAAQ,SAACjB,GACpC,IAEMkF,EAFQ6hB,EAAI/mB,EAAEkH,QACLlH,EAAEE,KAAKwrB,OAElBxmB,SACWvG,IAAT+rB,GAAsBxlB,EAAIwlB,KAC5BA,EAAOxlB,EAGb,IAEKwlB,IACHA,EAAO,SAGO/rB,IAAZ61B,GAAyB9J,EAAO8J,KAClCA,EAAU9J,GAGZpmB,EAAMpE,KAAKwqB,KAAOA,EACXA,GA5BY,CA6BrB,EAEAtmB,EAAE0H,cACC/C,QAAO,SAACnH,GAAM,OAAyC,IAAzCwC,EAAE6e,gBAAgBrhB,EAAExB,GAAI,MAAMvC,MAA9B,IACdoD,SAAQ,SAACgG,GACJA,GAAQ8f,EAAI9f,EAAO7G,GACzB,SAEezB,IAAb61B,IACFA,EAAU,GAMZ,IAAM8G,EAA0C,CAAC,EAC3CC,EAAa,SAAC12B,EAAO22B,G,MACnBl3B,EAAQF,EAAEue,QAAQ9d,GAElB42B,EAAYv1B,MAAM5B,EAAMpE,KAAK6rB,OAA8ByP,EAApBl3B,EAAMpE,KAAK6rB,YAGhCptB,IAApB2F,EAAMpE,KAAKwqB,MAAsBpmB,EAAMpE,KAAKwqB,KAAQ+Q,KACtDn3B,EAAMpE,KAAKwqB,KAAO+Q,GAGhBH,EAAez2B,KACnBy2B,EAAez2B,IAAK,EAGO,QAA3B,EAAAT,EAAE6e,gBAAgBpe,EAAG,cAAM,SAAE5D,SAAQ,SAACjB,GACpCu7B,EAAWv7B,EAAEkH,OAAQu0B,EAAWz7B,EAAEE,KAAKwrB,OACzC,IACF,EAGAtnB,EAAE0H,cAAc7K,SAAQ,SAACW,GACvB,IAAM0C,EAAQ1C,EAAE1B,KACXoE,IACA4B,MAAM5B,EAAMynB,OAGfznB,EAAMomB,MAAS8J,EAFf+G,EAAW35B,EAAExB,GAAIkE,EAAMynB,OAI3B,GACF,CG9FE2P,CAAqBt3B,GFyDO,SAACA,GAC7B,IAOIuE,EACAujB,EAREnpB,EAAI,IAAIie,GAAM,CAAE5O,KAAM,KAGtBsc,EAAQtqB,EAAE0H,cAAc,GACxBvF,EAAOnC,EAAE0H,cAAcjO,OAK7B,IAJAkF,EAAE6gB,QAAQ8K,GAIH5C,GAAmB/oB,EAAGqB,GAAMmC,GACjCoC,EAAOqjB,GAAiBjpB,EAAGqB,GAC3B8nB,EAAQnpB,EAAE6f,QAAQja,EAAK1B,QAAU0kB,GAAMvnB,EAAGuE,IAASgjB,GAAMvnB,EAAGuE,GAC5DsjB,GAAWlpB,EAAGqB,EAAG8nB,EAIrB,CEzEE,CAAa9nB,EACf,CAVMu3B,CAAgBv3B,SALlB,IAAK,eACHkqB,GAAkBlqB,GAMxB,CiBgFEsmB,CAAKV,GAAmB5lB,GAAIw2B,GAE5BgB,GAAuBx3B,GtBoFO,SAACA,EAAWi3B,QAAA,IAAAA,MAAA,GAE1C,IAAMz0B,EAAQxC,EAAE0H,cACVikB,EAAYnpB,EACfmC,QAAO,SAAClE,GAAM,YAAgBlG,IAAhBkG,EAAE3E,KAAKwqB,IAAP,IACd1hB,KAAI,SAACnE,GAAM,OAAAA,EAAE3E,KAAKwqB,IAAP,IAERvO,EAAS/R,KAAKoD,IAAG,MAARpD,KAAI,OAAQ2lB,KACrBC,EAAiB,GAEvBppB,EAAM3F,SAAQ,SAAC4D,GACb,IAAM6lB,GAAQ7lB,EAAE3E,KAAKwqB,MAAS,GAAKvO,EAE9B6T,EAAOtF,KACVsF,EAAOtF,GAAQ,IAEjBsF,EAAOtF,GAAM/tB,KAAKkI,EAAEzE,GACtB,IAGA,IADA,IAAI8rB,EAAQ,EACHvuB,EAAI,EAAGA,EAAIqyB,EAAOnyB,OAAQF,IAAK,CACtC,IAAM0uB,EAAK2D,EAAOryB,QACPgB,IAAP0tB,EACE1uB,EAAI09B,GAAmB,IACzBnP,GAAS,GAEFA,IACTG,WAAIprB,SAAQ,SAAC4D,GACX,IAAMmC,EAAO5C,EAAEue,QAAQ9d,GACnBmC,IACFA,EAAK9G,KAAKwqB,KAAO1jB,EAAK9G,KAAKwqB,MAAQ,EACnC1jB,EAAK9G,KAAKwqB,MAASwB,EAEvB,I,CAGN,CsBtHE2P,CAAiBz3B,EAAGi3B,GhB0CN,SAACj3B,EAAWg3B,GAItBA,GACFh3B,EAAE8f,WAAWkX,GAGfh3B,EAAE2H,cAAc9K,SAAQ,SAACjB,GACnBA,EAAEE,KAAKmvB,aACTjrB,EAAE6gB,WAAWjlB,EAAEI,GAEnB,GACF,CgBrDE07B,CAAoB13B,EAAGg3B,GtBmEK,SAACh3B,GAC7B,IAAM2rB,EAAY3rB,EACf0H,cACA/C,QAAO,SAAClE,GAAM,YAAgBlG,IAAhBkG,EAAE3E,KAAKwqB,IAAP,IACd1hB,KAAI,SAACnE,GAAM,OAAAA,EAAE3E,KAAKwqB,IAAP,IACRld,EAAMpD,KAAKoD,IAAG,MAARpD,KAAI,OAAQ2lB,KACxB3rB,EAAE0H,cAAc7K,SAAQ,SAAC4D,GACnBA,EAAE3E,KAAKtE,eAAe,SAAW4R,IAAQhH,MAC3C3B,EAAE3E,KAAKwqB,MAASld,EAEpB,GACF,CsB5EEuuB,CAAe33B,GAEf43B,GAAiB53B,GAEjB63B,GAAuB73B,GAEvB,IAAM83B,EAAoB,IrBhHhB,SAAC93B,EAAW83B,GACtB93B,EAAE2H,cAAc9K,SAAQ,SAAC0H,GAAS,OAGd,SAACvE,EAAWpE,EAAmBk8B,GACnD,IAAIr3B,EAAI7E,EAAEiH,OACNk1B,EAAQ/3B,EAAEue,QAAQ9d,GAAI3E,KAAKwqB,KACzBprB,EAAIU,EAAEkH,OACNk1B,EAAQh4B,EAAEue,QAAQrjB,GAAIY,KAAKwqB,KAC3B2R,EAAYr8B,EAAEE,KAAKm8B,UAEzB,GAAID,IAAUD,EAAQ,EAAtB,CAIA,IAAIpS,EACAuS,EAQA3+B,EACJ,IAZAyG,EAAE6gB,WAAWjlB,EAAEI,IAYVzC,EAAI,IAAKw+B,EAAOA,EAAQC,IAASz+B,IAAKw+B,EACzCn8B,EAAEE,KAAKq8B,OAAS,GAQhBxS,EAAQD,GAAa1lB,EArCD,OA8BpBk4B,EAAW,CACTE,aAAcx8B,EACdmL,MAAO,EACPC,OAAQ,EACRsf,KAAMyR,GAG2C,MAE/CA,IAAUE,IACZC,EAASnxB,MAAQnL,EAAEE,KAAKiL,MACxBmxB,EAASlxB,OAASpL,EAAEE,KAAKkL,OACzBkxB,EAASvS,MAAQyB,GACjB8Q,EAASlF,SAAWp3B,EAAEE,KAAKk3B,UAG7BhzB,EAAE2gB,QAAQ,CACR3kB,GAAI,IAAIgK,KAAKS,SACb5D,OAAQpC,EACRqC,OAAQ6iB,EACR7pB,KAAM,CAAEma,OAAQra,EAAEE,KAAKma,UAEf,IAAN1c,GACFu+B,EAAYv/B,KAAKotB,GAEnBllB,EAAIklB,EAGN3lB,EAAE2gB,QAAQ,CACR3kB,GAAI,IAAIgK,KAAKS,SACb5D,OAAQpC,EACRqC,OAAQ5H,EACRY,KAAM,CAAEma,OAAQra,EAAEE,KAAKma,SAhDM,CAkDjC,CA5DoCoiB,CAAcr4B,EAAGuE,EAAMuzB,EAAvB,GACpC,CqB+GE,CAAa93B,EAAG83B,GCjFe,SAAC93B,EAAW83B,GAC3C,IAAMQ,EAnDa,SAACt4B,GACpB,IAAM1D,EAAgC,CAAC,EACnC6sB,EAAM,EAEJxG,EAAM,SAACliB,GACX,IAAMwoB,EAAME,EACZnpB,EAAE+hB,YAAYthB,GAAG5D,SAAQ,SAACW,GAAM,OAAAmlB,EAAInlB,EAAExB,GAAN,IAChCM,EAAOmE,GAAK,CAAEwoB,IAAG,EAAEE,IAAKA,IAC1B,EAGA,OAFAnpB,EAAE6hB,WAAWhlB,SAAQ,SAACW,GAAM,OAAAmlB,EAAInlB,EAAExB,GAAN,IAErBM,CACT,CAuCwBi8B,CAAav4B,GAEnC83B,EAAYj7B,SAAQ,SAAC27B,G,QACf/3B,EAAI+3B,EACJ51B,EAAO5C,EAAEue,QAAQ9d,GACf23B,EAAex1B,EAAK9G,KAAKs8B,aAC/B,GAAKA,EAaL,IAZA,IAAMK,EA1CO,SACfz4B,EACAs4B,EACA73B,EACAvF,G,QAMI+S,EACAyqB,EALEC,EAAc,GACdC,EAAc,GACd3P,EAAMjjB,KAAKoD,IAAIkvB,EAAc73B,GAAGwoB,IAAKqP,EAAcp9B,GAAG+tB,KACtDE,EAAMnjB,KAAKc,IAAIwxB,EAAc73B,GAAG0oB,IAAKmP,EAAcp9B,GAAGiuB,KAK5Dlb,EAASxN,EACT,GACEwN,EAA4B,QAAnB,EAAAjO,EAAE8hB,UAAU7T,UAAO,eAAEjS,GAC9B28B,EAAMpgC,KAAK0V,SAEXA,IACCqqB,EAAcrqB,GAAQgb,IAAMA,GAAOE,EAAMmP,EAAcrqB,GAAQkb,MAMlE,IAJAuP,EAAMzqB,EAGNA,EAAS/S,EACF+S,GAAUA,IAAWyqB,GAC1BE,EAAMrgC,KAAK0V,GACXA,EAA4B,QAAnB,EAAAjO,EAAE8hB,UAAU7T,UAAO,eAAEjS,GAGhC,MAAO,CAAE08B,IAAG,EAAEG,KAAMF,EAAMv/B,OAAOw/B,EAAMjL,WACzC,CAUqBmL,CACf94B,EACAs4B,EACAF,EAAav1B,OACbu1B,EAAat1B,QAET+1B,EAAOJ,EAASI,KAChBH,EAAMD,EAASC,IACjBK,EAAU,EACVC,EAAQH,EAAKE,GACbE,GAAY,EAETx4B,IAAM23B,EAAat1B,QAAQ,CAGhC,GAFAF,EAAO5C,EAAEue,QAAQ9d,GAEbw4B,EAAW,CACb,KACED,IAAUN,IACM,QAAhB,EAAA14B,EAAEue,QAAQya,UAAM,eAAEl9B,KAAKuqB,SAAWzjB,EAAK9G,KAAKwqB,MAG5C0S,EAAQH,IADRE,GAIEC,IAAUN,IACZO,GAAY,E,CAIhB,IAAKA,EAAW,CACd,KACEF,EAAUF,EAAKp/B,OAAS,IACK,QAA7B,EAAAuG,EAAEue,QAAQsa,EAAKE,EAAU,WAAI,eAAEj9B,KAAKs0B,UAAYxtB,EAAK9G,KAAKwqB,MAE1DyS,IAEFC,EAAQH,EAAKE,E,CAGX/4B,EAAEwe,QAAQwa,IACZh5B,EAAE4hB,UAAUnhB,EAAGu4B,GAGjBv4B,EAAIT,EAAEuK,cAAc9J,GAAI,GAAGzE,E,CAE/B,GACF,CD4BEk9B,CAAkBl5B,EAAG83B,GftIU,SAAC93B,GAChC,IAAM2iB,EAAM,SAACliB,GACX,IAAM6C,EAAWtD,EAAE+hB,YAAYthB,GACzBmC,EAAO5C,EAAEue,QAAQ9d,GAKvB,IAJI6C,aAAQ,EAARA,EAAU7J,SACZ6J,EAASzG,SAAQ,SAAC6N,GAAU,OAAAiY,EAAIjY,EAAM1O,GAAV,IAG1B4G,EAAK9G,KAAKtE,eAAe,WAAY,CACvCoL,EAAK9G,KAAK4yB,WAAa,GACvB9rB,EAAK9G,KAAK8yB,YAAc,GACxB,IACE,IAAItI,EAAO1jB,EAAK9G,KAAKs0B,QAAU/J,EAAUzjB,EAAK9G,KAAKuqB,QAAW,EAC9DC,EAAOD,EACPC,GAAQ,EAER,GAActmB,EAAG,aAAc,MAAOS,EAAGmC,EAAM0jB,GAC/C,GAActmB,EAAG,cAAe,MAAOS,EAAGmC,EAAM0jB,E,CAGtD,EAEAtmB,EAAE6hB,WAAWhlB,SAAQ,SAAC6N,GAAU,OAAAiY,EAAIjY,EAAM1O,GAAV,GAClC,CeiHEm9B,CAAkBn5B,GAEduuB,GExIuB,SAACvuB,EAAU02B,GAOtC,IANA,IAGMxG,EAHclwB,EAAE0H,cAAc/C,QAAO,SAAClE,G,MAC1C,QAA2B,QAAnB,EAAAT,EAAE+hB,YAAYthB,EAAEzE,WAAG,eAAEvC,OAC/B,IAC0BmL,KAAI,SAACnE,GAAM,OAAAA,EAAE3E,KAAKwqB,IAAP,IAC/BD,EAAUrgB,KAAKc,IAAG,MAARd,KAAI,OAAQkqB,KACtBtE,EAAiB,GACdryB,EAAI,EAAGA,EAAI8sB,EAAU,EAAG9sB,IAC/BqyB,EAAOryB,GAAK,GAGdm9B,WAAW75B,SAAQ,SAACW,GAClB,IAAMoF,EAAO5C,EAAEue,QAAQ/gB,GAElBoF,IAAQA,EAAK9G,KAAK6pB,QAGlB7jB,MAAMc,EAAK9G,KAAKwqB,QACnB1jB,EAAK9G,KAAKiwB,SAAWH,EAAOhpB,EAAK9G,KAAKwqB,MAAO7sB,OAC7CmyB,EAAOhpB,EAAK9G,KAAKwqB,MAAO/tB,KAAKiF,IAEjC,GACF,CFmHI47B,CAAcp5B,EAAG02B,GLtHA,SAAC12B,EAAWuuB,GAI/B,IAHA,IAAM8K,EAAShT,GAAQrmB,GACjBs5B,EAAS,GACTC,EAAS,GACNhgC,EAAI,EAAGA,EAAI8/B,EAAS,EAAG9/B,IAAK+/B,EAAO/gC,KAAKgB,GACjD,IAASA,EAAI8/B,EAAS,EAAG9/B,GAAK,EAAGA,IAAKggC,EAAOhhC,KAAKgB,GAClD,IAAMigC,EAAkBvJ,GAAiBjwB,EAAGs5B,EAAQ,MAC9CG,EAAgBxJ,GAAiBjwB,EAAGu5B,EAAQ,OAE9CxM,EAAWtB,GAAUzrB,GACzB8wB,GAAY9wB,EAAG+sB,GAIf,IAFA,IACI2M,EADAC,EAAS1T,OAAOsP,kBAEJqE,GAAPrgC,EAAI,EAAc,GAAGqgC,EAAW,IAAKrgC,IAAKqgC,EACjDtJ,GACE/2B,EAAI,EAAIigC,EAAkBC,EAC1BlgC,EAAI,GAAK,GACT,EACAg1B,GAGFxB,EAAW,GAAiB/sB,IACtB4sB,EAAKE,GAAW9sB,EAAG+sB,IAChB4M,IACPC,EAAW,EACXF,EAAO,GAAM3M,GACb4M,EAAS/M,GAOb,IAFAG,EAAWtB,GAAUzrB,GACrB8wB,GAAY9wB,EAAG+sB,GACNxzB,EAAI,EAAGqgC,EAAW,EAAGA,EAAW,IAAKrgC,IAAKqgC,EAAU,CAS3D,IAAMhN,EARN0D,GACE/2B,EAAI,EAAIigC,EAAkBC,EAC1BlgC,EAAI,GAAK,GACT,EACAg1B,GAGFxB,EAAW,GAAiB/sB,IACtB4sB,EAAKE,GAAW9sB,EAAG+sB,IAChB4M,IACPC,EAAW,EACXF,EAAO,GAAM3M,GACb4M,EAAS/M,E,CAGbkE,GAAY9wB,EAAG05B,EACjB,CKsEEhT,CAAM1mB,EAAGuuB,GAETsL,GAAgB75B,GdjJH,SAACA,EAAUy2B,GACxB,IAAMqD,EAAKrD,EAAQxD,cACR,OAAP6G,GAAsB,OAAPA,GACjBzO,GAAgBrrB,EAEpB,Cc8IE+5B,CAAuB/5B,EAAGy2B,GAE1BvD,GAASlzB,EAAG,CACV20B,MAAK,EACLpC,QAAO,EACPC,QAAO,EACPY,QAAO,IAGT4G,GAAkBh6B,GAElBi6B,GAAkBj6B,GrB1EP,SAACA,EAAW83B,GACvBA,EAAYj7B,SAAQ,SAAC4D,GACnB,IAIIvF,EAJA0H,EAAO5C,EAAEue,QAAQ9d,GAEf23B,EADWx1B,EAAI,KACKw1B,aAItBA,GACFp4B,EAAE2gB,QAAQyX,GAIZ,IADA,IAAI8B,EAAWz5B,EACRmC,EAAK9G,KAAK6pB,OACfzqB,EAAI8E,EAAEuK,cAAc2vB,GAAW,GAC/Bl6B,EAAE8f,WAAWoa,GACb9B,EAAat8B,KAAKq8B,OAAQ5/B,KAAK,CAC7BwL,EAAGnB,EAAK9G,KAAKiI,EACbhE,EAAG6C,EAAK9G,KAAKiE,IAEX6C,EAAK9G,KAAK6pB,QAAUyB,KACtBgR,EAAat8B,KAAKiI,EAAInB,EAAK9G,KAAKiI,EAChCq0B,EAAat8B,KAAKiE,EAAI6C,EAAK9G,KAAKiE,EAChCq4B,EAAat8B,KAAKiL,MAAQnE,EAAK9G,KAAKiL,MACpCqxB,EAAat8B,KAAKkL,OAASpE,EAAK9G,KAAKkL,QAEvCkzB,EAAWh/B,EAAEc,GACb4G,EAAO5C,EAAEue,QAAQ2b,EAErB,GACF,CqB8CE,CAAcl6B,EAAG83B,GAEjBqC,GAAqBn6B,Gd3JV,SAACA,EAAUy2B,GACtB,IAAMqD,EAAKrD,EAAQxD,cACR,OAAP6G,GAAsB,OAAPA,GAyBJ,SAAC95B,GAChBA,EAAE0H,cAAc7K,SAAQ,SAAC4D,GACvB8qB,GAAY9qB,EAAE3E,KAChB,IAEAkE,EAAE2H,cAAc9K,SAAQ,SAAC0H,G,MACP,QAAhB,EAAAA,EAAKzI,KAAKq8B,cAAM,SAAEt7B,SAAQ,SAACmpB,GAAU,OAAAuF,GAAYvF,EAAZ,IACjCzhB,EAAKzI,KAAKtE,eAAe,MAC3B+zB,GAAYhnB,EAAKzI,KAErB,GACF,CAnCIs+B,CAASp6B,GAGA,OAAP85B,GAAsB,OAAPA,IAwCN,SAAC95B,GACdA,EAAE0H,cAAc7K,SAAQ,SAAC4D,GACvB+qB,GAAU/qB,EAAE3E,KACd,IAEAkE,EAAE2H,cAAc9K,SAAQ,SAAC0H,G,MACP,QAAhB,EAAAA,EAAKzI,KAAKq8B,cAAM,SAAEt7B,SAAQ,SAACmpB,GAAU,OAAAwF,GAAUxF,EAAV,IACjCzhB,EAAKzI,KAAKtE,eAAe,MAC3Bg0B,GAAUjnB,EAAKzI,KAEnB,GACF,CAlDIu+B,CAAOr6B,GACPqrB,GAAgBrrB,GAEpB,CcmJE,CAAqBA,EAAGy2B,GAElB,MAAoB6D,GAAet6B,GAAjC+G,EAAK,QAAEC,EAAM,SAQrB,OANAuzB,GAAqBv6B,GAErBw6B,GAA8Bx6B,GvB3HnB,SAACA,GACZA,EAAE2H,cAAc9K,SAAQ,SAACjB,GACvB,IAAMsE,EAAQtE,EAAEE,KAChB,GAAIoE,EAAMulB,SAAU,CAClBzlB,EAAE6gB,WAAWjlB,EAAEI,IAEf,IAAMwpB,EAActlB,EAAMslB,mBACnBtlB,EAAMulB,gBACNvlB,EAAMslB,YACbxlB,EAAE2gB,QAAQ,CACR3kB,GAAIJ,EAAEI,GACN6G,OAAQjH,EAAEkH,OACVA,OAAQlH,EAAEiH,OACV/G,KAAM,OAAKoE,GAAK,CAAEslB,YAAW,K,CAGnC,GACF,CuB4GEiV,CAAYz6B,GAEL,CAAE+G,MAAK,EAAEC,OAAM,EACxB,EA0DM0zB,GAAe,CAAC,QAAS,SAAU,QAAS,YAC5CC,GAAe,CAAE5zB,MAAO,EAAGC,OAAQ,GACnC4zB,GAAe,CAAC,SAAU,SAAU,QAAS,SAAU,eACvDC,GAAe,CACnBvT,OAAQ,EACRrR,OAAQ,EACRlP,MAAO,EACPC,OAAQ,EACR8zB,YAAa,GACb9H,SAAU,KAEN+H,GAAY,CAAC,YAqGbvD,GAAyB,SAACx3B,GAC9BA,EAAE2H,cAAc9K,SAAQ,SAACjB,GACvB,GAAIA,EAAEE,KAAKiL,OAASnL,EAAEE,KAAKkL,OAAQ,CACjC,IAAMvG,EAAIT,EAAEue,QAAQ3iB,EAAEiH,QAEhB3C,EAAQ,CACZtE,EACA0qB,MAHQtmB,EAAEue,QAAQ3iB,EAAEkH,QAGXhH,KAAKwqB,KAAQ7lB,EAAE3E,KAAKwqB,MAAS,EAAI7lB,EAAE3E,KAAKwqB,MAEnDZ,GAAa1lB,EAAG,aAAcE,EAAO,M,CAEzC,GACF,EAEM03B,GAAmB,SAAC53B,GACxB,IAAIqmB,EAAU,EASd,OARArmB,EAAE0H,cAAc7K,SAAQ,SAAC+F,G,QACnBA,EAAK9G,KAAK6uB,YACZ/nB,EAAK9G,KAAKs0B,QAA8C,QAApC,EAAApwB,EAAEue,QAAQ3b,EAAK9G,KAAK6uB,kBAAgB,eAAE7uB,KAAKwqB,KAC/D1jB,EAAK9G,KAAKuqB,QAAiD,QAAvC,EAAArmB,EAAEue,QAAQ3b,EAAK9G,KAAK8uB,qBAAmB,eAAE9uB,KAAKwqB,KAClED,EAAUrgB,KAAKc,IAAIuf,EAASzjB,EAAK9G,KAAKuqB,UAAW,KAErD,IAEOA,CACT,EAEMwR,GAAyB,SAAC73B,GAC9BA,EAAE0H,cAAc7K,SAAQ,SAAC+F,GACC,eAApBA,EAAK9G,KAAK6pB,QACZ3lB,EAAEsgB,QAAQ1d,EAAK9G,KAAKF,EAAGI,IAAKF,KAAKm8B,UAAYr1B,EAAK9G,KAAKwqB,KACvDtmB,EAAE8f,WAAWld,EAAK5G,IAEtB,GACF,EAEMs+B,GAAiB,SACrBt6B,EACAwI,GAKA,IAAI/E,EAEAC,EADAC,EAAO,EAEPC,EAAO,EAEL,EAAiD4E,GAAW,CAAC,EAA3D,IAAAwyB,QAASC,OAAO,IAAG,IAAC,EAAE,IAAAC,QAASC,OAAO,IAAG,IAAC,EAE5CC,EAAc,SAACC,GACnB,GAAKA,EAAMv/B,KAAX,CACA,IAAMiI,EAAIs3B,EAAMv/B,KAAKiI,EACfhE,EAAIs7B,EAAMv/B,KAAKiE,EACf7E,EAAImgC,EAAMv/B,KAAKiL,MACfmf,EAAImV,EAAMv/B,KAAKkL,OAChBlF,MAAMiC,IAAOjC,MAAM5G,UACTX,IAATkJ,IACFA,EAAOM,EAAI7I,EAAI,GAEjBuI,EAAOuC,KAAKoD,IAAI3F,EAAMM,EAAI7I,EAAI,GAC9ByI,EAAOqC,KAAKc,IAAInD,EAAMI,EAAI7I,EAAI,IAE3B4G,MAAM/B,IAAO+B,MAAMokB,UACT3rB,IAATmJ,IACFA,EAAO3D,EAAImmB,EAAI,GAEjBxiB,EAAOsC,KAAKoD,IAAI1F,EAAM3D,EAAImmB,EAAI,GAC9BtiB,EAAOoC,KAAKc,IAAIlD,EAAM7D,EAAImmB,EAAI,GAjBT,CAmBzB,EAgCA,OA9BAlmB,EAAE0H,cAAc7K,SAAQ,SAAC4D,GACvB26B,EAAY36B,EACd,IACAT,EAAE2H,cAAc9K,SAAQ,SAACjB,IACnBA,aAAC,EAADA,EAAGE,KAAKtE,eAAe,OACzB4jC,EAAYx/B,EAEhB,IAEA6H,GAASw3B,EACTv3B,GAASy3B,EAETn7B,EAAE0H,cAAc7K,SAAQ,SAAC+F,GACvBA,EAAK9G,KAAKiI,GAAMN,EAChBb,EAAK9G,KAAKiE,GAAM2D,CAClB,IAEA1D,EAAE2H,cAAc9K,SAAQ,SAAC0H,G,MACP,QAAhB,EAAAA,EAAKzI,KAAKq8B,cAAM,SAAEt7B,SAAQ,SAACwB,GACzBA,EAAE0F,GAAKN,EACPpF,EAAE0B,GAAK2D,CACT,IACIa,EAAKzI,KAAKtE,eAAe,OAC3B+M,EAAKzI,KAAKiI,GAAMN,GAEdc,EAAKzI,KAAKtE,eAAe,OAC3B+M,EAAKzI,KAAKiE,GAAM2D,EAEpB,IAEO,CACLqD,MAAOpD,EAAOF,EAAQw3B,EACtBj0B,OAAQpD,EAAOF,EAAQy3B,EAE3B,EAEMZ,GAAuB,SAACv6B,GAC5BA,EAAE2H,cAAc9K,SAAQ,SAACjB,GACvB,IAEIkK,EACAC,EAHEu1B,EAAQt7B,EAAEue,QAAQ3iB,EAAEiH,QACpB04B,EAAQv7B,EAAEue,QAAQ3iB,EAAEkH,QAGrBlH,EAAEE,KAAKq8B,QAKVryB,EAAKlK,EAAEE,KAAKq8B,OAAO,GACnBpyB,EAAKnK,EAAEE,KAAKq8B,OAAOv8B,EAAEE,KAAKq8B,OAAO1+B,OAAS,KAL1CmC,EAAEE,KAAKq8B,OAAS,GAChBryB,EAAK,CAAE/B,EAAGw3B,EAAMz/B,KAAKiI,EAAIhE,EAAGw7B,EAAMz/B,KAAKiE,GACvCgG,EAAK,CAAEhC,EAAGu3B,EAAMx/B,KAAKiI,EAAIhE,EAAGu7B,EAAMx/B,KAAKiE,IAMzCnE,EAAEE,KAAKq8B,OAAOqD,QAAQ1V,GAAcwV,EAAMx/B,KAAMgK,IAChDlK,EAAEE,KAAKq8B,OAAO5/B,KAAKutB,GAAcyV,EAAMz/B,KAAMiK,GAC/C,GACF,EAEMo0B,GAAuB,SAACn6B,GAC5BA,EAAE2H,cAAc9K,SAAQ,SAAC0H,GACvB,GAAIA,EAAKzI,KAAKtE,eAAe,KAI3B,OAH2B,MAAvB+M,EAAKzI,KAAKk3B,UAA2C,MAAvBzuB,EAAKzI,KAAKk3B,WAC1CzuB,EAAKzI,KAAKiL,OAAUxC,EAAKzI,KAAKg/B,aAExBv2B,EAAKzI,KAAKk3B,UAChB,IAAK,IACHzuB,EAAKzI,KAAKiI,GAAMQ,EAAKzI,KAAKiL,MAAS,EAAIxC,EAAKzI,KAAKg/B,YACjD,MACF,IAAK,IACHv2B,EAAKzI,KAAKiI,GAAMQ,EAAKzI,KAAKiL,MAAS,EAAIxC,EAAKzI,KAAKg/B,YAIzD,GACF,EAEMN,GAAgC,SAACx6B,GACrCA,EAAE2H,cAAc9K,SAAQ,SAAC0H,G,MACnBA,EAAKzI,KAAK2pB,WACI,QAAhB,EAAAlhB,EAAKzI,KAAKq8B,cAAM,SAAExK,UAEtB,GACF,EAEMsM,GAAoB,SAACj6B,GACzBA,EAAE0H,cAAc7K,SAAQ,SAAC4D,G,UACvB,GAAuB,QAAnB,EAAAT,EAAE+hB,YAAYthB,EAAEzE,WAAG,eAAEvC,OAAQ,CAC/B,IAAMmJ,EAAO5C,EAAEue,QAAQ9d,EAAEzE,IACnB2C,EAAIqB,EAAEue,QAAQ3b,EAAK9G,KAAK6uB,WACxB1tB,EAAI+C,EAAEue,QAAQ3b,EAAK9G,KAAK8uB,cACxBpxB,EAAIwG,EAAEue,QACT3b,EAAK9G,KAAK4yB,YACqB,QAA9B,EAAC9rB,EAAK9G,KAAK4yB,kBAAmB,eAAEj1B,QAAS,IAGvCqH,EAAId,EAAEue,QACT3b,EAAK9G,KAAK8yB,aACsB,QAA/B,EAAChsB,EAAK9G,KAAK8yB,mBAAoB,eAAEn1B,QAAS,IAI9CmJ,EAAK9G,KAAKiL,MAAQf,KAAKmH,KAAIrM,aAAC,EAADA,EAAGhF,KAAKiI,IAAKvK,aAAC,EAADA,EAAGsC,KAAKiI,KAAO,GACvDnB,EAAK9G,KAAKkL,OAAShB,KAAKmH,KAAIlQ,aAAC,EAADA,EAAGnB,KAAKiE,IAAKpB,aAAC,EAADA,EAAG7C,KAAKiE,KAAO,GACxD6C,EAAK9G,KAAKiI,IAAKvK,aAAC,EAADA,EAAGsC,KAAKiI,IAAM,GAAKnB,EAAK9G,KAAKiL,MAAS,EACrDnE,EAAK9G,KAAKiE,IAAKpB,aAAC,EAADA,EAAG7C,KAAKiE,IAAM,GAAK6C,EAAK9G,KAAKkL,OAAU,C,CAE1D,IAEAhH,EAAE0H,cAAc7K,SAAQ,SAACW,GACF,WAAjBA,EAAE1B,KAAK6pB,OACT3lB,EAAE8f,WAAWtiB,EAAExB,GAEnB,GACF,EAEM26B,GAAkB,SAAC32B,GACvBA,EAAE2H,cAAc9K,SAAQ,SAACjB,GACvB,GAAIA,EAAEiH,SAAWjH,EAAEkH,OAAQ,CACzB,IAAMF,EAAO5C,EAAEue,QAAQ3iB,EAAEiH,QACpBD,EAAK9G,KAAK2/B,YACb74B,EAAK9G,KAAK2/B,UAAY,IAExB74B,EAAK9G,KAAK2/B,UAAUljC,KAAKqD,GACzBoE,EAAE6gB,WAAWjlB,EAAEI,G,CAEnB,GACF,EAEM69B,GAAkB,SAAC75B,GACvB,IAAM4rB,EAAS,GAAiB5rB,GAChC4rB,WAAQ/uB,SAAQ,SAAC8qB,GACf,IAAI+T,EAAa,EACjB/T,WAAO9qB,SAAQ,SAAC4D,EAAOlH,G,MACfqJ,EAAO5C,EAAEue,QAAQ9d,GACvBmC,EAAK9G,KAAK4qB,MAAQntB,EAAImiC,EACH,QAAnB,EAAA94B,EAAK9G,KAAK2/B,iBAAS,SAAE5+B,SAAQ,SAAC8+B,GAC5BjW,GACE1lB,EACA,WACA,CACE+G,MAAO40B,EAAS7/B,KAAKiL,MACrBC,OAAQ20B,EAAS7/B,KAAKkL,OACtBsf,KAAM1jB,EAAK9G,KAAKwqB,KAChBI,MAAOntB,KAAMmiC,EACb9/B,GAEF,MAEJ,WACOgH,EAAK9G,KAAK2/B,SACnB,GACF,GACF,EAEMzB,GAAoB,SAACh6B,GACzBA,EAAE0H,cAAc7K,SAAQ,SAAC4D,GACvB,IAAMmC,EAAO5C,EAAEue,QAAQ9d,EAAEzE,IACzB,GAAwB,aAApB4G,EAAK9G,KAAK6pB,MAAsB,CAClC,IAAMiW,EAAW57B,EAAEue,QAAQ3b,EAAK9G,KAAKF,EAAGiH,QAClCkB,EAAI63B,EAAS9/B,KAAKiI,EAAK63B,EAAS9/B,KAAKiL,MAAS,EAC9ChH,EAAI67B,EAAS9/B,KAAKiE,EAClByQ,EAAK5N,EAAK9G,KAAKiI,EAAKA,EACpB0M,EAAKmrB,EAAS9/B,KAAKkL,OAAU,EAE/BhH,EAAEqgB,QAAQzd,EAAK9G,KAAKF,EAAGI,IACzBgE,EAAEqhB,eAAeze,EAAK9G,KAAKF,EAAGI,GAAI4G,EAAK9G,KAAKF,EAAGE,MAE/CkE,EAAE2gB,QAAQ,CACR3kB,GAAI4G,EAAK9G,KAAKF,EAAGI,GACjB6G,OAAQD,EAAK9G,KAAKF,EAAGiH,OACrBC,OAAQF,EAAK9G,KAAKF,EAAGkH,OACrBhH,KAAM8G,EAAK9G,KAAKF,EAAGE,OAGvBkE,EAAE8f,WAAWrf,EAAEzE,IAEf4G,EAAK9G,KAAKF,EAAGE,KAAKq8B,OAAS,CACzB,CAAEp0B,EAAGA,EAAK,EAAIyM,EAAM,EAAGzQ,EAAGA,EAAI0Q,GAC9B,CAAE1M,EAAGA,EAAK,EAAIyM,EAAM,EAAGzQ,EAAGA,EAAI0Q,GAC9B,CAAE1Q,EAAC,EAAEgE,EAAGA,EAAIyM,GACZ,CAAEzM,EAAGA,EAAK,EAAIyM,EAAM,EAAGzQ,EAAGA,EAAI0Q,GAC9B,CAAE1M,EAAGA,EAAK,EAAIyM,EAAM,EAAGzQ,EAAGA,EAAI0Q,IAGhC7N,EAAK9G,KAAKF,EAAGE,KAAKiI,EAAInB,EAAK9G,KAAKiI,EAChCnB,EAAK9G,KAAKF,EAAGE,KAAKiE,EAAI6C,EAAK9G,KAAKiE,C,CAEpC,GACF,EAEM87B,GAAoB,SAAC59B,EAA0Bo9B,GACnD,IAAMS,EAAwC,CAAC,EAK/C,OAJAT,WAAOx+B,SAAQ,SAACe,QACGrD,IAAb0D,EAAIL,KACRk+B,EAAiBl+B,IAAQK,EAAIL,GAC/B,IACOk+B,CACT,EAEMC,GAAe,SAACV,QAAA,IAAAA,MAAA,IACpB,IAAMW,EAAgC,CAAC,EAIvC,OAHA1kC,OAAO+O,KAAKg1B,GAAOx+B,SAAQ,SAACwF,GAC1B25B,EAAS35B,EAAE4wB,eAAiBoI,EAAMh5B,EACpC,IACO25B,CACT,EG9lBM,GAAuD,CAC3DvF,QAAS,KACTlE,QAAS,GACTa,QAAS,GACT6I,gBAAgB,EAChBC,eAAe,EACfC,QAAQ,EACRC,UAAW,MAkBb,cAGE,WAAmB5zB,QAAA,IAAAA,MAA8B,CAAC,GAA/B,KAAAA,UAFnB,KAAAxM,GAAK,QA6cL,KAAAqgC,WAAa,SAACz5B,GACZ,OAAOA,EAAK9G,KAAKiP,MACnB,EA5cEhT,KAAKyQ,QAAU,OACV,IACAA,EAEP,CAycF,OApcQ,YAAAC,QAAN,SAAcjB,EAAegB,G,mEAC3B,MAAO,CAAP,EAAOzQ,KAAKukC,oBAAmB,EAAO90B,EAAOgB,G,QAMzC,YAAArM,OAAN,SAAaqL,EAAegB,G,0FAC1B,SAAMzQ,KAAKukC,oBAAmB,EAAM90B,EAAOgB,I,cAA3C,S,YAaY,YAAA8zB,mBAAd,SACEngC,EACAqL,EACAgB,G,gJAsaA,OApaMG,EAAgB,OAAK5Q,KAAKyQ,SAAYA,GAE1CtB,EAcEyB,EAAa,SAbfgsB,EAaEhsB,EAAa,MAZf,EAYEA,EAAa,QAZf8tB,OAAO,IAAG,OAAI,EACdrD,EAWEzqB,EAAa,QAVf4pB,EAUE5pB,EAAa,QATf4zB,EASE5zB,EAAa,YARf6zB,EAQE7zB,EAAa,YAPfszB,EAOEtzB,EAAa,eANf+tB,EAME/tB,EAAa,UALf8zB,EAKE9zB,EAAa,MAJfuzB,EAIEvzB,EAAa,cAHfwzB,EAGExzB,EAAa,OAEX3I,EAAI,IAAI4c,GAA0B,CACtC5O,KAAM,KAGF0uB,EAAch2B,EAAe0sB,GAAW,GAAImJ,GAC5CI,EAAcj2B,EAAe6rB,GAAW,GAAIiK,GAC9CI,EAA4CD,EAC5CE,EAA6CH,EACjC,OAAZjG,GAAgC,OAAZA,IACtBmG,EAAUF,EACVG,EAAWF,GAEPhhB,EAAe1U,EAAeC,OAAU3M,GAGxCiI,EAAgBgF,EAAME,cACtBjF,EAAgB+E,EAAMG,cAE5BnF,EACGmC,QAAO,SAAC/B,GAAS,OAAAA,EAAK9G,KAAKiP,MAAV,IACjBlO,SAAQ,SAAC+F,GACR,IAAMT,EAAOwZ,EAAa/Y,GACpBk6B,EAAQD,EAASj6B,GAKjBmE,EAAQ5E,EAAO,EAJRy6B,EAAQh6B,GAKfoE,EAAS7E,EAAO,EAAI26B,EACpBnV,EAAQ/kB,EAAK9G,KAAK6rB,MACpB,EAASA,GAEX3nB,EAAEwf,QAAQ,CACRxjB,GAAI4G,EAAK5G,GACTF,KAAM,CAAEiL,MAAK,EAAEC,OAAM,EAAE2gB,MAAK,KAG9B3nB,EAAEwf,QAAQ,CACRxjB,GAAI4G,EAAK5G,GACTF,KAAM,CAAEiL,MAAK,EAAEC,OAAM,IAY3B,IAEFvE,EAAM5F,SAAQ,SAAC0H,GAGX,EAAK83B,WAAWr8B,EAAEue,QAAQha,EAAK1B,UAC/B,EAAKw5B,WAAWr8B,EAAEue,QAAQha,EAAKzB,UAE/B9C,EAAE2gB,QAAQ,CACR3kB,GAAIuI,EAAKvI,GACT6G,OAAQ0B,EAAK1B,OACbC,OAAQyB,EAAKzB,OACbhH,KAAM,CACJma,OAAQ1R,EAAKzI,KAAKma,QAAU,IAIpC,IHjIkB,SACpBjW,EACAwI,GAcQ,IAkIYu0B,EAAeC,EAlI3Bf,EACNzzB,EAAO,eADe+lB,EACtB/lB,EAAO,cAD8By0B,EACrCz0B,EAAO,UADyCiuB,EAChDjuB,EAAO,QADkD4qB,EACzD5qB,EAAO,SAGJ+lB,GAAiB0O,IA8HaD,EA7HjBC,GA6HEF,EA7HL/8B,GA8HT0H,cAAc7K,SAAQ,SAACW,GAC3B,IAAMoF,EAAOm6B,EAAMxe,QAAQ/gB,EAAExB,IACvBkhC,EAAWF,EAAMze,QAAQ/gB,EAAExB,SAChBzB,IAAb2iC,GACFt6B,EAAK9G,KAAKiwB,SAAWmR,EAASphC,KAAKqhC,cAC5BD,EAASphC,KAAKqhC,eAEdv6B,EAAK9G,KAAKiwB,QAErB,KArIA,IAAMqR,EAkMiB,SAACC,GACxB,IAAMr9B,EAAI,IAAI4c,GAAM,CAAE5O,KAAM,KAgD5B,OA/CAqvB,EAAW31B,cAAc7K,SAAQ,SAAC4D,GAChC,IAAMmC,EAAOm5B,GAAasB,EAAW9e,QAAQ9d,EAAEzE,IAAIF,MAC7CwhC,EAAc,OACf3C,IACA/3B,GAEC26B,EAAe1B,GAAkByB,EAAa5C,IAE/C16B,EAAEwe,QAAQ/d,EAAEzE,KACfgE,EAAEwf,QAAQ,CACRxjB,GAAIyE,EAAEzE,GACNF,KAAM,KACDyhC,KAKT,IAAMtvB,EAASovB,EAAWvb,UAAUrhB,EAAEzE,II5Q/BuD,MJ6QI0O,IACJjO,EAAEwe,QAAQvQ,EAAOjS,KACpBgE,EAAEwf,QAAQ,KAAKvR,IAEjBjO,EAAE4hB,UAAUnhB,EAAEzE,GAAIiS,EAAOjS,IAE7B,IAEAqhC,EAAW11B,cAAc9K,SAAQ,SAACjB,GAChC,IAAM2I,EAAOw3B,GAAasB,EAAW/c,QAAQ1kB,EAAEI,IAAIF,MAE7CggC,EAAwB,CAAC,EAC/Bf,aAAWl+B,SAAQ,SAACe,QACArD,IAAdgK,EAAK3G,KAAoBk+B,EAAiBl+B,GAAO2G,EAAK3G,GAC5D,IAEAoC,EAAE2gB,QAAQ,CACR3kB,GAAIJ,EAAEI,GACN6G,OAAQjH,EAAEiH,OACVC,OAAQlH,EAAEkH,OACVhH,KAAMxE,OAAO6E,OACX,CAAC,EACD0+B,GACAgB,GAAkBt3B,EAAMq2B,IACxBkB,IAGN,IAEO97B,CACT,CApPsBw9B,CAAiBx9B,GAG9Bi8B,IACLzzB,EAAQ4qB,QA0PmB,SAC7BpzB,EACAwI,GAKQ,MAAyBA,EAAO,QAAhC4qB,OAAO,IAAG,IAAC,EAAEqD,EAAYjuB,EAAO,QAiBxC,OAhBAxI,EAAE0H,cAAc7K,SAAQ,SAAC+F,GAClBd,MAAMc,EAAK9G,KAAK6rB,QACd/kB,EAAK9G,KAAK6rB,QAAO/kB,EAAK9G,KAAK6rB,MAAQ,EAE5C,IACA3nB,EAAE2H,cAAc9K,SAAQ,SAAC0H,G,MACvBA,EAAKzI,KAAKwrB,QAAW,EACiC,OAApB,QAA9B,EAAC/iB,EAAKzI,KAAKk3B,gBAAmB,eAAEC,iBAClB,OAAZwD,GAAgC,OAAZA,EACtBlyB,EAAKzI,KAAKiL,OAAUxC,EAAKzI,KAAKg/B,YAE9Bv2B,EAAKzI,KAAKkL,QAAWzC,EAAKzI,KAAKg/B,YAGrC,IAEO1H,EAAU,CACnB,CAnRsBqK,CAAuBL,EAAa,CACpD3G,QAAO,EACPrD,QAAO,KAKX,IACcmD,GAAU6G,EAAa50B,E,CACnC,MAAO5M,GACP,GACgB,8DAAdA,EAAES,QAMF,YAJAof,QAAQvf,MACN,oJACAN,GAIJ,MAAMA,C,EAuHe,SAACyhC,EAAoBD,GAC5CC,EAAW31B,cAAc7K,SAAQ,SAAC4D,G,MAC1Bi9B,EAAaL,EAAW9e,QAAQ9d,EAAEzE,IAExC,GAAI0hC,EAAY,CACd,IAAMC,EAAcP,EAAY7e,QAAQ9d,EAAEzE,IAC1C0hC,EAAW5hC,KAAKiI,EAAI45B,EAAY7hC,KAAKiI,EACrC25B,EAAW5hC,KAAKiE,EAAI49B,EAAY7hC,KAAKiE,EACrC29B,EAAW5hC,KAAKqhC,OAASQ,EAAY7hC,KAAK4qB,MAC1CgX,EAAW5hC,KAAK8hC,MAAQD,EAAY7hC,KAAKwqB,MAER,QAA7B,EAAA8W,EAAYrb,YAAYthB,EAAEzE,WAAG,eAAEvC,UACjCikC,EAAW5hC,KAAKiL,MAAQ42B,EAAY7hC,KAAKiL,MACzC22B,EAAW5hC,KAAKkL,OAAS22B,EAAY7hC,KAAKkL,O,CAGhD,IAEAq2B,EAAW11B,cAAc9K,SAAQ,SAACjB,GAChC,IAAM8hC,EAAaL,EAAW/c,QAAQ1kB,EAAEI,IAClC2hC,EAAcP,EAAY9c,QAAQ1kB,EAAEI,IAE1C0hC,EAAW5hC,KAAKq8B,OAASwF,EAAcA,EAAY7hC,KAAKq8B,OAAS,GAC7DwF,GAAeA,EAAY7hC,KAAKtE,eAAe,OACjDkmC,EAAW5hC,KAAKiI,EAAI45B,EAAY7hC,KAAKiI,EACrC25B,EAAW5hC,KAAKiE,EAAI49B,EAAY7hC,KAAKiE,EAEzC,GAIF,CApJE89B,CAAiB79B,EAAGo9B,EAEtB,CGkFIryB,CAAO/K,EAAG,CACRi9B,UAAW,KACXhB,eAAc,EACd1N,gBAAiBmI,EACjBA,UAAWA,GAAa,GACxBhS,UAAW,SACX8R,OAAQ,kBACRC,QAAO,EACPlE,QAAO,EACPoC,MAAK,IAGDmJ,EAAgB,CAAC,EAAG,GACtBrB,IACE,EAAOr6B,IACP,EAAOA,IACXpC,EAAE0H,cAAc7K,SAAQ,SAAC+F,GACnB,EAAOA,EAAK9G,KAAKiI,IAAI,EAAOnB,EAAK9G,KAAKiI,GACtC,EAAOnB,EAAK9G,KAAKiE,IAAI,EAAO6C,EAAK9G,KAAKiE,EAC5C,IACAC,EAAE2H,cAAc9K,SAAQ,SAAC0H,G,MACP,QAAhB,EAAAA,EAAKzI,KAAKq8B,cAAM,SAAEt7B,SAAQ,SAACmpB,GACrB,EAAOA,EAAMjiB,IAAG,EAAOiiB,EAAMjiB,GAC7B,EAAOiiB,EAAMjmB,IAAG,EAAOimB,EAAMjmB,EACnC,GACF,IACA+9B,EAAc,GAAKrB,EAAM,GAAK,EAC9BqB,EAAc,GAAKrB,EAAM,GAAK,GAG1BsB,EAA2B,OAAZtH,GAAgC,OAAZA,EACrC0F,IAoNI,EAA2B,IAAIr3B,IAE/Bk5B,EADuB,OAAZvH,GAAgC,OAAZA,EAEjC,SAACz5B,EAAWC,GAAc,OAAAA,EAAID,CAAJ,EAC1B,SAACA,EAAWC,GAAc,OAAAD,EAAIC,CAAJ,EAC9B+C,EAAE0H,cAAc7K,SAAQ,SAAC+F,GAYvBA,EAAK9G,KAAKiI,EAAInB,EAAK9G,KAAKiI,EAAK+5B,EAAc,GAC3Cl7B,EAAK9G,KAAKiE,EAAI6C,EAAK9G,KAAKiE,EAAK+9B,EAAc,GAC3C,EAAYnuB,IAAIouB,EAAen7B,EAAK9G,KAAKiI,EAAInB,EAAK9G,KAAKiE,EACzD,IACM,EAAiBpG,MAAMuH,KAAK,GAAauI,KAAKu0B,GAG9C,EAAmBD,EACrB,SAACE,EAAeC,GAAkB,OAAAD,EAAOl6B,IAAMm6B,EAAOn6B,CAApB,EAClC,SAACk6B,EAAeC,GAAkB,OAAAD,EAAOl+B,IAAMm+B,EAAOn+B,CAApB,EAChC,EAAmCg+B,EACrC,SAACI,EAAaF,EAAeC,GAC3B,IAAMp3B,EAAMd,KAAKc,IAAIm3B,EAAOl+B,EAAGm+B,EAAOn+B,GAChCqJ,EAAMpD,KAAKoD,IAAI60B,EAAOl+B,EAAGm+B,EAAOn+B,GACtC,OAAOo+B,EAAGx5B,QAAO,SAACqhB,GAAU,OAAAA,EAAMjmB,GAAK+G,GAAOkf,EAAMjmB,GAAKqJ,CAA7B,GAC9B,EACA,SAAC+0B,EAAaF,EAAeC,GAC3B,IAAMp3B,EAAMd,KAAKc,IAAIm3B,EAAOl6B,EAAGm6B,EAAOn6B,GAChCqF,EAAMpD,KAAKoD,IAAI60B,EAAOl6B,EAAGm6B,EAAOn6B,GACtC,OAAOo6B,EAAGx5B,QAAO,SAACqhB,GAAU,OAAAA,EAAMjiB,GAAK+C,GAAOkf,EAAMjiB,GAAKqF,CAA7B,GAC9B,EAEJpJ,EAAE2H,cAAc9K,SAAQ,SAAC0H,EAAMhL,G,MAKzB0iC,GAAkBC,GAAoC,SAAnB33B,EAAKzI,KAAKC,OAC/CwI,EAAKzI,KAAKogC,cAAgBkC,GACR,QAAhB,EAAA75B,EAAKzI,KAAKq8B,cAAM,eAAEvzB,KAAI,SAAC,G,IAAEb,EAAC,IAAEhE,EAAC,IAAO,OAClCgE,EAAGA,EAAI+5B,EAAc,GACrB/9B,EAAGA,EAAI+9B,EAAc,GAFa,IAIpC99B,EAAEue,QAAQha,EAAK1B,QACf7C,EAAEue,QAAQha,EAAKzB,QACf,EACAi7B,EACA,EACA,GAGN,KAIEz0B,EAAyB,GAE7BA,EAActJ,EACX0H,cACA9C,KAAI,SAAChC,GAAS,OAAA0D,EAAgB1D,EAAhB,IACXiY,EAAc7a,EAAE2H,cAElBxL,IACFmN,EAAYzM,SAAQ,SAAC+F,GACnB4E,EAAMI,cAAchF,EAAK5G,GAAI,CAC3B+H,EAAGnB,EAAK9G,KAAKiI,EACbhE,EAAG6C,EAAK9G,KAAKiE,GAEjB,IACA8a,EAAYhe,SAAQ,SAAC0H,GACnBiD,EAAM8Z,cAAc/c,EAAKvI,GAAI,CAC3BkgC,cAAe33B,EAAKzI,KAAKogC,eAE7B,KAQK,CAAP,EALe,CACb15B,MAAO8G,EACP7G,MAAOoY,G,QASb,EAjdA,GA4dMujB,GAAmB,SACvBjG,EACAkG,EACAC,EACAC,EACAR,EACAS,EACAC,GAMA,IAAIvC,GAAgB/D,aAAM,EAANA,EAAQj/B,MAAM,EAAGi/B,EAAO1+B,OAAS,KAAM,GAE3D,GAAI4kC,GAAcC,EAAY,CACxB,MAA6BD,EAAWviC,KAAnC4iC,EAAO,IAAKC,EAAO,IACxB,EAA6BL,EAAWxiC,KAAnC8iC,EAAO,IAAKC,EAAO,IAY5B,GAXId,IACFW,EAAUL,EAAWviC,KAAKiE,EAC1B4+B,EAAUN,EAAWviC,KAAKiI,EAC1B66B,EAAUN,EAAWxiC,KAAKiE,EAC1B8+B,EAAUP,EAAWxiC,KAAKiI,GAOxB86B,IAAYF,GAAWD,IAAYE,EAAS,CAC9C,IAAME,EAAcP,EAAez/B,QAAQ6/B,GACrCI,EAAuBR,EAAeO,EAAc,GAC1D,GAAIC,EAAsB,CACxB,IAAMC,EAAoB9C,EAAc,GAClC+C,EACJlB,EACI,CACEh6B,GAAI46B,EAAWI,GAAwB,EACvCh/B,GAAGi/B,aAAiB,EAAjBA,EAAmBj/B,IAAK6+B,GAE7B,CACE76B,GAAGi7B,aAAiB,EAAjBA,EAAmBj7B,IAAK66B,EAC3B7+B,GAAI4+B,EAAWI,GAAwB,GAK5CC,IACDR,EAAiBQ,EAAmBC,IAEpC/C,EAAcV,QAAQyD,E,CAI1B,IAAMC,EAAcX,EAAez/B,QAAQ+/B,GACrCM,EAAYn5B,KAAKmH,IAAI+xB,EAAcJ,GACzC,GAAkB,IAAdK,GACFjD,EAAgBuC,EACdvC,EACAmC,EAAWviC,KACXwiC,EAAWxiC,OAGMrC,QACjByiC,EAAc3jC,KACXwlC,EACG,CACEh6B,GAAI46B,EAAWE,GAAY,EAC3B9+B,EAAG2+B,GAEL,CACE36B,EAAG26B,EACH3+B,GAAI4+B,EAAWE,GAAY,SAIhC,GAAIM,EAAY,EAAG,CACxB,IAAMC,EAAuBb,EAAeW,EAAc,GAC1D,GAAIE,EAAsB,CACxB,IAAMC,EAAoBnD,EAAcA,EAAcziC,OAAS,GACzD6lC,EACJvB,EACI,CACEh6B,GAAI86B,EAAWO,GAAwB,EACvCr/B,GAAGs/B,aAAiB,EAAjBA,EAAmBt/B,IAAK6+B,GAE7B,CACE76B,GAAGs7B,aAAiB,EAAjBA,EAAmBt7B,IAAK26B,EAC3B3+B,GAAI8+B,EAAWO,GAAwB,GAK5CC,IACDb,EAAiBa,EAAmBC,IAEpCpD,EAAc3jC,KAAK+mC,E,IAM7B,OAAOpD,CACT,EEtmBA,SAAS,GAAIluB,EAAMjK,EAAGhE,EAAGgQ,EAAGlU,GAC1B,GAAIiG,MAAMiC,IAAMjC,MAAM/B,IAAM+B,MAAMiO,GAAI,OAAO/B,EAE7C,IAAIC,EASAC,EACAC,EACAoxB,EACAnxB,EACAC,EACAmxB,EACAx7B,EACAE,EACAu7B,EACAlmC,EACAkB,EAlBAmI,EAAOoL,EAAKM,MACZC,EAAO,CAACzS,KAAMD,GACd2S,EAAKR,EAAKS,IACVC,EAAKV,EAAKW,IACV+wB,EAAK1xB,EAAK2xB,IACV/wB,EAAKZ,EAAKa,IACVC,EAAKd,EAAKe,IACV6wB,EAAK5xB,EAAK6xB,IAcd,IAAKj9B,EAAM,OAAOoL,EAAKM,MAAQC,EAAMP,EAGrC,KAAOpL,EAAKnJ,QAIV,IAHIuK,EAAQD,IAAMmK,GAAMM,EAAKI,GAAM,IAAIJ,EAAKN,EAASU,EAAKV,GACtDhK,EAASnE,IAAMoO,GAAMO,EAAKI,GAAM,IAAIJ,EAAKP,EAASW,EAAKX,GACvDsxB,EAAO1vB,IAAMwvB,GAAMG,EAAKE,GAAM,IAAIF,EAAKH,EAASK,EAAKL,EACrDtxB,EAASrL,IAAQA,EAAOA,EAAKrJ,EAAIkmC,GAAQ,EAAIv7B,GAAU,EAAIF,IAAS,OAAOiK,EAAO1U,GAAKgV,EAAMP,EAOnG,GAHAI,GAAMJ,EAAKgB,GAAG/V,KAAK,KAAM2J,EAAK9G,MAC9BuS,GAAML,EAAKiB,GAAGhW,KAAK,KAAM2J,EAAK9G,MAC9B0jC,GAAMxxB,EAAK8xB,GAAG7mC,KAAK,KAAM2J,EAAK9G,MAC1BiI,IAAMqK,GAAMrO,IAAMsO,GAAM0B,IAAMyvB,EAAI,OAAOjxB,EAAK9O,KAAOmD,EAAMqL,EAASA,EAAO1U,GAAKgV,EAAOP,EAAKM,MAAQC,EAAMP,EAG9G,GACEC,EAASA,EAASA,EAAO1U,GAAK,IAAII,MAAM,GAAKqU,EAAKM,MAAQ,IAAI3U,MAAM,IAChEqK,EAAQD,IAAMmK,GAAMM,EAAKI,GAAM,IAAIJ,EAAKN,EAASU,EAAKV,GACtDhK,EAASnE,IAAMoO,GAAMO,EAAKI,GAAM,IAAIJ,EAAKP,EAASW,EAAKX,GACvDsxB,EAAO1vB,IAAMwvB,GAAMG,EAAKE,GAAM,IAAIF,EAAKH,EAASK,EAAKL,SACjDhmC,EAAIkmC,GAAQ,EAAIv7B,GAAU,EAAIF,KAAYvJ,GAAK+kC,GAAMD,IAAO,GAAKlxB,GAAMF,IAAO,EAAKC,GAAMF,IACnG,OAAOD,EAAOxT,GAAKmI,EAAMqL,EAAO1U,GAAKgV,EAAMP,CAC7C,CCxDe,YAASpL,EAAM4L,EAAIE,EAAIgxB,EAAI9wB,EAAIE,EAAI8wB,GAChD7nC,KAAK6K,KAAOA,EACZ7K,KAAKyW,GAAKA,EACVzW,KAAK2W,GAAKA,EACV3W,KAAK2nC,GAAKA,EACV3nC,KAAK6W,GAAKA,EACV7W,KAAK+W,GAAKA,EACV/W,KAAK6nC,GAAKA,CACZ,CCRO,SAAS,GAAS/jC,GACvB,OAAOA,EAAE,EACX,CCFO,SAAS,GAASA,GACvB,OAAOA,EAAE,EACX,CCFO,SAASkkC,GAASlkC,GACvB,OAAOA,EAAE,EACX,CCYe,SAASmkC,GAAOx9B,EAAOuB,EAAGhE,EAAGgQ,GAC1C,IAAI/B,EAAO,IAAIiyB,GAAY,MAALl8B,EAAY,GAAWA,EAAQ,MAALhE,EAAY,GAAWA,EAAQ,MAALgQ,EAAYgwB,GAAWhwB,EAAGT,IAAKA,IAAKA,IAAKA,IAAKA,IAAKA,KAC7H,OAAgB,MAAT9M,EAAgBwL,EAAOA,EAAKuB,OAAO/M,EAC5C,CAEA,SAASy9B,GAAOl8B,EAAGhE,EAAGgQ,EAAGvB,EAAIE,EAAIgxB,EAAI9wB,EAAIE,EAAI8wB,GAC3C7nC,KAAKiX,GAAKjL,EACVhM,KAAKkX,GAAKlP,EACVhI,KAAK+nC,GAAK/vB,EACVhY,KAAK0W,IAAMD,EACXzW,KAAK4W,IAAMD,EACX3W,KAAK4nC,IAAMD,EACX3nC,KAAK8W,IAAMD,EACX7W,KAAKgX,IAAMD,EACX/W,KAAK8nC,IAAMD,EACX7nC,KAAKuW,WAAQ/T,CACf,CAEA,SAAS,GAAUgU,GAEjB,IADA,IAAIkB,EAAO,CAAC3T,KAAMyS,EAAKzS,MAAO2D,EAAOgQ,EAC9BlB,EAAOA,EAAK9O,MAAMA,EAAOA,EAAKA,KAAO,CAAC3D,KAAMyS,EAAKzS,MACxD,OAAO2T,CACT,CAEA,IAAI,GAAYuwB,GAAOzoC,UAAY0oC,GAAO1oC,UCmC1C,SAASwe,GAAWmqB,GAClB,IAAIC,EAAY,EACZC,EAAO,EACPC,EAAO,EACPC,EAAO,EACLC,EAAcL,EAASzmC,OAE7B,GAAI8mC,EAAa,CAEf,IAAK,IAAIhnC,EAAI,EAAGA,EAAIgnC,EAAahnC,KACzB6W,EAAI8vB,EAAS3mC,KACV6W,EAAE6F,SACTkqB,GAAa/vB,EAAE6F,OACfmqB,GAAQhwB,EAAErM,EAAIqM,EAAE6F,OAChBoqB,GAAQjwB,EAAErQ,EAAIqQ,EAAE6F,OAChBqqB,GAAQlwB,EAAEL,EAAIK,EAAE6F,QAGpBiqB,EAASn8B,EAAIq8B,EAAOD,EACpBD,EAASngC,EAAIsgC,EAAOF,EACpBD,EAASnwB,EAAIuwB,EAAOH,EACpBD,EAASjqB,OAASkqB,C,KACb,CAEL,IAAM/vB,EAAI8vB,EACVA,EAASn8B,EAAIqM,EAAEtU,KAAKiI,EACpBm8B,EAASngC,EAAIqQ,EAAEtU,KAAKiE,EACpBmgC,EAASnwB,EAAIK,EAAEtU,KAAKiU,EACpBmwB,EAASjqB,OAAS7F,EAAEtU,KAAKma,M,CAE7B,CD/DA,GAAUxG,KAAO,WACf,IAEIjN,EACAkI,EAHA+E,EAAO,IAAIwwB,GAAOloC,KAAKiX,GAAIjX,KAAKkX,GAAIlX,KAAK+nC,GAAI/nC,KAAK0W,IAAK1W,KAAK4W,IAAK5W,KAAK4nC,IAAK5nC,KAAK8W,IAAK9W,KAAKgX,IAAKhX,KAAK8nC,KACpGj9B,EAAO7K,KAAKuW,MAIhB,IAAK1L,EAAM,OAAO6M,EAElB,IAAK7M,EAAKnJ,OAAQ,OAAOgW,EAAKnB,MAAQ,GAAU1L,GAAO6M,EAGvD,IADAjN,EAAQ,CAAC,CAACK,OAAQD,EAAME,OAAQ2M,EAAKnB,MAAQ,IAAI3U,MAAM,KAChDiJ,EAAOJ,EAAM7B,OAClB,IAAK,IAAIpH,EAAI,EAAGA,EAAI,IAAKA,GACnBmR,EAAQ9H,EAAKC,OAAOtJ,MAClBmR,EAAMjR,OAAQ+I,EAAMjK,KAAK,CAACsK,OAAQ6H,EAAO5H,OAAQF,EAAKE,OAAOvJ,GAAK,IAAII,MAAM,KAC3EiJ,EAAKE,OAAOvJ,GAAK,GAAUmR,IAKtC,OAAO+E,CACT,EAEA,GAAUE,IL/DK,SAAS9T,GACtB,MAAMkI,GAAKhM,KAAKiX,GAAG/V,KAAK,KAAM4C,GAC1BkE,GAAKhI,KAAKkX,GAAGhW,KAAK,KAAM4C,GACxBkU,GAAKhY,KAAK+nC,GAAG7mC,KAAK,KAAM4C,GAC5B,OAAO,GAAI9D,KAAK6X,MAAM7L,EAAGhE,EAAGgQ,GAAIhM,EAAGhE,EAAGgQ,EAAGlU,EAC3C,EK2DA,GAAU0T,OLNH,SAAgBzT,GAChBnC,MAAM+H,QAAQ5F,KAAOA,EAAOnC,MAAMuH,KAAKpF,IAC5C,MAAM0B,EAAI1B,EAAKrC,OACToW,EAAK,IAAI2wB,aAAahjC,GACtBsS,EAAK,IAAI0wB,aAAahjC,GACtBijC,EAAK,IAAID,aAAahjC,GAC5B,IAAIgR,EAAKpM,IACLsM,EAAKtM,IACLs9B,EAAKt9B,IACLwM,GAAK,IACLE,GAAK,IACL8wB,GAAK,IAGT,IAAK,IAAW/jC,EAAGkI,EAAGhE,EAAGgQ,EAAhBxW,EAAI,EAAeA,EAAIiE,IAAKjE,EAC/BuI,MAAMiC,GAAKhM,KAAKiX,GAAG/V,KAAK,KAAM4C,EAAIC,EAAKvC,MAAQuI,MAAM/B,GAAKhI,KAAKkX,GAAGhW,KAAK,KAAM4C,KAAOiG,MAAMiO,GAAKhY,KAAK+nC,GAAG7mC,KAAK,KAAM4C,MACtHgU,EAAGtW,GAAKwK,EACR+L,EAAGvW,GAAKwG,EACR0gC,EAAGlnC,GAAKwW,EACJhM,EAAIyK,IAAIA,EAAKzK,GACbA,EAAI6K,IAAIA,EAAK7K,GACbhE,EAAI2O,IAAIA,EAAK3O,GACbA,EAAI+O,IAAIA,EAAK/O,GACbgQ,EAAI2vB,IAAIA,EAAK3vB,GACbA,EAAI6vB,IAAIA,EAAK7vB,IAInB,GAAIvB,EAAKI,GAAMF,EAAKI,GAAM4wB,EAAKE,EAAI,OAAO7nC,KAG1CA,KAAK6X,MAAMpB,EAAIE,EAAIgxB,GAAI9vB,MAAMhB,EAAIE,EAAI8wB,GAGrC,IAAK,IAAIrmC,EAAI,EAAGA,EAAIiE,IAAKjE,EACvB,GAAIxB,KAAM8X,EAAGtW,GAAIuW,EAAGvW,GAAIknC,EAAGlnC,GAAIuC,EAAKvC,IAGtC,OAAOxB,IACT,EKhCA,GAAU6X,MEjEK,SAAS7L,EAAGhE,EAAGgQ,GAC5B,GAAIjO,MAAMiC,GAAKA,IAAMjC,MAAM/B,GAAKA,IAAM+B,MAAMiO,GAAKA,GAAI,OAAOhY,KAE5D,IAAIyW,EAAKzW,KAAK0W,IACVC,EAAK3W,KAAK4W,IACV+wB,EAAK3nC,KAAK4nC,IACV/wB,EAAK7W,KAAK8W,IACVC,EAAK/W,KAAKgX,IACV6wB,EAAK7nC,KAAK8nC,IAKd,GAAI/9B,MAAM0M,GACRI,GAAMJ,EAAKxI,KAAKiE,MAAMlG,IAAM,EAC5B+K,GAAMJ,EAAK1I,KAAKiE,MAAMlK,IAAM,EAC5B6/B,GAAMF,EAAK15B,KAAKiE,MAAM8F,IAAM,MAIzB,CAMH,IALA,IAEI9B,EACA1U,EAHAoF,EAAIiQ,EAAKJ,GAAM,EACf5L,EAAO7K,KAAKuW,MAITE,EAAKzK,GAAKA,GAAK6K,GAAMF,EAAK3O,GAAKA,GAAK+O,GAAM4wB,EAAK3vB,GAAKA,GAAK6vB,GAG9D,OAFArmC,GAAKwW,EAAI2vB,IAAO,GAAK3/B,EAAI2O,IAAO,EAAK3K,EAAIyK,GACzCP,EAAS,IAAItU,MAAM,IAAWJ,GAAKqJ,EAAMA,EAAOqL,EAAQtP,GAAK,EACrDpF,GACN,KAAK,EAAGqV,EAAKJ,EAAK7P,EAAGmQ,EAAKJ,EAAK/P,EAAGihC,EAAKF,EAAK/gC,EAAG,MAC/C,KAAK,EAAG6P,EAAKI,EAAKjQ,EAAGmQ,EAAKJ,EAAK/P,EAAGihC,EAAKF,EAAK/gC,EAAG,MAC/C,KAAK,EAAGiQ,EAAKJ,EAAK7P,EAAG+P,EAAKI,EAAKnQ,EAAGihC,EAAKF,EAAK/gC,EAAG,MAC/C,KAAK,EAAG6P,EAAKI,EAAKjQ,EAAG+P,EAAKI,EAAKnQ,EAAGihC,EAAKF,EAAK/gC,EAAG,MAC/C,KAAK,EAAGiQ,EAAKJ,EAAK7P,EAAGmQ,EAAKJ,EAAK/P,EAAG+gC,EAAKE,EAAKjhC,EAAG,MAC/C,KAAK,EAAG6P,EAAKI,EAAKjQ,EAAGmQ,EAAKJ,EAAK/P,EAAG+gC,EAAKE,EAAKjhC,EAAG,MAC/C,KAAK,EAAGiQ,EAAKJ,EAAK7P,EAAG+P,EAAKI,EAAKnQ,EAAG+gC,EAAKE,EAAKjhC,EAAG,MAC/C,KAAK,EAAG6P,EAAKI,EAAKjQ,EAAG+P,EAAKI,EAAKnQ,EAAG+gC,EAAKE,EAAKjhC,EAI5C5G,KAAKuW,OAASvW,KAAKuW,MAAM7U,SAAQ1B,KAAKuW,MAAQ1L,EACpD,CAQA,OANA7K,KAAK0W,IAAMD,EACXzW,KAAK4W,IAAMD,EACX3W,KAAK4nC,IAAMD,EACX3nC,KAAK8W,IAAMD,EACX7W,KAAKgX,IAAMD,EACX/W,KAAK8nC,IAAMD,EACJ7nC,IACT,EFeA,GAAU+D,KGlEK,WACb,IAAIA,EAAO,GAIX,OAHA/D,KAAKiY,OAAM,SAASpN,GAClB,IAAKA,EAAKnJ,OAAQ,GAAGqC,EAAKvD,KAAKqK,EAAK9G,YAAc8G,EAAOA,EAAKnD,KAChE,IACO3D,CACT,EH6DA,GAAUmU,OInEK,SAAShQ,GACtB,OAAO5F,UAAUZ,OACX1B,KAAK6X,OAAO3P,EAAE,GAAG,IAAKA,EAAE,GAAG,IAAKA,EAAE,GAAG,IAAI2P,OAAO3P,EAAE,GAAG,IAAKA,EAAE,GAAG,IAAKA,EAAE,GAAG,IACzE6B,MAAM/J,KAAK0W,UAAOlU,EAAY,CAAC,CAACxC,KAAK0W,IAAK1W,KAAK4W,IAAK5W,KAAK4nC,KAAM,CAAC5nC,KAAK8W,IAAK9W,KAAKgX,IAAKhX,KAAK8nC,KACjG,EJgEA,GAAUv7B,KKlEK,SAASP,EAAGhE,EAAGgQ,EAAGjI,GAC/B,IAAIhM,EAIA8S,EACAE,EACA8wB,EACA1vB,EACAC,EACAuwB,EAMAtwB,EACA7W,EAfAiV,EAAKzW,KAAK0W,IACVC,EAAK3W,KAAK4W,IACV+wB,EAAK3nC,KAAK4nC,IAOVtvB,EAAKtY,KAAK8W,IACVyB,EAAKvY,KAAKgX,IACV4xB,EAAK5oC,KAAK8nC,IACVe,EAAO,GACPh+B,EAAO7K,KAAKuW,MAYhB,IARI1L,GAAMg+B,EAAKroC,KAAK,IAAI,GAAOqK,EAAM4L,EAAIE,EAAIgxB,EAAIrvB,EAAIC,EAAIqwB,IAC3C,MAAV74B,EAAgBA,EAAS1F,KAE3BoM,EAAKzK,EAAI+D,EAAQ4G,EAAK3O,EAAI+H,EAAQ43B,EAAK3vB,EAAIjI,EAC3CuI,EAAKtM,EAAI+D,EAAQwI,EAAKvQ,EAAI+H,EAAQ64B,EAAK5wB,EAAIjI,EAC3CA,GAAUA,GAGLsI,EAAIwwB,EAAKjgC,OAGd,OAAMiC,EAAOwN,EAAExN,QACPgM,EAAKwB,EAAE5B,IAAM6B,IACbvB,EAAKsB,EAAE1B,IAAM4B,IACbsvB,EAAKxvB,EAAEsvB,IAAMiB,IACbzwB,EAAKE,EAAExB,IAAMJ,IACb2B,EAAKC,EAAEtB,IAAMJ,IACbgyB,EAAKtwB,EAAEwvB,IAAMF,GAGrB,GAAI98B,EAAKnJ,OAAQ,CACf,IAAIyU,GAAMU,EAAKsB,GAAM,EACjB/B,GAAMW,EAAKqB,GAAM,EACjBovB,GAAMK,EAAKc,GAAM,EAErBE,EAAKroC,KACH,IAAI,GAAOqK,EAAK,GAAIsL,EAAIC,EAAIoxB,EAAIrvB,EAAIC,EAAIuwB,GACxC,IAAI,GAAO99B,EAAK,GAAIgM,EAAIT,EAAIoxB,EAAIrxB,EAAIiC,EAAIuwB,GACxC,IAAI,GAAO99B,EAAK,GAAIsL,EAAIY,EAAIywB,EAAIrvB,EAAI/B,EAAIuyB,GACxC,IAAI,GAAO99B,EAAK,GAAIgM,EAAIE,EAAIywB,EAAIrxB,EAAIC,EAAIuyB,GACxC,IAAI,GAAO99B,EAAK,GAAIsL,EAAIC,EAAIyxB,EAAI1vB,EAAIC,EAAIovB,GACxC,IAAI,GAAO38B,EAAK,GAAIgM,EAAIT,EAAIyxB,EAAI1xB,EAAIiC,EAAIovB,GACxC,IAAI,GAAO38B,EAAK,GAAIsL,EAAIY,EAAI8wB,EAAI1vB,EAAI/B,EAAIoxB,GACxC,IAAI,GAAO38B,EAAK,GAAIgM,EAAIE,EAAI8wB,EAAI1xB,EAAIC,EAAIoxB,KAItChmC,GAAKwW,GAAKwvB,IAAO,GAAKx/B,GAAKoO,IAAO,EAAKpK,GAAKmK,KAC9CkC,EAAIwwB,EAAKA,EAAKnnC,OAAS,GACvBmnC,EAAKA,EAAKnnC,OAAS,GAAKmnC,EAAKA,EAAKnnC,OAAS,EAAIF,GAC/CqnC,EAAKA,EAAKnnC,OAAS,EAAIF,GAAK6W,EAEhC,KAGK,CACH,IAAII,EAAKzM,GAAKhM,KAAKiX,GAAG/V,KAAK,KAAM2J,EAAK9G,MAClC2U,EAAK1Q,GAAKhI,KAAKkX,GAAGhW,KAAK,KAAM2J,EAAK9G,MAClC+kC,EAAK9wB,GAAKhY,KAAK+nC,GAAG7mC,KAAK,KAAM2J,EAAK9G,MAClC4U,EAAKF,EAAKA,EAAKC,EAAKA,EAAKowB,EAAKA,EAClC,GAAInwB,EAAK5I,EAAQ,CACf,IAAIjM,EAAImK,KAAKC,KAAK6B,EAAS4I,GAC3BlC,EAAKzK,EAAIlI,EAAG6S,EAAK3O,EAAIlE,EAAG6jC,EAAK3vB,EAAIlU,EACjCwU,EAAKtM,EAAIlI,EAAGyU,EAAKvQ,EAAIlE,EAAG8kC,EAAK5wB,EAAIlU,EACjCC,EAAO8G,EAAK9G,IACd,CACF,CAGF,OAAOA,CACT,ELZA,GAAU6U,OMrEK,SAAS9U,GACtB,GAAIiG,MAAMiC,GAAKhM,KAAKiX,GAAG/V,KAAK,KAAM4C,KAAOiG,MAAM/B,GAAKhI,KAAKkX,GAAGhW,KAAK,KAAM4C,KAAOiG,MAAMiO,GAAKhY,KAAK+nC,GAAG7mC,KAAK,KAAM4C,IAAK,OAAO9D,KAExH,IAAIkW,EAEA2C,EACAC,EACApR,EAOAsE,EACAhE,EACAgQ,EACA7B,EACAC,EACAoxB,EACAv7B,EACAE,EACAu7B,EACAlmC,EACAkB,EApBAmI,EAAO7K,KAAKuW,MAIZE,EAAKzW,KAAK0W,IACVC,EAAK3W,KAAK4W,IACV+wB,EAAK3nC,KAAK4nC,IACV/wB,EAAK7W,KAAK8W,IACVC,EAAK/W,KAAKgX,IACV6wB,EAAK7nC,KAAK8nC,IAcd,IAAKj9B,EAAM,OAAO7K,KAIlB,GAAI6K,EAAKnJ,OAAQ,OAAa,CAI5B,IAHIuK,EAAQD,IAAMmK,GAAMM,EAAKI,GAAM,IAAIJ,EAAKN,EAASU,EAAKV,GACtDhK,EAASnE,IAAMoO,GAAMO,EAAKI,GAAM,IAAIJ,EAAKP,EAASW,EAAKX,GACvDsxB,EAAO1vB,IAAMwvB,GAAMG,EAAKE,GAAM,IAAIF,EAAKH,EAASK,EAAKL,EACnDtxB,EAASrL,IAAMA,EAAOA,EAAKrJ,EAAIkmC,GAAQ,EAAIv7B,GAAU,EAAIF,IAAS,OAAOjM,KAC/E,IAAK6K,EAAKnJ,OAAQ,OACdwU,EAAQ1U,EAAI,EAAK,IAAM0U,EAAQ1U,EAAI,EAAK,IAAM0U,EAAQ1U,EAAI,EAAK,IAAM0U,EAAQ1U,EAAI,EAAK,IAAM0U,EAAQ1U,EAAI,EAAK,IAAM0U,EAAQ1U,EAAI,EAAK,IAAM0U,EAAQ1U,EAAI,EAAK,MAAIqX,EAAW3C,EAAQxT,EAAIlB,EAC5L,CAGA,KAAOqJ,EAAK9G,OAASD,MAASgV,EAAWjO,IAAMA,EAAOA,EAAKnD,MAAO,OAAO1H,KAIzE,OAHI0H,EAAOmD,EAAKnD,cAAamD,EAAKnD,KAG9BoR,GAAkBpR,EAAOoR,EAASpR,KAAOA,SAAcoR,EAASpR,KAAO1H,MAGtEkW,GAGLxO,EAAOwO,EAAO1U,GAAKkG,SAAcwO,EAAO1U,IAGnCqJ,EAAOqL,EAAO,IAAMA,EAAO,IAAMA,EAAO,IAAMA,EAAO,IAAMA,EAAO,IAAMA,EAAO,IAAMA,EAAO,IAAMA,EAAO,KACvGrL,KAAUqL,EAAO,IAAMA,EAAO,IAAMA,EAAO,IAAMA,EAAO,IAAMA,EAAO,IAAMA,EAAO,IAAMA,EAAO,IAAMA,EAAO,MAC3GrL,EAAKnJ,SACPmX,EAAUA,EAASnW,GAAKmI,EACvB7K,KAAKuW,MAAQ1L,GAGb7K,OAbaA,KAAKuW,MAAQ7O,EAAM1H,KAczC,ENQA,GAAU+Y,UMNH,SAAmBhV,GACxB,IAAK,IAAIvC,EAAI,EAAGiE,EAAI1B,EAAKrC,OAAQF,EAAIiE,IAAKjE,EAAGxB,KAAK4Y,OAAO7U,EAAKvC,IAC9D,OAAOxB,IACT,ENIA,GAAUgZ,KOvEK,WACb,OAAOhZ,KAAKuW,KACd,EPsEA,GAAUnM,KQxEK,WACb,IAAIA,EAAO,EAIX,OAHApK,KAAKiY,OAAM,SAASpN,GAClB,IAAKA,EAAKnJ,OAAQ,KAAK0I,QAAaS,EAAOA,EAAKnD,KAClD,IACO0C,CACT,ERmEA,GAAU6N,MSvEK,SAASgB,GACtB,IAAeZ,EAAsB1F,EAAO8D,EAAIE,EAAIgxB,EAAI9wB,EAAIE,EAAI8wB,EAA5DgB,EAAO,GAAOh+B,EAAO7K,KAAKuW,MAE9B,IADI1L,GAAMg+B,EAAKroC,KAAK,IAAI,GAAOqK,EAAM7K,KAAK0W,IAAK1W,KAAK4W,IAAK5W,KAAK4nC,IAAK5nC,KAAK8W,IAAK9W,KAAKgX,IAAKhX,KAAK8nC,MACrFzvB,EAAIwwB,EAAKjgC,OACd,IAAKqQ,EAASpO,EAAOwN,EAAExN,KAAM4L,EAAK4B,EAAE5B,GAAIE,EAAK0B,EAAE1B,GAAIgxB,EAAKtvB,EAAEsvB,GAAI9wB,EAAKwB,EAAExB,GAAIE,EAAKsB,EAAEtB,GAAI8wB,EAAKxvB,EAAEwvB,KAAOh9B,EAAKnJ,OAAQ,CAC7G,IAAIyU,GAAMM,EAAKI,GAAM,EAAGT,GAAMO,EAAKI,GAAM,EAAGywB,GAAMG,EAAKE,GAAM,GACzDl1B,EAAQ9H,EAAK,KAAIg+B,EAAKroC,KAAK,IAAI,GAAOmS,EAAOwD,EAAIC,EAAIoxB,EAAI3wB,EAAIE,EAAI8wB,KACjEl1B,EAAQ9H,EAAK,KAAIg+B,EAAKroC,KAAK,IAAI,GAAOmS,EAAO8D,EAAIL,EAAIoxB,EAAIrxB,EAAIY,EAAI8wB,KACjEl1B,EAAQ9H,EAAK,KAAIg+B,EAAKroC,KAAK,IAAI,GAAOmS,EAAOwD,EAAIQ,EAAI6wB,EAAI3wB,EAAIT,EAAIyxB,KACjEl1B,EAAQ9H,EAAK,KAAIg+B,EAAKroC,KAAK,IAAI,GAAOmS,EAAO8D,EAAIE,EAAI6wB,EAAIrxB,EAAIC,EAAIyxB,KACjEl1B,EAAQ9H,EAAK,KAAIg+B,EAAKroC,KAAK,IAAI,GAAOmS,EAAOwD,EAAIC,EAAIuxB,EAAI9wB,EAAIE,EAAIywB,KACjE70B,EAAQ9H,EAAK,KAAIg+B,EAAKroC,KAAK,IAAI,GAAOmS,EAAO8D,EAAIL,EAAIuxB,EAAIxxB,EAAIY,EAAIywB,KACjE70B,EAAQ9H,EAAK,KAAIg+B,EAAKroC,KAAK,IAAI,GAAOmS,EAAOwD,EAAIQ,EAAIgxB,EAAI9wB,EAAIT,EAAIoxB,KACjE70B,EAAQ9H,EAAK,KAAIg+B,EAAKroC,KAAK,IAAI,GAAOmS,EAAO8D,EAAIE,EAAIgxB,EAAIxxB,EAAIC,EAAIoxB,GACvE,CAEF,OAAOxnC,IACT,ETuDA,GAAUkZ,WUxEK,SAASD,GACtB,IAA0BZ,EAAtBwwB,EAAO,GAAInhC,EAAO,GAEtB,IADI1H,KAAKuW,OAAOsyB,EAAKroC,KAAK,IAAI,GAAOR,KAAKuW,MAAOvW,KAAK0W,IAAK1W,KAAK4W,IAAK5W,KAAK4nC,IAAK5nC,KAAK8W,IAAK9W,KAAKgX,IAAKhX,KAAK8nC,MACjGzvB,EAAIwwB,EAAKjgC,OAAO,CACrB,IAAIiC,EAAOwN,EAAExN,KACb,GAAIA,EAAKnJ,OAAQ,CACf,IAAIiR,EAAO8D,EAAK4B,EAAE5B,GAAIE,EAAK0B,EAAE1B,GAAIgxB,EAAKtvB,EAAEsvB,GAAI9wB,EAAKwB,EAAExB,GAAIE,EAAKsB,EAAEtB,GAAI8wB,EAAKxvB,EAAEwvB,GAAI1xB,GAAMM,EAAKI,GAAM,EAAGT,GAAMO,EAAKI,GAAM,EAAGywB,GAAMG,EAAKE,GAAM,GAClIl1B,EAAQ9H,EAAK,KAAIg+B,EAAKroC,KAAK,IAAI,GAAOmS,EAAO8D,EAAIE,EAAIgxB,EAAIxxB,EAAIC,EAAIoxB,KACjE70B,EAAQ9H,EAAK,KAAIg+B,EAAKroC,KAAK,IAAI,GAAOmS,EAAOwD,EAAIQ,EAAIgxB,EAAI9wB,EAAIT,EAAIoxB,KACjE70B,EAAQ9H,EAAK,KAAIg+B,EAAKroC,KAAK,IAAI,GAAOmS,EAAO8D,EAAIL,EAAIuxB,EAAIxxB,EAAIY,EAAIywB,KACjE70B,EAAQ9H,EAAK,KAAIg+B,EAAKroC,KAAK,IAAI,GAAOmS,EAAOwD,EAAIC,EAAIuxB,EAAI9wB,EAAIE,EAAIywB,KACjE70B,EAAQ9H,EAAK,KAAIg+B,EAAKroC,KAAK,IAAI,GAAOmS,EAAO8D,EAAIE,EAAI6wB,EAAIrxB,EAAIC,EAAIyxB,KACjEl1B,EAAQ9H,EAAK,KAAIg+B,EAAKroC,KAAK,IAAI,GAAOmS,EAAOwD,EAAIQ,EAAI6wB,EAAI3wB,EAAIT,EAAIyxB,KACjEl1B,EAAQ9H,EAAK,KAAIg+B,EAAKroC,KAAK,IAAI,GAAOmS,EAAO8D,EAAIL,EAAIoxB,EAAIrxB,EAAIY,EAAI8wB,KACjEl1B,EAAQ9H,EAAK,KAAIg+B,EAAKroC,KAAK,IAAI,GAAOmS,EAAOwD,EAAIC,EAAIoxB,EAAI3wB,EAAIE,EAAI8wB,GACvE,CACAngC,EAAKlH,KAAK6X,EACZ,CACA,KAAOA,EAAI3Q,EAAKkB,OACdqQ,EAASZ,EAAExN,KAAMwN,EAAE5B,GAAI4B,EAAE1B,GAAI0B,EAAEsvB,GAAItvB,EAAExB,GAAIwB,EAAEtB,GAAIsB,EAAEwvB,IAEnD,OAAO7nC,IACT,EVmDA,GAAUgM,EHvEK,SAAS9D,GACtB,OAAO5F,UAAUZ,QAAU1B,KAAKiX,GAAK/O,EAAGlI,MAAQA,KAAKiX,EACvD,EGsEA,GAAUjP,EFxEK,SAASE,GACtB,OAAO5F,UAAUZ,QAAU1B,KAAKkX,GAAKhP,EAAGlI,MAAQA,KAAKkX,EACvD,EEuEA,GAAUc,EDzEK,SAAS9P,GACtB,OAAO5F,UAAUZ,QAAU1B,KAAK+nC,GAAK7/B,EAAGlI,MAAQA,KAAK+nC,EACvD,EEmGA,IAAMtlC,GAAQ,SACZ0lC,EACAtxB,EACAkyB,EACAC,EACAC,EACAp+B,EACAq+B,GAEA,IAAM/wB,EAAK,CAAC4wB,EAAMC,EAAMC,GAAMC,EAAa,GAErCzwB,EAAK5N,EAAKmB,EAAIm8B,EAASn8B,GA7Gf,GA8GR0M,EAAK7N,EAAK7C,EAAImgC,EAASngC,GA9Gf,GA+GR8gC,EAAKj+B,EAAKmN,EAAImwB,EAASnwB,GA/Gf,GAgHRhJ,EAAQmJ,EAAKtB,EACbsyB,EAAO1wB,EAAKA,EAAKC,EAAKA,EAAKowB,EAAKA,EAChCM,EAAOn7B,KAAKC,KAAKi7B,GAAQA,EAG/B,GAAIn6B,EAAQA,EAtHC,IAsHgBm6B,EAAM,CACjC,IAAME,EAAQlB,EAASjqB,OAASkrB,EAIhC,OAHAv+B,EAAKmS,IAAMvE,EAAK4wB,EAChBx+B,EAAKqS,IAAMxE,EAAK2wB,EAChBx+B,EAAKy+B,IAAMR,EAAKO,GACT,C,CAGT,GAAIlB,EAASzmC,OAAQ,OAAO,EAIxBymC,EAASpkC,OAAS8G,IACdw+B,EAAQlB,EAASpkC,KAAKma,OAASkrB,EACrCv+B,EAAKmS,IAAMvE,EAAK4wB,EAChBx+B,EAAKqS,IAAMxE,EAAK2wB,EAChBx+B,EAAKy+B,IAAMR,EAAKO,EAEpB,EUvHM,GAAuD,CAC3DH,WAAY,EACZK,aAAc,IACdC,QAAS,GACTC,OAAQ,EACRzmB,aAAc,IACdD,aAAc,IACd2mB,gBAAiB,KACjBC,QAAS,GACTC,SAAU,IACVC,YAAa,GACb7vB,SAAU,IACV8H,aAAc,IACdI,oBAAqB,GACrBpO,gBAAgB,EAChBg2B,sBAAuB,QAkBzB,cAuBE,WAAmBr5B,QAAA,IAAAA,MAA8B,CAAC,GAA/B,KAAAA,UAtBnB,KAAAxM,GAAK,QAIG,KAAA8lC,aAAuB,EAIvB,KAAAC,gBAA0B,EAE1B,KAAA72B,SAAmB,EAazBnT,KAAKyQ,QAAU,OACV,IACAA,EAEP,CAuvBF,OAlvBQ,YAAAC,QAAN,SAAcjB,EAAcgB,G,mEAC1B,MAAO,CAAP,EAAOzQ,KAAKuiB,oBAAmB,EAAO9S,EAAOgB,G,QAKzC,YAAArM,OAAN,SAAaqL,EAAcgB,G,0EACzBzQ,KAAKuiB,oBAAmB,EAAM9S,EAAOgB,G,WAMvC,YAAAiD,KAAA,WACM1T,KAAK+pC,cAAkC,oBAAXl3B,QAC9BA,OAAOiJ,cAAc9b,KAAK+pC,cAE5B/pC,KAAKmT,SAAU,CACjB,EAMA,YAAA0J,KAAA,SAAKvJ,GAAL,WACE,QADG,IAAAA,MAAatT,KAAKyQ,QAAQ84B,cAAgB,GACzCvpC,KAAKiqC,WACP,OAAOjqC,KAAKiqC,WAGd,IACE,IAAIzoC,EAAI,GACPxB,KAAKgqC,gBAAkBhqC,KAAKkqC,YAAYL,aAAeroC,EAAI,IAC5DA,EAAI8R,EACJ9R,IAEAxB,KAAKmqC,WACHnqC,KAAKoqC,cACLpqC,KAAK6iB,UACLrhB,EACAxB,KAAKqqC,WACLrqC,KAAKkqC,aAEPlqC,KAAKsqC,eACHtqC,KAAK6iB,UACL7iB,KAAKoqC,cACLpqC,KAAKqqC,WACLrqC,KAAKkqC,aAIT,IAAM3lC,EAAS,CACbkG,MAAOzK,KAAKyiB,gBACZ/X,MAAO1K,KAAK2iB,iBAad,OAVI3iB,KAAK4iB,YACPre,EAAOkG,MAAM3F,SAAQ,SAAC+F,GACpB,SAAKgY,UAAUhT,cAAchF,EAAK5G,GAAI,CACpC+H,EAAGnB,EAAK9G,KAAKiI,EACbhE,EAAG6C,EAAK9G,KAAKiE,EACbgQ,EAA+B,IAA5B,EAAKvH,QAAQy4B,WAAmBr+B,EAAK9G,KAAKiU,OAAIxV,GAHnD,IAQG+B,CACT,EAYc,YAAAge,mBAAd,SACEne,EACAqL,EACAgB,G,sHAiDA,OA/CMG,EAAgB,OAAK5Q,KAAKyQ,SAAYA,GAEtChG,EAAQgF,EAAME,cACdjF,EAAQ+E,EAAMG,cAEd26B,EAAmBvqC,KAAKwqC,cAAc55B,EAAenB,GAEzDy5B,EAQEqB,EAAgB,WAPlBv7B,EAOEu7B,EAAgB,MANlBt7B,EAMEs7B,EAAgB,OALlBp7B,EAKEo7B,EAAgB,SAJlBE,EAIEF,EAAgB,QAHlBxnB,EAGEwnB,EAAgB,aAFlBvnB,EAEEunB,EAAgB,aADlBzoB,EACEyoB,EAAgB,aAGdh5B,EAA0B9G,EAAMoC,KACpC,SAAChC,EAAMrJ,GACL,OAAC,OACIqJ,GAAI,CACP9G,KAAM,OACD8G,EAAK9G,MAAI,CAEZiI,EAAG,EAASnB,EAAK9G,KAAKiI,GAAKnB,EAAK9G,KAAKiI,EAAIiC,KAAKS,SAAWM,EACzDhH,EAAG,EAAS6C,EAAK9G,KAAKiE,GAAK6C,EAAK9G,KAAKiE,EAAIiG,KAAKS,SAAWO,EACzD+I,EAAG,EAASnN,EAAK9G,KAAKiU,GAAKnN,EAAK9G,KAAKiU,EAAI/J,KAAKS,SAAWT,KAAKC,KAAKc,EAAQC,GAC3E7E,KAAM+E,EAAStE,IAAS,GACxB6/B,KAAMD,EAAQ5/B,GACdkY,aAAcA,EAAalY,MAV/B,IAcEiY,EAA0BpY,EAAMmC,KAAI,SAACL,GAAS,OAAC,OAChDA,GAAI,CACPzI,KAAM,OACDyI,EAAKzI,MAAI,CACZif,aAAcA,EAAaxW,GAC3BsV,aAAcA,EACZtV,EACAiD,EAAM+W,QAAQha,EAAK1B,QACnB2E,EAAM+W,QAAQha,EAAKzB,YAR2B,KAa/CN,aAAK,EAALA,EAAO/I,SAKNipC,EAAkC,CAAC,EACzClgC,EAAM3F,SAAQ,SAAC+F,EAAMrJ,GACnBmpC,EAAO9/B,EAAK5G,IAAM,CAChB+H,EAAG,EACHhE,EAAG,EACHgQ,EAAG,EAEP,IAEM4yB,EAAY,IAAI,GAAmC,CACvDngC,MAAO8G,EACP7G,MAAOoY,IAGT9iB,KAAK6qC,kBAAkBN,EAAkBK,GAEjCrB,EAAsCgB,EAAgB,aAAxCV,EAAwBU,EAAgB,YAA3BtnB,EAAWsnB,EAAgB,OAG9DvqC,KAAKyiB,gBAAkBlR,EACvBvR,KAAK2iB,gBAAkBG,EACvB9iB,KAAK4iB,WAAaxe,EAClBpE,KAAK6iB,UAAYpT,EACjBzP,KAAKoqC,cAAgBQ,EACrB5qC,KAAKkqC,YAAcK,EACnBvqC,KAAKqqC,WAAaM,EAEI,oBAAX93B,OAAwB,KAC/Bi4B,EAAO,EAEJ,CAAP,EAAO,IAAI9lC,SAAQ,SAACqC,GAElB,EAAK0iC,aAAel3B,OAAOkJ,aAAY,WAChCtR,GAAU,EAAK0I,SAClB9L,EAAQ,CACNoD,MAAO,GAAegF,EAAO8B,GAC7B7G,MAAK,IAGT,EAAKy/B,WAAWS,EAAWn7B,EAAOq7B,EAAMH,EAAQJ,GAChD,EAAKD,eAAe76B,EAAOm7B,EAAWD,EAAQJ,GAC1CnmC,GACFmN,EAAYzM,SAAQ,SAAC+F,GACnB,OAAA4E,EAAMI,cAAchF,EAAK5G,GAAI,CAC3B+H,EAAGnB,EAAK9G,KAAKiI,EACbhE,EAAG6C,EAAK9G,KAAKiE,EACbgQ,EAAkB,IAAfkxB,EAAmBr+B,EAAK9G,KAAKiU,OAAIxV,GAHtC,IAOJygB,WAAS,CACPxY,MAAO,GAAegF,EAAO8B,GAC7B7G,MAAK,OAEPogC,GACYvB,GAAgB,EAAKS,gBAAkBH,KACjDh3B,OAAOiJ,cAAc,EAAKiuB,cAE1B1iC,EAAQ,CACNoD,MAAO,GAAegF,EAAO8B,GAC7B7G,MAAK,IAGX,GAAG,GACH,EAAKyI,SAAU,CACjB,QArEEnT,KAAKiqC,WAAa,CAAEx/B,MAAO,GAAIC,MAAK,GAC7B,CAAP,EAAO,CAAED,MAAO,GAAIC,MAAK,I,QA6ErB,YAAA8/B,cAAR,SACE/5B,EACAhB,GAEA,IAAM86B,EAAmB95B,EACV4D,EAA6C5D,EAAO,MAAhC6D,EAAyB7D,EAAO,OAAnBg6B,EAAYh6B,EAAO,QA6BnE,GA1BA85B,EAAiBv7B,MACdqF,GAAgC,oBAAXxB,OAEjBwB,EADDxB,OAAOC,WAEby3B,EAAiBt7B,OACdqF,GAAiC,oBAAXzB,OAElByB,EADDzB,OAAOE,YAERtC,EAAQf,SACX66B,EAAiB76B,OAAS,CACxB66B,EAAiBv7B,MAAQ,EACzBu7B,EAAiBt7B,OAAS,IAKzBw7B,IACHF,EAAiBE,QAAU,SAAC3mC,GAC1B,IAAIinC,EAAa,EACb,EAASjnC,aAAC,EAADA,EAAGC,KAAK2mC,QAAOK,EAAajnC,aAAC,EAADA,EAAGC,KAAK2mC,MACjD,IAAMM,EAASv7B,EAAMoC,UAAU/N,EAAGG,GAAI,QACtC,OAAQ+mC,GAAUA,EAAS,EAAID,EAAsB,EAATC,EAAaD,CAC3D,GAIEt6B,EAAQqD,eAAgB,CAC1B,IAAM,EAAkBnF,EAAqB,EAAG8B,EAAQrB,aACnDqB,EAAQtB,SAcFxF,EAAQ8G,EAAQtB,UACzBo7B,EAAiBp7B,SAAW,SAACrL,GAC3B,IAAMqL,EAAWsB,EAAQtB,SACzB,OAAOlB,KAAKc,IAAII,EAAS,GAAIA,EAAS,IAAM,EAAgBrL,EAC9D,EAEAymC,EAAiBp7B,SAAW,SAACrL,GAC3B,OAAC2M,EAAQtB,SAAsB,EAAgBrL,EAA/C,EApBFymC,EAAiBp7B,SAAW,SAACrL,GACnB,IAAAsG,IAAStG,aAAC,EAADA,EAAGC,OAAQ,CAAC,GAAC,KAC9B,OAAIqG,EACET,EAAQS,GACH6D,KAAKc,IAAI3E,EAAK,GAAIA,EAAK,IAAM,EAAgBtG,GAElD,EAA4CsG,GACvC6D,KAAKc,IAAI3E,EAAK4E,MAAO5E,EAAK6E,QAAU,EAAgBnL,GAErDsG,EAAkB,EAAgBtG,GAErC,GAAK,EAAgBA,EAC9B,C,CAsBJ,OATAymC,EAAiBzoB,aAAerR,EAAQqR,aACpCnT,EAAe,EAAG8B,EAAQqR,cAC1B,SAACtV,GACC,SACA+9B,EAAiBp7B,SAASM,EAAM+W,QAAQha,EAAM1B,SAC9Cy/B,EAAiBp7B,SAASM,EAAM+W,QAAQha,EAAMzB,QAF9C,EAGNw/B,EAAiBxnB,aAAepU,EAAe,EAAG8B,EAAQsS,cAC1DwnB,EAAiBvnB,aAAerU,EAAe,EAAG8B,EAAQuS,cAEnDvS,CACT,EAOQ,YAAAo6B,kBAAR,SAA0Bp6B,EAA0Bm6B,GAEhD,IAyBEK,EAzBFC,EAMEz6B,EAAO,mBALTf,EAKEe,EAAO,OAJTyR,EAIEzR,EAAO,oBAHT06B,EAGE16B,EAAO,YAFTwR,EAEExR,EAAO,WADTxD,EACEwD,EAAO,cACL26B,EAAYR,EAAUj7B,cAEtB07B,EAAmBH,GAAsB,CAC7C10B,KAAM,EACN80B,OAAQ,EACRznB,OAAQ,EAERnU,OAAQ,SAACjK,GACP,MAAO,CACLuG,EAAG0D,EAAO,GACV1H,EAAG0H,EAAO,GAEd,GAEiC,mBAAxBwS,IACTzR,EAAQyR,oBAAsB,SAACrX,GAC7B,OAAAqX,CAAA,GAGJ,IAAIqpB,EAAqB,GAuDzB,GAtDIJ,GAAel+B,IACjBg+B,EAAkBO,GAAmBZ,EAAW39B,GAChDs+B,EACE3pC,MAAMuH,KACJ,IAAI4D,IAAIq+B,aAAS,EAATA,EAAWv+B,KAAI,SAAChC,GAAS,OAAAA,EAAK9G,KAAKkJ,EAAV,OAC9B,GAEPwD,EAAQy6B,mBAAqB3rC,OAAO6E,OAAOinC,EAAkB,CAC3DC,OAAQ,IACR90B,KAAM,SAAC3L,GAEC,MACJogC,EAAgBpgC,EAAK5G,KAAO,CAAC,EADvBwnC,EAAa,gBAAEC,EAAc,iBAGrC,OACEA,aAAc,EAAdA,EAAgBhqC,WAAW+pC,aAAa,EAAbA,EAAe/pC,SACrB,KAArB6pC,aAAQ,EAARA,EAAU7pC,QAEH,EAEF+O,EAAQyR,oBAAoBrX,EACrC,EACAgZ,OAAQ,EACRnU,OAAQ,SAAC7E,GACP,IAQI8gC,EAREX,EAASJ,EAAU/4B,UAAUhH,EAAK5G,GAAI,QAE5C,IAAK+mC,EACH,MAAO,CACLh/B,EAAG,IACHhE,EAAG,KAIP,GAAe,IAAXgjC,EAAc,CAGR,OAAwBC,EAAgBpgC,EAAK5G,KAAO,CAAC,GAAC,eAAtDynC,OAAc,IAAG,KAAE,EACG,IAA1BA,EAAehqC,OAEjBiqC,OAAYnpC,EACHkpC,EAAehqC,OAAS,IAEjCiqC,EAAY,GAAmBD,G,MAGjCC,OAAYnpC,EAEd,MAAO,CACLwJ,EAAG2/B,aAAS,EAATA,EAAW3/B,EACdhE,EAAG2jC,aAAS,EAATA,EAAW3jC,EAElB,KAGAia,GAAchV,EAAe,CAC1Bg+B,IACHA,EAAkBO,GAAmBZ,EAAW39B,IAE7Cs+B,IACHA,EAAW3pC,MAAMuH,KACf,IAAI4D,IACFq+B,EAAUv+B,KAAI,SAAChC,GAAe,OAAAA,EAAK9G,KAAKkJ,EAAV,OAIpCs+B,EAAWA,EAAS3+B,QAAO,SAACgB,GAAS,YAASpL,IAAToL,CAAA,IAErC,IAAM,EAAuC,CAAC,EAC9C29B,EAASzmC,SAAQ,SAAC6a,GAChB,IAAMhS,EAAgBy9B,EACnBx+B,QAAO,SAAC/B,GAAS,OAAAA,EAAK9G,KAAKkJ,KAAmB0S,CAA7B,IACjB9S,KAAI,SAAChC,GAAS,OAAA+/B,EAAUpkB,QAAQ3b,EAAK5G,GAAvB,IAEjB,EAAW0b,GAAW,GAAmBhS,EAC3C,IACA8C,EAAQy6B,mBAAqB3rC,OAAO6E,OAAOinC,EAAkB,CAC3DC,OAAQ,SAACzgC,GAAe,OAAA4F,EAAQyR,oBAAoBrX,EAA5B,EACxB2L,KAAM,SAAC3L,GAAe,OAAA4F,EAAQyR,oBAAoBrX,EAA5B,EACtBgZ,OAAQ,SAAChZ,GAAe,OAAA4F,EAAQyR,oBAAoBrX,EAA5B,EACxB6E,OAAQ,SAAC7E,GAEP,IAAM8gC,EAAY,EAAW9gC,EAAK9G,KAAKkJ,IACvC,MAAO,CACLjB,EAAG2/B,aAAS,EAATA,EAAW3/B,EACdhE,EAAG2jC,aAAS,EAATA,EAAW3jC,EAElB,G,CAGE,MAA2ByI,EAAQy6B,oBAAsB,CAAC,EAAxD10B,EAAI,OAAE80B,EAAM,SAAEznB,EAAM,SACxBrN,GAAwB,mBAATA,IACjB/F,EAAQy6B,mBAAmB10B,KAAO,WAAM,OAAAA,CAAA,GAEtC80B,GAA4B,mBAAXA,IACnB76B,EAAQy6B,mBAAmBI,OAAS,WAAM,OAAAA,CAAA,GAExCznB,GAA4B,mBAAXA,IACnBpT,EAAQy6B,mBAAmBrnB,OAAS,WAAM,OAAAA,CAAA,EAE9C,EAWQ,YAAAsmB,WAAR,SACES,EACAn7B,EACAq7B,EACAH,EACAl6B,GAEA,IAAMm7B,EAAkC,CAAC,EACnCR,EAAYR,EAAUj7B,cACtBk8B,EAAYjB,EAAUh7B,cAC5B,GAAKw7B,aAAS,EAATA,EAAW1pC,OAAhB,CACQ,IAAAoqC,EAAYr7B,EAAO,QAC3BzQ,KAAK+rC,aAAanB,EAAWgB,EAAQn7B,GACjCo7B,GAAW7rC,KAAKgsC,cAAcpB,EAAWgB,EAAQn7B,GACrDzQ,KAAKisC,WAAWrB,EAAWn7B,EAAOm8B,EAAQn7B,GAC1CzQ,KAAKksC,eAAetB,EAAWgB,EAAQjB,EAAQl6B,GAG3Cq7B,GAEFA,EAAQ,CACNK,OAFansC,KAAKosC,eAAeR,EAAQR,GAGzC3gC,MAAOgF,EAAME,cACbjF,MAAO+E,EAAMG,cACb0D,WAAYw3B,GAdc,CAiBhC,EAQQ,YAAAsB,eAAR,SAAuBR,EAAiCnhC,GAAxD,WACE,KAAKA,aAAK,EAALA,EAAO/I,QAAQ,OAAO,EAC3B,IAAIyqC,EAAS,EAWb,OATA1hC,EAAM3F,SAAQ,SAAC+F,EAAMrJ,GACnB,IAAMwb,EAAK4uB,EAAO/gC,EAAK5G,IAAI+H,EACrBkR,EAAK0uB,EAAO/gC,EAAK5G,IAAI+D,EACrBshC,EAAiC,IAA5B,EAAK74B,QAAQy4B,WAAmB0C,EAAO/gC,EAAK5G,IAAI+T,EAAI,EACzDq0B,EAASrvB,EAAKA,EAAKE,EAAKA,EAAKosB,EAAKA,EAChC,EAAaz+B,EAAK9G,KAAI,KAC9BooC,SADY,IAAG,IAAC,GACCE,EAAS,EAC5B,IAEOF,CACT,EAQO,YAAAJ,aAAP,SACEnB,EACAgB,EACAn7B,GAEQ,IAAAy4B,EAAwCz4B,EAAO,WAAnCg5B,EAA4Bh5B,EAAO,OAA3Bi5B,EAAoBj5B,EAAO,iBV9iBpD,SACLm6B,EACAnB,EACA6C,EACAV,EACA1C,GAEA,IAAMqD,EAAc9C,EAAS6C,EACvBlB,EAAYR,EAAUj7B,cACtB5L,EAAOqnC,EAAUv+B,KAAI,SAAC2/B,EAAUhrC,GAC9B,MAAkCgrC,EAASzoC,KAAzCgf,EAAY,eACpB,MAAO,CACL/W,EAFqB,IAGrBhE,EAHwB,IAIxBgQ,EAJ2B,IAK3B5N,KALiC,OAMjCgT,MAAO5b,EACPwb,GAAI,EACJE,GAAI,EACJosB,GAAI,EACJprB,OAAQquB,EAAcxpB,EAE1B,IAEM9M,GAAuB,IAAfizB,EAAmB7xB,GAC/BtT,GACA,SAACD,GAAW,OAAAA,EAAEkI,CAAF,IACZ,SAAClI,GAAW,OAAAA,EAAEkE,CAAF,IACVigC,GACFlkC,GACA,SAACD,GAAW,OAAAA,EAAEkI,CAAF,IACZ,SAAClI,GAAW,OAAAA,EAAEkE,CAAF,IACZ,SAAClE,GAAW,OAAAA,EAAEkU,CAAF,KACXkB,WAAW8E,IAEdja,EAAKe,SAAQ,SAACW,IA0FhB,SAAsBoF,EAAoBoL,EAAWizB,GAEnDjzB,EAAKgC,OAAM,SAACkwB,EAAUtxB,EAAIE,EAAIoB,EAAIC,GAAO,OAAA3V,GAAM0lC,EAAUtxB,EAAIE,EAAIoB,EAAIC,EAAIvN,EAAMq+B,EAAtC,GAC3C,CA3FIuD,CAAahnC,EAAGwQ,EAAMizB,EACxB,IAEAnlC,EAAK8I,KAAI,SAACpH,EAAGjE,GACL,MAAe4pC,EAAU5pC,GAAvByC,EAAE,KACF,EADQ,OACS,KAAjBymC,OAAI,IAAG,IAAC,EAEhBkB,EAAO3nC,GAAM,CACX+H,EAAGvG,EAAEuX,GAAK0tB,EACV1iC,EAAGvC,EAAEyX,GAAKwtB,EACV1yB,EAAGvS,EAAE6jC,GAAKoB,EAEd,GAEF,CU4fIgC,CAAW9B,EAAWnB,EAAQC,EAAkBA,EAAiBkC,EAAQ1C,EAC3E,EAOO,YAAA8C,cAAP,SAAqBpB,EAAsBgB,EAAiCn7B,GAClE,IAAAy4B,EAAez4B,EAAO,WAC9Bm6B,EAAUh7B,cAAc9K,SAAQ,SAAC0H,EAAMhL,GAC7B,IAAAsJ,EAAmB0B,EAAI,OAAfzB,EAAWyB,EAAI,OACzB85B,EAAasE,EAAUpkB,QAAQ1b,GAC/By7B,EAAaqE,EAAUpkB,QAAQzb,GACrC,GAAKu7B,GAAeC,EAApB,CACA,IAAIoG,EAAOpG,EAAWxiC,KAAKiI,EAAIs6B,EAAWviC,KAAKiI,EAC3C4gC,EAAOrG,EAAWxiC,KAAKiE,EAAIs+B,EAAWviC,KAAKiE,EAC3C6kC,EAAsB,IAAf3D,EAAmB3C,EAAWxiC,KAAKiU,EAAIsuB,EAAWviC,KAAKiU,EAAI,EACjE20B,GAASC,IACZD,EAAuB,IAAhB1+B,KAAKS,SACZk+B,EAAuB,IAAhB3+B,KAAKS,SAEO,IAAfw6B,GAAqB2D,IACvBA,EAAuB,IAAhB5+B,KAAKS,WAGhB,IAAMo+B,EAAY7+B,KAAKC,KAAKy+B,EAAOA,EAAOC,EAAOA,EAAOC,EAAOA,GACzDE,EAAQJ,EAAOG,EACfE,EAAQJ,EAAOE,EACfG,EAAQJ,EAAOC,EACf,EAA6CtgC,EAAKzI,MAAQ,CAAC,EAAzD,IAAA+d,oBAAY,IAAG,MAAG,EAAE,IAAAkB,aAEtBqmB,GADOvnB,EAAegrB,SADY,IAAG,MAAG,GAMxCI,EAAkB,GAHL5G,EAAWviC,KAAK2mC,MAAQ,GAIrCyC,EAAkB,GAHL5G,EAAWxiC,KAAK2mC,MAAQ,GAIrC0C,EAAOL,EAAQ1D,EACfgE,EAAOL,EAAQ3D,EACfiE,EAAOL,EAAQ5D,EACrBuC,EAAO9gC,GAAQkB,GAAKohC,EAAOF,EAC3BtB,EAAO9gC,GAAQ9C,GAAKqlC,EAAOH,EAC3BtB,EAAO9gC,GAAQkN,GAAKs1B,EAAOJ,EAC3BtB,EAAO7gC,GAAQiB,GAAKohC,EAAOD,EAC3BvB,EAAO7gC,GAAQ/C,GAAKqlC,EAAOF,EAC3BvB,EAAO7gC,GAAQiN,GAAKs1B,EAAOH,CAhCW,CAiCxC,GACF,EASO,YAAAlB,WAAP,SACErB,EACAn7B,EACAm8B,EACAn7B,GAEQ,IAAA88B,EAAc98B,EAAO,UACvB26B,EAAYR,EAAUj7B,cACtBlF,EAAQgF,EAAME,cACdjF,EAAQ+E,EAAMG,cAElBZ,EAKEyB,EAAO,MAJTxB,EAIEwB,EAAO,OAHTf,EAGEe,EAAO,OAFA+8B,EAEP/8B,EAAO,QADTy6B,EACEz6B,EAAO,mBACN26B,GACLA,EAAUtmC,SAAQ,SAAC0nC,GACT,IAAAvoC,EAAauoC,EAAQ,GAAjBzoC,EAASyoC,EAAQ,KACrB9B,EAAkB3mC,EAAI,KAAhBiI,EAAYjI,EAAI,EAAbiE,EAASjE,EAAI,EAAViU,EAAMjU,EAAI,EACxB8G,EAAO4E,EAAM+W,QAAQviB,GACvB0oC,EAAO,EACPC,EAAO,EACPC,EAAO,EACPrD,EAAUgE,EACRrgC,EAAWy9B,EAAU/4B,UAAU5N,EAAI,MACnCmJ,EAAYw9B,EAAU/4B,UAAU5N,EAAI,OACpC+mC,EAASJ,EAAU/4B,UAAU5N,EAAI,QACjCwpC,EAAcF,aAAS,EAATA,EAAY1iC,EAAMmgC,GACtC,GAAIyC,EAAa,CACT,QAA+BA,EAAW,GAChDd,EAAO3gC,EADO,KAEd4gC,EAAO5kC,EAFgB,KAGvBwhC,EAHiC,I,MAKjCmD,EAAO3gC,EAAI0D,EAAO,GAClBk9B,EAAO5kC,EAAI0H,EAAO,GAClBm9B,EAAO70B,EAAItI,EAAO,GASpB,GANI85B,IACFoC,EAAO3nC,GAAI+H,GAAMw9B,EAAUmD,EAAQjC,EACnCkB,EAAO3nC,GAAI+D,GAAMwhC,EAAUoD,EAAQlC,EACnCkB,EAAO3nC,GAAI+T,GAAMwxB,EAAUqD,EAAQnC,GAGjCQ,EAAoB,CAEpB,IAAA10B,EAIE00B,EAAkB,KAHpBI,EAGEJ,EAAkB,OAFpBrnB,EAEEqnB,EAAkB,OADZwC,EACNxC,EAAkB,OAChB,GAKFwC,aAAY,EAAZA,EAAe7iC,EAAMJ,EAAOC,EAAOsE,EAAOC,KAAW,CACvDjD,EAAG,EACHhE,EAAG,EACHgQ,EAAG,EACH21B,eAAgB,GARbC,EAAO,IACPC,EAAO,IACPC,EAAO,IACVH,EAAc,iBAOhB,IAAK,EAASC,KAAa,EAASC,GAAU,OAC9C,IAAM7wB,GAAMhR,EAAI4hC,GAAWlD,EACrBxtB,GAAMlV,EAAI6lC,GAAWnD,EACrBpB,GAAMtxB,EAAI81B,GAAWpD,EAQ3B,GAPIiD,IACF/B,EAAO3nC,GAAI+H,GAAK2hC,EAAiB3wB,EACjC4uB,EAAO3nC,GAAI+D,GAAK2lC,EAAiBzwB,EACjC0uB,EAAO3nC,GAAI+T,GAAK21B,EAAiBrE,GAIpB,IAAX0B,EAAc,CAChB,IAAM+C,EAAiBzC,EAAOzgC,GAC9B,IAAKkjC,EAAgB,OAIrB,OAHAnC,EAAO3nC,GAAI+H,GAAK+hC,EAAiB/wB,EACjC4uB,EAAO3nC,GAAI+D,GAAK+lC,EAAiB7wB,OACjC0uB,EAAO3nC,GAAI+T,GAAK+1B,EAAiBzE,E,CAKnC,GAAiB,IAAbn8B,GAAgC,IAAdC,EAAiB,CACrC,IAAM4gC,EAAex3B,EAAK3L,EAAMJ,EAAOC,GACvC,IAAKsjC,EAAc,OAInB,OAHApC,EAAO3nC,GAAI+H,GAAKgiC,EAAehxB,EAC/B4uB,EAAO3nC,GAAI+D,GAAKgmC,EAAe9wB,OAC/B0uB,EAAO3nC,GAAI+T,GAAKg2B,EAAe1E,E,CAKjC,IAAM2E,EAAiBpqB,EAAOhZ,GAC9B,IAAKojC,EAAgB,OACrBrC,EAAO3nC,GAAI+H,GAAKiiC,EAAiBjxB,EACjC4uB,EAAO3nC,GAAI+D,GAAKimC,EAAiB/wB,EACjC0uB,EAAO3nC,GAAI+T,GAAKi2B,EAAiB3E,C,CAErC,GACF,EAUO,YAAA4C,eAAP,SACEtB,EACAgB,EACAjB,EACAl6B,GAEQ,IAAAk5B,EAA4Cl5B,EAAO,QAA1Cm5B,EAAmCn5B,EAAO,SAAhCuJ,EAAyBvJ,EAAO,SAAtBy4B,EAAez4B,EAAO,WACrD26B,EAAYR,EAAUj7B,eACvBy7B,aAAS,EAATA,EAAW1pC,SAChB0pC,EAAUtmC,SAAQ,SAAC0nC,GACT,IAAAvoC,EAAOuoC,EAAQ,GACnBxvB,GAAM2tB,EAAO1mC,GAAI+H,EAAI4/B,EAAO3nC,GAAI+H,EAAIgO,GAAY2vB,GAAW,IAC3DzsB,GAAMytB,EAAO1mC,GAAI+D,EAAI4jC,EAAO3nC,GAAI+D,EAAIgS,GAAY2vB,GAAW,IAC3DL,EAAoB,IAAfJ,GAAqByB,EAAO1mC,GAAI+T,EAAI4zB,EAAO3nC,GAAI+T,EAAIgC,GAAY2vB,GAAW,IAAQ,EACrFuE,EAAUjgC,KAAKC,KAAK8O,EAAKA,EAAKE,EAAKA,EAAKosB,EAAKA,GACnD,GAAI4E,EAAUtE,EAAU,CACtB,IAAMuE,EAASvE,EAAWsE,EAC1BlxB,GAAKmxB,EACLjxB,GAAKixB,EACL7E,GAAK6E,C,CAEPxD,EAAO1mC,GAAM,CACX+H,EAAGgR,EACHhV,EAAGkV,EACHlF,EAAGsxB,EAEP,GACF,EAUO,YAAAgB,eAAP,SACE76B,EACAm7B,EACAD,EACAl6B,GAJF,WAMUq5B,EAAgDr5B,EAAO,sBAAhCuJ,EAAyBvJ,EAAO,SAAtBy4B,EAAez4B,EAAO,WACzD26B,EAAYR,EAAUj7B,cAC5B,GAAKy7B,aAAS,EAATA,EAAW1pC,OAAhB,CAIA,IAAIwzB,EAAM,EACoB,QAA1B4U,EAAiC9pC,KAAKgqC,iBAAkB,IACzB,QAA1BF,IAAiC9pC,KAAKgqC,gBAAkB3/B,KAEjE+gC,EAAUtmC,SAAQ,SAAC0nC,GACT,IAAAvoC,EAAOuoC,EAAQ,GACjB3hC,EAAO4E,EAAM+W,QAAQviB,GAC3B,GAAI,EAAS4G,EAAK9G,KAAKgZ,KAAO,EAASlS,EAAK9G,KAAKkZ,IAC/C2tB,EAAU/6B,cAAc5L,EAAI,CAC1B+H,EAAGnB,EAAK9G,KAAKgZ,GACb/U,EAAG6C,EAAK9G,KAAKkZ,GACbjF,EAAkB,IAAfkxB,EAAmBr+B,EAAK9G,KAAKqqC,QAAe5rC,QAJnD,CAQA,IAAM6rC,EAAQ1D,EAAO1mC,GAAI+H,EAAIgO,EACvBs0B,EAAQ3D,EAAO1mC,GAAI+D,EAAIgS,EACvBu0B,EAAuB,IAAfrF,EAAmByB,EAAO1mC,GAAI+T,EAAIgC,EAAW,EAC3D4wB,EAAU/6B,cAAc5L,EAAI,CAC1B+H,EAAGwgC,EAASzoC,KAAKiI,EAAIqiC,EACrBrmC,EAAGwkC,EAASzoC,KAAKiE,EAAIsmC,EACrBt2B,EAAGw0B,EAASzoC,KAAKiU,EAAIu2B,IAGvB,IAAMC,EAAoBvgC,KAAKC,KAAKmgC,EAAQA,EAAQC,EAAQA,EAAQC,EAAQA,GAC5E,OAAQzE,GACN,IAAK,MACC,EAAKE,gBAAkBwE,IACzB,EAAKxE,gBAAkBwE,GAEzB,MACF,IAAK,MACC,EAAKxE,gBAAkBwE,IACzB,EAAKxE,gBAAkBwE,GAEzB,MACF,QACEtZ,GAAYsZ,E,CAGlB,IACK1E,GAAmD,SAA1BA,IAC5B9pC,KAAKgqC,gBAAkB9U,EAAMkW,EAAU1pC,O,MA7CvC1B,KAAKgqC,gBAAkB,CA+C3B,EACF,EAnxBA,GAmyBMwB,GAAqB,SACzBZ,EACA39B,GAEA,IAAMm+B,EAAYR,EAAUj7B,cAC5B,KAAKy7B,aAAS,EAATA,EAAW1pC,QAAQ,MAAO,CAAC,EAChC,IAAMupC,EAAmC,CAAC,EAY1C,OAXAG,EAAUtmC,SAAQ,SAAC+F,EAAMrJ,GAER,IADAopC,EAAU/4B,UAAUhH,EAAK5G,GAAI,UAE1CgnC,EAAgBpgC,EAAK5G,IAAMwqC,GACzB7D,EACA,OACA//B,EACAoC,GAGN,IACOg+B,CACT,EAUMwD,GAA8B,SAClC7D,EACA5mC,EACA6G,EACAoC,GAMA,IAAME,EAAWy9B,EAAU/4B,UAAUhH,EAAK5G,GAAI,MACxCmJ,EAAYw9B,EAAU/4B,UAAUhH,EAAK5G,GAAI,OAE3CyI,EAAiB7B,EACjB4gC,EAAwB,GAuB5B,OAtBiB,IAAbt+B,GAEFT,EAAWk+B,EAAUp4B,cAAc3H,EAAK5G,IAAI,GAC5CwnC,EAAgBb,EAAUn4B,aAAa/F,EAASzI,KACzB,IAAdmJ,IAETV,EAAWk+B,EAAUzjB,gBAAgBtc,EAAK5G,IAAI,GAC9CwnC,EAAgBb,EAAUn4B,aAAa/F,EAASzI,KAGlDwnC,EAAgBA,EAAc7+B,QAC5B,SAAC/B,GACC,OAAuC,IAAvC+/B,EAAU/4B,UAAUhH,EAAK5G,GAAI,OACW,IAAxC2mC,EAAU/4B,UAAUhH,EAAK5G,GAAI,MAD7B,IAUG,CAAEyI,SAAQ,EAAE++B,cAAa,EAAEC,eAPX,GACrBd,EACA5mC,EACAiJ,EACApC,EACA4gC,GAGJ,EAWM,GAAmB,SACvBb,EACA5mC,EACAiJ,EACApC,EACA8B,GAEA,IAAMe,EAAW7C,EAAK9G,KAAKkJ,IAAkB,GACzCU,GACFhB,aAAa,EAAbA,EAAeC,QAAO,SAACgB,GAAS,OAAAA,EAAK7J,KAAKkJ,KAAmBS,CAA7B,MAChC,GAQF,MAPa,SAAT1J,IACF2J,EAAgBA,EAAcf,QAC5B,SAACgB,GACC,OAAuC,IAAvCg9B,EAAU/4B,UAAUjE,EAAK3J,GAAI,OACW,IAAxC2mC,EAAU/4B,UAAUjE,EAAK3J,GAAI,MAD7B,KAIC0J,CACT,EAOM,GAAqB,SAAClD,GAC1B,IAAM4B,EAAa,CAAEL,EAAG,EAAGhE,EAAG,GAC9ByC,EAAM3F,SAAQ,SAAC+F,GACP,MAAWA,EAAK9G,KAAdiI,EAAC,IAAEhE,EAAC,IACZqE,EAAWL,GAAKA,GAAK,EACrBK,EAAWrE,GAAKA,GAAK,CACvB,IAEA,IAAMtG,EAAS+I,EAAM/I,QAAU,EAC/B,MAAO,CACLsK,EAAGK,EAAWL,EAAItK,EAClBsG,EAAGqE,EAAWrE,EAAItG,EAEtB,EAQM,GAAiB,SAAC+N,EAAc8B,GACpC,OAAAA,EAAY1E,KAAI,SAAC2/B,GACP,IAAAvoC,EAAauoC,EAAQ,GAAjBzoC,EAASyoC,EAAQ,KACvB3hC,EAAO4E,EAAM+W,QAAQviB,GAC3B,OAAO,OACF4G,GAAI,CACP9G,KAAM,OACD8G,EAAK9G,MAAI,CACZiI,EAAGjI,EAAKiI,EACRhE,EAAGjE,EAAKiE,EACRgQ,EAAGjU,EAAKiU,KAGd,GAZA,ECt8BF,cAUE,WAAYpT,GAKV5E,KAAKiE,GAAKW,EAAOX,IAAM,EAKvBjE,KAAK0uC,GAAK9pC,EAAO8pC,GAKjB1uC,KAAK2uC,GAAK/pC,EAAO+pC,GAKjB3uC,KAAK+c,GAAK,EAKV/c,KAAKid,GAAK,EAKVjd,KAAK0qC,KAAO9lC,EAAO8lC,KAKnB1qC,KAAKgrC,OAASpmC,EAAOomC,OAKrBhrC,KAAKiI,EAAIrD,EAAOqD,GAAK,CACvB,CA4CF,OA1CE,YAAA2mC,WAAA,SAAWC,GACT,IAAMp2B,EAAKzY,KAAK0uC,GAAKG,EAAGH,GAClBh2B,EAAK1Y,KAAK2uC,GAAKE,EAAGF,GACxB,OAAO1gC,KAAK6gC,MAAMr2B,EAAIC,EACxB,EACA,YAAAq2B,OAAA,SAAO/iC,EAAWhE,GAChBhI,KAAK0uC,GAAK1iC,EACVhM,KAAK2uC,GAAK3mC,CACZ,EAEA,YAAAgnC,WAAA,WACEhvC,KAAK+c,GAAK,EACV/c,KAAKid,GAAK,CACZ,EACA,YAAAgyB,SAAA,SAAS/pC,GACP,IAAMuT,EAAKvT,EAAEwpC,GAAK1uC,KAAK0uC,GACjBh2B,EAAKxT,EAAEypC,GAAK3uC,KAAK2uC,GACnBxkC,EAAO8D,KAAK6gC,MAAMr2B,EAAIC,GAC1BvO,EAAOA,EAAO,KAAS,KAASA,EAEhC,IAAM+kC,EAAKlvC,KAAKiI,GAAKjI,KAAKgrC,OAAS,IAAM9lC,EAAE8lC,OAAS,GAAM7gC,EAC1DnK,KAAK+c,IAAMmyB,EAAIz2B,EAAKtO,EACpBnK,KAAKid,IAAMiyB,EAAIx2B,EAAKvO,CACtB,EAEA,YAAAoD,GAAA,SAAG0Q,GACD,OAAOA,EAAKkxB,SAASnvC,KAAK0uC,GAAI1uC,KAAK2uC,GACrC,EAEA,YAAA/2B,IAAA,SAAIi3B,GACF,IAAMO,EAAWpvC,KAAK0qC,KAAOmE,EAAGnE,KAUhC,OAAO,IAAI2E,EANe,CACxBX,IAJS1uC,KAAK0uC,GAAK1uC,KAAK0qC,KAAOmE,EAAGH,GAAKG,EAAGnE,MAAQ0E,EAKlDT,IAJS3uC,KAAK2uC,GAAK3uC,KAAK0qC,KAAOmE,EAAGF,GAAKE,EAAGnE,MAAQ0E,EAKlD1E,KAAM0E,EACNpE,OALShrC,KAAKgrC,OAAS6D,EAAG7D,QAQ9B,EACF,EA/FA,G,qBCJA,WAME,WAAYpmC,GAKV5E,KAAKsvC,KAAO1qC,EAAO0qC,KAKnBtvC,KAAKuvC,KAAO3qC,EAAO2qC,KAKnBvvC,KAAK0B,OAASkD,EAAOlD,OAKrB1B,KAAKwvC,WAAa5qC,EAAO4qC,YAAc,CAAC,EAAG,GAK3CxvC,KAAK0qC,KAAO9lC,EAAO8lC,MAAQ,CAC7B,CAmEF,OAlEE,YAAA+E,UAAA,WACE,OAAOzvC,KAAK0B,MACd,EACA,YAAAytC,SAAA,SAASnjC,EAAWhE,GAClB,IAAM0nC,EAAU1vC,KAAK0B,OAAS,EAC9B,OAAQsK,GAAKhM,KAAKsvC,KAAOI,GACvB1jC,GAAKhM,KAAKsvC,KAAOI,GACjB1nC,GAAKhI,KAAKuvC,KAAOG,GACjB1nC,GAAKhI,KAAKuvC,KAAOG,CACrB,EAGA,YAAAC,GAAA,WAUE,OADW,IAAIC,EALW,CACxBN,KAJQtvC,KAAKsvC,KAAOtvC,KAAK0B,OAAS,EAKlC6tC,KAJQvvC,KAAKuvC,KAAOvvC,KAAK0B,OAAS,EAKlCA,OAJU1B,KAAK0B,OAAS,GAQ5B,EAGA,YAAAmuC,GAAA,WAUE,OADW,IAAID,EALA,CACbN,KAJQtvC,KAAKsvC,KAAOtvC,KAAK0B,OAAS,EAKlC6tC,KAJQvvC,KAAKuvC,KAAOvvC,KAAK0B,OAAS,EAKlCA,OAJU1B,KAAK0B,OAAS,GAQ5B,EAGA,YAAAouC,GAAA,WAUE,OADW,IAAIF,EALA,CACbN,KAJQtvC,KAAKsvC,KAAOtvC,KAAK0B,OAAS,EAKlC6tC,KAJQvvC,KAAKuvC,KAAOvvC,KAAK0B,OAAS,EAKlCA,OAJU1B,KAAK0B,OAAS,GAQ5B,EAGA,YAAAquC,GAAA,WAUE,OADW,IAAIH,EALA,CACbN,KAJQtvC,KAAKsvC,KAAOtvC,KAAK0B,OAAS,EAKlC6tC,KAJQvvC,KAAKuvC,KAAOvvC,KAAK0B,OAAS,EAKlCA,OAJU1B,KAAK0B,OAAS,GAQ5B,EACF,EAnGA,G,GCPA,WAWE,WAAY2nC,GAKVrpC,KAAK+H,KAAO,KAKZ/H,KAAKie,KAAO,KACZje,KAAK2vC,GAAK,KACV3vC,KAAK6vC,GAAK,KACV7vC,KAAK8vC,GAAK,KACV9vC,KAAK+vC,GAAK,KAKV/vC,KAAKgW,MAAQ,GACA,MAATqzB,IAAerpC,KAAKie,KAAOorB,EACjC,CAkEF,OAhEE,YAAA2G,OAAA,SAAOnB,GAEY,MAAb7uC,KAAK+H,KAKJ/H,KAAKiwC,eAOJjwC,KAAKie,OACPje,KAAK2vC,GAAK,IAAIO,EAASlwC,KAAKie,KAAK0xB,MACjC3vC,KAAK6vC,GAAK,IAAIK,EAASlwC,KAAKie,KAAK4xB,MACjC7vC,KAAK8vC,GAAK,IAAII,EAASlwC,KAAKie,KAAK6xB,MACjC9vC,KAAK+vC,GAAK,IAAIG,EAASlwC,KAAKie,KAAK8xB,OAInC/vC,KAAKmwC,SAASnwC,KAAK+H,MACnB/H,KAAKmwC,SAAStB,GAEd7uC,KAAK+H,KAAO/H,KAAK+H,KAAK6P,IAAIi3B,KAhB1B7uC,KAAK+H,KAAO/H,KAAK+H,KAAK6P,IAAIi3B,GAE1B7uC,KAAKmwC,SAAStB,IARd7uC,KAAK+H,KAAO8mC,CAyBhB,EAGA,YAAAsB,SAAA,SAAStB,GACF7uC,KAAKie,OACN4wB,EAAGthC,GAAGvN,KAAKie,KAAK0xB,OAAS3vC,KAAK2vC,GAAI3vC,KAAK2vC,GAAGK,OAAOnB,GAC5CA,EAAGthC,GAAGvN,KAAKie,KAAK4xB,OAAS7vC,KAAK6vC,GAAI7vC,KAAK6vC,GAAGG,OAAOnB,GACjDA,EAAGthC,GAAGvN,KAAKie,KAAK6xB,OAAS9vC,KAAK8vC,GAAI9vC,KAAK8vC,GAAGE,OAAOnB,GACjDA,EAAGthC,GAAGvN,KAAKie,KAAK8xB,OAAS/vC,KAAK+vC,IAAI/vC,KAAK+vC,GAAGC,OAAOnB,GAC5D,EAEA,YAAAoB,YAAA,WAEE,OAAmB,MAAXjwC,KAAK2vC,IAAyB,MAAX3vC,KAAK6vC,IAAyB,MAAX7vC,KAAK8vC,IAAyB,MAAX9vC,KAAK+vC,EACxE,EAEA,YAAAK,YAAA,SAAYvB,GACO,MAAb7uC,KAAK+H,MAAgB8mC,IAAO7uC,KAAK+H,OAIjC/H,KAAKiwC,gBAGGjwC,KAAKie,KAAOje,KAAKie,KAAKwxB,YAAc,GACpCzvC,KAAK+H,KAAK6mC,WAAWC,GAEjB7uC,KAAKgW,MANG64B,EAAGI,SAASjvC,KAAK+H,OAQrC/H,KAAK2vC,IAAM3vC,KAAK2vC,GAAGS,YAAYvB,GAC/B7uC,KAAK6vC,IAAM7vC,KAAK6vC,GAAGO,YAAYvB,GAC/B7uC,KAAK8vC,IAAM9vC,KAAK8vC,GAAGM,YAAYvB,GAC/B7uC,KAAK+vC,IAAM/vC,KAAK+vC,GAAGK,YAAYvB,IAGrC,EACF,EAlGA,GCYA,IAAM,GAA6D,CACjEn/B,OAAQ,CAAC,EAAG,GACZV,MAAO,IACPC,OAAQ,IACRohC,GAAI,EACJC,GAAI,EACJC,KAAM,SACNz8B,gBAAgB,EAChB08B,cAAc,EACdjH,aAAc,EACdkH,GAAI,GACJC,MAAO,GACPC,IAAK,IAsCP,cAGE,WACSlgC,QAAA,IAAAA,MAAoC,CAAC,GAArC,KAAAA,UAHT,KAAAxM,GAAK,cAKHjE,KAAKyQ,QAAU,OACV,IACAA,EAEP,CAimBF,OA5lBQ,YAAAC,QAAN,SAAcjB,EAAcgB,G,mEAC1B,MAAO,CAAP,EAAOzQ,KAAK4wC,0BAAyB,EAAOnhC,EAAOgB,G,QAK/C,YAAArM,OAAN,SAAaqL,EAAcgB,G,0EACzBzQ,KAAK4wC,0BAAyB,EAAMnhC,EAAOgB,G,WAa/B,YAAAmgC,yBAAd,SACExsC,EACAqL,EACAgB,G,mHASA,GAPM/F,EAAQ+E,EAAMG,cACdnF,EAAQgF,EAAME,cAEdiB,EAAgB5Q,KAAKwqC,cAAc/5B,EAAShG,EAAM/I,QAChDsN,EACN4B,EAAa,MADA3B,EACb2B,EAAa,OADQigC,EACrBjgC,EAAa,MADe24B,EAC5B34B,EAAa,aAD6BzB,EAC1CyB,EAAa,SADuClB,EACpDkB,EAAa,SAEVnG,aAAK,EAALA,EAAO/I,SAA2B,IAAjB+I,EAAM/I,OAC1B,MAAO,CAAP,EAAO8N,EAAsBC,EAAOrL,EAAQsL,IAmB9C,GAhBM07B,EAAY3gC,EAAMoC,KACtB,SAAChC,GAAS,OAAA0D,EAAgB1D,EAAM,CAACmE,EAAOC,GAA9B,IAEN48B,EAAYnhC,EAAMkC,QAAO,SAACJ,GAE9B,OAD2BA,EAAI,SAAJA,EAAI,MAEjC,IACMo+B,EAAY,IAAI,GAA8B,CAClDngC,MAAO2gC,EACP1gC,MAAOmhC,IAEHiF,EAAiB9wC,KAAK+wC,SAASnG,EAAWn7B,EAAON,GAEvDnP,KAAK0sB,IAAIke,EAAWn7B,EAAO85B,EAAcuH,EAAO1sC,EAAQwM,GAGpDigC,EAAO,CACT,IAASnuC,EAAI,EAAGA,EAAImpC,EAAUnqC,OAAQgB,GAAK,EACnC,EAAqBmpC,EAAUnpC,GAA7BoI,EAAM,SAAEC,EAAM,SAChBimC,EAAepG,EAAU/4B,UAAU/G,GACnCmmC,EAAerG,EAAU/4B,UAAU/G,GACrCkmC,GAAgB,GACZzK,EAAaqE,EAAUpkB,QAAQzb,GACrC6/B,EAAU/6B,cAAc/E,EAAQ,CAC9BkB,EAAGu6B,EAAWxiC,KAAKiI,EACnBhE,EAAGu+B,EAAWxiC,KAAKiE,KAEZipC,GAAgB,IACnB3K,EAAasE,EAAUpkB,QAAQ1b,GACrC8/B,EAAU/6B,cAAc9E,EAAQ,CAC9BiB,EAAGs6B,EAAWviC,KAAKiI,EACnBhE,EAAGs+B,EAAWviC,KAAKiE,KAInBkpC,EAAc,OACftgC,GAAa,CAChBigC,OAAO,EACPM,WAAW,IAEbnxC,KAAK0sB,IAAIke,EAAWn7B,EAAO,IAAKqhC,EAAO1sC,EAAQ8sC,E,CAGjD,MAAO,CAAP,EAAO,CACLzmC,MAAO2gC,EACP1gC,MAAK,G,QAYD,YAAAqmC,SAAR,SACEnG,EACAn7B,EACAN,GAIA,IAFA,IAAM1E,EAAQmgC,EAAUj7B,cAClBmhC,EAAiB,CAAC,EACftvC,EAAI,EAAGA,EAAIiJ,EAAM/I,OAAQF,GAAK,EAAG,CAClC,MAAeiJ,EAAMjJ,GAAnByC,EAAE,KAAEF,EAAI,OAEhB,GADA+sC,EAAM7sC,GAAM,GACR,EAASF,EAAKqG,MAChB0mC,EAAM7sC,GAAMF,EAAKqG,UACZ,GAAIT,EAAQ5F,EAAKqG,MACjBL,MAAMhG,EAAKqG,KAAK,MAAK0mC,EAAM7sC,GAAMgK,KAAKc,IAAIhL,EAAKqG,KAAK,KACpDL,MAAMhG,EAAKqG,KAAK,MAAK0mC,EAAM7sC,GAAMgK,KAAKc,IAAIhL,EAAKqG,KAAK,UACpD,GAAI,EAASrG,EAAKqG,MAEvB0mC,EAAM7sC,GAAMgK,KAAKc,IAAIhL,EAAKqG,KAAK4E,MAAOjL,EAAKqG,KAAK6E,aAC3C,GAAI,EAAWE,GAAW,CAC/B,IACM/E,EAAO+E,EADMM,EAAM+W,QAAQviB,IAE7B0F,EAAQS,GACV0mC,EAAM7sC,GAAMgK,KAAKc,IAAG,MAARd,KAAI,OAAQ7D,KAExB0mC,EAAM7sC,GAAMmG,C,MAELT,EAAQwF,GACjB2hC,EAAM7sC,GAAMgK,KAAKc,IAAG,MAARd,KAAI,OAAQkB,KACf,EAASA,KAClB2hC,EAAM7sC,GAAMkL,E,CAGhB,OAAO2hC,CACT,EAQQ,YAAAtG,cAAR,SACE/5B,EACA2gC,QADA,IAAA3gC,MAAA,IAGA,IAAMG,EAAgB,OAAK5Q,KAAKyQ,SAAYA,GACpCf,EACNkB,EAAa,OADC5B,EACd4B,EAAa,MADQ3B,EACrB2B,EAAa,OADgBugC,EAC7BvgC,EAAa,UAD2BigC,EACxCjgC,EAAa,MADkC24B,EAC/C34B,EAAa,aADgDy/B,EAC7Dz/B,EAAa,GADoD0/B,EACjE1/B,EAAa,GAkCf,OAjCAA,EAAc5B,MACXA,GAA2B,oBAAX6D,OAA6C7D,EAApB6D,OAAOC,WACnDlC,EAAc3B,OACXA,GAA4B,oBAAX4D,OAA8C5D,EAArB4D,OAAOE,YACpDnC,EAAclB,OAAUA,GACpB,CAACkB,EAAc5B,MAAQ,EAAG4B,EAAc3B,OAAS,QAGnCzM,IAAd2uC,GAA2BC,EAAU,MACvCxgC,EAAcugC,WAAY,QAEd3uC,IAAVquC,GAAuBO,EAAU,MAAKxgC,EAAcigC,OAAQ,GAC3C,IAAjBtH,GAAuBsH,EAIC,IAAjBtH,GAAsBsH,IAC/BjgC,EAAc24B,aAAe,IACzB6H,GAAW,KAAOA,EAAU,IAAKxgC,EAAc24B,aAAe,IACzD6H,EAAU,MAAKxgC,EAAc24B,aAAe,OANrD34B,EAAc24B,aAAe,IACzB6H,GAAW,KAAOA,EAAU,IAAKxgC,EAAc24B,aAAe,IACzD6H,EAAU,MAAKxgC,EAAc24B,aAAe,OAOlD8G,IACHz/B,EAAcy/B,GAAK,GACfe,EAAU,KAAOA,GAAW,IAAKxgC,EAAcy/B,GAAK,GAC/Ce,EAAU,MAAKxgC,EAAcy/B,GAAK,IAExCC,IACH1/B,EAAc0/B,GAAK,GACfc,EAAU,KAAOA,GAAW,IAAKxgC,EAAc0/B,GAAK,GAC/Cc,EAAU,MAAKxgC,EAAc0/B,GAAK,IAGtC1/B,CACT,EAWQ,YAAA8b,IAAR,SACEke,EACAn7B,EACA4hC,EACAP,EACA1sC,EACAqM,GAUA,IARQ,IAAA4/B,EAA0B5/B,EAAO,GAA7B0gC,EAAsB1gC,EAAO,UAAlBwS,EAAWxS,EAAO,OACnC26B,EAAYR,EAAUj7B,cACxBwjB,EAAK,EACL2X,EAAOuG,EACL50B,EAAmB,CAAC,EACpB60B,EAAsB,CAAC,EACvBC,EAAkB,CAAC,EAEhB/vC,EAAI,EAAGA,EAAI4pC,EAAU1pC,OAAQF,GAAK,EAAG,CACtC,MAAe4pC,EAAU5pC,GAAvBuC,EAAI,OAAEE,EAAE,KAGhB,GAFAwY,EAAOxY,GAAM,CAAC,EAAG,GAEbktC,EAAW,CACb,IAAMvsC,EAAS,CACbX,GAAIzC,EACJktC,GAAI3qC,EAAKiI,EACT2iC,GAAI5qC,EAAKiE,EACT0iC,KAAM,EACNziC,EAAGooC,EACHrF,OAAQJ,EAAU/4B,UAAU5N,IAE9BstC,EAAOttC,GAAM,IAAI,GAAKW,E,EAI1B,KAAOkmC,EAAO,GACZ3X,EAAKnzB,KAAKwxC,QACR5G,EACA,CACEE,KAAI,EACJ2G,oBAAqB,GACrBC,QAAS,IACTve,GAAE,EACF1W,OAAM,EACN60B,UAAS,EACTC,OAAM,EACNT,MAAK,GAEPrgC,GAEFq6B,IACA7nB,WAAS,CACPxY,MAAO2gC,EACP1gC,MAAO+E,EAAMG,gBAUjB,OAAOg7B,CACT,EASQ,YAAA4G,QAAR,SACE/hC,EACA7K,EAUA6L,GAOA,IALQ,IAAAq6B,EACNlmC,EAAM,KADM6sC,EACZ7sC,EAAM,oBAD2B8sC,EACjC9sC,EAAM,QADoCuuB,EAC1CvuB,EAAM,GADwC0sC,EAC9C1sC,EAAM,UADmD2sC,EACzD3sC,EAAM,OAD2DksC,EACjElsC,EAAM,MACF6X,EAAW7X,EAAM,OACfkP,EAA8BrD,EAAO,eAArB0gC,EAAc1gC,EAAO,UACvChG,EAAQgF,EAAME,cACXnO,EAAI,EAAGA,EAAIiJ,EAAM/I,OAAQF,GAAK,EAAG,CAChC,IAAAyC,EAAOwG,EAAMjJ,GAAE,GACvB8vC,EAAUrtC,GAAM,OAAIwY,EAAOxY,KAC3BwY,EAAOxY,GAAM,CAAC,EAAG,E,CA+BnB,OA5BAwY,EAASzc,KAAK2xC,cACZliC,EACAq7B,EACA2G,EACAX,EACAr0B,EACAhM,GASAgM,EAHA00B,IACEr9B,GAAkBg3B,EAAO2G,IAAyB39B,GAE3C9T,KAAK4xC,mBAAmBniC,EAAOgN,EAAQ80B,EAAQ9gC,GAE/CzQ,KAAK6xC,gBACZpiC,EACAq7B,EACA2G,EACAh1B,EACAi1B,EACAZ,EACArgC,GAIGzQ,KAAK8xC,UAAUriC,EAAOgN,EAAQ60B,EAAWne,EAAI1iB,EACtD,EAYQ,YAAAkhC,cAAR,SACEliC,EACAq7B,EACA2G,EACAX,EACAr0B,EACAhM,GAIA,IAFQ,IAAAqD,EAA8CrD,EAAO,eAArC+/B,EAA8B//B,EAAO,aAAvB8/B,EAAgB9/B,EAAO,KAAjBogC,EAAUpgC,EAAO,MACvD/F,EAAQ+E,EAAMG,cACXpO,EAAI,EAAGA,EAAIkJ,EAAMhJ,OAAQF,GAAK,EAAG,CAClC,MAAqBkJ,EAAMlJ,GAAzBsJ,EAAM,SAAEC,EAAM,SAChBu7B,EAAa72B,EAAM+W,QAAQ1b,GAC3By7B,EAAa92B,EAAM+W,QAAQzb,GAE3BimC,EAAevhC,EAAMoC,UAAU/G,GAC/BmmC,EAAexhC,EAAMoC,UAAU9G,GACrC,IAAI8lC,KAAUG,GAAgB,GAAKC,GAAgB,GAAnD,CAEA,IAAMc,EAAM,CACVxL,EAAWxiC,KAAKiI,EAAIs6B,EAAWviC,KAAKiI,EACpCu6B,EAAWxiC,KAAKiE,EAAIs+B,EAAWviC,KAAKiE,GAElCgqC,EAAW/jC,KAAK6gC,MAAMiD,EAAI,GAAIA,EAAI,IACtCC,EAAWA,EAAW,KAAS,KAASA,EACxCD,EAAI,GAAKA,EAAI,GAAKC,EAClBD,EAAI,GAAKA,EAAI,GAAKC,EAEdl+B,GAAkBg3B,EAAO2G,IAC3BO,EAAWA,EAAWlB,EAAMhmC,GAAUgmC,EAAM/lC,IAE9C,IAAIknC,EAAMD,EACNE,EAAMD,EACG,WAAT1B,IAEF2B,EADAD,EAAMhkC,KAAKkkC,IAAI,EAAIH,IAGjBxB,IACFyB,EAAMD,EAAWhB,EACjBkB,EAAMF,EAAWf,GAEfn9B,GAAkBg3B,EAAO2G,GAAuBO,GAAY,GAC9DC,EAAM,EACNC,EAAM,GACGp+B,GAAkBg3B,EAAO2G,GAAuBO,EAAW,IACpEC,EAAMD,EACNE,EAAMF,GAERv1B,EAAO3R,GAAQ,IAAMmnC,EAAMF,EAAI,GAC/Bt1B,EAAO1R,GAAQ,IAAMmnC,EAAMH,EAAI,GAC/Bt1B,EAAO3R,GAAQ,IAAMmnC,EAAMF,EAAI,GAC/Bt1B,EAAO1R,GAAQ,IAAMmnC,EAAMH,EAAI,EAlCgC,C,CAoCjE,OAAOt1B,CACT,EAUQ,YAAAm1B,mBAAR,SACEniC,EACAgN,EACA80B,EACA9gC,GASA,IAPQ,IAAA6/B,EAAsB7/B,EAAO,GAAzBf,EAAkBe,EAAO,OAAjBogC,EAAUpgC,EAAO,MAC/BhG,EAAQgF,EAAME,cACdyhC,EAAU3mC,EAAM/I,OAClB0wC,EAAO,KACPC,GAAQ,KACRC,EAAO,KACPC,GAAQ,KACH/wC,EAAI,EAAGA,EAAI4vC,EAAS5vC,GAAK,EAAG,CAC7B,MAAeiJ,EAAMjJ,GAAnByC,EAAE,KAAEF,EAAI,OACZ8sC,GAASphC,EAAMoC,UAAU5N,IAAO,IACpCstC,EAAOttC,GAAI8qC,OAAOhrC,EAAKiI,EAAGjI,EAAKiE,GAC3BjE,EAAKiI,GAAKqmC,IAAMA,EAAOtuC,EAAKiI,GAC5BjI,EAAKiI,GAAKomC,IAAMA,EAAOruC,EAAKiI,GAC5BjI,EAAKiE,GAAKuqC,IAAMA,EAAOxuC,EAAKiE,GAC5BjE,EAAKiE,GAAKsqC,IAAMA,EAAOvuC,EAAKiE,G,CAGlC,IAAMgH,EAAQf,KAAKc,IAAIsjC,EAAOD,EAAMG,EAAOD,GASrCr0B,EAAO,IAAI,GAPE,CACjBqxB,MAAO+C,EAAOD,GAAQ,EACtB7C,MAAOgD,EAAOD,GAAQ,EACtB5wC,OAAQsN,EACRwgC,WAAY9/B,EACZg7B,KAAM0G,IAGFoB,EAAW,IAAI,GAASv0B,GAG9B,IAASzc,EAAI,EAAGA,EAAI4vC,EAAS5vC,GAAK,EACxByC,EAAOwG,EAAMjJ,GAAE,GACnBqvC,GAASphC,EAAMoC,UAAU5N,IAAO,GAEhCstC,EAAOttC,GAAIsJ,GAAG0Q,IAAOu0B,EAASxC,OAAOuB,EAAOttC,IAGlD,IAASzC,EAAI,EAAGA,EAAI4vC,EAAS5vC,GAAK,EAAG,CAC7B,MAAeiJ,EAAMjJ,GACrBwpC,GADE/mC,EAAE,KAAEF,EAAI,OACD0L,EAAMoC,UAAU5N,IAC/B,KAAI4sC,GAAS7F,GAAU,GAAvB,CAEAuG,EAAOttC,GAAI+qC,aACXwD,EAASpC,YAAYmB,EAAOttC,IAC5BwY,EAAOxY,GAAI,IAAMstC,EAAOttC,GAAI8Y,GAC5BN,EAAOxY,GAAI,IAAMstC,EAAOttC,GAAIgZ,GAG5B,IAAM80B,EAAM,CAAChuC,EAAKiI,EAAI0D,EAAO,GAAI3L,EAAKiE,EAAI0H,EAAO,IAC7CsiC,EAAW/jC,KAAK6gC,MAAMiD,EAAI,GAAIA,EAAI,IACtCC,EAAWA,EAAW,KAAS,KAASA,EACxCD,EAAI,GAAKA,EAAI,GAAKC,EAClBD,EAAI,GAAKA,EAAI,GAAKC,EAClB,IAAMS,EAAKnC,GAAMtF,EAAS,GAC1BvuB,EAAOxY,GAAI,IAAMwuC,EAAKV,EAAI,GAC1Bt1B,EAAOxY,GAAI,IAAMwuC,EAAKV,EAAI,EAfQ,C,CAiBpC,OAAOt1B,CACT,EAaQ,YAAAo1B,gBAAR,SACEpiC,EACAq7B,EACA2G,EACAh1B,EACAi1B,EACAZ,EACArgC,GAKA,IAHQ,IAAAqD,EAA0CrD,EAAO,eAAjC4/B,EAA0B5/B,EAAO,GAA7B6/B,EAAsB7/B,EAAO,GAAzBf,EAAkBe,EAAO,OAAjBogC,EAAUpgC,EAAO,MACnDhG,EAAQgF,EAAME,cACdyhC,EAAU3mC,EAAM/I,OACbF,EAAI,EAAGA,EAAI4vC,EAAS5vC,GAAK,EAAG,CAGnC,IAFA,IAAMkxC,EAAQjoC,EAAMjJ,GACdmxC,EAAUljC,EAAMoC,UAAU6gC,EAAMzuC,IAC7BvB,EAAIlB,EAAI,EAAGkB,EAAI0uC,EAAS1uC,GAAK,EAAG,CACvC,IAAMkwC,EAAQnoC,EAAM/H,GACdmwC,EAAUpjC,EAAMoC,UAAU+gC,EAAM3uC,IAEtC,IAAI4sC,KAAU8B,GAAW,GAAKE,GAAW,GAAzC,CAEA,IAAM,EAAM,CAACD,EAAM7uC,KAAKiI,EAAI0mC,EAAM3uC,KAAKiI,EAAG4mC,EAAM7uC,KAAKiE,EAAI0qC,EAAM3uC,KAAKiE,GAChE,EAAWiG,KAAK6gC,MAAM,EAAI,GAAI,EAAI,IACtC,EAAW,EAAW,KAAS,KAAS,EACxC,EAAI,GAAK,EAAI,GAAK,EAClB,EAAI,GAAK,EAAI,GAAK,EAEdh7B,GAAkBg3B,EAAO2G,IAC3B,EAAW,EAAWX,EAAM4B,EAAMzuC,IAAM6sC,EAAM8B,EAAM3uC,KAGtD,IAAI6uC,EAAMzC,GAAMsC,EAAU,IAAME,EAAU,GAAM,EAE5C/+B,GAAkBg3B,EAAO2G,GAAuB,EAAW,EAC7DqB,EAAKpB,GAAWiB,EAAU,IAAME,EAAU,GAE1C/+B,GACAg3B,EAAO2G,GACM,IAAb,EAEAqB,EAAK,EAELh/B,GACAg3B,EAAO2G,GACP,EAAW,IAEXqB,EAAMzC,GAAMsC,EAAU,IAAME,EAAU,GAAM,GAE9Cp2B,EAAOi2B,EAAMzuC,IAAI,IAAM6uC,EAAK,EAAI,GAChCr2B,EAAOm2B,EAAM3uC,IAAI,IAAM6uC,EAAK,EAAI,GAChCr2B,EAAOi2B,EAAMzuC,IAAI,IAAM6uC,EAAK,EAAI,GAChCr2B,EAAOm2B,EAAM3uC,IAAI,IAAM6uC,EAAK,EAAI,EAhCqB,C,CAoCvD,IAAMf,EAAM,CAACW,EAAM3uC,KAAKiI,EAAI0D,EAAO,GAAIgjC,EAAM3uC,KAAKiE,EAAI0H,EAAO,IACvDsiC,EAAW/jC,KAAK6gC,MAAMiD,EAAI,GAAIA,EAAI,IACxCA,EAAI,GAAKA,EAAI,GAAKC,EAClBD,EAAI,GAAKA,EAAI,GAAKC,EAClB,IAAMS,EAAKnC,GAAMqC,EAAU,GAC3Bl2B,EAAOi2B,EAAMzuC,IAAI,IAAMwuC,EAAKV,EAAI,GAChCt1B,EAAOi2B,EAAMzuC,IAAI,IAAMwuC,EAAKV,EAAI,E,CAElC,OAAOt1B,CACT,EAWQ,YAAAq1B,UAAR,SACEriC,EACAgN,EACA60B,EACAne,EACA1iB,GAWA,IATQ,IAAAggC,EAA0BhgC,EAAO,GAA7BkgC,EAAsBlgC,EAAO,IAAxBogC,EAAiBpgC,EAAO,MAAjBigC,EAAUjgC,EAAO,MACnChG,EAAQgF,EAAME,cACdyhC,EAAU3mC,EAAM/I,OAChBqxC,EAAQ,GACRC,EAAQ,GAEVC,EAAO,EACPC,EAAO,EACPC,EAAUhgB,EACL3xB,EAAI,EAAGA,EAAI4vC,EAAS5vC,GAAK,EAAG,CAC3B,IAAAyC,EAAOwG,EAAMjJ,GAAE,GACjBwpC,EAASv7B,EAAMoC,UAAU5N,GAC/B,KAAI4sC,GAAS7F,GAAU,GAAvB,CAEA,IAAMoI,EAAQ,CACZ32B,EAAOxY,GAAI,GAAKqtC,EAAUrtC,GAAI,GAC9BwY,EAAOxY,GAAI,GAAKqtC,EAAUrtC,GAAI,IAE1BovC,EAAYplC,KAAK6gC,MAAMsE,EAAM,GAAIA,EAAM,IACvCx7B,EAAM,CACV6E,EAAOxY,GAAI,GAAKqtC,EAAUrtC,GAAI,GAC9BwY,EAAOxY,GAAI,GAAKqtC,EAAUrtC,GAAI,IAE1BqvC,EAAUrlC,KAAK6gC,MAAMl3B,EAAI,GAAIA,EAAI,IAEvCm7B,EAAMvxC,GAAK6xC,EACXL,EAAMxxC,GAAK8xC,EAAU,EAErBL,IAASjI,EAAS,GAAK+H,EAAMvxC,GAC7B0xC,IAASlI,EAAS,GAAKgI,EAAMxxC,EAjBK,C,CAoBpC,IAAM+xC,EAAQJ,EAMd,IALAA,EAAWxC,EAAMuC,EAAQD,EACX,IAAVM,IACFJ,EAAUA,EAAU,IAAMI,EAAQ,IAAMA,EAAQJ,GAGzC3xC,EAAI,EAAGA,EAAI4vC,EAAS5vC,GAAK,EAAG,CAC7B,MAAeiJ,EAAMjJ,GAAfuC,GAAJE,EAAE,KAAM,QAEhB,GADM+mC,EAASv7B,EAAMoC,UAAU5N,KAC3B4sC,GAAS7F,GAAU,GACnB,EAASjnC,EAAKgZ,KAAO,EAAShZ,EAAKkZ,KAAvC,CAEA,IAAIu2B,EAAM/C,EAAK0C,GAAY,EAAIA,EAAUllC,KAAKC,KAAK6kC,EAAMvxC,KACrDiyC,EAAWxlC,KAAK6gC,MAAMryB,EAAOxY,GAAI,GAAIwY,EAAOxY,GAAI,IAE9C8K,EAAM2hC,GADZ+C,EAAWA,EAAW,KAAS,KAASA,GAGlCC,GADNF,EAAKA,EAAKzkC,EAAMA,EAAMykC,GACL/2B,EAAOxY,GAAI,GACtB0vC,EAAMH,EAAK/2B,EAAOxY,GAAI,GAC5BwL,EAAMI,cAAc5L,EAAI,CACtB+H,EAAGjI,EAAKiI,EAAI0nC,EACZ1rC,EAAGjE,EAAKiE,EAAI2rC,GAXsC,C,CActD,OAAOR,CACT,EACF,EA3mBA,GCtDM,GAA6D,CACjE5J,aAAc,IACdC,QAAS,GACToK,MAAO,EACP3xB,YAAY,EACZ4xB,eAAgB,GAChB7kC,MAAO,IACPC,OAAQ,IACRhC,cAAe,WA4CjB,cAgBE,WACSwD,QAAA,IAAAA,MAAoC,CAAC,GAArC,KAAAA,UAdT,KAAAxM,GAAK,cAEG,KAAA8lC,aAAuB,EAEvB,KAAA52B,SAAmB,EAYzBnT,KAAKyQ,QAAU,OACV,IACAA,EAEP,CA+ZF,OA1ZQ,YAAAC,QAAN,SAAcjB,EAAcgB,G,mEAC1B,MAAO,CAAP,EAAOzQ,KAAK8zC,0BAAyB,EAAOrkC,EAAOgB,G,QAK/C,YAAArM,OAAN,SAAaqL,EAAcgB,G,0EACzBzQ,KAAK8zC,0BAAyB,EAAMrkC,EAAOgB,G,WAM7C,YAAAiD,KAAA,WACM1T,KAAK+pC,cAAkC,oBAAXl3B,QAC9BA,OAAOiJ,cAAc9b,KAAK+pC,cAE5B/pC,KAAKmT,SAAU,CACjB,EAMA,YAAA0J,KAAA,SAAKvJ,GAAL,WACE,QADG,IAAAA,MAAatT,KAAKyQ,QAAQ84B,cAAgB,GACzCvpC,KAAKiqC,WACP,OAAOjqC,KAAKiqC,WAGd,IAAK,IAAIzoC,EAAI,EAAGA,EAAI8R,EAAY9R,IAC9BxB,KAAKmqC,WAAWnqC,KAAK6iB,UAAW7iB,KAAK+zC,eAAgB/zC,KAAKkqC,aAG5D,IAAM3lC,EAAS,CACbkG,MAAOzK,KAAKyiB,gBACZ/X,MAAO1K,KAAK2iB,iBAad,OAVI3iB,KAAK4iB,YACPre,EAAOkG,MAAM3F,SAAQ,SAAC+F,GACpB,SAAKgY,UAAUhT,cAAchF,EAAK5G,GAAI,CACpC+H,EAAGnB,EAAK9G,KAAKiI,EACbhE,EAAG6C,EAAK9G,KAAKiE,EACbgQ,EAA+B,IAA5B,EAAKvH,QAAQy4B,WAAmBr+B,EAAK9G,KAAKiU,OAAIxV,GAHnD,IAQG+B,CACT,EAYc,YAAAuvC,yBAAd,SACE1vC,EACAqL,EACAgB,G,8GAEA,OAAIzQ,KAAKmT,QAAS,KAEZo3B,EAAmBvqC,KAAKwqC,cAAc/5B,GAE1Cy4B,EAQEqB,EAAgB,WAPlBv7B,EAOEu7B,EAAgB,MANlBt7B,EAMEs7B,EAAgB,OALlB76B,EAKE66B,EAAgB,OAJlBtoB,EAIEsoB,EAAgB,WAHlBt9B,EAGEs9B,EAAgB,cAFlBhB,EAEEgB,EAAgB,aADlBtnB,EACEsnB,EAAgB,OAEd9/B,EAAQgF,EAAME,cACdjF,EAAQ+E,EAAMG,eAEfnF,aAAK,EAALA,EAAO/I,QAMS,IAAjB+I,EAAM/I,QACJ0C,GACFqL,EAAMI,cAAcpF,EAAM,GAAGxG,GAAI,CAC/B+H,EAAG0D,EAAO,GACV1H,EAAG0H,EAAO,GACVsI,EAAkB,IAAfkxB,EAAmBx5B,EAAO,QAAKlN,IAGhC+B,EAAS,CACbkG,MAAO,C,OAEAA,EAAM,IAAE,CACX1G,KAAM,OACD0G,EAAM,GAAG1G,MAAI,CAChBiI,EAAG0D,EAAO,GACV1H,EAAG0H,EAAO,GACVsI,EAAkB,IAAfkxB,EAAmBx5B,EAAO,QAAKlN,OAIxCkI,MAAK,GAEP1K,KAAKiqC,WAAa1lC,EACX,CAAP,EAAOA,KAGHgN,EAAyB9G,EAAMoC,KACnC,SAAChC,GAAS,OAAA0D,EAAgB1D,EAAM,CAACmE,EAAOC,GAA9B,IAEN27B,EAAY,IAAI,GAA8B,CAClDngC,MAAO8G,EACP7G,MAAK,IAIDspC,EAAyB,CAAC,EAC5B/xB,GACF1Q,EAAYzM,SAAQ,SAAC+F,GACnB,IAAMopC,EAAeppC,EAAK9G,KAAKkJ,GAC1B+mC,EAAWC,KACdD,EAAWC,GAAgB,CACzBjzC,KAAMizC,EACNC,GAAI,EACJC,GAAI,EACJx1B,MAAO,GAGb,IAIF3e,KAAKyiB,gBAAkBlR,EACvBvR,KAAK2iB,gBAAkBjY,EACvB1K,KAAK4iB,WAAaxe,EAClBpE,KAAK6iB,UAAY+nB,EACjB5qC,KAAKkqC,YAAcK,EACnBvqC,KAAK+zC,eAAiBC,EAEA,oBAAXnhC,OAAwB,KAC/Bi4B,EAAO,EAEJ,CAAP,EAAO,IAAI9lC,SAAQ,SAACqC,GAElB,EAAK0iC,aAAel3B,OAAOkJ,aAAY,WAChC,EAAK5I,SAKV,EAAKg3B,WAAWS,EAAWoJ,EAAYzJ,GACnCnmC,GACFmN,EAAYzM,SAAQ,SAAC,G,IAAEb,EAAE,KAAEF,EAAI,OAC7B,OAAA0L,EAAMI,cAAc5L,EAAI,CACtB+H,EAAGjI,EAAKiI,EACRhE,EAAGjE,EAAKiE,EACRgQ,EAAkB,IAAfkxB,EAAmBnlC,EAAKiU,OAAIxV,GAHjC,IAOJygB,WAAS,CACPxY,MAAO8G,EACP7G,MAAK,MAEPogC,GACYvB,IACV12B,OAAOiJ,cAAc,EAAKiuB,cAC1B1iC,EAAQ,CAAEoD,MAAO8G,EAAa7G,MAAK,MArBnCrD,EAAQ,CAAEoD,MAAO8G,EAAa7G,MAAK,GAuBvC,GAAG,GACH,EAAKyI,SAAU,CACjB,QA/FQ5O,EAAS,CAAEkG,MAAO,GAAaC,MAAK,GAC1C1K,KAAKiqC,WAAa1lC,EACX,CAAP,EAAOA,I,QAgGH,YAAAimC,cAAR,SACE/5B,QAAA,IAAAA,MAAA,IAEA,IAAMG,EAAgB,OAAK5Q,KAAKyQ,SAAYA,GACpCwR,EAA8BrR,EAAa,WAA/B3D,EAAkB2D,EAAa,cAGzCwD,EAGNxD,EAAa,OAFRyD,EAELzD,EAAa,MADP0D,EACN1D,EAAa,OAejB,OAdAA,EAAc5B,MACXqF,GAAgC,oBAAXxB,OAEjBwB,EADDxB,OAAOC,WAEblC,EAAc3B,OACXqF,GAAiC,oBAAXzB,OAElByB,EADDzB,OAAOE,YAEbnC,EAAclB,OAAU0E,GACpB,CAACxD,EAAc5B,MAAQ,EAAG4B,EAAc3B,OAAS,GAGrD2B,EAAcqR,WAAaA,KAAgBhV,EAEpC2D,CACT,EAEQ,YAAAu5B,WAAR,SACES,EACAoJ,EACAvjC,GAGE,IAAAy4B,EASEz4B,EAAO,WARTxB,EAQEwB,EAAO,OAPTzB,EAOEyB,EAAO,MANT+4B,EAME/4B,EAAO,QALTf,EAKEe,EAAO,OAJTmjC,EAIEnjC,EAAO,MAHTwR,EAGExR,EAAO,WAFTxD,EAEEwD,EAAO,cADO2jC,EACd3jC,EAAO,eACL4jC,EAAOplC,EAASD,EAChBslC,EAAcrmC,KAAKC,KAAKmmC,GAAQ,GAChC5pC,EAAQmgC,EAAUj7B,cAClB4kC,EAAKF,GAAQ5pC,EAAM/I,OAAS,GAC5B4I,EAAI2D,KAAKC,KAAKqmC,GACdC,EAAiC,CAAC,EAIxC,GAHAx0C,KAAKy0C,eAAe7J,EAAW4J,EAAelqC,EAAGiqC,GAG7CtyB,EAAY,CAEd,IAAK,IAAMpc,KAAOmuC,EAChBA,EAAWnuC,GAAKquC,GAAK,EACrBF,EAAWnuC,GAAKsuC,GAAK,EACrBH,EAAWnuC,GAAK8Y,MAAQ,EAc1B,IAAK,IAAM9Y,KAXX4E,EAAM3F,SAAQ,SAAC+F,GACL,IAAA9G,EAAS8G,EAAI,KACfnH,EAAIswC,EAAWjwC,EAAKkJ,IACtB,EAASlJ,EAAKiI,KAChBtI,EAAEwwC,IAAMnwC,EAAKiI,GAEX,EAASjI,EAAKiE,KAChBtE,EAAEywC,IAAMpwC,EAAKiE,GAEftE,EAAEib,OACJ,IACkBq1B,EAChBA,EAAWnuC,GAAKquC,IAAMF,EAAWnuC,GAAK8Y,MACtCq1B,EAAWnuC,GAAKsuC,IAAMH,EAAWnuC,GAAK8Y,MAIxC,IAAM,EAAkBy1B,GAAuB5K,EAC/C/+B,EAAM3F,SAAQ,SAAC+F,EAAMnI,GACX,IAAAuB,EAAa4G,EAAI,GAAb9G,EAAS8G,EAAI,KACzB,GAAK,EAAS9G,EAAKiI,IAAO,EAASjI,EAAKiE,GAAxC,CACA,IAAMtE,EAAIswC,EAAWjwC,EAAKkJ,IACpBynC,EAAazmC,KAAKC,MACrBnK,EAAKiI,EAAItI,EAAEwwC,KAAOnwC,EAAKiI,EAAItI,EAAEwwC,KAAOnwC,EAAKiE,EAAItE,EAAEywC,KAAOpwC,EAAKiE,EAAItE,EAAEywC,KAE9DQ,EAAerqC,EAAI,EACzBkqC,EAAcvwC,GAAI+H,GAAM2oC,GAAgB5wC,EAAKiI,EAAItI,EAAEwwC,IAAOQ,EAC1DF,EAAcvwC,GAAI+D,GAAM2sC,GAAgB5wC,EAAKiE,EAAItE,EAAEywC,IAAOO,CAPR,CAQpD,G,CAIFjqC,EAAM3F,SAAQ,SAAC+F,EAAMnI,GACX,IAAAuB,EAAa4G,EAAI,GAAb9G,EAAS8G,EAAI,KACzB,GAAK,EAAS9G,EAAKiI,IAAO,EAASjI,EAAKiE,GAAxC,CACA,IAAM2sC,EAAe,IAAOrqC,EAAIk/B,EAChCgL,EAAcvwC,GAAI+H,GAAK2oC,GAAgB5wC,EAAKiI,EAAI0D,EAAO,IACvD8kC,EAAcvwC,GAAI+D,GAAK2sC,GAAgB5wC,EAAKiE,EAAI0H,EAAO,IACpC,IAAfw5B,IACFsL,EAAcvwC,GAAI+T,GAAK28B,GAAgB5wC,EAAKiU,EAAItI,EAAO,IALP,CAOpD,IAGAjF,EAAM3F,SAAQ,SAAC+F,EAAenI,GACpB,IAAAuB,EAAa4G,EAAI,GAAb9G,EAAS8G,EAAI,KACzB,GAAI,EAAS9G,EAAKgZ,KAAO,EAAShZ,EAAKkZ,IAMrC,OALAlZ,EAAKiI,EAAIjI,EAAKgZ,GACdhZ,EAAKiE,EAAIjE,EAAKkZ,QACK,IAAfisB,IACFnlC,EAAKiU,EAAIjU,EAAKqqC,KAIlB,GAAK,EAASrqC,EAAKiI,IAAO,EAASjI,EAAKiE,GAAxC,CACA,IAAM0sC,EAAazmC,KAAKC,KACtBsmC,EAAcvwC,GAAI+H,EAAIwoC,EAAcvwC,GAAI+H,EACtCwoC,EAAcvwC,GAAI+D,EAAIwsC,EAAcvwC,GAAI+D,GAAoB,IAAfkhC,EAAmBsL,EAAcvwC,GAAI+T,EAAIw8B,EAAcvwC,GAAI+T,EAAI,IAEhH,GAAI08B,EAAa,EAAG,CAElB,IAAME,EAAc3mC,KAAKoD,IACvBijC,GAAeV,EAvXH,KAwXZc,GAEF9J,EAAU/6B,cAAc5L,EAAI,CAC1B+H,EAAGjI,EAAKiI,EAAKwoC,EAAcvwC,GAAI+H,EAAI0oC,EAAcE,EACjD5sC,EAAGjE,EAAKiE,EAAKwsC,EAAcvwC,GAAI+D,EAAI0sC,EAAcE,EACjD58B,EAAkB,IAAfkxB,EAAmBnlC,EAAKiU,EAAKw8B,EAAcvwC,GAAI+T,EAAI08B,EAAcE,OAAcpyC,G,CAdpC,CAiBpD,GACF,EACQ,YAAAiyC,eAAR,SACE7J,EACA4J,EACAlqC,EACAiqC,GAEAv0C,KAAK+rC,aAAanB,EAAW4J,EAAeD,GAC5Cv0C,KAAKgsC,cAAcpB,EAAW4J,EAAelqC,EAC/C,EAEQ,YAAAyhC,aAAR,SACEnB,EACA4J,EACAD,GAHF,WAKQ9pC,EAAQmgC,EAAUj7B,cACxBlF,EAAM3F,SAAQ,SAAC,EAAsBtD,G,IAAdkH,EAAC,OAAMmsC,EAAG,KAC/BL,EAAcK,GAAO,CAAE7oC,EAAG,EAAGhE,EAAG,EAAGgQ,EAAG,GACtCvN,EAAM3F,SAAQ,SAAC,EAAsBpC,G,IAAduvB,EAAC,OAAM6iB,EAAG,KAC/B,KACEtzC,GAAKkB,IACJ,EAASgG,EAAEsD,IACX,EAASimB,EAAEjmB,IACX,EAAStD,EAAEV,IACX,EAASiqB,EAAEjqB,GALd,CASA,IAAI2kC,EAAOjkC,EAAEsD,EAAIimB,EAAEjmB,EACf4gC,EAAOlkC,EAAEV,EAAIiqB,EAAEjqB,EACf6kC,EAAmC,IAA5B,EAAKp8B,QAAQy4B,WAAmBxgC,EAAEsP,EAAIia,EAAEja,EAAI,EACnD+8B,EAAYpI,EAAOA,EAAOC,EAAOA,EAAOC,EAAOA,EACjC,IAAdkI,IACFA,EAAY,EACZpI,EAAO,IACPC,EAAO,IACPC,EAAO,KAET,IAAMmI,EAAST,EAAKQ,EACdE,EAAQtI,EAAOqI,EACfE,EAAQtI,EAAOoI,EACfG,EAAQtI,EAAOmI,EACrBR,EAAcK,GAAK7oC,GAAKipC,EACxBT,EAAcK,GAAK7sC,GAAKktC,EACxBV,EAAcM,GAAK9oC,GAAKipC,EACxBT,EAAcM,GAAK9sC,GAAKktC,EAEQ,IAA5B,EAAKzkC,QAAQy4B,aACfsL,EAAcK,GAAK78B,GAAKm9B,EACxBX,EAAcM,GAAK98B,GAAKm9B,E,CAE5B,GACF,GACF,EAEQ,YAAAnJ,cAAR,SACEpB,EACA4J,EACAlqC,GAHF,WAKgBsgC,EAAUh7B,cAClB9K,SAAQ,SAACjB,GACL,IAAAiH,EAAmBjH,EAAC,OAAZkH,EAAWlH,EAAC,OAC5B,GAAKiH,GAAWC,GAAUD,IAAWC,EAArC,CAGQ,IAAMknB,EAAM2Y,EAAUpkB,QAAQ1b,GAAO,KAC/BpC,EAAMkiC,EAAUpkB,QAAQzb,GAAO,KAC7C,GACG,EAASrC,EAAEsD,IACX,EAASimB,EAAEjmB,IACX,EAAStD,EAAEV,IACX,EAASiqB,EAAEjqB,GAJd,CAQA,IAAM2kC,EAAOjkC,EAAEsD,EAAIimB,EAAEjmB,EACf4gC,EAAOlkC,EAAEV,EAAIiqB,EAAEjqB,EACf6kC,EAAmC,IAA5B,EAAKp8B,QAAQy4B,WAAmBxgC,EAAEsP,EAAIia,EAAEja,EAAI,EACnDg9B,EAAS/mC,KAAKC,KAAKy+B,EAAOA,EAAOC,EAAOA,EAAOC,EAAOA,GAAQviC,EAC9D2qC,EAAQtI,EAAOqI,EACfE,EAAQtI,EAAOoI,EACfG,EAAQtI,EAAOmI,EACrBR,EAAc1pC,GAAQkB,GAAKipC,EAC3BT,EAAc1pC,GAAQ9C,GAAKktC,EAC3BV,EAAczpC,GAAQiB,GAAKipC,EAC3BT,EAAczpC,GAAQ/C,GAAKktC,EAEK,IAA5B,EAAKzkC,QAAQy4B,aACfsL,EAAc1pC,GAAQkN,GAAKm9B,EAC3BX,EAAczpC,GAAQiN,GAAKm9B,E,EAE/B,GACF,EACF,EAtbA,GCpCM,GAAsD,CAC1DzQ,MAAO,CAAC,EAAG,GACX5wB,gBAAgB,EAChBshC,sBAAuB,GACvBC,UAAU,EACVC,UAAM9yC,EACN+yC,UAAM/yC,EACN24B,cAAU34B,EACV0R,OAAQ,SACR/E,SAAU,GACVH,MAAO,IACPC,OAAQ,KAkBV,cAGE,WAAmBwB,QAAA,IAAAA,MAA6B,CAAC,GAA9B,KAAAA,UAFnB,KAAAxM,GAAK,OAGHjE,KAAKyQ,QAAU,OACV,IACAA,EAEP,CAoPF,OA/OQ,YAAAC,QAAN,SAAcjB,EAAcgB,G,mEAC1B,MAAO,CAAP,EAAOzQ,KAAKw1C,mBAAkB,EAAO/lC,EAAOgB,G,QAKxC,YAAArM,OAAN,SAAaqL,EAAcgB,G,0EACzBzQ,KAAKw1C,mBAAkB,EAAM/lC,EAAOgB,G,WAaxB,YAAA+kC,kBAAd,SACEpxC,EACAqL,EACAgB,G,iJAwBA,GAtBMG,EAAgB,OAAK5Q,KAAKyQ,SAAYA,GAE1C,EAWEG,EAAa,MAXf8zB,OAAK,IAAG,GAAC,EAAG,GAAE,EACd2Q,EAUEzkC,EAAa,SATfwkC,EASExkC,EAAa,sBARfkD,EAQElD,EAAa,eAPT6kC,EAOJ7kC,EAAa,KANT8kC,EAMJ9kC,EAAa,KALFC,EAKXD,EAAa,YAJLE,EAIRF,EAAa,SAHRyD,EAGLzD,EAAa,MAFP0D,EAEN1D,EAAa,OADfuqB,EACEvqB,EAAa,SACXsD,EAAWtD,EAAa,OAExBnG,EAAgBgF,EAAME,cACtBjF,EAAgB+E,EAAMG,gBAEtBnK,EAAIgF,aAAK,EAALA,EAAO/I,SAGD,IAAN+D,EACR,MAAO,CAAP,EAAO+J,EAAsBC,EAAOrL,EAAQsgC,IAiE9C,GA9DMnzB,EAAyB9G,EAAMoC,KACnC,SAAChC,GAAS,OAAA0D,EAAgB1D,EAAhB,IAKC,OAAXqJ,GACE,EAASA,SAAoD1R,IAAxC+O,EAAY,GAAWxN,KAAKmQ,KAEnDA,EAAS,UAGI,WAAXA,EACF3C,EAAYG,MACV,SAACoD,EAAIC,GACH,OAAAtF,EAAMoC,UAAUkD,EAAG9Q,GAAI,QAAUwL,EAAMoC,UAAUiD,EAAG7Q,GAAI,OAAxD,IAEgB,OAAXiQ,EAET3C,EAAYG,MAAK,SAACoD,EAAIC,GACpB,OAAI,EAASA,EAAG9Q,KAAO,EAAS6Q,EAAG7Q,IAC1B8Q,EAAG9Q,GAAK6Q,EAAG7Q,IAEb,GAAG6Q,EAAG7Q,IAAK0xC,cAAc,GAAG5gC,EAAG9Q,GACxC,IAGAsN,EAAYG,MACV,SAACoD,EAAIC,GAAO,OAACA,EAAWhR,KAAKmQ,GAAYY,EAAW/Q,KAAKmQ,EAA7C,IAGVlF,EACHqF,GAAgC,oBAAXxB,OAEjBwB,EADDxB,OAAOC,WAEP7D,EACHqF,GAAiC,oBAAXzB,OAElByB,EADDzB,OAAOE,YAGP6iC,EAAQnwC,EACRowC,EAAM,CAAEP,KAAMG,EAAWF,KAAMG,GAGpB,MAAbD,GAAkC,MAAbC,GACvBG,EAAIP,KAAOG,EACXI,EAAIN,KAAOG,GACW,MAAbD,GAAkC,MAAbC,GAC9BG,EAAIP,KAAOG,EACXI,EAAIN,KAAOtnC,KAAK+D,KAAK4jC,EAAQC,EAAIP,OACX,MAAbG,GAAkC,MAAbC,GAC9BG,EAAIN,KAAOG,EACXG,EAAIP,KAAOrnC,KAAK+D,KAAK4jC,EAAQC,EAAIN,QAI3BO,EAAS7nC,KAAKC,KAAM0nC,EAAQ3mC,EAAUD,GAC5C6mC,EAAIP,KAAOrnC,KAAK8nC,MAAMD,GACtBD,EAAIN,KAAOtnC,KAAK8nC,MAAO/mC,EAAQC,EAAU6mC,IAE3CD,EAAIP,KAAOrnC,KAAKc,IAAI8mC,EAAIP,KAAM,GAC9BO,EAAIN,KAAOtnC,KAAKc,IAAI8mC,EAAIN,KAAM,GAC1BM,EAAIN,KAAOM,EAAIP,KAAOM,EAGlBI,EAAKC,GAAMJ,GACXpd,EAAKyd,GAAML,IAGZG,EAAK,GAAKvd,GAAMmd,EACnBK,GAAMJ,EAAKG,EAAK,IACNvd,EAAK,GAAKud,GAAMJ,GAC1BM,GAAML,EAAKpd,EAAK,QAIlB,KAAOod,EAAIN,KAAOM,EAAIP,KAAOM,GACrBI,EAAKC,GAAMJ,KACXpd,EAAKyd,GAAML,IAGP,GAAKG,GAAMJ,EACnBM,GAAML,EAAKpd,EAAK,GAEhBwd,GAAMJ,EAAKG,EAAK,GAqDtB,IAhDIG,EAAYd,EAAW,EAAIrmC,EAAQ6mC,EAAIN,KACvCa,EAAaf,EAAW,EAAIpmC,EAAS4mC,EAAIP,MAEzCxhC,GAAkBjD,KACd,EAAwBlC,EAC5B,GACAkC,GAEI,EAAqBhC,EAAa,GAAIiC,GAAe,GAC3DS,EAAYzM,SAAQ,SAAC+F,GACdA,EAAK9G,KAAKiI,GAAMnB,EAAK9G,KAAKiE,IAE7B6C,EAAK9G,KAAKiI,EAAI,EACdnB,EAAK9G,KAAKiE,EAAI,GAGhB,IAGIw7B,EACA6S,EAJEC,EAAQ7mC,EAAM+W,QAAQ3b,EAAK5G,IAC3BsyC,EAAM,EAASD,IAAU,GAK3B3sC,EAAQ4sC,IACV/S,EAAQ+S,EAAI,GACZF,EAAQE,EAAI,KAEZ/S,EAAQ+S,EACRF,EAAQE,GAGV,IAAMjwC,OACY9D,IAAhB,EAA4B,EAAYqI,GAAQuqC,EAE5CjyC,EAAIqgC,EAAQl9B,EACZ6nB,EAAIkoB,EAAQ/vC,EAElB6vC,EAAYloC,KAAKc,IAAIonC,EAAWhzC,GAChCizC,EAAanoC,KAAKc,IAAIqnC,EAAYjoB,EACpC,KAGIqoB,EAAqB,CAAC,EAGtBC,EAAK,CAAErrC,IAAK,EAAGsrC,IAAK,GAGpBC,EAA4B,CAAC,EAC1Bn1C,EAAI,EAAGA,EAAI+P,EAAY7P,OAAQF,IAAK,CAQ3C,GAPMqJ,EAAO0G,EAAY/P,GACrBo1C,OAAK,EACLzb,IAEFyb,EAAQzb,EAAS1rB,EAAM+W,QAAQ3b,EAAK5G,MAGlC2yC,SAAwBp0C,IAAdo0C,EAAMxrC,UAAmC5I,IAAdo0C,EAAMF,KAAoB,CAOjE,QAAgBl0C,KALVgyB,EAAM,CACVppB,IAAKwrC,EAAMxrC,IACXsrC,IAAKE,EAAMF,MAGLA,IAIN,IAFAliB,EAAIkiB,IAAM,EAEHG,GAAKL,EAAUhiB,IACpBA,EAAIkiB,WAED,QAAgBl0C,IAAZgyB,EAAIppB,IAIb,IAFAopB,EAAIppB,IAAM,EAEHyrC,GAAKL,EAAUhiB,IACpBA,EAAIppB,MAIRurC,EAAU9rC,EAAK5G,IAAMuwB,EACrBsiB,GAAIN,EAAUhiB,E,CAEhBuiB,GAAOlsC,EAAM65B,EAAOyR,EAAWC,EAAYO,EAAWd,EAAKY,EAAID,E,CAejE,OAbMjyC,EAAS,CACbkG,MAAO8G,EACP7G,MAAK,GAGHtG,GACFmN,EAAYzM,SAAQ,SAAC+F,GACnB4E,EAAMI,cAAchF,EAAK5G,GAAI,CAC3B+H,EAAGnB,EAAK9G,KAAKiI,EACbhE,EAAG6C,EAAK9G,KAAKiE,GAEjB,IAEK,CAAP,EAAOzD,E,QAEX,EA5PA,GA8PM0xC,GAAQ,SACZJ,EACAhsC,GAEA,IAAI0sC,EACEjB,EAAOO,EAAIP,MAAQ,EACnBC,EAAOM,EAAIN,MAAQ,EAWzB,OAVW,MAAP1rC,EACF0sC,EAAMtoC,KAAKoD,IAAIikC,EAAMC,GAETtnC,KAAKoD,IAAIikC,EAAMC,KACfM,EAAIP,KACdO,EAAIP,KAAOzrC,EAEXgsC,EAAIN,KAAO1rC,EAGR0sC,CACT,EAEML,GAAQ,SAACL,EAAkBhsC,GAC/B,IAAItF,EACEyyC,EAAWnB,EAAIP,MAAQ,EACvB2B,EAAWpB,EAAIN,MAAQ,EAW7B,OAVW,MAAP1rC,EACFtF,EAAS0J,KAAKc,IAAIioC,EAAUC,GAEhBhpC,KAAKc,IAAIioC,EAAUC,KACnBpB,EAAIP,KACdO,EAAIP,KAAOzrC,EAEXgsC,EAAIN,KAAO1rC,EAGRtF,CACT,EAEMsyC,GAAO,SAACL,EAAoBC,GAChC,OAAAD,EAAS,KAAKC,EAAGrrC,IAAG,IAAIqrC,EAAGC,OAAU,CAArC,EAEII,GAAM,SAACN,EAAoBC,GAC/B,OAACD,EAAS,KAAKC,EAAGrrC,IAAG,IAAIqrC,EAAGC,MAAS,CAArC,EAEIQ,GAAiB,SAACrB,EAAkBY,GACxC,IAAMlB,EAAOM,EAAIN,MAAQ,EACzBkB,EAAGC,MACCD,EAAGC,KAAOnB,IACZkB,EAAGC,IAAM,EACTD,EAAGrrC,MAEP,EAEM2rC,GAAS,SACblsC,EACA65B,EACAyR,EACAC,EACAO,EACAd,EACAY,EACAD,GAEA,IAAIxqC,EACAhE,EAGE4uC,EAAQD,EAAU9rC,EAAK5G,IAC7B,GAAI2yC,EACF5qC,EAAI4qC,EAAMF,IAAMP,EAAYA,EAAY,EAAIzR,EAAM,GAClD18B,EAAI4uC,EAAMxrC,IAAMgrC,EAAaA,EAAa,EAAI1R,EAAM,OAC/C,CAGL,KAAOmS,GAAKL,EAAUC,IACpBS,GAAerB,EAAKY,GAGtBzqC,EAAIyqC,EAAGC,IAAMP,EAAYA,EAAY,EAAIzR,EAAM,GAC/C18B,EAAIyuC,EAAGrrC,IAAMgrC,EAAaA,EAAa,EAAI1R,EAAM,GACjDoS,GAAIN,EAAUC,GAEdS,GAAerB,EAAKY,E,CAEtB5rC,EAAK9G,KAAKiI,EAAIA,EACdnB,EAAK9G,KAAKiE,EAAIA,CAChB,EC/YA,MAAM,GAAWzI,OAAOC,UAAUwK,SAO3B,SAASmtC,GAAW3vC,GACvB,MAAM4vC,EAAM,GAASl2C,KAAKsG,GAC1B,OAAO4vC,EAAIC,SAAS,YAAcD,EAAIjoB,SAAS,MACnD,CCPA,SAASmoB,GAAQC,GACf,IAQIC,EARA/mC,EAAUnO,UAAUZ,OAAS,QAAsBc,IAAjBF,UAAU,GAAmBA,UAAU,GAAK,CAAC,EAEnF,IAAK60C,GAAWI,GACd,MAAM,IAAIn3C,UAAU,0BACf,GAAqB,IAAjBm3C,EAAM71C,OACf,MAAM,IAAItB,UAAU,2BAKtB,QAAuBoC,IAAnBiO,EAAQ+mC,OAAsB,CAChC,IAAKL,GAAW1mC,EAAQ+mC,QACtB,MAAM,IAAIp3C,UAAU,+CAGtBo3C,EAAS/mC,EAAQ+mC,MACnB,MACEA,EAAS,IAAI51C,MAAM21C,EAAM71C,QAG3B,IAAI+1C,ECvBN,SAAaF,GACX,IAAI9mC,EAAUnO,UAAUZ,OAAS,QAAsBc,IAAjBF,UAAU,GAAmBA,UAAU,GAAK,CAAC,EAEnF,IAAK60C,GAAWI,GACd,MAAM,IAAIn3C,UAAU,0BAGtB,GAAqB,IAAjBm3C,EAAM71C,OACR,MAAM,IAAItB,UAAU,2BAGtB,IAAIs3C,EAAqBjnC,EAAQknC,UAC7BA,OAAmC,IAAvBD,EAAgC,EAAIA,EAChDE,EAAmBnnC,EAAQonC,QAC3BA,OAA+B,IAArBD,EAA8BL,EAAM71C,OAASk2C,EAE3D,GAAID,EAAY,GAAKA,GAAaJ,EAAM71C,SAAWwsB,OAAO4pB,UAAUH,GAClE,MAAM,IAAItzC,MAAM,4DAGlB,GAAIwzC,GAAWF,GAAaE,EAAUN,EAAM71C,SAAWwsB,OAAO4pB,UAAUD,GACtE,MAAM,IAAIxzC,MAAM,iFAKlB,IAFA,IAAI0zC,EAAWR,EAAMI,GAEZn2C,EAAIm2C,EAAY,EAAGn2C,EAAIq2C,EAASr2C,IACnC+1C,EAAM/1C,GAAKu2C,IAAUA,EAAWR,EAAM/1C,IAG5C,OAAOu2C,CACT,CDRmB1mC,CAAIkmC,GACjBS,EExBN,SAAaT,GACX,IAAI9mC,EAAUnO,UAAUZ,OAAS,QAAsBc,IAAjBF,UAAU,GAAmBA,UAAU,GAAK,CAAC,EAEnF,IAAK60C,GAAWI,GACd,MAAM,IAAIn3C,UAAU,0BAGtB,GAAqB,IAAjBm3C,EAAM71C,OACR,MAAM,IAAItB,UAAU,2BAGtB,IAAIs3C,EAAqBjnC,EAAQknC,UAC7BA,OAAmC,IAAvBD,EAAgC,EAAIA,EAChDE,EAAmBnnC,EAAQonC,QAC3BA,OAA+B,IAArBD,EAA8BL,EAAM71C,OAASk2C,EAE3D,GAAID,EAAY,GAAKA,GAAaJ,EAAM71C,SAAWwsB,OAAO4pB,UAAUH,GAClE,MAAM,IAAItzC,MAAM,4DAGlB,GAAIwzC,GAAWF,GAAaE,EAAUN,EAAM71C,SAAWwsB,OAAO4pB,UAAUD,GACtE,MAAM,IAAIxzC,MAAM,iFAKlB,IAFA,IAAI4zC,EAAWV,EAAMI,GAEZn2C,EAAIm2C,EAAY,EAAGn2C,EAAIq2C,EAASr2C,IACnC+1C,EAAM/1C,GAAKy2C,IAAUA,EAAWV,EAAM/1C,IAG5C,OAAOy2C,CACT,CFPmBlpC,CAAIwoC,GAErB,GAAIE,IAAeO,EACjB,MAAM,IAAIE,WAAW,+EAGvB,IAAIC,EAAe1nC,EAAQY,IACvB0mC,OAA4B,IAAjBI,EAA0B1nC,EAAQ2nC,WAAaX,EAAa,EAAIU,EAC3EE,EAAe5nC,EAAQ1B,IACvBkpC,OAA4B,IAAjBI,EAA0B5nC,EAAQ2nC,WAAaJ,EAAa,EAAIK,EAE/E,GAAIN,GAAYE,EACd,MAAM,IAAIC,WAAW,8CAKvB,IAFA,IAAIzO,GAAUwO,EAAWF,IAAaC,EAAaP,GAE1Cj2C,EAAI,EAAGA,EAAI+1C,EAAM71C,OAAQF,IAChCg2C,EAAOh2C,IAAM+1C,EAAM/1C,GAAKi2C,GAAchO,EAASsO,EAGjD,OAAOP,CACT,CGhDA,MAAMc,GAAS,IAAIC,OAAO,GACpBC,GAAa,IAAID,OAAO,GAMvB,SAASE,GAAyB9tC,EAAQ8F,EAAU,CAAC,GAC1D,MAAM,QACJioC,EAAU,GAAE,WACZC,EAAa,GAAE,WACfC,EAAa,EAAC,SACdC,EAAW,QACTpoC,EACJ,MAAO,GAAG9F,EAAOjE,YAAY1F,WAC7Bs3C,QACAE,KAOF,SAAqB7tC,EAAQ+tC,EAASC,EAAYC,EAAYC,GAC5D,MAAM,KAAEvD,EAAI,QAAEwD,GAAYnuC,EACpBouC,EAAO9qC,KAAKoD,IAAIikC,EAAMoD,GACtBM,EAAO/qC,KAAKoD,IAAIynC,EAASH,GACzBp0C,EAAS,GAEf,GAAiB,SAAbs0C,EAAqB,CACvBA,GAAW,EACXI,EAAM,IAAK,IAAIz3C,EAAI,EAAGA,EAAIu3C,EAAMv3C,IAC9B,IAAK,IAAIkB,EAAI,EAAGA,EAAIs2C,EAAMt2C,IACxB,GAAIiI,EAAO1E,IAAIzE,EAAGkB,GAAK,EAAG,CACxBm2C,GAAW,EACX,MAAMI,CACR,CAGN,CAEA,IAAK,IAAIz3C,EAAI,EAAGA,EAAIu3C,EAAMv3C,IAAK,CAC7B,IAAI03C,EAAO,GACX,IAAK,IAAIx2C,EAAI,EAAGA,EAAIs2C,EAAMt2C,IACxBw2C,EAAK14C,KAAK24C,GAAaxuC,EAAO1E,IAAIzE,EAAGkB,GAAIk2C,EAAYC,IAEvDt0C,EAAO/D,KAAK,GAAG04C,EAAKjtB,KAAK,OAC3B,CAOA,OANI+sB,IAASF,IACXv0C,EAAOA,EAAO7C,OAAS,IAAM,QAAQo3C,EAAUH,kBAE7CI,IAASzD,GACX/wC,EAAO/D,KAAK,OAAO80C,EAAOoD,eAErBn0C,EAAO0nB,KAAK,KAAKusB,KAC1B,CAvCeY,CAAYzuC,EAAQ+tC,EAASC,EAAYC,EAAYC,OAClEP,QACAA,WAAe3tC,EAAO2qC,SACtBgD,cAAkB3tC,EAAOmuC,YAE3B,CAoCA,SAASK,GAAaE,EAAKT,EAAYC,GACrC,OACEQ,GAAO,GAAKR,EACR,IAAIS,GAAcD,EAAKT,EAAa,KACpCU,GAAcD,EAAKT,IACvBW,OAAOX,EACX,CAEA,SAASU,GAAcD,EAAKh3C,GAE1B,IAAImH,EAAM6vC,EAAIrvC,WACd,GAAIR,EAAI9H,QAAUW,EAAK,OAAOmH,EAI9B,IAAIgwC,EAAMH,EAAII,QAAQp3C,GAItB,GAHIm3C,EAAI93C,OAASW,IACfm3C,EAAMH,EAAII,QAAQxrC,KAAKc,IAAI,EAAG1M,GAAOm3C,EAAI93C,OAASW,MAGlDm3C,EAAI93C,QAAUW,IACbm3C,EAAIE,WAAW,WACfF,EAAIE,WAAW,UAEhB,OAAOF,EAIT,IAAIG,EAAMN,EAAIO,cAAcv3C,GAI5B,OAHIs3C,EAAIj4C,OAASW,IACfs3C,EAAMN,EAAIO,cAAc3rC,KAAKc,IAAI,EAAG1M,GAAOs3C,EAAIj4C,OAASW,MAEnDs3C,EAAIx4C,MAAM,EACnB,CCjFO,SAAS04C,GAAclvC,EAAQyS,EAAO08B,GAC3C,IAAI/qC,EAAM+qC,EAAQnvC,EAAO2qC,KAAO3qC,EAAO2qC,KAAO,EAC9C,GAAIl4B,EAAQ,GAAKA,EAAQrO,EACvB,MAAM,IAAImpC,WAAW,yBAEzB,CASO,SAAS6B,GAAiBpvC,EAAQyS,EAAO08B,GAC9C,IAAI/qC,EAAM+qC,EAAQnvC,EAAOmuC,QAAUnuC,EAAOmuC,QAAU,EACpD,GAAI17B,EAAQ,GAAKA,EAAQrO,EACvB,MAAM,IAAImpC,WAAW,4BAEzB,CAUO,SAAS8B,GAAervC,EAAQsvC,GAIrC,GAHIA,EAAOC,YACTD,EAASA,EAAOC,aAEdD,EAAOv4C,SAAWiJ,EAAOmuC,QAC3B,MAAM,IAAIZ,WACR,yDAGJ,OAAO+B,CACT,CAUO,SAASE,GAAkBxvC,EAAQsvC,GAIxC,GAHIA,EAAOC,YACTD,EAASA,EAAOC,aAEdD,EAAOv4C,SAAWiJ,EAAO2qC,KAC3B,MAAM,IAAI4C,WAAW,sDAEvB,OAAO+B,CACT,CA0BO,SAASG,GAAWzvC,EAAQ0vC,EAAUC,EAAQC,EAAaC,GAChE,GAAyB,IAArBl4C,UAAUZ,OACZ,MAAM,IAAIw2C,WAAW,wBAMvB,GAJAuC,GAAY,WAAYJ,GACxBI,GAAY,SAAUH,GACtBG,GAAY,cAAeF,GAC3BE,GAAY,YAAaD,GAEvBH,EAAWC,GACXC,EAAcC,GACdH,EAAW,GACXA,GAAY1vC,EAAO2qC,MACnBgF,EAAS,GACTA,GAAU3vC,EAAO2qC,MACjBiF,EAAc,GACdA,GAAe5vC,EAAOmuC,SACtB0B,EAAY,GACZA,GAAa7vC,EAAOmuC,QAEpB,MAAM,IAAIZ,WAAW,qCAEzB,CAEO,SAASwC,GAASh5C,EAAQ8F,EAAQ,GACvC,IAAIunB,EAAQ,GACZ,IAAK,IAAIvtB,EAAI,EAAGA,EAAIE,EAAQF,IAC1ButB,EAAMvuB,KAAKgH,GAEb,OAAOunB,CACT,CAEA,SAAS0rB,GAAYz5C,EAAMwG,GACzB,GAAqB,iBAAVA,EACT,MAAM,IAAIpH,UAAU,GAAGY,qBAE3B,CAEO,SAAS25C,GAAchwC,GAC5B,GAAIA,EAAOiwC,UACT,MAAM,IAAIv2C,MAAM,wCAEpB,CClGO,MAAMw2C,GACXC,mBAAmBC,EAASC,EAAYC,GAEtC,GADaF,EAAUC,IACRC,EAAQv5C,OACrB,MAAM,IAAIw2C,WAAW,+CAEvB,IAAIgD,EAAY,IAAIC,GAAOJ,EAASC,GACpC,IAAK,IAAI5vC,EAAM,EAAGA,EAAM2vC,EAAS3vC,IAC/B,IAAK,IAAIgwC,EAAS,EAAGA,EAASJ,EAAYI,IACxCF,EAAUpuC,IAAI1B,EAAKgwC,EAAQH,EAAQ7vC,EAAM4vC,EAAaI,IAG1D,OAAOF,CACT,CAEAJ,iBAAiBG,GACf,IAAIhB,EAAS,IAAIkB,GAAO,EAAGF,EAAQv5C,QACnC,IAAK,IAAIF,EAAI,EAAGA,EAAIy5C,EAAQv5C,OAAQF,IAClCy4C,EAAOntC,IAAI,EAAGtL,EAAGy5C,EAAQz5C,IAE3B,OAAOy4C,CACT,CAEAa,oBAAoBG,GAClB,IAAIhB,EAAS,IAAIkB,GAAOF,EAAQv5C,OAAQ,GACxC,IAAK,IAAIF,EAAI,EAAGA,EAAIy5C,EAAQv5C,OAAQF,IAClCy4C,EAAOntC,IAAItL,EAAG,EAAGy5C,EAAQz5C,IAE3B,OAAOy4C,CACT,CAEAa,aAAaxF,EAAMwD,GACjB,OAAO,IAAIqC,GAAO7F,EAAMwD,EAC1B,CAEAgC,YAAYxF,EAAMwD,GAChB,OAAO,IAAIqC,GAAO7F,EAAMwD,GAASlkB,KAAK,EACxC,CAEAkmB,YAAYxF,EAAMwD,EAASroC,EAAU,CAAC,GACpC,GAAuB,iBAAZA,EACT,MAAM,IAAIrQ,UAAU,6BAEtB,MAAM,OAAEsO,EAAST,KAAKS,QAAW+B,EACjC,IAAI9F,EAAS,IAAIwwC,GAAO7F,EAAMwD,GAC9B,IAAK,IAAIt3C,EAAI,EAAGA,EAAI8zC,EAAM9zC,IACxB,IAAK,IAAIkB,EAAI,EAAGA,EAAIo2C,EAASp2C,IAC3BiI,EAAOmC,IAAItL,EAAGkB,EAAGgM,KAGrB,OAAO/D,CACT,CAEAmwC,eAAexF,EAAMwD,EAASroC,EAAU,CAAC,GACvC,GAAuB,iBAAZA,EACT,MAAM,IAAIrQ,UAAU,6BAEtB,MAAM,IAAEiR,EAAM,EAAC,IAAEtC,EAAM,IAAI,OAAEL,EAAST,KAAKS,QAAW+B,EACtD,IAAKyd,OAAO4pB,UAAUzmC,GAAM,MAAM,IAAIjR,UAAU,0BAChD,IAAK8tB,OAAO4pB,UAAU/oC,GAAM,MAAM,IAAI3O,UAAU,0BAChD,GAAIiR,GAAOtC,EAAK,MAAM,IAAImpC,WAAW,gCACrC,IAAIl+B,EAAWjL,EAAMsC,EACjB1G,EAAS,IAAIwwC,GAAO7F,EAAMwD,GAC9B,IAAK,IAAIt3C,EAAI,EAAGA,EAAI8zC,EAAM9zC,IACxB,IAAK,IAAIkB,EAAI,EAAGA,EAAIo2C,EAASp2C,IAAK,CAChC,IAAI8E,EAAQ6J,EAAMpD,KAAK8nC,MAAMrnC,IAAWsL,GACxCrP,EAAOmC,IAAItL,EAAGkB,EAAG8E,EACnB,CAEF,OAAOmD,CACT,CAEAmwC,WAAWxF,EAAMwD,EAAStxC,QACRhF,IAAZs2C,IAAuBA,EAAUxD,QACvB9yC,IAAVgF,IAAqBA,EAAQ,GACjC,IAAI6J,EAAMpD,KAAKoD,IAAIikC,EAAMwD,GACrBnuC,EAAS3K,KAAKq7C,MAAM/F,EAAMwD,GAC9B,IAAK,IAAIt3C,EAAI,EAAGA,EAAI6P,EAAK7P,IACvBmJ,EAAOmC,IAAItL,EAAGA,EAAGgG,GAEnB,OAAOmD,CACT,CAEAmwC,YAAY/2C,EAAMuxC,EAAMwD,GACtB,IAAIr3C,EAAIsC,EAAKrC,YACAc,IAAT8yC,IAAoBA,EAAO7zC,QACfe,IAAZs2C,IAAuBA,EAAUxD,GACrC,IAAIjkC,EAAMpD,KAAKoD,IAAI5P,EAAG6zC,EAAMwD,GACxBnuC,EAAS3K,KAAKq7C,MAAM/F,EAAMwD,GAC9B,IAAK,IAAIt3C,EAAI,EAAGA,EAAI6P,EAAK7P,IACvBmJ,EAAOmC,IAAItL,EAAGA,EAAGuC,EAAKvC,IAExB,OAAOmJ,CACT,CAEAmwC,WAAWQ,EAASC,GAClBD,EAAUt7C,KAAKw7C,YAAYF,GAC3BC,EAAUv7C,KAAKw7C,YAAYD,GAC3B,IAAIjG,EAAOgG,EAAQhG,KACfwD,EAAUwC,EAAQxC,QAClBv0C,EAAS,IAAI42C,GAAO7F,EAAMwD,GAC9B,IAAK,IAAIt3C,EAAI,EAAGA,EAAI8zC,EAAM9zC,IACxB,IAAK,IAAIkB,EAAI,EAAGA,EAAIo2C,EAASp2C,IAC3B6B,EAAOuI,IAAItL,EAAGkB,EAAGuL,KAAKoD,IAAIiqC,EAAQr1C,IAAIzE,EAAGkB,GAAI64C,EAAQt1C,IAAIzE,EAAGkB,KAGhE,OAAO6B,CACT,CAEAu2C,WAAWQ,EAASC,GAClBD,EAAUt7C,KAAKw7C,YAAYF,GAC3BC,EAAUv7C,KAAKw7C,YAAYD,GAC3B,IAAIjG,EAAOgG,EAAQhG,KACfwD,EAAUwC,EAAQxC,QAClBv0C,EAAS,IAAIvE,KAAKs1C,EAAMwD,GAC5B,IAAK,IAAIt3C,EAAI,EAAGA,EAAI8zC,EAAM9zC,IACxB,IAAK,IAAIkB,EAAI,EAAGA,EAAIo2C,EAASp2C,IAC3B6B,EAAOuI,IAAItL,EAAGkB,EAAGuL,KAAKc,IAAIusC,EAAQr1C,IAAIzE,EAAGkB,GAAI64C,EAAQt1C,IAAIzE,EAAGkB,KAGhE,OAAO6B,CACT,CAEAu2C,mBAAmBtzC,GACjB,OAAOqzC,GAAeY,SAASj0C,GAASA,EAAQ,IAAI2zC,GAAO3zC,EAC7D,CAEAszC,gBAAgBtzC,GACd,OAAgB,MAATA,GAAiC,WAAhBA,EAAMk0C,KAChC,CAEItxC,WACF,OAAOpK,KAAKs1C,KAAOt1C,KAAK84C,OAC1B,CAEAr2C,MAAMwW,GACJ,GAAwB,mBAAbA,EACT,MAAM,IAAI7Y,UAAU,+BAEtB,IAAK,IAAIoB,EAAI,EAAGA,EAAIxB,KAAKs1C,KAAM9zC,IAC7B,IAAK,IAAIkB,EAAI,EAAGA,EAAI1C,KAAK84C,QAASp2C,IAChCuW,EAAS/X,KAAKlB,KAAMwB,EAAGkB,GAG3B,OAAO1C,IACT,CAEAk6C,YACE,IAAInrB,EAAQ,GACZ,IAAK,IAAIvtB,EAAI,EAAGA,EAAIxB,KAAKs1C,KAAM9zC,IAC7B,IAAK,IAAIkB,EAAI,EAAGA,EAAI1C,KAAK84C,QAASp2C,IAChCqsB,EAAMvuB,KAAKR,KAAKiG,IAAIzE,EAAGkB,IAG3B,OAAOqsB,CACT,CAEA4sB,YACE,IAAIjkC,EAAO,GACX,IAAK,IAAIlW,EAAI,EAAGA,EAAIxB,KAAKs1C,KAAM9zC,IAAK,CAClCkW,EAAKlX,KAAK,IACV,IAAK,IAAIkC,EAAI,EAAGA,EAAI1C,KAAK84C,QAASp2C,IAChCgV,EAAKlW,GAAGhB,KAAKR,KAAKiG,IAAIzE,EAAGkB,GAE7B,CACA,OAAOgV,CACT,CAEA0T,SACE,OAAOprB,KAAK27C,WACd,CAEAC,cACE,OAAqB,IAAd57C,KAAKs1C,IACd,CAEAuG,iBACE,OAAwB,IAAjB77C,KAAK84C,OACd,CAEAgD,WACE,OAAqB,IAAd97C,KAAKs1C,MAA+B,IAAjBt1C,KAAK84C,OACjC,CAEAiD,WACE,OAAO/7C,KAAKs1C,OAASt1C,KAAK84C,OAC5B,CAEA8B,UACE,OAAqB,IAAd56C,KAAKs1C,MAA+B,IAAjBt1C,KAAK84C,OACjC,CAEAkD,cACE,GAAIh8C,KAAK+7C,WAAY,CACnB,IAAK,IAAIv6C,EAAI,EAAGA,EAAIxB,KAAKs1C,KAAM9zC,IAC7B,IAAK,IAAIkB,EAAI,EAAGA,GAAKlB,EAAGkB,IACtB,GAAI1C,KAAKiG,IAAIzE,EAAGkB,KAAO1C,KAAKiG,IAAIvD,EAAGlB,GACjC,OAAO,EAIb,OAAO,CACT,CACA,OAAO,CACT,CAEAy6C,gBACE,IAAIz6C,EAAI,EACJkB,EAAI,EACJw5C,GAAkB,EAClBD,GAAgB,EAChBE,GAAU,EACd,KAAO36C,EAAIxB,KAAKs1C,MAAQ2G,GAAe,CAGrC,IAFAv5C,EAAI,EACJy5C,GAAU,EACHz5C,EAAI1C,KAAK84C,UAAuB,IAAZqD,GACF,IAAnBn8C,KAAKiG,IAAIzE,EAAGkB,GACdA,IAC4B,IAAnB1C,KAAKiG,IAAIzE,EAAGkB,IAAYA,EAAIw5C,GACrCC,GAAU,EACVD,EAAiBx5C,IAEjBu5C,GAAgB,EAChBE,GAAU,GAGd36C,GACF,CACA,OAAOy6C,CACT,CAEAG,uBACE,IAAI56C,EAAI,EACJkB,EAAI,EACJw5C,GAAkB,EAClBE,GAAuB,EACvBD,GAAU,EACd,KAAO36C,EAAIxB,KAAKs1C,MAAQ8G,GAAsB,CAG5C,IAFA15C,EAAI,EACJy5C,GAAU,EACHz5C,EAAI1C,KAAK84C,UAAuB,IAAZqD,GACF,IAAnBn8C,KAAKiG,IAAIzE,EAAGkB,GACdA,IAC4B,IAAnB1C,KAAKiG,IAAIzE,EAAGkB,IAAYA,EAAIw5C,GACrCC,GAAU,EACVD,EAAiBx5C,IAEjB05C,GAAuB,EACvBD,GAAU,GAGd,IAAK,IAAI7xC,EAAI5H,EAAI,EAAG4H,EAAItK,KAAKs1C,KAAMhrC,IACV,IAAnBtK,KAAKiG,IAAIzE,EAAG8I,KACd8xC,GAAuB,GAG3B56C,GACF,CACA,OAAO46C,CACT,CAEAC,cACE,IAAI93C,EAASvE,KAAKmO,QACdggB,EAAI,EACJ7jB,EAAI,EACR,KAAO6jB,EAAI5pB,EAAO+wC,MAAQhrC,EAAI/F,EAAOu0C,SAAS,CAC5C,IAAIwD,EAAOnuB,EACX,IAAK,IAAI3sB,EAAI2sB,EAAG3sB,EAAI+C,EAAO+wC,KAAM9zC,IAC3B+C,EAAO0B,IAAIzE,EAAG8I,GAAK/F,EAAO0B,IAAIq2C,EAAMhyC,KACtCgyC,EAAO96C,GAGX,GAA4B,IAAxB+C,EAAO0B,IAAIq2C,EAAMhyC,GACnBA,QACK,CACL/F,EAAOg4C,SAASpuB,EAAGmuB,GACnB,IAAI9mB,EAAMjxB,EAAO0B,IAAIkoB,EAAG7jB,GACxB,IAAK,IAAI5H,EAAI4H,EAAG5H,EAAI6B,EAAOu0C,QAASp2C,IAClC6B,EAAOuI,IAAIqhB,EAAGzrB,EAAG6B,EAAO0B,IAAIkoB,EAAGzrB,GAAK8yB,GAEtC,IAAK,IAAIh0B,EAAI2sB,EAAI,EAAG3sB,EAAI+C,EAAO+wC,KAAM9zC,IAAK,CACxC,IAAIioC,EAASllC,EAAO0B,IAAIzE,EAAG8I,GAAK/F,EAAO0B,IAAIkoB,EAAG7jB,GAC9C/F,EAAOuI,IAAItL,EAAG8I,EAAG,GACjB,IAAK,IAAI5H,EAAI4H,EAAI,EAAG5H,EAAI6B,EAAOu0C,QAASp2C,IACtC6B,EAAOuI,IAAItL,EAAGkB,EAAG6B,EAAO0B,IAAIzE,EAAGkB,GAAK6B,EAAO0B,IAAIkoB,EAAGzrB,GAAK+mC,EAE3D,CACAtb,IACA7jB,GACF,CACF,CACA,OAAO/F,CACT,CAEAi4C,qBACE,IAAIj4C,EAASvE,KAAKq8C,cACdvzC,EAAIvE,EAAOu0C,QACXrzC,EAAIlB,EAAO+wC,KACXnnB,EAAI1oB,EAAI,EACZ,KAAO0oB,GAAK,GACV,GAAyB,IAArB5pB,EAAOk4C,OAAOtuB,GAChBA,QACK,CACL,IAAI7nB,EAAI,EACJo2C,GAAQ,EACZ,KAAOp2C,EAAIb,IAAe,IAAVi3C,GACW,IAArBn4C,EAAO0B,IAAIkoB,EAAG7nB,GAChBo2C,GAAQ,EAERp2C,IAGJ,IAAK,IAAI9E,EAAI,EAAGA,EAAI2sB,EAAG3sB,IAAK,CAC1B,IAAIioC,EAASllC,EAAO0B,IAAIzE,EAAG8E,GAC3B,IAAK,IAAI5D,EAAI4D,EAAG5D,EAAIoG,EAAGpG,IAAK,CAC1B,IAAI8yB,EAAMjxB,EAAO0B,IAAIzE,EAAGkB,GAAK+mC,EAASllC,EAAO0B,IAAIkoB,EAAGzrB,GACpD6B,EAAOuI,IAAItL,EAAGkB,EAAG8yB,EACnB,CACF,CACArH,GACF,CAEF,OAAO5pB,CACT,CAEAuI,MACE,MAAM,IAAIzI,MAAM,8BAClB,CAEA4B,MACE,MAAM,IAAI5B,MAAM,8BAClB,CAEAk0C,OAAO9nC,EAAU,CAAC,GAChB,GAAuB,iBAAZA,EACT,MAAM,IAAIrQ,UAAU,6BAEtB,MAAM,KAAEk1C,EAAO,EAAC,QAAEwD,EAAU,GAAMroC,EAClC,IAAKyd,OAAO4pB,UAAUxC,IAASA,GAAQ,EACrC,MAAM,IAAIl1C,UAAU,mCAEtB,IAAK8tB,OAAO4pB,UAAUgB,IAAYA,GAAW,EAC3C,MAAM,IAAI14C,UAAU,sCAEtB,IAAIuK,EAAS,IAAIwwC,GAAOn7C,KAAKs1C,KAAOA,EAAMt1C,KAAK84C,QAAUA,GACzD,IAAK,IAAIt3C,EAAI,EAAGA,EAAI8zC,EAAM9zC,IACxB,IAAK,IAAIkB,EAAI,EAAGA,EAAIo2C,EAASp2C,IAC3BiI,EAAOgyC,aAAa38C,KAAMA,KAAKs1C,KAAO9zC,EAAGxB,KAAK84C,QAAUp2C,GAG5D,OAAOiI,CACT,CAEAiqB,KAAKptB,GACH,IAAK,IAAIhG,EAAI,EAAGA,EAAIxB,KAAKs1C,KAAM9zC,IAC7B,IAAK,IAAIkB,EAAI,EAAGA,EAAI1C,KAAK84C,QAASp2C,IAChC1C,KAAK8M,IAAItL,EAAGkB,EAAG8E,GAGnB,OAAOxH,IACT,CAEA48C,MACE,OAAO58C,KAAK68C,MAAM,EACpB,CAEAC,OAAO1/B,GACLy8B,GAAc75C,KAAMod,GACpB,IAAIhS,EAAM,GACV,IAAK,IAAI5J,EAAI,EAAGA,EAAIxB,KAAK84C,QAASt3C,IAChC4J,EAAI5K,KAAKR,KAAKiG,IAAImX,EAAO5b,IAE3B,OAAO4J,CACT,CAEA2xC,aAAa3/B,GACX,OAAO+9B,GAAO6B,UAAUh9C,KAAK88C,OAAO1/B,GACtC,CAEA6/B,OAAO7/B,EAAO2R,GACZ8qB,GAAc75C,KAAMod,GACpB2R,EAAQirB,GAAeh6C,KAAM+uB,GAC7B,IAAK,IAAIvtB,EAAI,EAAGA,EAAIxB,KAAK84C,QAASt3C,IAChCxB,KAAK8M,IAAIsQ,EAAO5b,EAAGutB,EAAMvtB,IAE3B,OAAOxB,IACT,CAEAu8C,SAASW,EAAMC,GACbtD,GAAc75C,KAAMk9C,GACpBrD,GAAc75C,KAAMm9C,GACpB,IAAK,IAAI37C,EAAI,EAAGA,EAAIxB,KAAK84C,QAASt3C,IAAK,CACrC,IAAI47C,EAAOp9C,KAAKiG,IAAIi3C,EAAM17C,GAC1BxB,KAAK8M,IAAIowC,EAAM17C,EAAGxB,KAAKiG,IAAIk3C,EAAM37C,IACjCxB,KAAK8M,IAAIqwC,EAAM37C,EAAG47C,EACpB,CACA,OAAOp9C,IACT,CAEAq9C,UAAUjgC,GACR28B,GAAiB/5C,KAAMod,GACvB,IAAIg+B,EAAS,GACb,IAAK,IAAI55C,EAAI,EAAGA,EAAIxB,KAAKs1C,KAAM9zC,IAC7B45C,EAAO56C,KAAKR,KAAKiG,IAAIzE,EAAG4b,IAE1B,OAAOg+B,CACT,CAEAkC,gBAAgBlgC,GACd,OAAO+9B,GAAOoC,aAAav9C,KAAKq9C,UAAUjgC,GAC5C,CAEAogC,UAAUpgC,EAAO2R,GACfgrB,GAAiB/5C,KAAMod,GACvB2R,EAAQorB,GAAkBn6C,KAAM+uB,GAChC,IAAK,IAAIvtB,EAAI,EAAGA,EAAIxB,KAAKs1C,KAAM9zC,IAC7BxB,KAAK8M,IAAItL,EAAG4b,EAAO2R,EAAMvtB,IAE3B,OAAOxB,IACT,CAEAy9C,YAAYC,EAASC,GACnB5D,GAAiB/5C,KAAM09C,GACvB3D,GAAiB/5C,KAAM29C,GACvB,IAAK,IAAIn8C,EAAI,EAAGA,EAAIxB,KAAKs1C,KAAM9zC,IAAK,CAClC,IAAI47C,EAAOp9C,KAAKiG,IAAIzE,EAAGk8C,GACvB19C,KAAK8M,IAAItL,EAAGk8C,EAAS19C,KAAKiG,IAAIzE,EAAGm8C,IACjC39C,KAAK8M,IAAItL,EAAGm8C,EAASP,EACvB,CACA,OAAOp9C,IACT,CAEA49C,aAAa3D,GACXA,EAASD,GAAeh6C,KAAMi6C,GAC9B,IAAK,IAAIz4C,EAAI,EAAGA,EAAIxB,KAAKs1C,KAAM9zC,IAC7B,IAAK,IAAIkB,EAAI,EAAGA,EAAI1C,KAAK84C,QAASp2C,IAChC1C,KAAK8M,IAAItL,EAAGkB,EAAG1C,KAAKiG,IAAIzE,EAAGkB,GAAKu3C,EAAOv3C,IAG3C,OAAO1C,IACT,CAEA69C,aAAa5D,GACXA,EAASD,GAAeh6C,KAAMi6C,GAC9B,IAAK,IAAIz4C,EAAI,EAAGA,EAAIxB,KAAKs1C,KAAM9zC,IAC7B,IAAK,IAAIkB,EAAI,EAAGA,EAAI1C,KAAK84C,QAASp2C,IAChC1C,KAAK8M,IAAItL,EAAGkB,EAAG1C,KAAKiG,IAAIzE,EAAGkB,GAAKu3C,EAAOv3C,IAG3C,OAAO1C,IACT,CAEA89C,aAAa7D,GACXA,EAASD,GAAeh6C,KAAMi6C,GAC9B,IAAK,IAAIz4C,EAAI,EAAGA,EAAIxB,KAAKs1C,KAAM9zC,IAC7B,IAAK,IAAIkB,EAAI,EAAGA,EAAI1C,KAAK84C,QAASp2C,IAChC1C,KAAK8M,IAAItL,EAAGkB,EAAG1C,KAAKiG,IAAIzE,EAAGkB,GAAKu3C,EAAOv3C,IAG3C,OAAO1C,IACT,CAEA+9C,aAAa9D,GACXA,EAASD,GAAeh6C,KAAMi6C,GAC9B,IAAK,IAAIz4C,EAAI,EAAGA,EAAIxB,KAAKs1C,KAAM9zC,IAC7B,IAAK,IAAIkB,EAAI,EAAGA,EAAI1C,KAAK84C,QAASp2C,IAChC1C,KAAK8M,IAAItL,EAAGkB,EAAG1C,KAAKiG,IAAIzE,EAAGkB,GAAKu3C,EAAOv3C,IAG3C,OAAO1C,IACT,CAEAg+C,gBAAgB/D,GACdA,EAASE,GAAkBn6C,KAAMi6C,GACjC,IAAK,IAAIz4C,EAAI,EAAGA,EAAIxB,KAAKs1C,KAAM9zC,IAC7B,IAAK,IAAIkB,EAAI,EAAGA,EAAI1C,KAAK84C,QAASp2C,IAChC1C,KAAK8M,IAAItL,EAAGkB,EAAG1C,KAAKiG,IAAIzE,EAAGkB,GAAKu3C,EAAOz4C,IAG3C,OAAOxB,IACT,CAEAi+C,gBAAgBhE,GACdA,EAASE,GAAkBn6C,KAAMi6C,GACjC,IAAK,IAAIz4C,EAAI,EAAGA,EAAIxB,KAAKs1C,KAAM9zC,IAC7B,IAAK,IAAIkB,EAAI,EAAGA,EAAI1C,KAAK84C,QAASp2C,IAChC1C,KAAK8M,IAAItL,EAAGkB,EAAG1C,KAAKiG,IAAIzE,EAAGkB,GAAKu3C,EAAOz4C,IAG3C,OAAOxB,IACT,CAEAk+C,gBAAgBjE,GACdA,EAASE,GAAkBn6C,KAAMi6C,GACjC,IAAK,IAAIz4C,EAAI,EAAGA,EAAIxB,KAAKs1C,KAAM9zC,IAC7B,IAAK,IAAIkB,EAAI,EAAGA,EAAI1C,KAAK84C,QAASp2C,IAChC1C,KAAK8M,IAAItL,EAAGkB,EAAG1C,KAAKiG,IAAIzE,EAAGkB,GAAKu3C,EAAOz4C,IAG3C,OAAOxB,IACT,CAEAm+C,gBAAgBlE,GACdA,EAASE,GAAkBn6C,KAAMi6C,GACjC,IAAK,IAAIz4C,EAAI,EAAGA,EAAIxB,KAAKs1C,KAAM9zC,IAC7B,IAAK,IAAIkB,EAAI,EAAGA,EAAI1C,KAAK84C,QAASp2C,IAChC1C,KAAK8M,IAAItL,EAAGkB,EAAG1C,KAAKiG,IAAIzE,EAAGkB,GAAKu3C,EAAOz4C,IAG3C,OAAOxB,IACT,CAEAo+C,OAAOhhC,EAAO5V,GACZqyC,GAAc75C,KAAMod,GACpB,IAAK,IAAI5b,EAAI,EAAGA,EAAIxB,KAAK84C,QAASt3C,IAChCxB,KAAK8M,IAAIsQ,EAAO5b,EAAGxB,KAAKiG,IAAImX,EAAO5b,GAAKgG,GAE1C,OAAOxH,IACT,CAEAq+C,UAAUjhC,EAAO5V,GACfuyC,GAAiB/5C,KAAMod,GACvB,IAAK,IAAI5b,EAAI,EAAGA,EAAIxB,KAAKs1C,KAAM9zC,IAC7BxB,KAAK8M,IAAItL,EAAG4b,EAAOpd,KAAKiG,IAAIzE,EAAG4b,GAAS5V,GAE1C,OAAOxH,IACT,CAEA+O,IAAIuvC,GACF,GAAIt+C,KAAK46C,UACP,OAAOrjC,IAET,OAAQ+mC,GACN,IAAK,MAAO,CACV,MAAMvvC,EAAM,IAAInN,MAAM5B,KAAKs1C,MAAM1gB,KAAK1G,OAAO0P,mBAC7C,IAAK,IAAIxyB,EAAM,EAAGA,EAAMpL,KAAKs1C,KAAMlqC,IACjC,IAAK,IAAIgwC,EAAS,EAAGA,EAASp7C,KAAK84C,QAASsC,IACtCp7C,KAAKiG,IAAImF,EAAKgwC,GAAUrsC,EAAI3D,KAC9B2D,EAAI3D,GAAOpL,KAAKiG,IAAImF,EAAKgwC,IAI/B,OAAOrsC,CACT,CACA,IAAK,SAAU,CACb,MAAMA,EAAM,IAAInN,MAAM5B,KAAK84C,SAASlkB,KAAK1G,OAAO0P,mBAChD,IAAK,IAAIxyB,EAAM,EAAGA,EAAMpL,KAAKs1C,KAAMlqC,IACjC,IAAK,IAAIgwC,EAAS,EAAGA,EAASp7C,KAAK84C,QAASsC,IACtCp7C,KAAKiG,IAAImF,EAAKgwC,GAAUrsC,EAAIqsC,KAC9BrsC,EAAIqsC,GAAUp7C,KAAKiG,IAAImF,EAAKgwC,IAIlC,OAAOrsC,CACT,CACA,UAAKvM,EAAW,CACd,IAAIuM,EAAM/O,KAAKiG,IAAI,EAAG,GACtB,IAAK,IAAImF,EAAM,EAAGA,EAAMpL,KAAKs1C,KAAMlqC,IACjC,IAAK,IAAIgwC,EAAS,EAAGA,EAASp7C,KAAK84C,QAASsC,IACtCp7C,KAAKiG,IAAImF,EAAKgwC,GAAUrsC,IAC1BA,EAAM/O,KAAKiG,IAAImF,EAAKgwC,IAI1B,OAAOrsC,CACT,CACA,QACE,MAAM,IAAI1K,MAAM,mBAAmBi6C,KAEzC,CAEAC,WACE5D,GAAc36C,MACd,IAAI0I,EAAI1I,KAAKiG,IAAI,EAAG,GAChBu4C,EAAM,CAAC,EAAG,GACd,IAAK,IAAIh9C,EAAI,EAAGA,EAAIxB,KAAKs1C,KAAM9zC,IAC7B,IAAK,IAAIkB,EAAI,EAAGA,EAAI1C,KAAK84C,QAASp2C,IAC5B1C,KAAKiG,IAAIzE,EAAGkB,GAAKgG,IACnBA,EAAI1I,KAAKiG,IAAIzE,EAAGkB,GAChB87C,EAAI,GAAKh9C,EACTg9C,EAAI,GAAK97C,GAIf,OAAO87C,CACT,CAEAntC,IAAIitC,GACF,GAAIt+C,KAAK46C,UACP,OAAOrjC,IAGT,OAAQ+mC,GACN,IAAK,MAAO,CACV,MAAMjtC,EAAM,IAAIzP,MAAM5B,KAAKs1C,MAAM1gB,KAAK1G,OAAOsP,mBAC7C,IAAK,IAAIpyB,EAAM,EAAGA,EAAMpL,KAAKs1C,KAAMlqC,IACjC,IAAK,IAAIgwC,EAAS,EAAGA,EAASp7C,KAAK84C,QAASsC,IACtCp7C,KAAKiG,IAAImF,EAAKgwC,GAAU/pC,EAAIjG,KAC9BiG,EAAIjG,GAAOpL,KAAKiG,IAAImF,EAAKgwC,IAI/B,OAAO/pC,CACT,CACA,IAAK,SAAU,CACb,MAAMA,EAAM,IAAIzP,MAAM5B,KAAK84C,SAASlkB,KAAK1G,OAAOsP,mBAChD,IAAK,IAAIpyB,EAAM,EAAGA,EAAMpL,KAAKs1C,KAAMlqC,IACjC,IAAK,IAAIgwC,EAAS,EAAGA,EAASp7C,KAAK84C,QAASsC,IACtCp7C,KAAKiG,IAAImF,EAAKgwC,GAAU/pC,EAAI+pC,KAC9B/pC,EAAI+pC,GAAUp7C,KAAKiG,IAAImF,EAAKgwC,IAIlC,OAAO/pC,CACT,CACA,UAAK7O,EAAW,CACd,IAAI6O,EAAMrR,KAAKiG,IAAI,EAAG,GACtB,IAAK,IAAImF,EAAM,EAAGA,EAAMpL,KAAKs1C,KAAMlqC,IACjC,IAAK,IAAIgwC,EAAS,EAAGA,EAASp7C,KAAK84C,QAASsC,IACtCp7C,KAAKiG,IAAImF,EAAKgwC,GAAU/pC,IAC1BA,EAAMrR,KAAKiG,IAAImF,EAAKgwC,IAI1B,OAAO/pC,CACT,CACA,QACE,MAAM,IAAIhN,MAAM,mBAAmBi6C,KAEzC,CAEAG,WACE9D,GAAc36C,MACd,IAAI0I,EAAI1I,KAAKiG,IAAI,EAAG,GAChBu4C,EAAM,CAAC,EAAG,GACd,IAAK,IAAIh9C,EAAI,EAAGA,EAAIxB,KAAKs1C,KAAM9zC,IAC7B,IAAK,IAAIkB,EAAI,EAAGA,EAAI1C,KAAK84C,QAASp2C,IAC5B1C,KAAKiG,IAAIzE,EAAGkB,GAAKgG,IACnBA,EAAI1I,KAAKiG,IAAIzE,EAAGkB,GAChB87C,EAAI,GAAKh9C,EACTg9C,EAAI,GAAK97C,GAIf,OAAO87C,CACT,CAEA/B,OAAOrxC,GAEL,GADAyuC,GAAc75C,KAAMoL,GAChBpL,KAAK46C,UACP,OAAOrjC,IAET,IAAI7O,EAAI1I,KAAKiG,IAAImF,EAAK,GACtB,IAAK,IAAI5J,EAAI,EAAGA,EAAIxB,KAAK84C,QAASt3C,IAC5BxB,KAAKiG,IAAImF,EAAK5J,GAAKkH,IACrBA,EAAI1I,KAAKiG,IAAImF,EAAK5J,IAGtB,OAAOkH,CACT,CAEAg2C,YAAYtzC,GACVyuC,GAAc75C,KAAMoL,GACpBuvC,GAAc36C,MACd,IAAI0I,EAAI1I,KAAKiG,IAAImF,EAAK,GAClBozC,EAAM,CAACpzC,EAAK,GAChB,IAAK,IAAI5J,EAAI,EAAGA,EAAIxB,KAAK84C,QAASt3C,IAC5BxB,KAAKiG,IAAImF,EAAK5J,GAAKkH,IACrBA,EAAI1I,KAAKiG,IAAImF,EAAK5J,GAClBg9C,EAAI,GAAKh9C,GAGb,OAAOg9C,CACT,CAEAG,OAAOvzC,GAEL,GADAyuC,GAAc75C,KAAMoL,GAChBpL,KAAK46C,UACP,OAAOrjC,IAET,IAAI7O,EAAI1I,KAAKiG,IAAImF,EAAK,GACtB,IAAK,IAAI5J,EAAI,EAAGA,EAAIxB,KAAK84C,QAASt3C,IAC5BxB,KAAKiG,IAAImF,EAAK5J,GAAKkH,IACrBA,EAAI1I,KAAKiG,IAAImF,EAAK5J,IAGtB,OAAOkH,CACT,CAEAk2C,YAAYxzC,GACVyuC,GAAc75C,KAAMoL,GACpBuvC,GAAc36C,MACd,IAAI0I,EAAI1I,KAAKiG,IAAImF,EAAK,GAClBozC,EAAM,CAACpzC,EAAK,GAChB,IAAK,IAAI5J,EAAI,EAAGA,EAAIxB,KAAK84C,QAASt3C,IAC5BxB,KAAKiG,IAAImF,EAAK5J,GAAKkH,IACrBA,EAAI1I,KAAKiG,IAAImF,EAAK5J,GAClBg9C,EAAI,GAAKh9C,GAGb,OAAOg9C,CACT,CAEAK,UAAUzD,GAER,GADArB,GAAiB/5C,KAAMo7C,GACnBp7C,KAAK46C,UACP,OAAOrjC,IAET,IAAI7O,EAAI1I,KAAKiG,IAAI,EAAGm1C,GACpB,IAAK,IAAI55C,EAAI,EAAGA,EAAIxB,KAAKs1C,KAAM9zC,IACzBxB,KAAKiG,IAAIzE,EAAG45C,GAAU1yC,IACxBA,EAAI1I,KAAKiG,IAAIzE,EAAG45C,IAGpB,OAAO1yC,CACT,CAEAo2C,eAAe1D,GACbrB,GAAiB/5C,KAAMo7C,GACvBT,GAAc36C,MACd,IAAI0I,EAAI1I,KAAKiG,IAAI,EAAGm1C,GAChBoD,EAAM,CAAC,EAAGpD,GACd,IAAK,IAAI55C,EAAI,EAAGA,EAAIxB,KAAKs1C,KAAM9zC,IACzBxB,KAAKiG,IAAIzE,EAAG45C,GAAU1yC,IACxBA,EAAI1I,KAAKiG,IAAIzE,EAAG45C,GAChBoD,EAAI,GAAKh9C,GAGb,OAAOg9C,CACT,CAEAO,UAAU3D,GAER,GADArB,GAAiB/5C,KAAMo7C,GACnBp7C,KAAK46C,UACP,OAAOrjC,IAET,IAAI7O,EAAI1I,KAAKiG,IAAI,EAAGm1C,GACpB,IAAK,IAAI55C,EAAI,EAAGA,EAAIxB,KAAKs1C,KAAM9zC,IACzBxB,KAAKiG,IAAIzE,EAAG45C,GAAU1yC,IACxBA,EAAI1I,KAAKiG,IAAIzE,EAAG45C,IAGpB,OAAO1yC,CACT,CAEAs2C,eAAe5D,GACbrB,GAAiB/5C,KAAMo7C,GACvBT,GAAc36C,MACd,IAAI0I,EAAI1I,KAAKiG,IAAI,EAAGm1C,GAChBoD,EAAM,CAAC,EAAGpD,GACd,IAAK,IAAI55C,EAAI,EAAGA,EAAIxB,KAAKs1C,KAAM9zC,IACzBxB,KAAKiG,IAAIzE,EAAG45C,GAAU1yC,IACxBA,EAAI1I,KAAKiG,IAAIzE,EAAG45C,GAChBoD,EAAI,GAAKh9C,GAGb,OAAOg9C,CACT,CAEAS,OACE,IAAI5tC,EAAMpD,KAAKoD,IAAIrR,KAAKs1C,KAAMt1C,KAAK84C,SAC/BmG,EAAO,GACX,IAAK,IAAIz9C,EAAI,EAAGA,EAAI6P,EAAK7P,IACvBy9C,EAAKz+C,KAAKR,KAAKiG,IAAIzE,EAAGA,IAExB,OAAOy9C,CACT,CAEAC,KAAKl7C,EAAO,aACV,IAAIO,EAAS,EACb,GAAa,QAATP,EACF,OAAOhE,KAAK+O,MACP,GAAa,cAAT/K,EAAsB,CAC/B,IAAK,IAAIxC,EAAI,EAAGA,EAAIxB,KAAKs1C,KAAM9zC,IAC7B,IAAK,IAAIkB,EAAI,EAAGA,EAAI1C,KAAK84C,QAASp2C,IAChC6B,GAAkBvE,KAAKiG,IAAIzE,EAAGkB,GAAK1C,KAAKiG,IAAIzE,EAAGkB,GAGnD,OAAOuL,KAAKC,KAAK3J,EACnB,CACE,MAAM,IAAI2zC,WAAW,sBAAsBl0C,IAE/C,CAEAm7C,gBACE,IAAIjqB,EAAM,EACV,IAAK,IAAI1zB,EAAI,EAAGA,EAAIxB,KAAKs1C,KAAM9zC,IAC7B,IAAK,IAAIkB,EAAI,EAAGA,EAAI1C,KAAK84C,QAASp2C,IAChCwyB,GAAOl1B,KAAKiG,IAAIzE,EAAGkB,GACnB1C,KAAK8M,IAAItL,EAAGkB,EAAGwyB,GAGnB,OAAOl1B,IACT,CAEAo/C,IAAIC,GACExE,GAAeY,SAAS4D,KAAUA,EAAUA,EAAQnF,aACxD,IAAIoF,EAAUt/C,KAAKk6C,YACnB,GAAIoF,EAAQ59C,SAAW29C,EAAQ39C,OAC7B,MAAM,IAAIw2C,WAAW,qCAEvB,IAAIkH,EAAM,EACV,IAAK,IAAI59C,EAAI,EAAGA,EAAI89C,EAAQ59C,OAAQF,IAClC49C,GAAOE,EAAQ99C,GAAK69C,EAAQ79C,GAE9B,OAAO49C,CACT,CAEAG,KAAK7uB,GACHA,EAAQyqB,GAAOK,YAAY9qB,GAE3B,IAAI5nB,EAAI9I,KAAKs1C,KACT7vC,EAAIzF,KAAK84C,QACTxyC,EAAIoqB,EAAMooB,QAEVv0C,EAAS,IAAI42C,GAAOryC,EAAGxC,GAEvBk5C,EAAQ,IAAI/W,aAAahjC,GAC7B,IAAK,IAAI/C,EAAI,EAAGA,EAAI4D,EAAG5D,IAAK,CAC1B,IAAK,IAAI4H,EAAI,EAAGA,EAAI7E,EAAG6E,IACrBk1C,EAAMl1C,GAAKomB,EAAMzqB,IAAIqE,EAAG5H,GAG1B,IAAK,IAAIlB,EAAI,EAAGA,EAAIsH,EAAGtH,IAAK,CAC1B,IAAIqF,EAAI,EACR,IAAK,IAAIyD,EAAI,EAAGA,EAAI7E,EAAG6E,IACrBzD,GAAK7G,KAAKiG,IAAIzE,EAAG8I,GAAKk1C,EAAMl1C,GAG9B/F,EAAOuI,IAAItL,EAAGkB,EAAGmE,EACnB,CACF,CACA,OAAOtC,CACT,CAEAk7C,YAAY/uB,GACVA,EAAQyqB,GAAOK,YAAY9qB,GAC3B,IAAInsB,EAAS,IAAI42C,GAAO,EAAG,GAC3B,MAAMuE,EAAM1/C,KAAKiG,IAAI,EAAG,GAClB05C,EAAMjvB,EAAMzqB,IAAI,EAAG,GACnB25C,EAAM5/C,KAAKiG,IAAI,EAAG,GAClB45C,EAAMnvB,EAAMzqB,IAAI,EAAG,GACnB65C,EAAM9/C,KAAKiG,IAAI,EAAG,GAClB85C,EAAMrvB,EAAMzqB,IAAI,EAAG,GACnB+5C,EAAMhgD,KAAKiG,IAAI,EAAG,GAClBg6C,EAAMvvB,EAAMzqB,IAAI,EAAG,GAGnBi6C,GAAMR,EAAMM,IAAQL,EAAMM,GAC1BE,GAAML,EAAME,GAAOL,EACnBS,EAAKV,GAAOG,EAAMI,GAClBI,EAAKL,GAAOD,EAAMJ,GAClBW,GAAMZ,EAAME,GAAOK,EAKnBM,EAAML,EAAKG,EAAKC,GAHVV,EAAMI,IAAQD,EAAME,GAI1BO,EAAMJ,EAAKE,EACXG,EAAMN,EAAKE,EACXK,EAAMR,EAAKC,EAAKC,GAPVN,EAAMJ,IAAQC,EAAME,GAahC,OAJAt7C,EAAOuI,IAAI,EAAG,EAAGyzC,GACjBh8C,EAAOuI,IAAI,EAAG,EAAG0zC,GACjBj8C,EAAOuI,IAAI,EAAG,EAAG2zC,GACjBl8C,EAAOuI,IAAI,EAAG,EAAG4zC,GACVn8C,CACT,CAEAo8C,YAAYjwB,GACVA,EAAQyqB,GAAOK,YAAY9qB,GAC3B,IAAInsB,EAAS,IAAI42C,GAAO,EAAG,GAE3B,MAAMyF,EAAM5gD,KAAKiG,IAAI,EAAG,GAClB46C,EAAM7gD,KAAKiG,IAAI,EAAG,GAClB66C,EAAM9gD,KAAKiG,IAAI,EAAG,GAClB86C,EAAM/gD,KAAKiG,IAAI,EAAG,GAClBy5C,EAAM1/C,KAAKiG,IAAI,EAAG,GAClB25C,EAAM5/C,KAAKiG,IAAI,EAAG,GAClB+6C,EAAMhhD,KAAKiG,IAAI,EAAG,GAClB65C,EAAM9/C,KAAKiG,IAAI,EAAG,GAClB+5C,EAAMhgD,KAAKiG,IAAI,EAAG,GAElBg7C,EAAMvwB,EAAMzqB,IAAI,EAAG,GACnBi7C,EAAMxwB,EAAMzqB,IAAI,EAAG,GACnBk7C,EAAMzwB,EAAMzqB,IAAI,EAAG,GACnBm7C,EAAM1wB,EAAMzqB,IAAI,EAAG,GACnB05C,EAAMjvB,EAAMzqB,IAAI,EAAG,GACnB45C,EAAMnvB,EAAMzqB,IAAI,EAAG,GACnBo7C,EAAM3wB,EAAMzqB,IAAI,EAAG,GACnB85C,EAAMrvB,EAAMzqB,IAAI,EAAG,GACnBg6C,EAAMvvB,EAAMzqB,IAAI,EAAG,GAGnBk6C,GAAMS,EAAMG,KAASG,EAAMvB,GAE3BU,IAAOO,EAAMG,EAAMrB,IAAQuB,EAAMC,EAAMvB,GACvCW,GAAMS,EAAMrB,KAASuB,EAAMC,GAC3BI,EAAKV,EAAMK,EACXM,IAAOX,EAAMI,EAAMlB,IAAQmB,EAAME,EAAMtB,GACvC2B,IAAOZ,EAAMI,IAAQG,EAAMtB,GAC3B4B,GAAMT,EAAMlB,KAASmB,EAAME,GAG3BO,IAAQZ,EAAMhB,EAAME,IAAQL,EAAM0B,EAAMtB,GACxC4B,GAAOb,EAAMd,IAAQL,EAAMI,GAC3B6B,EAAMd,EAAMO,EACZQ,GAAO/B,EAAME,KAASqB,EAAMtB,GAC5B+B,IAAQhB,EAAMpB,EAAME,IAAQC,EAAMwB,EAAMpB,GACxC8B,GAAOjB,EAAMlB,IAAQC,EAAMI,GAC3B+B,GAAOtC,EAAME,KAASyB,EAAMpB,GAO5BM,EAAMe,EAAKM,EANLf,EAAMO,EAOZZ,GAzBMI,EAAMC,EAAMC,EAAMC,EAAMrB,EAAMI,EAAME,GAAOL,EAyBtCU,EAAKC,EAAKgB,EAAKI,EAAME,EAAMC,EACtCI,EAAMX,EAAKC,EAAKE,GAjBTb,EAAMC,EAAMC,EAAMpB,EAAME,EAAMoB,EAAMlB,GAAOD,EAiBvB+B,EAAME,EAAME,EACvCvB,EAAMN,EAzBDT,IAAQuB,EAAMC,EAAME,EAAMzB,EAAME,EAAMwB,EAAMpB,GAyBjCI,EAAKiB,EAAKM,EAAME,EAAMC,EACtCrB,EAAMP,EAAKE,EAAKC,EAAKgB,EATf1B,EAAMG,EAUZmC,EAAMN,EAAME,EAAMC,EAAMC,EATlBjB,EAAMI,EAUZgB,EAAMb,EAAKC,EAAKC,EApBV1B,IAAQmB,EAAME,EAAMC,EAAMzB,EAAME,EAAMwB,EAAMtB,GAoBvB2B,EAAMC,EAAMC,EACvCQ,EAAMV,EAAMC,EAAMC,EAAMC,EAVlBb,EAAME,EAWZmB,EAAMf,EAAKC,EAAKC,EAAKC,EAVfzB,EAAMC,EAqBlB,OATA17C,EAAOuI,IAAI,EAAG,EAAGyzC,GACjBh8C,EAAOuI,IAAI,EAAG,EAAG0zC,GACjBj8C,EAAOuI,IAAI,EAAG,EAAGm1C,GACjB19C,EAAOuI,IAAI,EAAG,EAAG2zC,GACjBl8C,EAAOuI,IAAI,EAAG,EAAG4zC,GACjBn8C,EAAOuI,IAAI,EAAG,EAAGo1C,GACjB39C,EAAOuI,IAAI,EAAG,EAAGq1C,GACjB59C,EAAOuI,IAAI,EAAG,EAAGs1C,GACjB79C,EAAOuI,IAAI,EAAG,EAAGu1C,GACV99C,CACT,CAEA+9C,aAAat6C,GACXA,EAAImzC,GAAOK,YAAYxzC,GACvB,IAAIgE,EAAIhM,KAAKmO,QACTo0C,EAAKv2C,EAAEspC,KACPkN,EAAKx2C,EAAE8sC,QACP2J,EAAKz6C,EAAEstC,KACPoN,EAAK16C,EAAE8wC,QAUX,SAAS6J,EAAMC,EAAKtN,EAAMC,GACxB,IAAIxsC,EAAI65C,EAAItN,KACR5xC,EAAIk/C,EAAI9J,QACZ,GAAI/vC,IAAMusC,GAAQ5xC,IAAM6xC,EACtB,OAAOqN,EACF,CACL,IAAIC,EAAWhI,GAAeQ,MAAM/F,EAAMC,GAE1C,OADAsN,EAAWA,EAASlG,aAAaiG,EAAK,EAAG,GAClCC,CACT,CACF,CAnBIL,IAAOC,GAET/+B,QAAQC,KACN,eAAe4+B,OAAQC,SAAUC,OAAQC,sCAsB7C,IAAI35C,EAAIkF,KAAKc,IAAIwzC,EAAIE,GACjB/+C,EAAIuK,KAAKc,IAAIyzC,EAAIE,GAiFrB,OAhFA12C,EAAI22C,EAAM32C,EAAGjD,EAAGrF,GAIhB,SAASo/C,EAAU79C,EAAGC,EAAGowC,EAAMC,GAE7B,GAAID,GAAQ,KAAOC,GAAQ,IACzB,OAAOtwC,EAAEs6C,KAAKr6C,GAIZowC,EAAO,GAAM,GAAKC,EAAO,GAAM,GACjCtwC,EAAI09C,EAAM19C,EAAGqwC,EAAO,EAAGC,EAAO,GAC9BrwC,EAAIy9C,EAAMz9C,EAAGowC,EAAO,EAAGC,EAAO,IACrBD,EAAO,GAAM,GACtBrwC,EAAI09C,EAAM19C,EAAGqwC,EAAO,EAAGC,GACvBrwC,EAAIy9C,EAAMz9C,EAAGowC,EAAO,EAAGC,IACdA,EAAO,GAAM,IACtBtwC,EAAI09C,EAAM19C,EAAGqwC,EAAMC,EAAO,GAC1BrwC,EAAIy9C,EAAMz9C,EAAGowC,EAAMC,EAAO,IAG5B,IAAIwN,EAAWC,SAAS/9C,EAAEqwC,KAAO,EAAG,IAChC2N,EAAWD,SAAS/9C,EAAE6zC,QAAU,EAAG,IAEnC4G,EAAMz6C,EAAEi+C,UAAU,EAAGH,EAAW,EAAG,EAAGE,EAAW,GACjDtD,EAAMz6C,EAAEg+C,UAAU,EAAGH,EAAW,EAAG,EAAGE,EAAW,GAEjDrD,EAAM36C,EAAEi+C,UAAU,EAAGH,EAAW,EAAGE,EAAUh+C,EAAE6zC,QAAU,GACzD+G,EAAM36C,EAAEg+C,UAAU,EAAGH,EAAW,EAAGE,EAAU/9C,EAAE4zC,QAAU,GAEzDgH,EAAM76C,EAAEi+C,UAAUH,EAAU99C,EAAEqwC,KAAO,EAAG,EAAG2N,EAAW,GACtDlD,EAAM76C,EAAEg+C,UAAUH,EAAU79C,EAAEowC,KAAO,EAAG,EAAG2N,EAAW,GAEtDjD,EAAM/6C,EAAEi+C,UAAUH,EAAU99C,EAAEqwC,KAAO,EAAG2N,EAAUh+C,EAAE6zC,QAAU,GAC9DmH,EAAM/6C,EAAEg+C,UAAUH,EAAU79C,EAAEowC,KAAO,EAAG2N,EAAU/9C,EAAE4zC,QAAU,GAG9DoH,EAAK4C,EACPjI,GAAejjC,IAAI8nC,EAAKM,GACxBnF,GAAejjC,IAAI+nC,EAAKM,GACxB8C,EACAE,GAEE9C,EAAK2C,EAAUjI,GAAejjC,IAAIkoC,EAAKE,GAAML,EAAKoD,EAAUE,GAC5D7C,EAAK0C,EAAUpD,EAAK7E,GAAesI,IAAItD,EAAKI,GAAM8C,EAAUE,GAC5D5C,EAAKyC,EAAU9C,EAAKnF,GAAesI,IAAIpD,EAAKJ,GAAMoD,EAAUE,GAC5D3C,EAAKwC,EAAUjI,GAAejjC,IAAI8nC,EAAKE,GAAMK,EAAK8C,EAAUE,GAC5D3B,EAAKwB,EACPjI,GAAesI,IAAIrD,EAAKJ,GACxB7E,GAAejjC,IAAI+nC,EAAKE,GACxBkD,EACAE,GAEE1B,EAAKuB,EACPjI,GAAesI,IAAIvD,EAAKI,GACxBnF,GAAejjC,IAAImoC,EAAKE,GACxB8C,EACAE,GAIEvC,EAAM7F,GAAejjC,IAAIsoC,EAAIG,GACjCK,EAAIyC,IAAI7C,GACRI,EAAI9oC,IAAI2pC,GACR,IAAIW,EAAMrH,GAAejjC,IAAIwoC,EAAIE,GAC7B8B,EAAMvH,GAAejjC,IAAIuoC,EAAIE,GAC7BgC,EAAMxH,GAAesI,IAAIjD,EAAIC,GACjCkC,EAAIzqC,IAAIwoC,GACRiC,EAAIzqC,IAAI0pC,GAGR,IAAIuB,EAAWhI,GAAeQ,MAAM,EAAIqF,EAAIpL,KAAM,EAAIoL,EAAI5H,SAK1D,OAJA+J,EAAWA,EAASlG,aAAa+D,EAAK,EAAG,GACzCmC,EAAWA,EAASlG,aAAauF,EAAKxB,EAAIpL,KAAM,GAChDuN,EAAWA,EAASlG,aAAayF,EAAK,EAAG1B,EAAI5H,SAC7C+J,EAAWA,EAASlG,aAAa0F,EAAK3B,EAAIpL,KAAMoL,EAAI5H,SAC7C+J,EAASK,UAAU,EAAG5N,EAAO,EAAG,EAAGC,EAAO,EACnD,CAEOuN,CAAU92C,EA/EjBhE,EAAI26C,EAAM36C,EAAGe,EAAGrF,GA+EOqF,EAAGrF,EAC5B,CAEA0/C,UAAU3yC,EAAU,CAAC,GACnB,GAAuB,iBAAZA,EACT,MAAM,IAAIrQ,UAAU,6BAEtB,MAAM,IAAEiR,EAAM,EAAC,IAAEtC,EAAM,GAAM0B,EAC7B,IAAKyd,OAAOm1B,SAAShyC,GAAM,MAAM,IAAIjR,UAAU,wBAC/C,IAAK8tB,OAAOm1B,SAASt0C,GAAM,MAAM,IAAI3O,UAAU,wBAC/C,GAAIiR,GAAOtC,EAAK,MAAM,IAAImpC,WAAW,gCACrC,IAAIgD,EAAY,IAAIC,GAAOn7C,KAAKs1C,KAAMt1C,KAAK84C,SAC3C,IAAK,IAAIt3C,EAAI,EAAGA,EAAIxB,KAAKs1C,KAAM9zC,IAAK,CAClC,MAAM4J,EAAMpL,KAAK88C,OAAOt7C,GACpB4J,EAAI1J,OAAS,GACf41C,GAAQlsC,EAAK,CAAEiG,MAAKtC,MAAKyoC,OAAQpsC,IAEnC8vC,EAAU+B,OAAOz7C,EAAG4J,EACtB,CACA,OAAO8vC,CACT,CAEAoI,aAAa7yC,EAAU,CAAC,GACtB,GAAuB,iBAAZA,EACT,MAAM,IAAIrQ,UAAU,6BAEtB,MAAM,IAAEiR,EAAM,EAAC,IAAEtC,EAAM,GAAM0B,EAC7B,IAAKyd,OAAOm1B,SAAShyC,GAAM,MAAM,IAAIjR,UAAU,wBAC/C,IAAK8tB,OAAOm1B,SAASt0C,GAAM,MAAM,IAAI3O,UAAU,wBAC/C,GAAIiR,GAAOtC,EAAK,MAAM,IAAImpC,WAAW,gCACrC,IAAIgD,EAAY,IAAIC,GAAOn7C,KAAKs1C,KAAMt1C,KAAK84C,SAC3C,IAAK,IAAIt3C,EAAI,EAAGA,EAAIxB,KAAK84C,QAASt3C,IAAK,CACrC,MAAM45C,EAASp7C,KAAKq9C,UAAU77C,GAC1B45C,EAAO15C,QACT41C,GAAQ8D,EAAQ,CACd/pC,IAAKA,EACLtC,IAAKA,EACLyoC,OAAQ4D,IAGZF,EAAUsC,UAAUh8C,EAAG45C,EACzB,CACA,OAAOF,CACT,CAEAqI,WACE,MAAMC,EAASv1C,KAAK+D,KAAKhS,KAAK84C,QAAU,GACxC,IAAK,IAAIt3C,EAAI,EAAGA,EAAIxB,KAAKs1C,KAAM9zC,IAC7B,IAAK,IAAIkB,EAAI,EAAGA,EAAI8gD,EAAQ9gD,IAAK,CAC/B,IAAI+gD,EAAQzjD,KAAKiG,IAAIzE,EAAGkB,GACpByzB,EAAOn2B,KAAKiG,IAAIzE,EAAGxB,KAAK84C,QAAU,EAAIp2C,GAC1C1C,KAAK8M,IAAItL,EAAGkB,EAAGyzB,GACfn2B,KAAK8M,IAAItL,EAAGxB,KAAK84C,QAAU,EAAIp2C,EAAG+gD,EACpC,CAEF,OAAOzjD,IACT,CAEA0jD,cACE,MAAMF,EAASv1C,KAAK+D,KAAKhS,KAAKs1C,KAAO,GACrC,IAAK,IAAI5yC,EAAI,EAAGA,EAAI1C,KAAK84C,QAASp2C,IAChC,IAAK,IAAIlB,EAAI,EAAGA,EAAIgiD,EAAQhiD,IAAK,CAC/B,IAAIiiD,EAAQzjD,KAAKiG,IAAIzE,EAAGkB,GACpByzB,EAAOn2B,KAAKiG,IAAIjG,KAAKs1C,KAAO,EAAI9zC,EAAGkB,GACvC1C,KAAK8M,IAAItL,EAAGkB,EAAGyzB,GACfn2B,KAAK8M,IAAI9M,KAAKs1C,KAAO,EAAI9zC,EAAGkB,EAAG+gD,EACjC,CAEF,OAAOzjD,IACT,CAEA2jD,iBAAiBjzB,GACfA,EAAQyqB,GAAOK,YAAY9qB,GAE3B,IAAI5nB,EAAI9I,KAAKs1C,KACT7vC,EAAIzF,KAAK84C,QACTxyC,EAAIoqB,EAAM4kB,KACVj9B,EAAIqY,EAAMooB,QAEVv0C,EAAS,IAAI42C,GAAOryC,EAAIxC,EAAGb,EAAI4S,GACnC,IAAK,IAAI7W,EAAI,EAAGA,EAAIsH,EAAGtH,IACrB,IAAK,IAAIkB,EAAI,EAAGA,EAAI+C,EAAG/C,IACrB,IAAK,IAAI4H,EAAI,EAAGA,EAAIhE,EAAGgE,IACrB,IAAK,IAAI7I,EAAI,EAAGA,EAAI4W,EAAG5W,IACrB8C,EAAOuI,IAAIxG,EAAI9E,EAAI8I,EAAG+N,EAAI3V,EAAIjB,EAAGzB,KAAKiG,IAAIzE,EAAGkB,GAAKguB,EAAMzqB,IAAIqE,EAAG7I,IAKvE,OAAO8C,CACT,CAEAq/C,aAAalzB,GAEX,GADAA,EAAQyqB,GAAOK,YAAY9qB,IACtB1wB,KAAK+7C,aAAerrB,EAAMqrB,WAC7B,MAAM,IAAI13C,MAAM,2CAElB,IAAIyE,EAAI9I,KAAKs1C,KACT7vC,EAAIirB,EAAM4kB,KACVuO,EAAM7jD,KAAK2jD,iBAAiBxI,GAAO2I,IAAIr+C,EAAGA,IAC1Cs+C,EAAM5I,GAAO2I,IAAIh7C,EAAGA,GAAG66C,iBAAiBjzB,GAC5C,OAAOmzB,EAAIjsC,IAAImsC,EACjB,CAEAC,YACE,IAAIz/C,EAAS,IAAI42C,GAAOn7C,KAAK84C,QAAS94C,KAAKs1C,MAC3C,IAAK,IAAI9zC,EAAI,EAAGA,EAAIxB,KAAKs1C,KAAM9zC,IAC7B,IAAK,IAAIkB,EAAI,EAAGA,EAAI1C,KAAK84C,QAASp2C,IAChC6B,EAAOuI,IAAIpK,EAAGlB,EAAGxB,KAAKiG,IAAIzE,EAAGkB,IAGjC,OAAO6B,CACT,CAEA0/C,SAASC,EAAkBC,IACzB,IAAK,IAAI3iD,EAAI,EAAGA,EAAIxB,KAAKs1C,KAAM9zC,IAC7BxB,KAAKi9C,OAAOz7C,EAAGxB,KAAK88C,OAAOt7C,GAAGkQ,KAAKwyC,IAErC,OAAOlkD,IACT,CAEAokD,YAAYF,EAAkBC,IAC5B,IAAK,IAAI3iD,EAAI,EAAGA,EAAIxB,KAAK84C,QAASt3C,IAChCxB,KAAKw9C,UAAUh8C,EAAGxB,KAAKq9C,UAAU77C,GAAGkQ,KAAKwyC,IAE3C,OAAOlkD,IACT,CAEAkjD,UAAU7I,EAAUC,EAAQC,EAAaC,GACvCJ,GAAWp6C,KAAMq6C,EAAUC,EAAQC,EAAaC,GAChD,IAAIU,EAAY,IAAIC,GAClBb,EAASD,EAAW,EACpBG,EAAYD,EAAc,GAE5B,IAAK,IAAI/4C,EAAI64C,EAAU74C,GAAK84C,EAAQ94C,IAClC,IAAK,IAAIkB,EAAI63C,EAAa73C,GAAK83C,EAAW93C,IACxCw4C,EAAUpuC,IAAItL,EAAI64C,EAAU33C,EAAI63C,EAAav6C,KAAKiG,IAAIzE,EAAGkB,IAG7D,OAAOw4C,CACT,CAEAmJ,aAAaC,EAAS/J,EAAaC,GAGjC,QAFoBh4C,IAAhB+3C,IAA2BA,EAAc,QAC3B/3C,IAAdg4C,IAAyBA,EAAYx6C,KAAK84C,QAAU,GAEtDyB,EAAcC,GACdD,EAAc,GACdA,GAAev6C,KAAK84C,SACpB0B,EAAY,GACZA,GAAax6C,KAAK84C,QAElB,MAAM,IAAIZ,WAAW,yBAGvB,IAAIgD,EAAY,IAAIC,GAAOmJ,EAAQ5iD,OAAQ84C,EAAYD,EAAc,GACrE,IAAK,IAAI/4C,EAAI,EAAGA,EAAI8iD,EAAQ5iD,OAAQF,IAClC,IAAK,IAAIkB,EAAI63C,EAAa73C,GAAK83C,EAAW93C,IAAK,CAC7C,GAAI4hD,EAAQ9iD,GAAK,GAAK8iD,EAAQ9iD,IAAMxB,KAAKs1C,KACvC,MAAM,IAAI4C,WAAW,2BAA2BoM,EAAQ9iD,MAE1D05C,EAAUpuC,IAAItL,EAAGkB,EAAI63C,EAAav6C,KAAKiG,IAAIq+C,EAAQ9iD,GAAIkB,GACzD,CAEF,OAAOw4C,CACT,CAEAqJ,gBAAgBD,EAASjK,EAAUC,GAGjC,QAFiB93C,IAAb63C,IAAwBA,EAAW,QACxB73C,IAAX83C,IAAsBA,EAASt6C,KAAKs1C,KAAO,GAE7C+E,EAAWC,GACXD,EAAW,GACXA,GAAYr6C,KAAKs1C,MACjBgF,EAAS,GACTA,GAAUt6C,KAAKs1C,KAEf,MAAM,IAAI4C,WAAW,yBAGvB,IAAIgD,EAAY,IAAIC,GAAOb,EAASD,EAAW,EAAGiK,EAAQ5iD,QAC1D,IAAK,IAAIF,EAAI,EAAGA,EAAI8iD,EAAQ5iD,OAAQF,IAClC,IAAK,IAAIkB,EAAI23C,EAAU33C,GAAK43C,EAAQ53C,IAAK,CACvC,GAAI4hD,EAAQ9iD,GAAK,GAAK8iD,EAAQ9iD,IAAMxB,KAAK84C,QACvC,MAAM,IAAIZ,WAAW,8BAA8BoM,EAAQ9iD,MAE7D05C,EAAUpuC,IAAIpK,EAAI23C,EAAU74C,EAAGxB,KAAKiG,IAAIvD,EAAG4hD,EAAQ9iD,IACrD,CAEF,OAAO05C,CACT,CAEAyB,aAAahyC,EAAQ0vC,EAAUE,GAE7B,IADA5vC,EAASwwC,GAAOK,YAAY7wC,IACjBiwC,UACT,OAAO56C,KAITo6C,GAAWp6C,KAAMq6C,EAFJA,EAAW1vC,EAAO2qC,KAAO,EAEHiF,EADnBA,EAAc5vC,EAAOmuC,QAAU,GAE/C,IAAK,IAAIt3C,EAAI,EAAGA,EAAImJ,EAAO2qC,KAAM9zC,IAC/B,IAAK,IAAIkB,EAAI,EAAGA,EAAIiI,EAAOmuC,QAASp2C,IAClC1C,KAAK8M,IAAIutC,EAAW74C,EAAG+4C,EAAc73C,EAAGiI,EAAO1E,IAAIzE,EAAGkB,IAG1D,OAAO1C,IACT,CAEAwkD,UAAUC,EAAYC,ID7sCjB,SAAyB/5C,EAAQ85C,GACtC,IAAKtN,GAAWsN,GACd,MAAM,IAAIrkD,UAAU,gCAGtB,IAAK,IAAIoB,EAAI,EAAGA,EAAIijD,EAAW/iD,OAAQF,IACrC,GAAIijD,EAAWjjD,GAAK,GAAKijD,EAAWjjD,IAAMmJ,EAAO2qC,KAC/C,MAAM,IAAI4C,WAAW,+BAG3B,CCosCIyM,CAAgB3kD,KAAMykD,GDlsCnB,SAA4B95C,EAAQ+5C,GACzC,IAAKvN,GAAWuN,GACd,MAAM,IAAItkD,UAAU,mCAGtB,IAAK,IAAIoB,EAAI,EAAGA,EAAIkjD,EAAchjD,OAAQF,IACxC,GAAIkjD,EAAcljD,GAAK,GAAKkjD,EAAcljD,IAAMmJ,EAAOmuC,QACrD,MAAM,IAAIZ,WAAW,kCAG3B,CCyrCI0M,CAAmB5kD,KAAM0kD,GACzB,IAAIxJ,EAAY,IAAIC,GAAOsJ,EAAW/iD,OAAQgjD,EAAchjD,QAC5D,IAAK,IAAIF,EAAI,EAAGA,EAAIijD,EAAW/iD,OAAQF,IAAK,CAC1C,IAAIqjD,EAAWJ,EAAWjjD,GAC1B,IAAK,IAAIkB,EAAI,EAAGA,EAAIgiD,EAAchjD,OAAQgB,IAAK,CAC7C,IAAIoiD,EAAcJ,EAAchiD,GAChCw4C,EAAUpuC,IAAItL,EAAGkB,EAAG1C,KAAKiG,IAAI4+C,EAAUC,GACzC,CACF,CACA,OAAO5J,CACT,CAEA6J,QACE,IAAI1zC,EAAMpD,KAAKoD,IAAIrR,KAAKs1C,KAAMt1C,KAAK84C,SAC/BiM,EAAQ,EACZ,IAAK,IAAIvjD,EAAI,EAAGA,EAAI6P,EAAK7P,IACvBujD,GAAS/kD,KAAKiG,IAAIzE,EAAGA,GAEvB,OAAOujD,CACT,CAEA52C,QACE,IAAI+sC,EAAY,IAAIC,GAAOn7C,KAAKs1C,KAAMt1C,KAAK84C,SAC3C,IAAK,IAAI1tC,EAAM,EAAGA,EAAMpL,KAAKs1C,KAAMlqC,IACjC,IAAK,IAAIgwC,EAAS,EAAGA,EAASp7C,KAAK84C,QAASsC,IAC1CF,EAAUpuC,IAAI1B,EAAKgwC,EAAQp7C,KAAKiG,IAAImF,EAAKgwC,IAG7C,OAAOF,CACT,CAEAhmB,IAAIopB,GACF,OAAQA,GACN,IAAK,MACH,OCnzCD,SAAkB3zC,GACvB,IAAIuqB,EAAMwlB,GAAS/vC,EAAO2qC,MAC1B,IAAK,IAAI9zC,EAAI,EAAGA,EAAImJ,EAAO2qC,OAAQ9zC,EACjC,IAAK,IAAIkB,EAAI,EAAGA,EAAIiI,EAAOmuC,UAAWp2C,EACpCwyB,EAAI1zB,IAAMmJ,EAAO1E,IAAIzE,EAAGkB,GAG5B,OAAOwyB,CACT,CD2yCe8vB,CAAShlD,MAClB,IAAK,SACH,OC3yCD,SAAqB2K,GAC1B,IAAIuqB,EAAMwlB,GAAS/vC,EAAOmuC,SAC1B,IAAK,IAAIt3C,EAAI,EAAGA,EAAImJ,EAAO2qC,OAAQ9zC,EACjC,IAAK,IAAIkB,EAAI,EAAGA,EAAIiI,EAAOmuC,UAAWp2C,EACpCwyB,EAAIxyB,IAAMiI,EAAO1E,IAAIzE,EAAGkB,GAG5B,OAAOwyB,CACT,CDmyCe+vB,CAAYjlD,MACrB,UAAKwC,EACH,OCnyCD,SAAgBmI,GACrB,IAAIjC,EAAI,EACR,IAAK,IAAIlH,EAAI,EAAGA,EAAImJ,EAAO2qC,KAAM9zC,IAC/B,IAAK,IAAIkB,EAAI,EAAGA,EAAIiI,EAAOmuC,QAASp2C,IAClCgG,GAAKiC,EAAO1E,IAAIzE,EAAGkB,GAGvB,OAAOgG,CACT,CD2xCew8C,CAAOllD,MAChB,QACE,MAAM,IAAIqE,MAAM,mBAAmBi6C,KAEzC,CAEA6G,QAAQ7G,GACN,OAAQA,GACN,IAAK,MACH,OClyCD,SAAsB3zC,GAC3B,IAAIuqB,EAAMwlB,GAAS/vC,EAAO2qC,KAAM,GAChC,IAAK,IAAI9zC,EAAI,EAAGA,EAAImJ,EAAO2qC,OAAQ9zC,EACjC,IAAK,IAAIkB,EAAI,EAAGA,EAAIiI,EAAOmuC,UAAWp2C,EACpCwyB,EAAI1zB,IAAMmJ,EAAO1E,IAAIzE,EAAGkB,GAG5B,OAAOwyB,CACT,CD0xCekwB,CAAaplD,MACtB,IAAK,SACH,OC1xCD,SAAyB2K,GAC9B,IAAIuqB,EAAMwlB,GAAS/vC,EAAOmuC,QAAS,GACnC,IAAK,IAAIt3C,EAAI,EAAGA,EAAImJ,EAAO2qC,OAAQ9zC,EACjC,IAAK,IAAIkB,EAAI,EAAGA,EAAIiI,EAAOmuC,UAAWp2C,EACpCwyB,EAAIxyB,IAAMiI,EAAO1E,IAAIzE,EAAGkB,GAG5B,OAAOwyB,CACT,CDkxCemwB,CAAgBrlD,MACzB,UAAKwC,EACH,OClxCD,SAAoBmI,GACzB,IAAIjC,EAAI,EACR,IAAK,IAAIlH,EAAI,EAAGA,EAAImJ,EAAO2qC,KAAM9zC,IAC/B,IAAK,IAAIkB,EAAI,EAAGA,EAAIiI,EAAOmuC,QAASp2C,IAClCgG,GAAKiC,EAAO1E,IAAIzE,EAAGkB,GAGvB,OAAOgG,CACT,CD0wCe48C,CAAWtlD,MACpB,QACE,MAAM,IAAIqE,MAAM,mBAAmBi6C,KAEzC,CAEAiH,KAAKjH,GACH,MAAMppB,EAAMl1B,KAAKk1B,IAAIopB,GACrB,OAAQA,GACN,IAAK,MACH,IAAK,IAAI98C,EAAI,EAAGA,EAAIxB,KAAKs1C,KAAM9zC,IAC7B0zB,EAAI1zB,IAAMxB,KAAK84C,QAEjB,OAAO5jB,EAET,IAAK,SACH,IAAK,IAAI1zB,EAAI,EAAGA,EAAIxB,KAAK84C,QAASt3C,IAChC0zB,EAAI1zB,IAAMxB,KAAKs1C,KAEjB,OAAOpgB,EAET,UAAK1yB,EACH,OAAO0yB,EAAMl1B,KAAKoK,KACpB,QACE,MAAM,IAAI/F,MAAM,mBAAmBi6C,KAEzC,CAEAkH,SAASlH,EAAI7tC,EAAU,CAAC,GAKtB,GAJkB,iBAAP6tC,IACT7tC,EAAU6tC,EACVA,OAAK97C,GAEgB,iBAAZiO,EACT,MAAM,IAAIrQ,UAAU,6BAEtB,MAAM,SAAEqlD,GAAW,EAAI,KAAEF,EAAOvlD,KAAKulD,KAAKjH,IAAQ7tC,EAClD,GAAwB,kBAAbg1C,EACT,MAAM,IAAIrlD,UAAU,8BAEtB,OAAQk+C,GACN,IAAK,MACH,IAAKnH,GAAWoO,GACd,MAAM,IAAInlD,UAAU,yBAEtB,OCrzCD,SAAuBuK,EAAQ86C,EAAUF,GAC9C,MAAMjQ,EAAO3qC,EAAO2qC,KACdC,EAAO5qC,EAAOmuC,QACd0M,EAAW,GAEjB,IAAK,IAAIhkD,EAAI,EAAGA,EAAI8zC,EAAM9zC,IAAK,CAC7B,IAAIkkD,EAAO,EACPC,EAAO,EACP35C,EAAI,EACR,IAAK,IAAItJ,EAAI,EAAGA,EAAI6yC,EAAM7yC,IACxBsJ,EAAIrB,EAAO1E,IAAIzE,EAAGkB,GAAK6iD,EAAK/jD,GAC5BkkD,GAAQ15C,EACR25C,GAAQ35C,EAAIA,EAEVy5C,EACFD,EAAShlD,MAAMmlD,EAAQD,EAAOA,EAAQnQ,IAASA,EAAO,IAEtDiQ,EAAShlD,MAAMmlD,EAAQD,EAAOA,EAAQnQ,GAAQA,EAElD,CACA,OAAOiQ,CACT,CDgyCeI,CAAc5lD,KAAMylD,EAAUF,GAEvC,IAAK,SACH,IAAKpO,GAAWoO,GACd,MAAM,IAAInlD,UAAU,yBAEtB,OCpyCD,SAA0BuK,EAAQ86C,EAAUF,GACjD,MAAMjQ,EAAO3qC,EAAO2qC,KACdC,EAAO5qC,EAAOmuC,QACd0M,EAAW,GAEjB,IAAK,IAAI9iD,EAAI,EAAGA,EAAI6yC,EAAM7yC,IAAK,CAC7B,IAAIgjD,EAAO,EACPC,EAAO,EACP35C,EAAI,EACR,IAAK,IAAIxK,EAAI,EAAGA,EAAI8zC,EAAM9zC,IACxBwK,EAAIrB,EAAO1E,IAAIzE,EAAGkB,GAAK6iD,EAAK7iD,GAC5BgjD,GAAQ15C,EACR25C,GAAQ35C,EAAIA,EAEVy5C,EACFD,EAAShlD,MAAMmlD,EAAQD,EAAOA,EAAQpQ,IAASA,EAAO,IAEtDkQ,EAAShlD,MAAMmlD,EAAQD,EAAOA,EAAQpQ,GAAQA,EAElD,CACA,OAAOkQ,CACT,CD+wCeK,CAAiB7lD,KAAMylD,EAAUF,GAE1C,UAAK/iD,EACH,GAAoB,iBAAT+iD,EACT,MAAM,IAAInlD,UAAU,yBAEtB,OCnxCD,SAAqBuK,EAAQ86C,EAAUF,GAC5C,MAAMjQ,EAAO3qC,EAAO2qC,KACdC,EAAO5qC,EAAOmuC,QACd1uC,EAAOkrC,EAAOC,EAEpB,IAAImQ,EAAO,EACPC,EAAO,EACP35C,EAAI,EACR,IAAK,IAAIxK,EAAI,EAAGA,EAAI8zC,EAAM9zC,IACxB,IAAK,IAAIkB,EAAI,EAAGA,EAAI6yC,EAAM7yC,IACxBsJ,EAAIrB,EAAO1E,IAAIzE,EAAGkB,GAAK6iD,EACvBG,GAAQ15C,EACR25C,GAAQ35C,EAAIA,EAGhB,OAAIy5C,GACME,EAAQD,EAAOA,EAAQt7C,IAASA,EAAO,IAEvCu7C,EAAQD,EAAOA,EAAQt7C,GAAQA,CAE3C,CD+vCe07C,CAAY9lD,KAAMylD,EAAUF,GAErC,QACE,MAAM,IAAIlhD,MAAM,mBAAmBi6C,KAEzC,CAEAyH,kBAAkBzH,EAAI7tC,GACF,iBAAP6tC,IACT7tC,EAAU6tC,EACVA,OAAK97C,GAEP,MAAMgjD,EAAWxlD,KAAKwlD,SAASlH,EAAI7tC,GACnC,QAAWjO,IAAP87C,EACF,OAAOrwC,KAAKC,KAAKs3C,GAEjB,IAAK,IAAIhkD,EAAI,EAAGA,EAAIgkD,EAAS9jD,OAAQF,IACnCgkD,EAAShkD,GAAKyM,KAAKC,KAAKs3C,EAAShkD,IAEnC,OAAOgkD,CAEX,CAEA91C,OAAO4uC,EAAI7tC,EAAU,CAAC,GAKpB,GAJkB,iBAAP6tC,IACT7tC,EAAU6tC,EACVA,OAAK97C,GAEgB,iBAAZiO,EACT,MAAM,IAAIrQ,UAAU,6BAEtB,MAAM,OAAEsP,EAAS1P,KAAKulD,KAAKjH,IAAQ7tC,EACnC,OAAQ6tC,GACN,IAAK,MACH,IAAKnH,GAAWznC,GACd,MAAM,IAAItP,UAAU,2BAGtB,OCnyCD,SAAqBuK,EAAQ46C,GAClC,IAAK,IAAI/jD,EAAI,EAAGA,EAAImJ,EAAO2qC,KAAM9zC,IAC/B,IAAK,IAAIkB,EAAI,EAAGA,EAAIiI,EAAOmuC,QAASp2C,IAClCiI,EAAOmC,IAAItL,EAAGkB,EAAGiI,EAAO1E,IAAIzE,EAAGkB,GAAK6iD,EAAK/jD,GAG/C,CD4xCQwkD,CAAYhmD,KAAM0P,GACX1P,KAET,IAAK,SACH,IAAKm3C,GAAWznC,GACd,MAAM,IAAItP,UAAU,2BAGtB,OClyCD,SAAwBuK,EAAQ46C,GACrC,IAAK,IAAI/jD,EAAI,EAAGA,EAAImJ,EAAO2qC,KAAM9zC,IAC/B,IAAK,IAAIkB,EAAI,EAAGA,EAAIiI,EAAOmuC,QAASp2C,IAClCiI,EAAOmC,IAAItL,EAAGkB,EAAGiI,EAAO1E,IAAIzE,EAAGkB,GAAK6iD,EAAK7iD,GAG/C,CD2xCQujD,CAAejmD,KAAM0P,GACd1P,KAET,UAAKwC,EACH,GAAsB,iBAAXkN,EACT,MAAM,IAAItP,UAAU,2BAGtB,OCjyCD,SAAmBuK,EAAQ46C,GAChC,IAAK,IAAI/jD,EAAI,EAAGA,EAAImJ,EAAO2qC,KAAM9zC,IAC/B,IAAK,IAAIkB,EAAI,EAAGA,EAAIiI,EAAOmuC,QAASp2C,IAClCiI,EAAOmC,IAAItL,EAAGkB,EAAGiI,EAAO1E,IAAIzE,EAAGkB,GAAK6iD,EAG1C,CD0xCQW,CAAUlmD,KAAM0P,GACT1P,KAET,QACE,MAAM,IAAIqE,MAAM,mBAAmBi6C,KAEzC,CAEA6H,MAAM7H,EAAI7tC,EAAU,CAAC,GAKnB,GAJkB,iBAAP6tC,IACT7tC,EAAU6tC,EACVA,OAAK97C,GAEgB,iBAAZiO,EACT,MAAM,IAAIrQ,UAAU,6BAEtB,IAAI+lD,EAAQ11C,EAAQ01C,MACpB,OAAQ7H,GACN,IAAK,MACH,QAAc97C,IAAV2jD,EACFA,EC5yCH,SAAuBx7C,GAC5B,MAAMw7C,EAAQ,GACd,IAAK,IAAI3kD,EAAI,EAAGA,EAAImJ,EAAO2qC,KAAM9zC,IAAK,CACpC,IAAI0zB,EAAM,EACV,IAAK,IAAIxyB,EAAI,EAAGA,EAAIiI,EAAOmuC,QAASp2C,IAClCwyB,GAAOjnB,KAAKqO,IAAI3R,EAAO1E,IAAIzE,EAAGkB,GAAI,IAAMiI,EAAOmuC,QAAU,GAE3DqN,EAAM3lD,KAAKyN,KAAKC,KAAKgnB,GACvB,CACA,OAAOixB,CACT,CDkyCkBC,CAAcpmD,WACjB,IAAKm3C,GAAWgP,GACrB,MAAM,IAAI/lD,UAAU,0BAGtB,OCryCD,SAAoBuK,EAAQw7C,GACjC,IAAK,IAAI3kD,EAAI,EAAGA,EAAImJ,EAAO2qC,KAAM9zC,IAC/B,IAAK,IAAIkB,EAAI,EAAGA,EAAIiI,EAAOmuC,QAASp2C,IAClCiI,EAAOmC,IAAItL,EAAGkB,EAAGiI,EAAO1E,IAAIzE,EAAGkB,GAAKyjD,EAAM3kD,GAGhD,CD8xCQ6kD,CAAWrmD,KAAMmmD,GACVnmD,KAET,IAAK,SACH,QAAcwC,IAAV2jD,EACFA,ECjyCH,SAA0Bx7C,GAC/B,MAAMw7C,EAAQ,GACd,IAAK,IAAIzjD,EAAI,EAAGA,EAAIiI,EAAOmuC,QAASp2C,IAAK,CACvC,IAAIwyB,EAAM,EACV,IAAK,IAAI1zB,EAAI,EAAGA,EAAImJ,EAAO2qC,KAAM9zC,IAC/B0zB,GAAOjnB,KAAKqO,IAAI3R,EAAO1E,IAAIzE,EAAGkB,GAAI,IAAMiI,EAAO2qC,KAAO,GAExD6Q,EAAM3lD,KAAKyN,KAAKC,KAAKgnB,GACvB,CACA,OAAOixB,CACT,CDuxCkBG,CAAiBtmD,WACpB,IAAKm3C,GAAWgP,GACrB,MAAM,IAAI/lD,UAAU,0BAGtB,OC1xCD,SAAuBuK,EAAQw7C,GACpC,IAAK,IAAI3kD,EAAI,EAAGA,EAAImJ,EAAO2qC,KAAM9zC,IAC/B,IAAK,IAAIkB,EAAI,EAAGA,EAAIiI,EAAOmuC,QAASp2C,IAClCiI,EAAOmC,IAAItL,EAAGkB,EAAGiI,EAAO1E,IAAIzE,EAAGkB,GAAKyjD,EAAMzjD,GAGhD,CDmxCQ6jD,CAAcvmD,KAAMmmD,GACbnmD,KAET,UAAKwC,EACH,QAAcA,IAAV2jD,EACFA,ECtxCH,SAAqBx7C,GAC1B,MAAM67C,EAAU77C,EAAOP,KAAO,EAC9B,IAAI8qB,EAAM,EACV,IAAK,IAAIxyB,EAAI,EAAGA,EAAIiI,EAAOmuC,QAASp2C,IAClC,IAAK,IAAIlB,EAAI,EAAGA,EAAImJ,EAAO2qC,KAAM9zC,IAC/B0zB,GAAOjnB,KAAKqO,IAAI3R,EAAO1E,IAAIzE,EAAGkB,GAAI,GAAK8jD,EAG3C,OAAOv4C,KAAKC,KAAKgnB,EACnB,CD6wCkBuxB,CAAYzmD,WACf,GAAqB,iBAAVmmD,EAChB,MAAM,IAAI/lD,UAAU,0BAGtB,OChxCD,SAAkBuK,EAAQw7C,GAC/B,IAAK,IAAI3kD,EAAI,EAAGA,EAAImJ,EAAO2qC,KAAM9zC,IAC/B,IAAK,IAAIkB,EAAI,EAAGA,EAAIiI,EAAOmuC,QAASp2C,IAClCiI,EAAOmC,IAAItL,EAAGkB,EAAGiI,EAAO1E,IAAIzE,EAAGkB,GAAKyjD,EAG1C,CDywCQO,CAAS1mD,KAAMmmD,GACRnmD,KAET,QACE,MAAM,IAAIqE,MAAM,mBAAmBi6C,KAEzC,CAEAt0C,SAASyG,GACP,OAAOgoC,GAAyBz4C,KAAMyQ,EACxC,EASF,SAAS0zC,GAAel/C,EAAGC,GACzB,OAAOD,EAAIC,CACb,CARA21C,GAAer7C,UAAUk8C,MAAQ,SACX,oBAAXlzC,SACTqyC,GAAer7C,UAAUgJ,OAAOm+C,IAAI,+BFx+C/B,WACL,OAAOlO,GAAyBz4C,KAClC,GEq/CA66C,GAAensC,OAASmsC,GAAe+L,KACvC/L,GAAegM,UAAYhM,GAAeiM,QAC1CjM,GAAekM,SAAWlM,GAAeoE,KACzCpE,GAAer7C,UAAUunD,SAAWlM,GAAer7C,UAAUy/C,KAC7DpE,GAAemM,SAAWnM,GAAeiJ,IACzCjJ,GAAer7C,UAAUynD,OAASpM,GAAer7C,UAAUo9C,IAC3D/B,GAAer7C,UAAU0nD,cACvBrM,GAAer7C,UAAUmkD,iBAEZ,MAAMxI,WAAeN,GAClCn0C,YAAYygD,EAAOC,GAEjB,GADA9hC,QACI61B,GAAOM,SAAS0L,GAElB,OAAOA,EAAMh5C,QACR,GAAI+f,OAAO4pB,UAAUqP,IAAUA,GAAS,EAAG,CAGhD,GADAnnD,KAAK+D,KAAO,KACRmqB,OAAO4pB,UAAUsP,IAAaA,GAAY,GAK5C,MAAM,IAAIhnD,UAAU,uCAJpB,IAAK,IAAIoB,EAAI,EAAGA,EAAI2lD,EAAO3lD,IACzBxB,KAAK+D,KAAKvD,KAAK,IAAIioC,aAAa2e,GAKtC,KAAO,KAAIjQ,GAAWgQ,GAqBpB,MAAM,IAAI/mD,UACR,wDAtB0B,CAE5B,MAAMinD,EAAYF,EAGlB,GAAwB,iBADxBC,GADAD,EAAQE,EAAU3lD,QACC2lD,EAAU,GAAG3lD,OAAS,GAEvC,MAAM,IAAItB,UACR,qDAGJJ,KAAK+D,KAAO,GACZ,IAAK,IAAIvC,EAAI,EAAGA,EAAI2lD,EAAO3lD,IAAK,CAC9B,GAAI6lD,EAAU7lD,GAAGE,SAAW0lD,EAC1B,MAAM,IAAIlP,WAAW,iCAEvB,IAAsBmP,EAAU7lD,GA9CzB8lD,OAAOC,GACQ,iBAAZA,IA8CR,MAAM,IAAInnD,UAAU,0CAEtBJ,KAAK+D,KAAKvD,KAAKioC,aAAat/B,KAAKk+C,EAAU7lD,IAC7C,CACF,CAIA,CACAxB,KAAKs1C,KAAO6R,EACZnnD,KAAK84C,QAAUsO,CACjB,CAEAt6C,IAAI+3C,EAAUC,EAAat9C,GAEzB,OADAxH,KAAK+D,KAAK8gD,GAAUC,GAAet9C,EAC5BxH,IACT,CAEAiG,IAAI4+C,EAAUC,GACZ,OAAO9kD,KAAK+D,KAAK8gD,GAAUC,EAC7B,CAEA0C,UAAUpqC,GAIR,OAHAy8B,GAAc75C,KAAMod,GACpBpd,KAAK+D,KAAKqgB,OAAOhH,EAAO,GACxBpd,KAAKs1C,MAAQ,EACNt1C,IACT,CAEAynD,OAAOrqC,EAAO2R,GASZ,YARcvsB,IAAVusB,IACFA,EAAQ3R,EACRA,EAAQpd,KAAKs1C,MAEfuE,GAAc75C,KAAMod,GAAO,GAC3B2R,EAAQ0Z,aAAat/B,KAAK6wC,GAAeh6C,KAAM+uB,IAC/C/uB,KAAK+D,KAAKqgB,OAAOhH,EAAO,EAAG2R,GAC3B/uB,KAAKs1C,MAAQ,EACNt1C,IACT,CAEA0nD,aAAatqC,GACX28B,GAAiB/5C,KAAMod,GACvB,IAAK,IAAI5b,EAAI,EAAGA,EAAIxB,KAAKs1C,KAAM9zC,IAAK,CAClC,MAAM6J,EAAS,IAAIo9B,aAAazoC,KAAK84C,QAAU,GAC/C,IAAK,IAAIp2C,EAAI,EAAGA,EAAI0a,EAAO1a,IACzB2I,EAAO3I,GAAK1C,KAAK+D,KAAKvC,GAAGkB,GAE3B,IAAK,IAAIA,EAAI0a,EAAQ,EAAG1a,EAAI1C,KAAK84C,QAASp2C,IACxC2I,EAAO3I,EAAI,GAAK1C,KAAK+D,KAAKvC,GAAGkB,GAE/B1C,KAAK+D,KAAKvC,GAAK6J,CACjB,CAEA,OADArL,KAAK84C,SAAW,EACT94C,IACT,CAEA2nD,UAAUvqC,EAAO2R,QACM,IAAVA,IACTA,EAAQ3R,EACRA,EAAQpd,KAAK84C,SAEfiB,GAAiB/5C,KAAMod,GAAO,GAC9B2R,EAAQorB,GAAkBn6C,KAAM+uB,GAChC,IAAK,IAAIvtB,EAAI,EAAGA,EAAIxB,KAAKs1C,KAAM9zC,IAAK,CAClC,MAAM6J,EAAS,IAAIo9B,aAAazoC,KAAK84C,QAAU,GAC/C,IAAIp2C,EAAI,EACR,KAAOA,EAAI0a,EAAO1a,IAChB2I,EAAO3I,GAAK1C,KAAK+D,KAAKvC,GAAGkB,GAG3B,IADA2I,EAAO3I,KAAOqsB,EAAMvtB,GACbkB,EAAI1C,KAAK84C,QAAU,EAAGp2C,IAC3B2I,EAAO3I,GAAK1C,KAAK+D,KAAKvC,GAAGkB,EAAI,GAE/B1C,KAAK+D,KAAKvC,GAAK6J,CACjB,CAEA,OADArL,KAAK84C,SAAW,EACT94C,IACT,GEjnDK,SAA+B66C,EAAgBM,GACpDN,EAAer7C,UAAUoY,IAAM,SAAapQ,GAC1C,MAAqB,iBAAVA,EAA2BxH,KAAK4nD,KAAKpgD,GACzCxH,KAAK6nD,KAAKrgD,EACnB,EAEAqzC,EAAer7C,UAAUooD,KAAO,SAAcpgD,GAC5C,IAAK,IAAIhG,EAAI,EAAGA,EAAIxB,KAAKs1C,KAAM9zC,IAC7B,IAAK,IAAIkB,EAAI,EAAGA,EAAI1C,KAAK84C,QAASp2C,IAChC1C,KAAK8M,IAAItL,EAAGkB,EAAG1C,KAAKiG,IAAIzE,EAAGkB,GAAK8E,GAGpC,OAAOxH,IACT,EAEA66C,EAAer7C,UAAUqoD,KAAO,SAAcl9C,GAE5C,GADAA,EAASwwC,EAAOK,YAAY7wC,GACxB3K,KAAKs1C,OAAS3qC,EAAO2qC,MACvBt1C,KAAK84C,UAAYnuC,EAAOmuC,QACxB,MAAM,IAAIZ,WAAW,qCAEvB,IAAK,IAAI12C,EAAI,EAAGA,EAAIxB,KAAKs1C,KAAM9zC,IAC7B,IAAK,IAAIkB,EAAI,EAAGA,EAAI1C,KAAK84C,QAASp2C,IAChC1C,KAAK8M,IAAItL,EAAGkB,EAAG1C,KAAKiG,IAAIzE,EAAGkB,GAAKiI,EAAO1E,IAAIzE,EAAGkB,IAGlD,OAAO1C,IACT,EAEA66C,EAAejjC,IAAM,SAAajN,EAAQnD,GAExC,OADkB,IAAI2zC,EAAOxwC,GACZiN,IAAIpQ,EACvB,EAEAqzC,EAAer7C,UAAU2jD,IAAM,SAAa37C,GAC1C,MAAqB,iBAAVA,EAA2BxH,KAAK8nD,KAAKtgD,GACzCxH,KAAK+nD,KAAKvgD,EACnB,EAEAqzC,EAAer7C,UAAUsoD,KAAO,SAActgD,GAC5C,IAAK,IAAIhG,EAAI,EAAGA,EAAIxB,KAAKs1C,KAAM9zC,IAC7B,IAAK,IAAIkB,EAAI,EAAGA,EAAI1C,KAAK84C,QAASp2C,IAChC1C,KAAK8M,IAAItL,EAAGkB,EAAG1C,KAAKiG,IAAIzE,EAAGkB,GAAK8E,GAGpC,OAAOxH,IACT,EAEA66C,EAAer7C,UAAUuoD,KAAO,SAAcp9C,GAE5C,GADAA,EAASwwC,EAAOK,YAAY7wC,GACxB3K,KAAKs1C,OAAS3qC,EAAO2qC,MACvBt1C,KAAK84C,UAAYnuC,EAAOmuC,QACxB,MAAM,IAAIZ,WAAW,qCAEvB,IAAK,IAAI12C,EAAI,EAAGA,EAAIxB,KAAKs1C,KAAM9zC,IAC7B,IAAK,IAAIkB,EAAI,EAAGA,EAAI1C,KAAK84C,QAASp2C,IAChC1C,KAAK8M,IAAItL,EAAGkB,EAAG1C,KAAKiG,IAAIzE,EAAGkB,GAAKiI,EAAO1E,IAAIzE,EAAGkB,IAGlD,OAAO1C,IACT,EAEA66C,EAAesI,IAAM,SAAax4C,EAAQnD,GAExC,OADkB,IAAI2zC,EAAOxwC,GACZw4C,IAAI37C,EACvB,EACAqzC,EAAer7C,UAAUwoD,SAAWnN,EAAer7C,UAAU2jD,IAC7DtI,EAAer7C,UAAUyoD,UAAYpN,EAAer7C,UAAUsoD,KAC9DjN,EAAer7C,UAAU0oD,UAAYrN,EAAer7C,UAAUuoD,KAC9DlN,EAAemN,SAAWnN,EAAesI,IAEzCtI,EAAer7C,UAAU2oD,IAAM,SAAa3gD,GAC1C,MAAqB,iBAAVA,EAA2BxH,KAAK68C,KAAKr1C,GACzCxH,KAAKooD,KAAK5gD,EACnB,EAEAqzC,EAAer7C,UAAUq9C,KAAO,SAAcr1C,GAC5C,IAAK,IAAIhG,EAAI,EAAGA,EAAIxB,KAAKs1C,KAAM9zC,IAC7B,IAAK,IAAIkB,EAAI,EAAGA,EAAI1C,KAAK84C,QAASp2C,IAChC1C,KAAK8M,IAAItL,EAAGkB,EAAG1C,KAAKiG,IAAIzE,EAAGkB,GAAK8E,GAGpC,OAAOxH,IACT,EAEA66C,EAAer7C,UAAU4oD,KAAO,SAAcz9C,GAE5C,GADAA,EAASwwC,EAAOK,YAAY7wC,GACxB3K,KAAKs1C,OAAS3qC,EAAO2qC,MACvBt1C,KAAK84C,UAAYnuC,EAAOmuC,QACxB,MAAM,IAAIZ,WAAW,qCAEvB,IAAK,IAAI12C,EAAI,EAAGA,EAAIxB,KAAKs1C,KAAM9zC,IAC7B,IAAK,IAAIkB,EAAI,EAAGA,EAAI1C,KAAK84C,QAASp2C,IAChC1C,KAAK8M,IAAItL,EAAGkB,EAAG1C,KAAKiG,IAAIzE,EAAGkB,GAAKiI,EAAO1E,IAAIzE,EAAGkB,IAGlD,OAAO1C,IACT,EAEA66C,EAAesN,IAAM,SAAax9C,EAAQnD,GAExC,OADkB,IAAI2zC,EAAOxwC,GACZw9C,IAAI3gD,EACvB,EACAqzC,EAAer7C,UAAU6oD,SAAWxN,EAAer7C,UAAU2oD,IAC7DtN,EAAer7C,UAAU8oD,UAAYzN,EAAer7C,UAAUq9C,KAC9DhC,EAAer7C,UAAU+oD,UAAY1N,EAAer7C,UAAU4oD,KAC9DvN,EAAewN,SAAWxN,EAAesN,IAEzCtN,EAAer7C,UAAUgpD,IAAM,SAAahhD,GAC1C,MAAqB,iBAAVA,EAA2BxH,KAAKyoD,KAAKjhD,GACzCxH,KAAK0oD,KAAKlhD,EACnB,EAEAqzC,EAAer7C,UAAUipD,KAAO,SAAcjhD,GAC5C,IAAK,IAAIhG,EAAI,EAAGA,EAAIxB,KAAKs1C,KAAM9zC,IAC7B,IAAK,IAAIkB,EAAI,EAAGA,EAAI1C,KAAK84C,QAASp2C,IAChC1C,KAAK8M,IAAItL,EAAGkB,EAAG1C,KAAKiG,IAAIzE,EAAGkB,GAAK8E,GAGpC,OAAOxH,IACT,EAEA66C,EAAer7C,UAAUkpD,KAAO,SAAc/9C,GAE5C,GADAA,EAASwwC,EAAOK,YAAY7wC,GACxB3K,KAAKs1C,OAAS3qC,EAAO2qC,MACvBt1C,KAAK84C,UAAYnuC,EAAOmuC,QACxB,MAAM,IAAIZ,WAAW,qCAEvB,IAAK,IAAI12C,EAAI,EAAGA,EAAIxB,KAAKs1C,KAAM9zC,IAC7B,IAAK,IAAIkB,EAAI,EAAGA,EAAI1C,KAAK84C,QAASp2C,IAChC1C,KAAK8M,IAAItL,EAAGkB,EAAG1C,KAAKiG,IAAIzE,EAAGkB,GAAKiI,EAAO1E,IAAIzE,EAAGkB,IAGlD,OAAO1C,IACT,EAEA66C,EAAe2N,IAAM,SAAa79C,EAAQnD,GAExC,OADkB,IAAI2zC,EAAOxwC,GACZ69C,IAAIhhD,EACvB,EACAqzC,EAAer7C,UAAUmpD,OAAS9N,EAAer7C,UAAUgpD,IAC3D3N,EAAer7C,UAAUopD,QAAU/N,EAAer7C,UAAUipD,KAC5D5N,EAAer7C,UAAUqpD,QAAUhO,EAAer7C,UAAUkpD,KAC5D7N,EAAe8N,OAAS9N,EAAe2N,IAEvC3N,EAAer7C,UAAUspD,IAAM,SAAathD,GAC1C,MAAqB,iBAAVA,EAA2BxH,KAAK+oD,KAAKvhD,GACzCxH,KAAKgpD,KAAKxhD,EACnB,EAEAqzC,EAAer7C,UAAUupD,KAAO,SAAcvhD,GAC5C,IAAK,IAAIhG,EAAI,EAAGA,EAAIxB,KAAKs1C,KAAM9zC,IAC7B,IAAK,IAAIkB,EAAI,EAAGA,EAAI1C,KAAK84C,QAASp2C,IAChC1C,KAAK8M,IAAItL,EAAGkB,EAAG1C,KAAKiG,IAAIzE,EAAGkB,GAAK8E,GAGpC,OAAOxH,IACT,EAEA66C,EAAer7C,UAAUwpD,KAAO,SAAcr+C,GAE5C,GADAA,EAASwwC,EAAOK,YAAY7wC,GACxB3K,KAAKs1C,OAAS3qC,EAAO2qC,MACvBt1C,KAAK84C,UAAYnuC,EAAOmuC,QACxB,MAAM,IAAIZ,WAAW,qCAEvB,IAAK,IAAI12C,EAAI,EAAGA,EAAIxB,KAAKs1C,KAAM9zC,IAC7B,IAAK,IAAIkB,EAAI,EAAGA,EAAI1C,KAAK84C,QAASp2C,IAChC1C,KAAK8M,IAAItL,EAAGkB,EAAG1C,KAAKiG,IAAIzE,EAAGkB,GAAKiI,EAAO1E,IAAIzE,EAAGkB,IAGlD,OAAO1C,IACT,EAEA66C,EAAeiO,IAAM,SAAan+C,EAAQnD,GAExC,OADkB,IAAI2zC,EAAOxwC,GACZm+C,IAAIthD,EACvB,EACAqzC,EAAer7C,UAAUypD,QAAUpO,EAAer7C,UAAUspD,IAC5DjO,EAAer7C,UAAU0pD,SAAWrO,EAAer7C,UAAUupD,KAC7DlO,EAAer7C,UAAU2pD,SAAWtO,EAAer7C,UAAUwpD,KAC7DnO,EAAeoO,QAAUpO,EAAeiO,IAExCjO,EAAer7C,UAAU4pD,IAAM,SAAa5hD,GAC1C,MAAqB,iBAAVA,EAA2BxH,KAAKqpD,KAAK7hD,GACzCxH,KAAKspD,KAAK9hD,EACnB,EAEAqzC,EAAer7C,UAAU6pD,KAAO,SAAc7hD,GAC5C,IAAK,IAAIhG,EAAI,EAAGA,EAAIxB,KAAKs1C,KAAM9zC,IAC7B,IAAK,IAAIkB,EAAI,EAAGA,EAAI1C,KAAK84C,QAASp2C,IAChC1C,KAAK8M,IAAItL,EAAGkB,EAAG1C,KAAKiG,IAAIzE,EAAGkB,GAAK8E,GAGpC,OAAOxH,IACT,EAEA66C,EAAer7C,UAAU8pD,KAAO,SAAc3+C,GAE5C,GADAA,EAASwwC,EAAOK,YAAY7wC,GACxB3K,KAAKs1C,OAAS3qC,EAAO2qC,MACvBt1C,KAAK84C,UAAYnuC,EAAOmuC,QACxB,MAAM,IAAIZ,WAAW,qCAEvB,IAAK,IAAI12C,EAAI,EAAGA,EAAIxB,KAAKs1C,KAAM9zC,IAC7B,IAAK,IAAIkB,EAAI,EAAGA,EAAI1C,KAAK84C,QAASp2C,IAChC1C,KAAK8M,IAAItL,EAAGkB,EAAG1C,KAAKiG,IAAIzE,EAAGkB,GAAKiI,EAAO1E,IAAIzE,EAAGkB,IAGlD,OAAO1C,IACT,EAEA66C,EAAeuO,IAAM,SAAaz+C,EAAQnD,GAExC,OADkB,IAAI2zC,EAAOxwC,GACZy+C,IAAI5hD,EACvB,EAEAqzC,EAAer7C,UAAU+pD,GAAK,SAAY/hD,GACxC,MAAqB,iBAAVA,EAA2BxH,KAAKwpD,IAAIhiD,GACxCxH,KAAKypD,IAAIjiD,EAClB,EAEAqzC,EAAer7C,UAAUgqD,IAAM,SAAahiD,GAC1C,IAAK,IAAIhG,EAAI,EAAGA,EAAIxB,KAAKs1C,KAAM9zC,IAC7B,IAAK,IAAIkB,EAAI,EAAGA,EAAI1C,KAAK84C,QAASp2C,IAChC1C,KAAK8M,IAAItL,EAAGkB,EAAG1C,KAAKiG,IAAIzE,EAAGkB,GAAK8E,GAGpC,OAAOxH,IACT,EAEA66C,EAAer7C,UAAUiqD,IAAM,SAAa9+C,GAE1C,GADAA,EAASwwC,EAAOK,YAAY7wC,GACxB3K,KAAKs1C,OAAS3qC,EAAO2qC,MACvBt1C,KAAK84C,UAAYnuC,EAAOmuC,QACxB,MAAM,IAAIZ,WAAW,qCAEvB,IAAK,IAAI12C,EAAI,EAAGA,EAAIxB,KAAKs1C,KAAM9zC,IAC7B,IAAK,IAAIkB,EAAI,EAAGA,EAAI1C,KAAK84C,QAASp2C,IAChC1C,KAAK8M,IAAItL,EAAGkB,EAAG1C,KAAKiG,IAAIzE,EAAGkB,GAAKiI,EAAO1E,IAAIzE,EAAGkB,IAGlD,OAAO1C,IACT,EAEA66C,EAAe0O,GAAK,SAAY5+C,EAAQnD,GAEtC,OADkB,IAAI2zC,EAAOxwC,GACZ4+C,GAAG/hD,EACtB,EAEAqzC,EAAer7C,UAAUkqD,IAAM,SAAaliD,GAC1C,MAAqB,iBAAVA,EAA2BxH,KAAK2pD,KAAKniD,GACzCxH,KAAK4pD,KAAKpiD,EACnB,EAEAqzC,EAAer7C,UAAUmqD,KAAO,SAAcniD,GAC5C,IAAK,IAAIhG,EAAI,EAAGA,EAAIxB,KAAKs1C,KAAM9zC,IAC7B,IAAK,IAAIkB,EAAI,EAAGA,EAAI1C,KAAK84C,QAASp2C,IAChC1C,KAAK8M,IAAItL,EAAGkB,EAAG1C,KAAKiG,IAAIzE,EAAGkB,GAAK8E,GAGpC,OAAOxH,IACT,EAEA66C,EAAer7C,UAAUoqD,KAAO,SAAcj/C,GAE5C,GADAA,EAASwwC,EAAOK,YAAY7wC,GACxB3K,KAAKs1C,OAAS3qC,EAAO2qC,MACvBt1C,KAAK84C,UAAYnuC,EAAOmuC,QACxB,MAAM,IAAIZ,WAAW,qCAEvB,IAAK,IAAI12C,EAAI,EAAGA,EAAIxB,KAAKs1C,KAAM9zC,IAC7B,IAAK,IAAIkB,EAAI,EAAGA,EAAI1C,KAAK84C,QAASp2C,IAChC1C,KAAK8M,IAAItL,EAAGkB,EAAG1C,KAAKiG,IAAIzE,EAAGkB,GAAKiI,EAAO1E,IAAIzE,EAAGkB,IAGlD,OAAO1C,IACT,EAEA66C,EAAe6O,IAAM,SAAa/+C,EAAQnD,GAExC,OADkB,IAAI2zC,EAAOxwC,GACZ++C,IAAIliD,EACvB,EAEAqzC,EAAer7C,UAAUqqD,UAAY,SAAmBriD,GACtD,MAAqB,iBAAVA,EAA2BxH,KAAK8pD,WAAWtiD,GAC/CxH,KAAK+pD,WAAWviD,EACzB,EAEAqzC,EAAer7C,UAAUsqD,WAAa,SAAoBtiD,GACxD,IAAK,IAAIhG,EAAI,EAAGA,EAAIxB,KAAKs1C,KAAM9zC,IAC7B,IAAK,IAAIkB,EAAI,EAAGA,EAAI1C,KAAK84C,QAASp2C,IAChC1C,KAAK8M,IAAItL,EAAGkB,EAAG1C,KAAKiG,IAAIzE,EAAGkB,IAAM8E,GAGrC,OAAOxH,IACT,EAEA66C,EAAer7C,UAAUuqD,WAAa,SAAoBp/C,GAExD,GADAA,EAASwwC,EAAOK,YAAY7wC,GACxB3K,KAAKs1C,OAAS3qC,EAAO2qC,MACvBt1C,KAAK84C,UAAYnuC,EAAOmuC,QACxB,MAAM,IAAIZ,WAAW,qCAEvB,IAAK,IAAI12C,EAAI,EAAGA,EAAIxB,KAAKs1C,KAAM9zC,IAC7B,IAAK,IAAIkB,EAAI,EAAGA,EAAI1C,KAAK84C,QAASp2C,IAChC1C,KAAK8M,IAAItL,EAAGkB,EAAG1C,KAAKiG,IAAIzE,EAAGkB,IAAMiI,EAAO1E,IAAIzE,EAAGkB,IAGnD,OAAO1C,IACT,EAEA66C,EAAegP,UAAY,SAAmBl/C,EAAQnD,GAEpD,OADkB,IAAI2zC,EAAOxwC,GACZk/C,UAAUriD,EAC7B,EAEAqzC,EAAer7C,UAAUwqD,0BAA4B,SAAmCxiD,GACtF,MAAqB,iBAAVA,EAA2BxH,KAAKiqD,2BAA2BziD,GAC/DxH,KAAKkqD,2BAA2B1iD,EACzC,EAEAqzC,EAAer7C,UAAUyqD,2BAA6B,SAAoCziD,GACxF,IAAK,IAAIhG,EAAI,EAAGA,EAAIxB,KAAKs1C,KAAM9zC,IAC7B,IAAK,IAAIkB,EAAI,EAAGA,EAAI1C,KAAK84C,QAASp2C,IAChC1C,KAAK8M,IAAItL,EAAGkB,EAAG1C,KAAKiG,IAAIzE,EAAGkB,IAAM8E,GAGrC,OAAOxH,IACT,EAEA66C,EAAer7C,UAAU0qD,2BAA6B,SAAoCv/C,GAExF,GADAA,EAASwwC,EAAOK,YAAY7wC,GACxB3K,KAAKs1C,OAAS3qC,EAAO2qC,MACvBt1C,KAAK84C,UAAYnuC,EAAOmuC,QACxB,MAAM,IAAIZ,WAAW,qCAEvB,IAAK,IAAI12C,EAAI,EAAGA,EAAIxB,KAAKs1C,KAAM9zC,IAC7B,IAAK,IAAIkB,EAAI,EAAGA,EAAI1C,KAAK84C,QAASp2C,IAChC1C,KAAK8M,IAAItL,EAAGkB,EAAG1C,KAAKiG,IAAIzE,EAAGkB,IAAMiI,EAAO1E,IAAIzE,EAAGkB,IAGnD,OAAO1C,IACT,EAEA66C,EAAemP,0BAA4B,SAAmCr/C,EAAQnD,GAEpF,OADkB,IAAI2zC,EAAOxwC,GACZq/C,0BAA0BxiD,EAC7C,EAEAqzC,EAAer7C,UAAU2qD,WAAa,SAAoB3iD,GACxD,MAAqB,iBAAVA,EAA2BxH,KAAKoqD,YAAY5iD,GAChDxH,KAAKqqD,YAAY7iD,EAC1B,EAEAqzC,EAAer7C,UAAU4qD,YAAc,SAAqB5iD,GAC1D,IAAK,IAAIhG,EAAI,EAAGA,EAAIxB,KAAKs1C,KAAM9zC,IAC7B,IAAK,IAAIkB,EAAI,EAAGA,EAAI1C,KAAK84C,QAASp2C,IAChC1C,KAAK8M,IAAItL,EAAGkB,EAAG1C,KAAKiG,IAAIzE,EAAGkB,KAAO8E,GAGtC,OAAOxH,IACT,EAEA66C,EAAer7C,UAAU6qD,YAAc,SAAqB1/C,GAE1D,GADAA,EAASwwC,EAAOK,YAAY7wC,GACxB3K,KAAKs1C,OAAS3qC,EAAO2qC,MACvBt1C,KAAK84C,UAAYnuC,EAAOmuC,QACxB,MAAM,IAAIZ,WAAW,qCAEvB,IAAK,IAAI12C,EAAI,EAAGA,EAAIxB,KAAKs1C,KAAM9zC,IAC7B,IAAK,IAAIkB,EAAI,EAAGA,EAAI1C,KAAK84C,QAASp2C,IAChC1C,KAAK8M,IAAItL,EAAGkB,EAAG1C,KAAKiG,IAAIzE,EAAGkB,KAAOiI,EAAO1E,IAAIzE,EAAGkB,IAGpD,OAAO1C,IACT,EAEA66C,EAAesP,WAAa,SAAoBx/C,EAAQnD,GAEtD,OADkB,IAAI2zC,EAAOxwC,GACZw/C,WAAW3iD,EAC9B,EACAqzC,EAAer7C,UAAU8qD,mBAAqBzP,EAAer7C,UAAU2qD,WACvEtP,EAAer7C,UAAU+qD,oBAAsB1P,EAAer7C,UAAU4qD,YACxEvP,EAAer7C,UAAUgrD,oBAAsB3P,EAAer7C,UAAU6qD,YACxExP,EAAeyP,mBAAqBzP,EAAesP,WAEnDtP,EAAer7C,UAAUirD,IAAM,WAC7B,IAAK,IAAIjpD,EAAI,EAAGA,EAAIxB,KAAKs1C,KAAM9zC,IAC7B,IAAK,IAAIkB,EAAI,EAAGA,EAAI1C,KAAK84C,QAASp2C,IAChC1C,KAAK8M,IAAItL,EAAGkB,GAAK1C,KAAKiG,IAAIzE,EAAGkB,IAGjC,OAAO1C,IACT,EAEA66C,EAAe4P,IAAM,SAAa9/C,GAEhC,OADkB,IAAIwwC,EAAOxwC,GACZ8/C,KACnB,EAEA5P,EAAer7C,UAAU4V,IAAM,WAC7B,IAAK,IAAI5T,EAAI,EAAGA,EAAIxB,KAAKs1C,KAAM9zC,IAC7B,IAAK,IAAIkB,EAAI,EAAGA,EAAI1C,KAAK84C,QAASp2C,IAChC1C,KAAK8M,IAAItL,EAAGkB,EAAGuL,KAAKmH,IAAIpV,KAAKiG,IAAIzE,EAAGkB,KAGxC,OAAO1C,IACT,EAEA66C,EAAezlC,IAAM,SAAazK,GAEhC,OADkB,IAAIwwC,EAAOxwC,GACZyK,KACnB,EAEAylC,EAAer7C,UAAUkrD,KAAO,WAC9B,IAAK,IAAIlpD,EAAI,EAAGA,EAAIxB,KAAKs1C,KAAM9zC,IAC7B,IAAK,IAAIkB,EAAI,EAAGA,EAAI1C,KAAK84C,QAASp2C,IAChC1C,KAAK8M,IAAItL,EAAGkB,EAAGuL,KAAKy8C,KAAK1qD,KAAKiG,IAAIzE,EAAGkB,KAGzC,OAAO1C,IACT,EAEA66C,EAAe6P,KAAO,SAAc//C,GAElC,OADkB,IAAIwwC,EAAOxwC,GACZ+/C,MACnB,EAEA7P,EAAer7C,UAAUmrD,MAAQ,WAC/B,IAAK,IAAInpD,EAAI,EAAGA,EAAIxB,KAAKs1C,KAAM9zC,IAC7B,IAAK,IAAIkB,EAAI,EAAGA,EAAI1C,KAAK84C,QAASp2C,IAChC1C,KAAK8M,IAAItL,EAAGkB,EAAGuL,KAAK08C,MAAM3qD,KAAKiG,IAAIzE,EAAGkB,KAG1C,OAAO1C,IACT,EAEA66C,EAAe8P,MAAQ,SAAehgD,GAEpC,OADkB,IAAIwwC,EAAOxwC,GACZggD,OACnB,EAEA9P,EAAer7C,UAAUorD,KAAO,WAC9B,IAAK,IAAIppD,EAAI,EAAGA,EAAIxB,KAAKs1C,KAAM9zC,IAC7B,IAAK,IAAIkB,EAAI,EAAGA,EAAI1C,KAAK84C,QAASp2C,IAChC1C,KAAK8M,IAAItL,EAAGkB,EAAGuL,KAAK28C,KAAK5qD,KAAKiG,IAAIzE,EAAGkB,KAGzC,OAAO1C,IACT,EAEA66C,EAAe+P,KAAO,SAAcjgD,GAElC,OADkB,IAAIwwC,EAAOxwC,GACZigD,MACnB,EAEA/P,EAAer7C,UAAUqrD,MAAQ,WAC/B,IAAK,IAAIrpD,EAAI,EAAGA,EAAIxB,KAAKs1C,KAAM9zC,IAC7B,IAAK,IAAIkB,EAAI,EAAGA,EAAI1C,KAAK84C,QAASp2C,IAChC1C,KAAK8M,IAAItL,EAAGkB,EAAGuL,KAAK48C,MAAM7qD,KAAKiG,IAAIzE,EAAGkB,KAG1C,OAAO1C,IACT,EAEA66C,EAAegQ,MAAQ,SAAelgD,GAEpC,OADkB,IAAIwwC,EAAOxwC,GACZkgD,OACnB,EAEAhQ,EAAer7C,UAAUsrD,KAAO,WAC9B,IAAK,IAAItpD,EAAI,EAAGA,EAAIxB,KAAKs1C,KAAM9zC,IAC7B,IAAK,IAAIkB,EAAI,EAAGA,EAAI1C,KAAK84C,QAASp2C,IAChC1C,KAAK8M,IAAItL,EAAGkB,EAAGuL,KAAK68C,KAAK9qD,KAAKiG,IAAIzE,EAAGkB,KAGzC,OAAO1C,IACT,EAEA66C,EAAeiQ,KAAO,SAAcngD,GAElC,OADkB,IAAIwwC,EAAOxwC,GACZmgD,MACnB,EAEAjQ,EAAer7C,UAAUurD,MAAQ,WAC/B,IAAK,IAAIvpD,EAAI,EAAGA,EAAIxB,KAAKs1C,KAAM9zC,IAC7B,IAAK,IAAIkB,EAAI,EAAGA,EAAI1C,KAAK84C,QAASp2C,IAChC1C,KAAK8M,IAAItL,EAAGkB,EAAGuL,KAAK88C,MAAM/qD,KAAKiG,IAAIzE,EAAGkB,KAG1C,OAAO1C,IACT,EAEA66C,EAAekQ,MAAQ,SAAepgD,GAEpC,OADkB,IAAIwwC,EAAOxwC,GACZogD,OACnB,EAEAlQ,EAAer7C,UAAUwrD,KAAO,WAC9B,IAAK,IAAIxpD,EAAI,EAAGA,EAAIxB,KAAKs1C,KAAM9zC,IAC7B,IAAK,IAAIkB,EAAI,EAAGA,EAAI1C,KAAK84C,QAASp2C,IAChC1C,KAAK8M,IAAItL,EAAGkB,EAAGuL,KAAK+8C,KAAKhrD,KAAKiG,IAAIzE,EAAGkB,KAGzC,OAAO1C,IACT,EAEA66C,EAAemQ,KAAO,SAAcrgD,GAElC,OADkB,IAAIwwC,EAAOxwC,GACZqgD,MACnB,EAEAnQ,EAAer7C,UAAUwS,KAAO,WAC9B,IAAK,IAAIxQ,EAAI,EAAGA,EAAIxB,KAAKs1C,KAAM9zC,IAC7B,IAAK,IAAIkB,EAAI,EAAGA,EAAI1C,KAAK84C,QAASp2C,IAChC1C,KAAK8M,IAAItL,EAAGkB,EAAGuL,KAAK+D,KAAKhS,KAAKiG,IAAIzE,EAAGkB,KAGzC,OAAO1C,IACT,EAEA66C,EAAe7oC,KAAO,SAAcrH,GAElC,OADkB,IAAIwwC,EAAOxwC,GACZqH,MACnB,EAEA6oC,EAAer7C,UAAUyrD,MAAQ,WAC/B,IAAK,IAAIzpD,EAAI,EAAGA,EAAIxB,KAAKs1C,KAAM9zC,IAC7B,IAAK,IAAIkB,EAAI,EAAGA,EAAI1C,KAAK84C,QAASp2C,IAChC1C,KAAK8M,IAAItL,EAAGkB,EAAGuL,KAAKg9C,MAAMjrD,KAAKiG,IAAIzE,EAAGkB,KAG1C,OAAO1C,IACT,EAEA66C,EAAeoQ,MAAQ,SAAetgD,GAEpC,OADkB,IAAIwwC,EAAOxwC,GACZsgD,OACnB,EAEApQ,EAAer7C,UAAU2S,IAAM,WAC7B,IAAK,IAAI3Q,EAAI,EAAGA,EAAIxB,KAAKs1C,KAAM9zC,IAC7B,IAAK,IAAIkB,EAAI,EAAGA,EAAI1C,KAAK84C,QAASp2C,IAChC1C,KAAK8M,IAAItL,EAAGkB,EAAGuL,KAAKkE,IAAInS,KAAKiG,IAAIzE,EAAGkB,KAGxC,OAAO1C,IACT,EAEA66C,EAAe1oC,IAAM,SAAaxH,GAEhC,OADkB,IAAIwwC,EAAOxwC,GACZwH,KACnB,EAEA0oC,EAAer7C,UAAU0rD,KAAO,WAC9B,IAAK,IAAI1pD,EAAI,EAAGA,EAAIxB,KAAKs1C,KAAM9zC,IAC7B,IAAK,IAAIkB,EAAI,EAAGA,EAAI1C,KAAK84C,QAASp2C,IAChC1C,KAAK8M,IAAItL,EAAGkB,EAAGuL,KAAKi9C,KAAKlrD,KAAKiG,IAAIzE,EAAGkB,KAGzC,OAAO1C,IACT,EAEA66C,EAAeqQ,KAAO,SAAcvgD,GAElC,OADkB,IAAIwwC,EAAOxwC,GACZugD,MACnB,EAEArQ,EAAer7C,UAAUm6C,IAAM,WAC7B,IAAK,IAAIn4C,EAAI,EAAGA,EAAIxB,KAAKs1C,KAAM9zC,IAC7B,IAAK,IAAIkB,EAAI,EAAGA,EAAI1C,KAAK84C,QAASp2C,IAChC1C,KAAK8M,IAAItL,EAAGkB,EAAGuL,KAAK0rC,IAAI35C,KAAKiG,IAAIzE,EAAGkB,KAGxC,OAAO1C,IACT,EAEA66C,EAAelB,IAAM,SAAahvC,GAEhC,OADkB,IAAIwwC,EAAOxwC,GACZgvC,KACnB,EAEAkB,EAAer7C,UAAU2rD,MAAQ,WAC/B,IAAK,IAAI3pD,EAAI,EAAGA,EAAIxB,KAAKs1C,KAAM9zC,IAC7B,IAAK,IAAIkB,EAAI,EAAGA,EAAI1C,KAAK84C,QAASp2C,IAChC1C,KAAK8M,IAAItL,EAAGkB,EAAGuL,KAAKk9C,MAAMnrD,KAAKiG,IAAIzE,EAAGkB,KAG1C,OAAO1C,IACT,EAEA66C,EAAesQ,MAAQ,SAAexgD,GAEpC,OADkB,IAAIwwC,EAAOxwC,GACZwgD,OACnB,EAEAtQ,EAAer7C,UAAU0S,MAAQ,WAC/B,IAAK,IAAI1Q,EAAI,EAAGA,EAAIxB,KAAKs1C,KAAM9zC,IAC7B,IAAK,IAAIkB,EAAI,EAAGA,EAAI1C,KAAK84C,QAASp2C,IAChC1C,KAAK8M,IAAItL,EAAGkB,EAAGuL,KAAKiE,MAAMlS,KAAKiG,IAAIzE,EAAGkB,KAG1C,OAAO1C,IACT,EAEA66C,EAAe3oC,MAAQ,SAAevH,GAEpC,OADkB,IAAIwwC,EAAOxwC,GACZuH,OACnB,EAEA2oC,EAAer7C,UAAU4rD,OAAS,WAChC,IAAK,IAAI5pD,EAAI,EAAGA,EAAIxB,KAAKs1C,KAAM9zC,IAC7B,IAAK,IAAIkB,EAAI,EAAGA,EAAI1C,KAAK84C,QAASp2C,IAChC1C,KAAK8M,IAAItL,EAAGkB,EAAGuL,KAAKm9C,OAAOprD,KAAKiG,IAAIzE,EAAGkB,KAG3C,OAAO1C,IACT,EAEA66C,EAAeuQ,OAAS,SAAgBzgD,GAEtC,OADkB,IAAIwwC,EAAOxwC,GACZygD,QACnB,EAEAvQ,EAAer7C,UAAU2yC,IAAM,WAC7B,IAAK,IAAI3wC,EAAI,EAAGA,EAAIxB,KAAKs1C,KAAM9zC,IAC7B,IAAK,IAAIkB,EAAI,EAAGA,EAAI1C,KAAK84C,QAASp2C,IAChC1C,KAAK8M,IAAItL,EAAGkB,EAAGuL,KAAKkkC,IAAInyC,KAAKiG,IAAIzE,EAAGkB,KAGxC,OAAO1C,IACT,EAEA66C,EAAe1I,IAAM,SAAaxnC,GAEhC,OADkB,IAAIwwC,EAAOxwC,GACZwnC,KACnB,EAEA0I,EAAer7C,UAAU6rD,MAAQ,WAC/B,IAAK,IAAI7pD,EAAI,EAAGA,EAAIxB,KAAKs1C,KAAM9zC,IAC7B,IAAK,IAAIkB,EAAI,EAAGA,EAAI1C,KAAK84C,QAASp2C,IAChC1C,KAAK8M,IAAItL,EAAGkB,EAAGuL,KAAKo9C,MAAMrrD,KAAKiG,IAAIzE,EAAGkB,KAG1C,OAAO1C,IACT,EAEA66C,EAAewQ,MAAQ,SAAe1gD,GAEpC,OADkB,IAAIwwC,EAAOxwC,GACZ0gD,OACnB,EAEAxQ,EAAer7C,UAAU8rD,MAAQ,WAC/B,IAAK,IAAI9pD,EAAI,EAAGA,EAAIxB,KAAKs1C,KAAM9zC,IAC7B,IAAK,IAAIkB,EAAI,EAAGA,EAAI1C,KAAK84C,QAASp2C,IAChC1C,KAAK8M,IAAItL,EAAGkB,EAAGuL,KAAKq9C,MAAMtrD,KAAKiG,IAAIzE,EAAGkB,KAG1C,OAAO1C,IACT,EAEA66C,EAAeyQ,MAAQ,SAAe3gD,GAEpC,OADkB,IAAIwwC,EAAOxwC,GACZ2gD,OACnB,EAEAzQ,EAAer7C,UAAU+rD,KAAO,WAC9B,IAAK,IAAI/pD,EAAI,EAAGA,EAAIxB,KAAKs1C,KAAM9zC,IAC7B,IAAK,IAAIkB,EAAI,EAAGA,EAAI1C,KAAK84C,QAASp2C,IAChC1C,KAAK8M,IAAItL,EAAGkB,EAAGuL,KAAKs9C,KAAKvrD,KAAKiG,IAAIzE,EAAGkB,KAGzC,OAAO1C,IACT,EAEA66C,EAAe0Q,KAAO,SAAc5gD,GAElC,OADkB,IAAIwwC,EAAOxwC,GACZ4gD,MACnB,EAEA1Q,EAAer7C,UAAUu2C,MAAQ,WAC/B,IAAK,IAAIv0C,EAAI,EAAGA,EAAIxB,KAAKs1C,KAAM9zC,IAC7B,IAAK,IAAIkB,EAAI,EAAGA,EAAI1C,KAAK84C,QAASp2C,IAChC1C,KAAK8M,IAAItL,EAAGkB,EAAGuL,KAAK8nC,MAAM/1C,KAAKiG,IAAIzE,EAAGkB,KAG1C,OAAO1C,IACT,EAEA66C,EAAe9E,MAAQ,SAAeprC,GAEpC,OADkB,IAAIwwC,EAAOxwC,GACZorC,OACnB,EAEA8E,EAAer7C,UAAUgsD,KAAO,WAC9B,IAAK,IAAIhqD,EAAI,EAAGA,EAAIxB,KAAKs1C,KAAM9zC,IAC7B,IAAK,IAAIkB,EAAI,EAAGA,EAAI1C,KAAK84C,QAASp2C,IAChC1C,KAAK8M,IAAItL,EAAGkB,EAAGuL,KAAKu9C,KAAKxrD,KAAKiG,IAAIzE,EAAGkB,KAGzC,OAAO1C,IACT,EAEA66C,EAAe2Q,KAAO,SAAc7gD,GAElC,OADkB,IAAIwwC,EAAOxwC,GACZ6gD,MACnB,EAEA3Q,EAAer7C,UAAU4S,IAAM,WAC7B,IAAK,IAAI5Q,EAAI,EAAGA,EAAIxB,KAAKs1C,KAAM9zC,IAC7B,IAAK,IAAIkB,EAAI,EAAGA,EAAI1C,KAAK84C,QAASp2C,IAChC1C,KAAK8M,IAAItL,EAAGkB,EAAGuL,KAAKmE,IAAIpS,KAAKiG,IAAIzE,EAAGkB,KAGxC,OAAO1C,IACT,EAEA66C,EAAezoC,IAAM,SAAazH,GAEhC,OADkB,IAAIwwC,EAAOxwC,GACZyH,KACnB,EAEAyoC,EAAer7C,UAAUisD,KAAO,WAC9B,IAAK,IAAIjqD,EAAI,EAAGA,EAAIxB,KAAKs1C,KAAM9zC,IAC7B,IAAK,IAAIkB,EAAI,EAAGA,EAAI1C,KAAK84C,QAASp2C,IAChC1C,KAAK8M,IAAItL,EAAGkB,EAAGuL,KAAKw9C,KAAKzrD,KAAKiG,IAAIzE,EAAGkB,KAGzC,OAAO1C,IACT,EAEA66C,EAAe4Q,KAAO,SAAc9gD,GAElC,OADkB,IAAIwwC,EAAOxwC,GACZ8gD,MACnB,EAEA5Q,EAAer7C,UAAU0O,KAAO,WAC9B,IAAK,IAAI1M,EAAI,EAAGA,EAAIxB,KAAKs1C,KAAM9zC,IAC7B,IAAK,IAAIkB,EAAI,EAAGA,EAAI1C,KAAK84C,QAASp2C,IAChC1C,KAAK8M,IAAItL,EAAGkB,EAAGuL,KAAKC,KAAKlO,KAAKiG,IAAIzE,EAAGkB,KAGzC,OAAO1C,IACT,EAEA66C,EAAe3sC,KAAO,SAAcvD,GAElC,OADkB,IAAIwwC,EAAOxwC,GACZuD,MACnB,EAEA2sC,EAAer7C,UAAUksD,IAAM,WAC7B,IAAK,IAAIlqD,EAAI,EAAGA,EAAIxB,KAAKs1C,KAAM9zC,IAC7B,IAAK,IAAIkB,EAAI,EAAGA,EAAI1C,KAAK84C,QAASp2C,IAChC1C,KAAK8M,IAAItL,EAAGkB,EAAGuL,KAAKy9C,IAAI1rD,KAAKiG,IAAIzE,EAAGkB,KAGxC,OAAO1C,IACT,EAEA66C,EAAe6Q,IAAM,SAAa/gD,GAEhC,OADkB,IAAIwwC,EAAOxwC,GACZ+gD,KACnB,EAEA7Q,EAAer7C,UAAUmsD,KAAO,WAC9B,IAAK,IAAInqD,EAAI,EAAGA,EAAIxB,KAAKs1C,KAAM9zC,IAC7B,IAAK,IAAIkB,EAAI,EAAGA,EAAI1C,KAAK84C,QAASp2C,IAChC1C,KAAK8M,IAAItL,EAAGkB,EAAGuL,KAAK09C,KAAK3rD,KAAKiG,IAAIzE,EAAGkB,KAGzC,OAAO1C,IACT,EAEA66C,EAAe8Q,KAAO,SAAchhD,GAElC,OADkB,IAAIwwC,EAAOxwC,GACZghD,MACnB,EAEA9Q,EAAer7C,UAAUosD,MAAQ,WAC/B,IAAK,IAAIpqD,EAAI,EAAGA,EAAIxB,KAAKs1C,KAAM9zC,IAC7B,IAAK,IAAIkB,EAAI,EAAGA,EAAI1C,KAAK84C,QAASp2C,IAChC1C,KAAK8M,IAAItL,EAAGkB,EAAGuL,KAAK29C,MAAM5rD,KAAKiG,IAAIzE,EAAGkB,KAG1C,OAAO1C,IACT,EAEA66C,EAAe+Q,MAAQ,SAAejhD,GAEpC,OADkB,IAAIwwC,EAAOxwC,GACZihD,OACnB,EAEA/Q,EAAev+B,IAAM,SAAa3R,EAAQkhD,GAExC,OADkB,IAAI1Q,EAAOxwC,GACZ2R,IAAIuvC,EACvB,EAEAhR,EAAer7C,UAAU8c,IAAM,SAAa9U,GAC1C,MAAqB,iBAAVA,EAA2BxH,KAAK8rD,KAAKtkD,GACzCxH,KAAK+rD,KAAKvkD,EACnB,EAEAqzC,EAAer7C,UAAUssD,KAAO,SAActkD,GAC5C,IAAK,IAAIhG,EAAI,EAAGA,EAAIxB,KAAKs1C,KAAM9zC,IAC7B,IAAK,IAAIkB,EAAI,EAAGA,EAAI1C,KAAK84C,QAASp2C,IAChC1C,KAAK8M,IAAItL,EAAGkB,EAAGuL,KAAKqO,IAAItc,KAAKiG,IAAIzE,EAAGkB,GAAI8E,IAG5C,OAAOxH,IACT,EAEA66C,EAAer7C,UAAUusD,KAAO,SAAcphD,GAE5C,GADAA,EAASwwC,EAAOK,YAAY7wC,GACxB3K,KAAKs1C,OAAS3qC,EAAO2qC,MACvBt1C,KAAK84C,UAAYnuC,EAAOmuC,QACxB,MAAM,IAAIZ,WAAW,qCAEvB,IAAK,IAAI12C,EAAI,EAAGA,EAAIxB,KAAKs1C,KAAM9zC,IAC7B,IAAK,IAAIkB,EAAI,EAAGA,EAAI1C,KAAK84C,QAASp2C,IAChC1C,KAAK8M,IAAItL,EAAGkB,EAAGuL,KAAKqO,IAAItc,KAAKiG,IAAIzE,EAAGkB,GAAIiI,EAAO1E,IAAIzE,EAAGkB,KAG1D,OAAO1C,IACT,CACF,CF8zBAgsD,CAAsBnR,GAAgBM,IGlnDvB,MAAM8Q,WAAwBpR,GAC3Cn0C,YAAY3C,GACVuhB,QACAtlB,KAAK+D,KAAOA,EACZ/D,KAAKs1C,KAAOvxC,EAAKrC,OACjB1B,KAAK84C,QAAU/0C,EAAK,GAAGrC,MACzB,CAEAoL,IAAI+3C,EAAUC,EAAat9C,GAEzB,OADAxH,KAAK+D,KAAK8gD,GAAUC,GAAet9C,EAC5BxH,IACT,CAEAiG,IAAI4+C,EAAUC,GACZ,OAAO9kD,KAAK+D,KAAK8gD,GAAUC,EAC7B,ECjBK,SAASoH,GAAWjnD,EAAGC,GAC5B,IAAI6D,EAAI,EACR,OAAIkF,KAAKmH,IAAInQ,GAAKgJ,KAAKmH,IAAIlQ,IACzB6D,EAAI7D,EAAID,EACDgJ,KAAKmH,IAAInQ,GAAKgJ,KAAKC,KAAK,EAAInF,EAAIA,IAE/B,IAAN7D,GACF6D,EAAI9D,EAAIC,EACD+I,KAAKmH,IAAIlQ,GAAK+I,KAAKC,KAAK,EAAInF,EAAIA,IAElC,CACT,CCNe,MAAMojD,GACnBzlD,YAAYc,EAAOiJ,EAAU,CAAC,GAG5B,IAFAjJ,EAAQykD,GAAgBzQ,YAAYh0C,IAE1BozC,UACR,MAAM,IAAIv2C,MAAM,4BAGlB,IAAIyE,EAAItB,EAAM8tC,KACV7vC,EAAI+B,EAAMsxC,QAEd,MAAM,2BACJsT,GAA6B,EAAI,4BACjCC,GAA8B,EAAI,cAClCC,GAAgB,GACd77C,EAEJ,IAIIxL,EAJAsnD,EAAQC,QAAQJ,GAChBK,EAAQD,QAAQH,GAEhBK,GAAU,EAEd,GAAI5jD,EAAIrD,EACN,GAAK6mD,EAME,CACLrnD,EAAIuC,EAAMw8C,YACVl7C,EAAI7D,EAAEqwC,KACN7vC,EAAIR,EAAE6zC,QACN4T,GAAU,EACV,IAAIC,EAAMJ,EACVA,EAAQE,EACRA,EAAQE,CACV,MAbE1nD,EAAIuC,EAAM2G,QAEVuV,QAAQC,KACN,+FAYJ1e,EAAIuC,EAAM2G,QAGZ,IAAIy+C,EAAK3+C,KAAKoD,IAAIvI,EAAGrD,GACjBonD,EAAK5+C,KAAKoD,IAAIvI,EAAI,EAAGrD,GACrBoB,EAAI,IAAI4hC,aAAaokB,GACrBC,EAAI,IAAI3R,GAAOryC,EAAG8jD,GAClBG,EAAI,IAAI5R,GAAO11C,EAAGA,GAElB5B,EAAI,IAAI4kC,aAAahjC,GACrBunD,EAAO,IAAIvkB,aAAa3/B,GAExBmkD,EAAK,IAAIxkB,aAAaokB,GAC1B,IAAK,IAAIrrD,EAAI,EAAGA,EAAIqrD,EAAIrrD,IAAKyrD,EAAGzrD,GAAKA,EAErC,IAAI0rD,EAAMj/C,KAAKoD,IAAIvI,EAAI,EAAGrD,GACtB0nD,EAAMl/C,KAAKc,IAAI,EAAGd,KAAKoD,IAAI5L,EAAI,EAAGqD,IAClCskD,EAAMn/C,KAAKc,IAAIm+C,EAAKC,GAExB,IAAK,IAAI7iD,EAAI,EAAGA,EAAI8iD,EAAK9iD,IAAK,CAC5B,GAAIA,EAAI4iD,EAAK,CACXrmD,EAAEyD,GAAK,EACP,IAAK,IAAI9I,EAAI8I,EAAG9I,EAAIsH,EAAGtH,IACrBqF,EAAEyD,GAAK4hD,GAAWrlD,EAAEyD,GAAIrF,EAAEgB,IAAIzE,EAAG8I,IAEnC,GAAa,IAATzD,EAAEyD,GAAU,CACVrF,EAAEgB,IAAIqE,EAAGA,GAAK,IAChBzD,EAAEyD,IAAMzD,EAAEyD,IAEZ,IAAK,IAAI9I,EAAI8I,EAAG9I,EAAIsH,EAAGtH,IACrByD,EAAE6H,IAAItL,EAAG8I,EAAGrF,EAAEgB,IAAIzE,EAAG8I,GAAKzD,EAAEyD,IAE9BrF,EAAE6H,IAAIxC,EAAGA,EAAGrF,EAAEgB,IAAIqE,EAAGA,GAAK,EAC5B,CACAzD,EAAEyD,IAAMzD,EAAEyD,EACZ,CAEA,IAAK,IAAI5H,EAAI4H,EAAI,EAAG5H,EAAI+C,EAAG/C,IAAK,CAC9B,GAAI4H,EAAI4iD,GAAgB,IAATrmD,EAAEyD,GAAU,CACzB,IAAI1D,EAAI,EACR,IAAK,IAAIpF,EAAI8I,EAAG9I,EAAIsH,EAAGtH,IACrBoF,GAAK3B,EAAEgB,IAAIzE,EAAG8I,GAAKrF,EAAEgB,IAAIzE,EAAGkB,GAE9BkE,GAAKA,EAAI3B,EAAEgB,IAAIqE,EAAGA,GAClB,IAAK,IAAI9I,EAAI8I,EAAG9I,EAAIsH,EAAGtH,IACrByD,EAAE6H,IAAItL,EAAGkB,EAAGuC,EAAEgB,IAAIzE,EAAGkB,GAAKkE,EAAI3B,EAAEgB,IAAIzE,EAAG8I,GAE3C,CACAzG,EAAEnB,GAAKuC,EAAEgB,IAAIqE,EAAG5H,EAClB,CAEA,GAAI6pD,GAASjiD,EAAI4iD,EACf,IAAK,IAAI1rD,EAAI8I,EAAG9I,EAAIsH,EAAGtH,IACrBsrD,EAAEhgD,IAAItL,EAAG8I,EAAGrF,EAAEgB,IAAIzE,EAAG8I,IAIzB,GAAIA,EAAI6iD,EAAK,CACXtpD,EAAEyG,GAAK,EACP,IAAK,IAAI9I,EAAI8I,EAAI,EAAG9I,EAAIiE,EAAGjE,IACzBqC,EAAEyG,GAAK4hD,GAAWroD,EAAEyG,GAAIzG,EAAErC,IAE5B,GAAa,IAATqC,EAAEyG,GAAU,CACVzG,EAAEyG,EAAI,GAAK,IACbzG,EAAEyG,GAAK,EAAIzG,EAAEyG,IAEf,IAAK,IAAI9I,EAAI8I,EAAI,EAAG9I,EAAIiE,EAAGjE,IACzBqC,EAAErC,IAAMqC,EAAEyG,GAEZzG,EAAEyG,EAAI,IAAM,CACd,CAEA,GADAzG,EAAEyG,IAAMzG,EAAEyG,GACNA,EAAI,EAAIxB,GAAc,IAATjF,EAAEyG,GAAU,CAC3B,IAAK,IAAI9I,EAAI8I,EAAI,EAAG9I,EAAIsH,EAAGtH,IACzBwrD,EAAKxrD,GAAK,EAEZ,IAAK,IAAIA,EAAI8I,EAAI,EAAG9I,EAAIsH,EAAGtH,IACzB,IAAK,IAAIkB,EAAI4H,EAAI,EAAG5H,EAAI+C,EAAG/C,IACzBsqD,EAAKxrD,IAAMqC,EAAEnB,GAAKuC,EAAEgB,IAAIzE,EAAGkB,GAG/B,IAAK,IAAIA,EAAI4H,EAAI,EAAG5H,EAAI+C,EAAG/C,IAAK,CAC9B,IAAIkE,GAAK/C,EAAEnB,GAAKmB,EAAEyG,EAAI,GACtB,IAAK,IAAI9I,EAAI8I,EAAI,EAAG9I,EAAIsH,EAAGtH,IACzByD,EAAE6H,IAAItL,EAAGkB,EAAGuC,EAAEgB,IAAIzE,EAAGkB,GAAKkE,EAAIomD,EAAKxrD,GAEvC,CACF,CACA,GAAIirD,EACF,IAAK,IAAIjrD,EAAI8I,EAAI,EAAG9I,EAAIiE,EAAGjE,IACzBurD,EAAEjgD,IAAItL,EAAG8I,EAAGzG,EAAErC,GAGpB,CACF,CAEA,IAAI8E,EAAI2H,KAAKoD,IAAI5L,EAAGqD,EAAI,GAYxB,GAXIokD,EAAMznD,IACRoB,EAAEqmD,GAAOjoD,EAAEgB,IAAIinD,EAAKA,IAElBpkD,EAAIxC,IACNO,EAAEP,EAAI,GAAK,GAET6mD,EAAM,EAAI7mD,IACZzC,EAAEspD,GAAOloD,EAAEgB,IAAIknD,EAAK7mD,EAAI,IAE1BzC,EAAEyC,EAAI,GAAK,EAEPimD,EAAO,CACT,IAAK,IAAI7pD,EAAIwqD,EAAKxqD,EAAIkqD,EAAIlqD,IAAK,CAC7B,IAAK,IAAIlB,EAAI,EAAGA,EAAIsH,EAAGtH,IACrBsrD,EAAEhgD,IAAItL,EAAGkB,EAAG,GAEdoqD,EAAEhgD,IAAIpK,EAAGA,EAAG,EACd,CACA,IAAK,IAAI4H,EAAI4iD,EAAM,EAAG5iD,GAAK,EAAGA,IAC5B,GAAa,IAATzD,EAAEyD,GAAU,CACd,IAAK,IAAI5H,EAAI4H,EAAI,EAAG5H,EAAIkqD,EAAIlqD,IAAK,CAC/B,IAAIkE,EAAI,EACR,IAAK,IAAIpF,EAAI8I,EAAG9I,EAAIsH,EAAGtH,IACrBoF,GAAKkmD,EAAE7mD,IAAIzE,EAAG8I,GAAKwiD,EAAE7mD,IAAIzE,EAAGkB,GAE9BkE,GAAKA,EAAIkmD,EAAE7mD,IAAIqE,EAAGA,GAClB,IAAK,IAAI9I,EAAI8I,EAAG9I,EAAIsH,EAAGtH,IACrBsrD,EAAEhgD,IAAItL,EAAGkB,EAAGoqD,EAAE7mD,IAAIzE,EAAGkB,GAAKkE,EAAIkmD,EAAE7mD,IAAIzE,EAAG8I,GAE3C,CACA,IAAK,IAAI9I,EAAI8I,EAAG9I,EAAIsH,EAAGtH,IACrBsrD,EAAEhgD,IAAItL,EAAG8I,GAAIwiD,EAAE7mD,IAAIzE,EAAG8I,IAExBwiD,EAAEhgD,IAAIxC,EAAGA,EAAG,EAAIwiD,EAAE7mD,IAAIqE,EAAGA,IACzB,IAAK,IAAI9I,EAAI,EAAGA,EAAI8I,EAAI,EAAG9I,IACzBsrD,EAAEhgD,IAAItL,EAAG8I,EAAG,EAEhB,KAAO,CACL,IAAK,IAAI9I,EAAI,EAAGA,EAAIsH,EAAGtH,IACrBsrD,EAAEhgD,IAAItL,EAAG8I,EAAG,GAEdwiD,EAAEhgD,IAAIxC,EAAGA,EAAG,EACd,CAEJ,CAEA,GAAImiD,EACF,IAAK,IAAIniD,EAAI7E,EAAI,EAAG6E,GAAK,EAAGA,IAAK,CAC/B,GAAIA,EAAI6iD,GAAgB,IAATtpD,EAAEyG,GACf,IAAK,IAAI5H,EAAI4H,EAAI,EAAG5H,EAAI+C,EAAG/C,IAAK,CAC9B,IAAIkE,EAAI,EACR,IAAK,IAAIpF,EAAI8I,EAAI,EAAG9I,EAAIiE,EAAGjE,IACzBoF,GAAKmmD,EAAE9mD,IAAIzE,EAAG8I,GAAKyiD,EAAE9mD,IAAIzE,EAAGkB,GAE9BkE,GAAKA,EAAImmD,EAAE9mD,IAAIqE,EAAI,EAAGA,GACtB,IAAK,IAAI9I,EAAI8I,EAAI,EAAG9I,EAAIiE,EAAGjE,IACzBurD,EAAEjgD,IAAItL,EAAGkB,EAAGqqD,EAAE9mD,IAAIzE,EAAGkB,GAAKkE,EAAImmD,EAAE9mD,IAAIzE,EAAG8I,GAE3C,CAEF,IAAK,IAAI9I,EAAI,EAAGA,EAAIiE,EAAGjE,IACrBurD,EAAEjgD,IAAItL,EAAG8I,EAAG,GAEdyiD,EAAEjgD,IAAIxC,EAAGA,EAAG,EACd,CAGF,IAAI+iD,EAAK/mD,EAAI,EACTwkC,EAAO,EACPwiB,EAAMp/B,OAAOq/B,QACjB,KAAOjnD,EAAI,GAAG,CACZ,IAAIgE,EAAGkjD,EACP,IAAKljD,EAAIhE,EAAI,EAAGgE,IAAM,IACT,IAAPA,EADmBA,IAAK,CAI5B,MAAM6R,EACJ+R,OAAOu/B,UAAYH,EAAMr/C,KAAKmH,IAAIvO,EAAEyD,GAAK2D,KAAKmH,IAAIvO,EAAEyD,EAAI,KAC1D,GAAI2D,KAAKmH,IAAIvR,EAAEyG,KAAO6R,GAAS+R,OAAOnkB,MAAMlG,EAAEyG,IAAK,CACjDzG,EAAEyG,GAAK,EACP,KACF,CACF,CACA,GAAIA,IAAMhE,EAAI,EACZknD,EAAO,MACF,CACL,IAAI/c,EACJ,IAAKA,EAAKnqC,EAAI,EAAGmqC,GAAMnmC,GACjBmmC,IAAOnmC,EADammC,IAAM,CAI9B,IAAI7pC,GACD6pC,IAAOnqC,EAAI2H,KAAKmH,IAAIvR,EAAE4sC,IAAO,IAC7BA,IAAOnmC,EAAI,EAAI2D,KAAKmH,IAAIvR,EAAE4sC,EAAK,IAAM,GACxC,GAAIxiC,KAAKmH,IAAIvO,EAAE4pC,KAAQ6c,EAAM1mD,EAAG,CAC9BC,EAAE4pC,GAAM,EACR,KACF,CACF,CACIA,IAAOnmC,EACTkjD,EAAO,EACE/c,IAAOnqC,EAAI,EACpBknD,EAAO,GAEPA,EAAO,EACPljD,EAAImmC,EAER,CAIA,OAFAnmC,IAEQkjD,GACN,KAAK,EAAG,CACN,IAAItpD,EAAIL,EAAEyC,EAAI,GACdzC,EAAEyC,EAAI,GAAK,EACX,IAAK,IAAI5D,EAAI4D,EAAI,EAAG5D,GAAK4H,EAAG5H,IAAK,CAC/B,IAAIkE,EAAIslD,GAAWrlD,EAAEnE,GAAIwB,GACrBwpD,EAAK7mD,EAAEnE,GAAKkE,EACZ4sC,EAAKtvC,EAAI0C,EAMb,GALAC,EAAEnE,GAAKkE,EACHlE,IAAM4H,IACRpG,GAAKsvC,EAAK3vC,EAAEnB,EAAI,GAChBmB,EAAEnB,EAAI,GAAKgrD,EAAK7pD,EAAEnB,EAAI,IAEpB+pD,EACF,IAAK,IAAIjrD,EAAI,EAAGA,EAAIiE,EAAGjE,IACrBoF,EAAI8mD,EAAKX,EAAE9mD,IAAIzE,EAAGkB,GAAK8wC,EAAKuZ,EAAE9mD,IAAIzE,EAAG8E,EAAI,GACzCymD,EAAEjgD,IAAItL,EAAG8E,EAAI,GAAIktC,EAAKuZ,EAAE9mD,IAAIzE,EAAGkB,GAAKgrD,EAAKX,EAAE9mD,IAAIzE,EAAG8E,EAAI,IACtDymD,EAAEjgD,IAAItL,EAAGkB,EAAGkE,EAGlB,CACA,KACF,CACA,KAAK,EAAG,CACN,IAAI1C,EAAIL,EAAEyG,EAAI,GACdzG,EAAEyG,EAAI,GAAK,EACX,IAAK,IAAI5H,EAAI4H,EAAG5H,EAAI4D,EAAG5D,IAAK,CAC1B,IAAIkE,EAAIslD,GAAWrlD,EAAEnE,GAAIwB,GACrBwpD,EAAK7mD,EAAEnE,GAAKkE,EACZ4sC,EAAKtvC,EAAI0C,EAIb,GAHAC,EAAEnE,GAAKkE,EACP1C,GAAKsvC,EAAK3vC,EAAEnB,GACZmB,EAAEnB,GAAKgrD,EAAK7pD,EAAEnB,GACV6pD,EACF,IAAK,IAAI/qD,EAAI,EAAGA,EAAIsH,EAAGtH,IACrBoF,EAAI8mD,EAAKZ,EAAE7mD,IAAIzE,EAAGkB,GAAK8wC,EAAKsZ,EAAE7mD,IAAIzE,EAAG8I,EAAI,GACzCwiD,EAAEhgD,IAAItL,EAAG8I,EAAI,GAAIkpC,EAAKsZ,EAAE7mD,IAAIzE,EAAGkB,GAAKgrD,EAAKZ,EAAE7mD,IAAIzE,EAAG8I,EAAI,IACtDwiD,EAAEhgD,IAAItL,EAAGkB,EAAGkE,EAGlB,CACA,KACF,CACA,KAAK,EAAG,CACN,MAAMu/C,EAAQl4C,KAAKc,IACjBd,KAAKmH,IAAIvO,EAAEP,EAAI,IACf2H,KAAKmH,IAAIvO,EAAEP,EAAI,IACf2H,KAAKmH,IAAIvR,EAAEyC,EAAI,IACf2H,KAAKmH,IAAIvO,EAAEyD,IACX2D,KAAKmH,IAAIvR,EAAEyG,KAEPqjD,EAAK9mD,EAAEP,EAAI,GAAK6/C,EAChByH,EAAO/mD,EAAEP,EAAI,GAAK6/C,EAClB0H,EAAOhqD,EAAEyC,EAAI,GAAK6/C,EAClB2H,EAAKjnD,EAAEyD,GAAK67C,EACZ4H,EAAKlqD,EAAEyG,GAAK67C,EACZjhD,IAAM0oD,EAAOD,IAAOC,EAAOD,GAAME,EAAOA,GAAQ,EAChDnqD,EAAIiqD,EAAKE,GAAQF,EAAKE,GAC5B,IAAIlpC,EAAQ,EACF,IAANzf,GAAiB,IAANxB,IAEXihB,EADEzf,EAAI,EACE,EAAI+I,KAAKC,KAAKhJ,EAAIA,EAAIxB,GAEtBuK,KAAKC,KAAKhJ,EAAIA,EAAIxB,GAE5BihB,EAAQjhB,GAAKwB,EAAIyf,IAEnB,IAAIzgB,GAAK4pD,EAAKH,IAAOG,EAAKH,GAAMhpC,EAC5B1c,EAAI6lD,EAAKC,EACb,IAAK,IAAIrrD,EAAI4H,EAAG5H,EAAI4D,EAAI,EAAG5D,IAAK,CAC9B,IAAIkE,EAAIslD,GAAWhoD,EAAG+D,GACZ,IAANrB,IAASA,EAAIsnB,OAAOu/B,WACxB,IAAIC,EAAKxpD,EAAI0C,EACT4sC,EAAKvrC,EAAIrB,EAQb,GAPIlE,IAAM4H,IACRzG,EAAEnB,EAAI,GAAKkE,GAEb1C,EAAIwpD,EAAK7mD,EAAEnE,GAAK8wC,EAAK3vC,EAAEnB,GACvBmB,EAAEnB,GAAKgrD,EAAK7pD,EAAEnB,GAAK8wC,EAAK3sC,EAAEnE,GAC1BuF,EAAIurC,EAAK3sC,EAAEnE,EAAI,GACfmE,EAAEnE,EAAI,GAAKgrD,EAAK7mD,EAAEnE,EAAI,GAClB+pD,EACF,IAAK,IAAIjrD,EAAI,EAAGA,EAAIiE,EAAGjE,IACrBoF,EAAI8mD,EAAKX,EAAE9mD,IAAIzE,EAAGkB,GAAK8wC,EAAKuZ,EAAE9mD,IAAIzE,EAAGkB,EAAI,GACzCqqD,EAAEjgD,IAAItL,EAAGkB,EAAI,GAAI8wC,EAAKuZ,EAAE9mD,IAAIzE,EAAGkB,GAAKgrD,EAAKX,EAAE9mD,IAAIzE,EAAGkB,EAAI,IACtDqqD,EAAEjgD,IAAItL,EAAGkB,EAAGkE,GAYhB,GATAA,EAAIslD,GAAWhoD,EAAG+D,GACR,IAANrB,IAASA,EAAIsnB,OAAOu/B,WACxBC,EAAKxpD,EAAI0C,EACT4sC,EAAKvrC,EAAIrB,EACTC,EAAEnE,GAAKkE,EACP1C,EAAIwpD,EAAK7pD,EAAEnB,GAAK8wC,EAAK3sC,EAAEnE,EAAI,GAC3BmE,EAAEnE,EAAI,IAAM8wC,EAAK3vC,EAAEnB,GAAKgrD,EAAK7mD,EAAEnE,EAAI,GACnCuF,EAAIurC,EAAK3vC,EAAEnB,EAAI,GACfmB,EAAEnB,EAAI,GAAKgrD,EAAK7pD,EAAEnB,EAAI,GAClB6pD,GAAS7pD,EAAIoG,EAAI,EACnB,IAAK,IAAItH,EAAI,EAAGA,EAAIsH,EAAGtH,IACrBoF,EAAI8mD,EAAKZ,EAAE7mD,IAAIzE,EAAGkB,GAAK8wC,EAAKsZ,EAAE7mD,IAAIzE,EAAGkB,EAAI,GACzCoqD,EAAEhgD,IAAItL,EAAGkB,EAAI,GAAI8wC,EAAKsZ,EAAE7mD,IAAIzE,EAAGkB,GAAKgrD,EAAKZ,EAAE7mD,IAAIzE,EAAGkB,EAAI,IACtDoqD,EAAEhgD,IAAItL,EAAGkB,EAAGkE,EAGlB,CACA/C,EAAEyC,EAAI,GAAKpC,EACX4mC,GAAc,EACd,KACF,CACA,KAAK,EACH,GAAIjkC,EAAEyD,IAAM,IACVzD,EAAEyD,GAAKzD,EAAEyD,GAAK,GAAKzD,EAAEyD,GAAK,EACtBmiD,GACF,IAAK,IAAIjrD,EAAI,EAAGA,GAAK6rD,EAAI7rD,IACvBurD,EAAEjgD,IAAItL,EAAG8I,GAAIyiD,EAAE9mD,IAAIzE,EAAG8I,IAI5B,KAAOA,EAAI+iD,KACLxmD,EAAEyD,IAAMzD,EAAEyD,EAAI,KADL,CAIb,IAAI1D,EAAIC,EAAEyD,GAGV,GAFAzD,EAAEyD,GAAKzD,EAAEyD,EAAI,GACbzD,EAAEyD,EAAI,GAAK1D,EACP6lD,GAASniD,EAAI7E,EAAI,EACnB,IAAK,IAAIjE,EAAI,EAAGA,EAAIiE,EAAGjE,IACrBoF,EAAImmD,EAAE9mD,IAAIzE,EAAG8I,EAAI,GACjByiD,EAAEjgD,IAAItL,EAAG8I,EAAI,EAAGyiD,EAAE9mD,IAAIzE,EAAG8I,IACzByiD,EAAEjgD,IAAItL,EAAG8I,EAAG1D,GAGhB,GAAI2lD,GAASjiD,EAAIxB,EAAI,EACnB,IAAK,IAAItH,EAAI,EAAGA,EAAIsH,EAAGtH,IACrBoF,EAAIkmD,EAAE7mD,IAAIzE,EAAG8I,EAAI,GACjBwiD,EAAEhgD,IAAItL,EAAG8I,EAAI,EAAGwiD,EAAE7mD,IAAIzE,EAAG8I,IACzBwiD,EAAEhgD,IAAItL,EAAG8I,EAAG1D,GAGhB0D,GACF,CACAwgC,EAAO,EACPxkC,IAKN,CAEA,GAAIomD,EAAS,CACX,IAAIl3B,EAAMu3B,EACVA,EAAID,EACJA,EAAIt3B,CACN,CAEAx1B,KAAK8I,EAAIA,EACT9I,KAAKyF,EAAIA,EACTzF,KAAK6G,EAAIA,EACT7G,KAAK8sD,EAAIA,EACT9sD,KAAK+sD,EAAIA,CACX,CAEAiB,MAAMxmD,GACJ,IAAIymD,EAAIzmD,EACJ3D,EAAI7D,KAAKkuD,UACTC,EAAQnuD,KAAK6G,EAAEnF,OACf0sD,EAAKjT,GAAOE,MAAM8S,EAAOA,GAE7B,IAAK,IAAI3sD,EAAI,EAAGA,EAAI2sD,EAAO3sD,IACrByM,KAAKmH,IAAIpV,KAAK6G,EAAErF,KAAOqC,EACzBuqD,EAAGthD,IAAItL,EAAGA,EAAG,GAEb4sD,EAAGthD,IAAItL,EAAGA,EAAG,EAAIxB,KAAK6G,EAAErF,IAI5B,IAAIsrD,EAAI9sD,KAAK8sD,EACTC,EAAI/sD,KAAKquD,qBAETC,EAAKvB,EAAExN,KAAK6O,GACZG,EAAQxB,EAAEzX,KACVkZ,EAAQ1B,EAAExX,KACVmZ,EAAMtT,GAAOE,MAAMkT,EAAOC,GAE9B,IAAK,IAAIhtD,EAAI,EAAGA,EAAI+sD,EAAO/sD,IACzB,IAAK,IAAIkB,EAAI,EAAGA,EAAI8rD,EAAO9rD,IAAK,CAC9B,IAAIwyB,EAAM,EACV,IAAK,IAAI5qB,EAAI,EAAGA,EAAI6jD,EAAO7jD,IACzB4qB,GAAOo5B,EAAGroD,IAAIzE,EAAG8I,GAAKwiD,EAAE7mD,IAAIvD,EAAG4H,GAEjCmkD,EAAI3hD,IAAItL,EAAGkB,EAAGwyB,EAChB,CAGF,OAAOu5B,EAAIlP,KAAK0O,EAClB,CAEAS,iBAAiBlnD,GACf,OAAOxH,KAAKguD,MAAM7S,GAAO8D,KAAKz3C,GAChC,CAEAmnD,UACE,IAAI5B,EAAI/sD,KAAK+sD,EACTlpD,EAAI7D,KAAKkuD,UACTK,EAAQxB,EAAEzX,KACVsZ,EAAQ7B,EAAEjU,QACV+V,EAAI,IAAI1T,GAAOoT,EAAOvuD,KAAK6G,EAAEnF,QAEjC,IAAK,IAAIF,EAAI,EAAGA,EAAI+sD,EAAO/sD,IACzB,IAAK,IAAIkB,EAAI,EAAGA,EAAIksD,EAAOlsD,IACrBuL,KAAKmH,IAAIpV,KAAK6G,EAAEnE,IAAMmB,GACxBgrD,EAAE/hD,IAAItL,EAAGkB,EAAGqqD,EAAE9mD,IAAIzE,EAAGkB,GAAK1C,KAAK6G,EAAEnE,IAKvC,IAAIoqD,EAAI9sD,KAAK8sD,EAET0B,EAAQ1B,EAAExX,KACVwZ,EAAQhC,EAAEhU,QACVmV,EAAI,IAAI9S,GAAOoT,EAAOC,GAE1B,IAAK,IAAIhtD,EAAI,EAAGA,EAAI+sD,EAAO/sD,IACzB,IAAK,IAAIkB,EAAI,EAAGA,EAAI8rD,EAAO9rD,IAAK,CAC9B,IAAIwyB,EAAM,EACV,IAAK,IAAI5qB,EAAI,EAAGA,EAAIwkD,EAAOxkD,IACzB4qB,GAAO25B,EAAE5oD,IAAIzE,EAAG8I,GAAKwiD,EAAE7mD,IAAIvD,EAAG4H,GAEhC2jD,EAAEnhD,IAAItL,EAAGkB,EAAGwyB,EACd,CAGF,OAAO+4B,CACT,CAEIc,gBACF,OAAO/uD,KAAK6G,EAAE,GAAK7G,KAAK6G,EAAEoH,KAAKoD,IAAIrR,KAAK8I,EAAG9I,KAAKyF,GAAK,EACvD,CAEIupD,YACF,OAAOhvD,KAAK6G,EAAE,EAChB,CAEI0nB,WACF,IAAI0gC,EAAMhhD,KAAKc,IAAI/O,KAAK8I,EAAG9I,KAAKyF,GAAKzF,KAAK6G,EAAE,GAAKqnB,OAAOq/B,QACpDxkD,EAAI,EACJlC,EAAI7G,KAAK6G,EACb,IAAK,IAAIrF,EAAI,EAAGoR,EAAK/L,EAAEnF,OAAQF,EAAIoR,EAAIpR,IACjCqF,EAAErF,GAAKytD,GACTlmD,IAGJ,OAAOA,CACT,CAEIg+C,eACF,OAAOnlD,MAAMuH,KAAKnJ,KAAK6G,EACzB,CAEIqnD,gBACF,OAAQhgC,OAAOq/B,QAAU,EAAKt/C,KAAKc,IAAI/O,KAAK8I,EAAG9I,KAAKyF,GAAKzF,KAAK6G,EAAE,EAClE,CAEIqoD,0BACF,OAAOlvD,KAAK8sD,CACd,CAEIuB,2BACF,OAAOruD,KAAK+sD,CACd,CAEIoC,qBACF,OAAOhU,GAAO8D,KAAKj/C,KAAK6G,EAC1B,EC3fF,IAAM,GAAqD,CACzD6I,OAAQ,CAAC,EAAG,GACZoS,aAAc,IAkBhB,cAGE,WAAmBrR,QAAA,IAAAA,MAA4B,CAAC,GAA7B,KAAAA,UAFnB,KAAAxM,GAAK,MAGHjE,KAAKyQ,QAAU,OACV,IACAA,EAEP,CA0EF,OArEQ,YAAAC,QAAN,SAAcjB,EAAcgB,G,mEAC1B,MAAO,CAAP,EAAOzQ,KAAKovD,kBAAiB,EAAO3/C,EAAOgB,G,QAKvC,YAAArM,OAAN,SAAaqL,EAAcgB,G,0EACzBzQ,KAAKovD,kBAAiB,EAAM3/C,EAAOgB,G,WAavB,YAAA2+C,iBAAd,SACEhrD,EACAqL,EACAgB,G,+FAQA,OANMG,EAAgB,OAAK5Q,KAAKyQ,SAAYA,GACpC,EAAuCG,EAAa,OAApDlB,OAAM,IAAG,GAAC,EAAG,GAAE,EAAE,EAAsBkB,EAAa,aAAnCkR,OAAY,IAAG,KAAE,EAEpCrX,EAAQgF,EAAME,cACdjF,EAAQ+E,EAAMG,eAEfnF,aAAK,EAALA,EAAO/I,SAA2B,IAAjB+I,EAAM/I,QAKtBwI,EAAYK,EAAa,CAAEE,MAAK,EAAEC,MAAK,IAAI,GAC3CgU,EAAYzU,EAAcC,GAChCmlD,GAAe3wC,GAGT4wC,EAAUpkD,EAAYwT,EAAWoD,GAGjCytC,EAAYC,GAAOF,GACnB/9C,EAAyB,GAC/Bg+C,EAAUzqD,SAAQ,SAACwB,EAAa9E,GAC9B,IAAMoT,EAAQrG,EAAgB9D,EAAMjJ,IACpCoT,EAAM7Q,KAAKiI,EAAI1F,EAAE,GAAKoJ,EAAO,GAC7BkF,EAAM7Q,KAAKiE,EAAI1B,EAAE,GAAKoJ,EAAO,GAC7B6B,EAAY/Q,KAAKoU,EACnB,IAEIxQ,GACFmN,EAAYzM,SAAQ,SAAC+F,GACnB,OAAA4E,EAAMI,cAAchF,EAAK5G,GAAI,CAC3B+H,EAAGnB,EAAK9G,KAAKiI,EACbhE,EAAG6C,EAAK9G,KAAKiE,GAFf,IAYG,CAAP,EALe,CACbyC,MAAO8G,EACP7G,MAAK,KAhCE,CAAP,EAAO8E,EAAsBC,EAAOrL,EAAQsL,G,QAqClD,EAlFA,GAoFM2/C,GAAiB,SAAC3wC,GACtB,IAAI+wC,GAAe,OACnB/wC,EAAU5Z,SAAQ,SAACsG,GACjBA,EAAItG,SAAQ,SAAC0C,GACPA,IAAU6C,KAGVolD,EAAcjoD,IAChBioD,EAAcjoD,EAElB,GACF,IACAkX,EAAU5Z,SAAQ,SAACsG,EAAK5J,GACtB4J,EAAItG,SAAQ,SAAC0C,EAAO9E,GACd8E,IAAU6C,MACZqU,EAAUld,GAAGkB,GAAK+sD,EAEtB,GACF,GACF,EAMMD,GAAS,SAAC9wC,GACd,IAGMgxC,EAAI,OAAa,OAAahxC,EAAW,IAAK,IAG9CixC,EAAWD,EAAEnK,KAAK,OAClBqK,EAAWF,EAAEnK,KAAK,UAClBsK,EAAYH,EAAEnK,OACpBmK,EAAE93C,IAAIi4C,GAAWhS,aAAa8R,GAAU1R,gBAAgB2R,GAIxD,IAAME,EAAM,IAAI3D,GAA2BuD,GACrCK,EAAc,QAAcD,EAAIX,gBAAgBpI,WACtD,OAAO+I,EAAIZ,oBAAoB9jC,SAASve,KAAI,SAACzB,GAC3C,OAAO,OAAa,CAACA,GAAM,CAAC2kD,IACzB3kC,SAAS,GACThH,OAAO,EAlBM,EAmBlB,GACF,ECrJM,GAAiE,CACrE9Q,WAAY,GACZrE,OAAQ,GACRD,MAAO,GACP4kC,MAAO,IACPpK,QAAS,GACTl/B,EAAG,GAuBC0lD,GAAe,SAACvlD,EAAe8kD,EAAoBU,EAAe3lD,EAAW2U,EAAiB2E,GAClG2rC,EAAUzqD,SAAQ,SAAC4D,EAAUlH,GAC3ByuD,EAAKzuD,GAAK,CAAEwK,EAAG,EAAGhE,EAAG,GACrBunD,EAAUzqD,SAAQ,SAACmtB,EAAUvvB,GAC3B,GAAIlB,IAAMkB,GAINuc,EAAMzd,KAAOyd,EAAMvc,GAAvB,CAGA,IAAIwtD,EAAOxnD,EAAEsD,EAAIimB,EAAEjmB,EACfmkD,EAAOznD,EAAEV,EAAIiqB,EAAEjqB,EACf8kC,EAAY7+B,KAAKC,KAAKgiD,EAAOA,EAAOC,EAAOA,GAC/C,GAAkB,IAAdrjB,EAAiB,CACnBA,EAAY,EACZ,IAAM0e,EAAOhqD,EAAIkB,EAAI,GAAK,EAC1BwtD,EAAO,IAAO1E,EACd2E,EAAO,IAAO3E,C,CAGhB,GAAI1e,EAAYlpB,EAAanZ,EAAMjJ,IAAM,EAAIoiB,EAAanZ,EAAM/H,IAAM,EAAG,CACvE,IAAMsyC,EAAU1qC,EAAIA,EAAKwiC,EACzBmjB,EAAKzuD,GAAGwK,GAAMkkD,EAAOpjB,EAAakI,EAClCib,EAAKzuD,GAAGwG,GAAMmoD,EAAOrjB,EAAakI,C,EAEtC,GACF,GACF,EAEMob,GAAkB,SAACb,EAAoBU,EAAerc,EAAeyc,EAAuBC,EAAkBhc,EAAqBtlC,EAAeiQ,GACtJ,IAAMsxC,EAAUjc,GAAetlC,EAAQ,GA0CvC,OAzCIqhD,GACFJ,EAAKnrD,SAAQ,SAAC0rD,EAAIhvD,GAChB,IAAMwb,EAAKuyC,EAAU/tD,GAAGwK,EAAIujD,EAAUe,GAAUtkD,EAC1CkR,EAAKqyC,EAAU/tD,GAAGwG,EAAIunD,EAAUe,GAAUtoD,EAC1CkmC,EAAUjgC,KAAKC,KAAK8O,EAAKA,EAAKE,EAAKA,GACrCuzC,EAAMvzC,EAAKgxB,EACXwiB,GAAO1zC,EAAKkxB,EACVyiB,EAAW1iD,KAAKC,KAAKsiD,EAAGxkD,EAAIwkD,EAAGxkD,EAAIwkD,EAAGxoD,EAAIwoD,EAAGxoD,GAC/CmU,EAAQlO,KAAKy8C,MAAM+F,EAAMD,EAAGxkD,EAAI0kD,EAAMF,EAAGxoD,GAAK2oD,GAC9Cx0C,EAAQlO,KAAKmC,GAAK,IACpB+L,GAASlO,KAAKmC,GAAK,EACnBqgD,IAAQ,EACRC,IAAQ,GAEV,IAAME,EAAc3iD,KAAKkE,IAAIgK,GAASw0C,EACtCH,EAAGxkD,EAAIykD,EAAMG,EACbJ,EAAGxoD,EAAI0oD,EAAME,CACf,IAIFrB,EAAUzqD,SAAQ,SAACW,EAAGjE,GACpB,GAAIA,IAAM8uD,EAAV,CAGA,IAAM5b,EAAazmC,KAAKC,KAAK+hD,EAAKzuD,GAAGwK,EAAIikD,EAAKzuD,GAAGwK,EAAIikD,EAAKzuD,GAAGwG,EAAIioD,EAAKzuD,GAAGwG,GACzE,GAAI0sC,EAAa,GAAKlzC,IAAM8uD,EAAU,CACpC,IAAM1b,EAAc3mC,KAAKoD,IAAIk/C,GAAW3c,EAzGxB,KAyGgDc,GAGhE,GAFAjvC,EAAEuG,GAAMikD,EAAKzuD,GAAGwK,EAAI0oC,EAAcE,EAClCnvC,EAAEuC,GAAMioD,EAAKzuD,GAAGwG,EAAI0sC,EAAcE,EAC9Byb,EAAc,CAChB,IAAIrzC,EAAKvX,EAAEuG,EAAIujD,EAAUe,GAAUtkD,EAC/BkR,EAAKzX,EAAEuC,EAAIunD,EAAUe,GAAUtoD,EAC7B6oD,EAAQ5iD,KAAKC,KAAK8O,EAAKA,EAAKE,EAAKA,GACvCF,EAAMA,EAAK6zC,EAAS5xC,EAAMzd,GAC1B0b,EAAMA,EAAK2zC,EAAS5xC,EAAMzd,GAC1BiE,EAAEuG,EAAIujD,EAAUe,GAAUtkD,EAAIgR,EAC9BvX,EAAEuC,EAAIunD,EAAUe,GAAUtoD,EAAIkV,C,GAGpC,IACOqyC,CACT,EChGM,GAAwD,CAC5DhmB,aAAc,IACdlF,UAAW,KACXysB,WAAY,KACZhvC,aAAc,GACdhO,gBAAgB,EAChBu8C,cAAc,EACdU,2BAA4B,IAC5BC,aAAc,IAkBhB,cAGE,WAAmBvgD,QAAA,IAAAA,MAA+B,CAAC,GAAhC,KAAAA,UAFnB,KAAAxM,GAAK,SAGHjE,KAAKyQ,QAAU,OACV,IACAA,EAEP,CA6PF,OAxPQ,YAAAC,QAAN,SAAcjB,EAAcgB,G,mEAC1B,MAAO,CAAP,EAAOzQ,KAAKixD,qBAAoB,EAAOxhD,EAAOgB,G,QAK1C,YAAArM,OAAN,SAAaqL,EAAcgB,G,0EACzBzQ,KAAKixD,qBAAoB,EAAMxhD,EAAOgB,G,WAa1B,YAAAwgD,oBAAd,SACE7sD,EACAqL,EACAgB,G,+JAmCA,GAjCMG,EAAgB,OAAK5Q,KAAKyQ,SAAYA,GAEnC4D,EAcLzD,EAAa,MAbP0D,EAaN1D,EAAa,OAZPwD,EAYNxD,EAAa,OAXJsgD,EAWTtgD,EAAa,UAVHugD,EAUVvgD,EAAa,WATfzB,EASEyB,EAAa,SARfxB,EAQEwB,EAAa,YAPfy/C,EAOEz/C,EAAa,aANfkD,EAMElD,EAAa,eALfmgD,EAKEngD,EAAa,2BAJfsD,EAIEtD,EAAa,OAHf,EAGEA,EAAa,aAHfkR,OAAY,IAAG,KAAE,EACjB,EAEElR,EAAa,aAFfogD,OAAY,IAAG,KAAE,EACjB,EACEpgD,EAAa,aADf24B,OAAY,IAAG,MAAI,EAGf9+B,EAAQgF,EAAME,cACdjF,EAAQ+E,EAAMG,cAEdZ,EACHqF,GAAgC,oBAAXxB,OAElBwB,EADAxB,OAAOC,WAEP7D,EACHqF,GAAiC,oBAAXzB,OAEnByB,EADAzB,OAAOE,YAEPrD,EACH0E,GAAc,CAACpF,EAAQ,EAAGC,EAAS,KAGjCxE,aAAK,EAALA,EAAO/I,SAA2B,IAAjB+I,EAAM/I,OAC1B,MAAO,CAAP,EAAO8N,EAAsBC,EAAOrL,EAAQsL,IAI9C,GADI20B,EAAY55B,EAAM,GAClB,EAASymD,IACX,IAAS1vD,EAAI,EAAGA,EAAIiJ,EAAM/I,OAAQF,IAChC,GAAIiJ,EAAMjJ,GAAGyC,KAAOitD,EAAgB,CAClC7sB,EAAY55B,EAAMjJ,GAClB,K,OAIJ6iC,EAAY6sB,GAAkBzmD,EAAM,GA2GtC,OAvGM2mD,EAAaC,GAAa5mD,EAAO45B,EAAUpgC,IAG3CiG,EAAYK,EAAa,CAAEE,MAAK,EAAEC,MAAK,IAAI,GAC3CgU,EAAYzU,EAAcC,GAC1BulD,EAAc6B,GAAW5yC,EAAW0yC,GAE1C,GAAe1yC,EAAW0yC,EAAY3B,EAAc,GAG9C8B,EAAa7yC,EAAU0yC,GACzBI,EACFxiD,EAAQU,EAAO,GAAKA,EAAO,GAAKA,EAAO,GAAKV,EAAQU,EAAO,GACzD+hD,EACFxiD,EAASS,EAAO,GAAKA,EAAO,GAAKA,EAAO,GAAKT,EAASS,EAAO,GAC7C,IAAd8hD,IACFA,EAAYxiD,EAAQ,GAEH,IAAfyiD,IACFA,EAAaxiD,EAAS,GAGlByiD,EAAYzjD,KAAKoD,IAAImgD,EAAWC,GAChCE,EAAO1jD,KAAKc,IAAG,MAARd,KAAI,OAAQsjD,KAEnBtyC,EAAkB,GAClB6xC,EAAcK,GAAkBO,EAAYC,EAClDJ,EAAWzsD,SAAQ,SAAC0C,EAAOhG,GACzByd,EAAMzd,GAAKgG,EAAQspD,CACrB,IAEMc,EAAiBC,GACrBpnD,EACAiU,EACAoD,EACA7C,EACA6xC,EACA58C,EACA88C,GAGIc,EAAUC,GAAgBH,GAG1BI,ECrLS,SAACC,EAAmBvzC,EAAqBoD,GAC1D,IAEE,IAAM4tC,EAAI,OAAa,OAAahxC,EAAW,IAAK,IAG9CixC,EAAWD,EAAEnK,KAAK,OAClBqK,EAAWF,EAAEnK,KAAK,UAClBsK,EAAYH,EAAEnK,OACpBmK,EAAE93C,IAAIi4C,GAAWhS,aAAa8R,GAAU1R,gBAAgB2R,GAIxD,IAAME,EAAM,IAAI3D,GAA2BuD,GACrC,EAAc,QAAcI,EAAIX,gBAAgBpI,WACtD,OAAO+I,EAAIZ,oBAAoB9jC,SAASve,KAAI,SAACzB,GAC3C,OAAO,OAAa,CAACA,GAAM,CAAC,IAAcggB,SAAS,GAAGhH,OAAO,EAAG6tC,EAClE,G,CACA,SAEA,IADA,IAAM1b,EAAoB,GACjB/0C,EAAI,EAAGA,EAAIkd,EAAUhd,OAAQF,IAAK,CACzC,IAAMwK,EAAIiC,KAAKS,SAAWoT,EACpB9Z,EAAIiG,KAAKS,SAAWoT,EAC1By0B,EAAI/1C,KAAK,CAACwL,EAAGhE,G,CAEf,OAAOuuC,C,CAEX,CD0JsB2b,CAAIpwC,EAAc8vC,EAAgB9vC,GAChDytC,EAAYyC,EAAUnlD,KAAI,SAAC,G,IAAA,SAACb,EAAC,KAAEhE,EAAC,KAAM,OACxCgE,GACGjC,MAAMiC,GAAKiC,KAAKS,SAAWoT,EAAe9V,GAC3CgmD,EAAUZ,GAAY,GACxBppD,GACG+B,MAAM/B,GAAKiG,KAAKS,SAAWoT,EAAe9Z,GAC3CgqD,EAAUZ,GAAY,GANgB,IAS1CpxD,KAAK0sB,IACH6c,EACAgmB,EACAuC,EACAF,EACA3yC,EACAmyC,GAIEt9C,IACF8P,EAAe1U,EAAeC,EAAUC,GAClC+iD,GAAsD,CAC1D1nD,MAAK,EACLmZ,aAAY,EACZ2rC,UAAS,EACTtwC,MAAK,EACLhQ,OAAM,EACND,MAAK,EACLqhD,aAAc7D,QAAQ6D,GACtBC,SAAUc,EACV99C,WAAYy9C,GAA8B,IAC1CzmD,EAAGilD,EAAU7tD,OAAS,KAExB6tD,ED9L+B,SAAC9/C,EAAcgB,GASlD,IARA,IAAMG,EAAgB,OAAK,IAA4BH,GAC/C8+C,EAAmG3+C,EAAa,UAArG0C,EAAwF1C,EAAa,WAAzF5B,EAA4E4B,EAAa,MAAlFtG,EAAqEsG,EAAa,EAA/E,EAAkEA,EAAa,MAA/EgjC,OAAK,IAAG,MAAG,EAAEyc,EAAqDz/C,EAAa,aAApD0/C,EAAuC1/C,EAAa,SAA1C,EAA6BA,EAAa,MAA1CqO,OAAK,IAAG,KAAE,EAAE2E,EAAiBhT,EAAa,aAElHnG,EAAQgF,EAAME,cAEdsgD,EAAgB,GAChB3b,EAActlC,EAAQ,GAEnBxN,EAAI,EAAGA,EAAI8R,EAAY9R,IAC9B+tD,EAAUzqD,SAAQ,SAACoD,EAAUoC,GAC3B2lD,EAAK3lD,GAAK,CAAE0B,EAAG,EAAGhE,EAAG,EACvB,IAEAgoD,GAAavlD,EAAO8kD,EAAWU,EAAM3lD,EAAG2U,EAAO2E,GAC/CwsC,GAAgBb,EAAWU,EAAMrc,EAAOyc,EAAcC,EAAUhc,EAAatlC,EAAOiQ,GAEtF,OAAOswC,CACT,CC4KkB6C,CAAsB3iD,EAAO0iD,KAGrC5gD,GAAyB,GAC/Bg+C,EAAUzqD,SAAQ,SAACwB,EAAU9E,GAC3B,IAAMoT,EAAQrG,EAAgB9D,EAAMjJ,IACpCoT,EAAM7Q,KAAKiI,EAAI1F,EAAE0F,EAAI0D,EAAO,GAC5BkF,EAAM7Q,KAAKiE,EAAI1B,EAAE0B,EAAI0H,EAAO,GAC5B6B,GAAY/Q,KAAKoU,EACnB,IAEIxQ,GACFmN,GAAYzM,SAAQ,SAAC+F,GACnB,OAAA4E,EAAMI,cAAchF,EAAK5G,GAAI,CAC3B+H,EAAGnB,EAAK9G,KAAKiI,EACbhE,EAAG6C,EAAK9G,KAAKiE,GAFf,IAYG,CAAP,EALe,CACbyC,MAAO8G,GACP7G,MAAK,G,QAKD,YAAAgiB,IAAR,SACE6c,EACAgmB,EACAuC,EACAF,EACA3yC,EACAmyC,GAEA,IAAK,IAAI5vD,EAAI,EAAGA,GAAK+nC,EAAc/nC,IAAK,CACtC,IAAM6nC,EAAQ7nC,EAAI+nC,EAClBvpC,KAAKqyD,aACHhpB,EACAkmB,EACAtwC,EACA2yC,EACAE,EACAV,E,CAGN,EACQ,YAAAiB,aAAR,SACEhpB,EACAkmB,EACAtwC,EACAP,EACAozC,EACAV,GAEA,IAAMkB,EAAS,EAAIjpB,EACnBkmB,EAAUzqD,SAAQ,SAAC4D,EAAUlH,GAE3B,IAAM+wD,EAAYzkD,EAAqBpF,EAAG,CAAEsD,EAAG,EAAGhE,EAAG,IAC/CwqD,EAAyB,IAAdD,EAAkB,EAAI,EAAIA,EAC3C,GAAI/wD,IAAM4vD,EAAV,CAGA,IAAIqB,EAAY,EACZC,EAAY,EACZC,EAAc,EAClBpD,EAAUzqD,SAAQ,SAACmtB,EAAGvvB,GAEpB,GAAIlB,IAAMkB,EAAV,CAIA,IAAMkwD,EAAO9kD,EAAqBpF,EAAGupB,GAC/B4gC,EAAoB,IAATD,EAAa,EAAI,EAAIA,EAChCE,EAAWp0C,EAAUhc,GAAGlB,GAE9BmxD,GAAeb,EAAQtwD,GAAGkB,GAE1B+vD,GAAaX,EAAQtwD,GAAGkB,IAAMuvB,EAAEjmB,EAAI8mD,GAAYpqD,EAAEsD,EAAIimB,EAAEjmB,GAAK6mD,GAE7DH,GAAaZ,EAAQtwD,GAAGkB,IAAMuvB,EAAEjqB,EAAI8qD,GAAYpqD,EAAEV,EAAIiqB,EAAEjqB,GAAK6qD,E,CAC/D,IACA,IAAME,EAAqB,IAAb9zC,EAAMzd,GAAW,EAAI,EAAIyd,EAAMzd,GAC7CmxD,GAAeL,EACfK,GAAetpB,EAAQ0pB,EAAQA,EAE/BN,GAAaH,EACbG,GAAappB,EAAQ0pB,EAAQrqD,EAAEsD,EAAIwmD,EACnC9pD,EAAEsD,EAAIymD,EAAYE,EAElBD,GAAaJ,EACbI,GAAarpB,EAAQ0pB,EAAQrqD,EAAEV,EAAIwqD,EACnC9pD,EAAEV,EAAI0qD,EAAYC,C,CACpB,GACF,EACF,EArQA,GAuQMd,GAAkB,SACtBpnD,EACAiU,EACAoD,EACA7C,EACA6xC,EACA58C,EACA88C,GAEA,IAAKvmD,EAAO,MAAO,GACnB,IAAMlG,EAAmB,GACzB,GAAIma,EAAW,CAEb,IAAM,EAEF,CAAC,EACLA,EAAU5Z,SAAQ,SAACsG,EAAe5J,GAChC,IAAM6J,EAAiB,GACvBD,EAAItG,SAAQ,SAAC4D,EAAGhG,G,QACd,GAAIlB,IAAMkB,EACR2I,EAAO7K,KAAK,QACP,GAAIye,EAAMzd,KAAOyd,EAAMvc,GAE5B,GAAe,SAAXwR,EAEF7I,EAAO7K,KACJkI,GAAKuF,KAAKmH,IAAI5T,EAAIkB,GAAKsuD,IAAkB/xC,EAAMzd,GAAKsvD,SAElD,GAAI58C,EAAQ,CAEjB,IAAI8+C,OAAM,EACNC,OAAM,EACV,GAAI,EAAexoD,EAAMjJ,GAAGyC,IAC1B+uD,EAAS,EAAevoD,EAAMjJ,GAAGyC,QAC5B,CACL,IAAMuD,GACQ,OAAX0M,EACGzJ,EAAMjJ,GAAGyC,GACK,QAAb,EAAAwG,EAAMjJ,GAAGuC,YAAI,eAAGmQ,KAAgC,EAErD8+C,EADE,EAASxrD,GACFA,EAAM0rD,WAAW,GAEjB1rD,EAEX,EAAeiD,EAAMjJ,GAAGyC,IAAM+uD,C,CAG5B,EAAevoD,EAAM/H,GAAGuB,IAC1BgvD,EAAS,EAAexoD,EAAM/H,GAAGuB,KAE3BuD,GACQ,OAAX0M,EACGzJ,EAAM/H,GAAGuB,GACK,QAAb,EAAAwG,EAAM/H,GAAGqB,YAAI,eAAGmQ,KAAgC,EAErD++C,EADE,EAASzrD,GACFA,EAAM0rD,WAAW,GAEjB1rD,EAEX,EAAeiD,EAAM/H,GAAGuB,IAAMgvD,GAEhC5nD,EAAO7K,KACJkI,GAAKuF,KAAKmH,IAAI49C,EAASC,GAAUjC,IAC/B/xC,EAAMzd,GAAKsvD,G,MAGhBzlD,EAAO7K,KAAMkI,EAAIoZ,GAAiB7C,EAAMzd,GAAKsvD,QAE1C,CAEL,IAAMjyC,GAAQiD,EAAegvC,GAAc,EAC3CzlD,EAAO7K,KAAKkI,EAAImW,E,CAEpB,IACAta,EAAO/D,KAAK6K,EACd,G,CAEF,OAAO9G,CACT,EAEMwtD,GAAkB,SAACH,GAIvB,IAHA,IAAMtc,EAAOsc,EAAelwD,OACtB6zC,EAAOqc,EAAe,GAAGlwD,OACzB6C,EAAqB,GAClB/C,EAAI,EAAGA,EAAI8zC,EAAM9zC,IAAK,CAE7B,IADA,IAAM4J,EAAgB,GACb1I,EAAI,EAAGA,EAAI6yC,EAAM7yC,IACK,IAAzBkvD,EAAepwD,GAAGkB,GACpB0I,EAAI5K,KAAK,GAAKoxD,EAAepwD,GAAGkB,GAAKkvD,EAAepwD,GAAGkB,KAEvD0I,EAAI5K,KAAK,GAGb+D,EAAO/D,KAAK4K,E,CAEd,OAAO7G,CACT,EAEM8sD,GAAe,SAACtiC,EAAc9qB,GAClC,IAAImZ,GAAS,EAMb,OALA2R,EAAMjqB,SAAQ,SAACG,EAAGzD,GACZyD,EAAEhB,KAAOA,IACXmZ,EAAQ5b,EAEZ,IACOyM,KAAKc,IAAIqO,EAAO,EACzB,EAEM,GAAiB,SAACzS,EAAkBymD,EAAoB3pD,GAG5D,IAFA,IAAM/F,EAASiJ,EAAOjJ,OAEbF,EAAI,EAAGA,EAAIE,EAAQF,IAE1B,GAAImJ,EAAOymD,GAAY5vD,KAAO6I,IAAU,CACtCM,EAAOymD,GAAY5vD,GAAKiG,EACxBkD,EAAOnJ,GAAG4vD,GAAc3pD,EAExB,IAAK,IAAI/E,EAAI,EAAGA,EAAIhB,EAAQgB,IACtBiI,EAAOnJ,GAAGkB,KAAO2H,KAAYM,EAAOymD,GAAY1uD,KAAO2H,MACzDM,EAAOymD,GAAY1uD,GAAK+E,EAAOkD,EAAOnJ,GAAGkB,GACzCiI,EAAOjI,GAAG0uD,GAAc3pD,EAAOkD,EAAOnJ,GAAGkB,G,CAMjD,IAASlB,EAAI,EAAGA,EAAIE,EAAQF,IAC1B,GAAIA,IAAM4vD,EAGV,IAAS1uD,EAAI,EAAGA,EAAIhB,EAAQgB,IAC1B,GAAIiI,EAAOnJ,GAAGkB,KAAO2H,IAAU,CAC7B,IAAI+oC,EAAQnlC,KAAKmH,IAAIzK,EAAOymD,GAAY5vD,GAAKmJ,EAAOymD,GAAY1uD,IAChE0wC,EAAkB,IAAVA,EAAc,EAAIA,EAC1BzoC,EAAOnJ,GAAGkB,GAAK0wC,C,CAIvB,EAEMke,GAAa,SAAC3mD,EAAkBymD,GAEpC,IADA,IAAIriD,EAAM,EACDvN,EAAI,EAAGA,EAAImJ,EAAOymD,GAAY1vD,OAAQF,IACzCmJ,EAAOymD,GAAY5vD,KAAO6I,MAG9B0E,EAAMpE,EAAOymD,GAAY5vD,GAAKuN,EAAMpE,EAAOymD,GAAY5vD,GAAKuN,GAE9D,OAAOA,CACT,EEvcM,GAAwD,CAC5DW,OAAQ,CAAC,EAAG,GACZV,MAAO,IACPC,OAAQ,KAkBV,cAGE,WAAmBwB,QAAA,IAAAA,MAA+B,CAAC,GAAhC,KAAAA,UAFnB,KAAAxM,GAAK,SAGHjE,KAAKyQ,QAAU,OACV,IACAA,EAEP,CAgFF,OA3EQ,YAAAC,QAAN,SAAcjB,EAAcgB,G,mEAC1B,MAAO,CAAP,EAAOzQ,KAAKmzD,qBAAoB,EAAO1jD,EAAOgB,G,QAK1C,YAAArM,OAAN,SAAaqL,EAAcgB,G,0EACzBzQ,KAAKmzD,qBAAoB,EAAM1jD,EAAOgB,G,WAa1B,YAAA0iD,oBAAd,SACE/uD,EACAqL,EACAgB,G,yFAkDA,OAhDMG,EAAgB,OAAK5Q,KAAKyQ,SAAYA,GAElC2D,EAGNxD,EAAa,OAFRyD,EAELzD,EAAa,MADP0D,EACN1D,EAAa,OAEXnG,EAAQgF,EAAME,cAEdX,EACHqF,GAAgC,oBAAXxB,OAEjBwB,EADDxB,OAAOC,WAEP7D,EACHqF,GAAiC,oBAAXzB,OAElByB,EADDzB,OAAOE,YAEPrD,EAAU0E,GACZ,CAACpF,EAAQ,EAAGC,EAAS,GAGnBsC,EAAyB,GAC3B9G,GACFA,EAAM3F,SAAQ,SAAC+F,GACb0G,EAAY/Q,KAAK,CACfyD,GAAI4G,EAAK5G,GACTF,KAAM,CACJiI,EAnBY,IAmBRiC,KAAKS,SAAW,IAAqBM,EAAQU,EAAO,GACxD1H,EApBY,IAoBRiG,KAAKS,SAAW,IAAqBO,EAASS,EAAO,KAG/D,IAGEtL,GACFmN,EAAYzM,SAAQ,SAAC+F,GACnB,OAAA4E,EAAMI,cAAchF,EAAK5G,GAAI,CAC3B+H,EAAGnB,EAAK9G,KAAKiI,EACbhE,EAAG6C,EAAK9G,KAAKiE,GAFf,IAYG,CAAP,EALe,CACbyC,MAAO8G,EACP7G,MAAO+E,EAAMG,e,QAKnB,EAxFA,GCjBawjD,GAAmD,CAC9DC,SAAUC,EACVC,WAAYC,EACZtB,IAAKuB,GACL/kD,OAAQglD,GACRC,KAAMC,GACNxvB,OAAQyvB,GACR/2C,MAAOg3C,GACPC,QAASC,GACTC,YAAaC,GACbC,YAAaC,GACbC,MAAOC,IAEF,SAASC,GAAetwD,EAAY+O,GACzCogD,GAASnvD,GAAM+O,CACjB,CCuEO,SAASwhD,GACdxhD,GAEA,QAASA,EAAO6J,QAAU7J,EAAOU,IACnC,C","file":"index.esm.js","sourcesContent":["'use strict';\n\nvar has = Object.prototype.hasOwnProperty\n , prefix = '~';\n\n/**\n * Constructor to create a storage for our `EE` objects.\n * An `Events` instance is a plain object whose properties are event names.\n *\n * @constructor\n * @private\n */\nfunction Events() {}\n\n//\n// We try to not inherit from `Object.prototype`. In some engines creating an\n// instance in this way is faster than calling `Object.create(null)` directly.\n// If `Object.create(null)` is not supported we prefix the event names with a\n// character to make sure that the built-in object properties are not\n// overridden or used as an attack vector.\n//\nif (Object.create) {\n Events.prototype = Object.create(null);\n\n //\n // This hack is needed because the `__proto__` property is still inherited in\n // some old browsers like Android 4, iPhone 5.1, Opera 11 and Safari 5.\n //\n if (!new Events().__proto__) prefix = false;\n}\n\n/**\n * Representation of a single event listener.\n *\n * @param {Function} fn The listener function.\n * @param {*} context The context to invoke the listener with.\n * @param {Boolean} [once=false] Specify if the listener is a one-time listener.\n * @constructor\n * @private\n */\nfunction EE(fn, context, once) {\n this.fn = fn;\n this.context = context;\n this.once = once || false;\n}\n\n/**\n * Add a listener for a given event.\n *\n * @param {EventEmitter} emitter Reference to the `EventEmitter` instance.\n * @param {(String|Symbol)} event The event name.\n * @param {Function} fn The listener function.\n * @param {*} context The context to invoke the listener with.\n * @param {Boolean} once Specify if the listener is a one-time listener.\n * @returns {EventEmitter}\n * @private\n */\nfunction addListener(emitter, event, fn, context, once) {\n if (typeof fn !== 'function') {\n throw new TypeError('The listener must be a function');\n }\n\n var listener = new EE(fn, context || emitter, once)\n , evt = prefix ? prefix + event : event;\n\n if (!emitter._events[evt]) emitter._events[evt] = listener, emitter._eventsCount++;\n else if (!emitter._events[evt].fn) emitter._events[evt].push(listener);\n else emitter._events[evt] = [emitter._events[evt], listener];\n\n return emitter;\n}\n\n/**\n * Clear event by name.\n *\n * @param {EventEmitter} emitter Reference to the `EventEmitter` instance.\n * @param {(String|Symbol)} evt The Event name.\n * @private\n */\nfunction clearEvent(emitter, evt) {\n if (--emitter._eventsCount === 0) emitter._events = new Events();\n else delete emitter._events[evt];\n}\n\n/**\n * Minimal `EventEmitter` interface that is molded against the Node.js\n * `EventEmitter` interface.\n *\n * @constructor\n * @public\n */\nfunction EventEmitter() {\n this._events = new Events();\n this._eventsCount = 0;\n}\n\n/**\n * Return an array listing the events for which the emitter has registered\n * listeners.\n *\n * @returns {Array}\n * @public\n */\nEventEmitter.prototype.eventNames = function eventNames() {\n var names = []\n , events\n , name;\n\n if (this._eventsCount === 0) return names;\n\n for (name in (events = this._events)) {\n if (has.call(events, name)) names.push(prefix ? name.slice(1) : name);\n }\n\n if (Object.getOwnPropertySymbols) {\n return names.concat(Object.getOwnPropertySymbols(events));\n }\n\n return names;\n};\n\n/**\n * Return the listeners registered for a given event.\n *\n * @param {(String|Symbol)} event The event name.\n * @returns {Array} The registered listeners.\n * @public\n */\nEventEmitter.prototype.listeners = function listeners(event) {\n var evt = prefix ? prefix + event : event\n , handlers = this._events[evt];\n\n if (!handlers) return [];\n if (handlers.fn) return [handlers.fn];\n\n for (var i = 0, l = handlers.length, ee = new Array(l); i < l; i++) {\n ee[i] = handlers[i].fn;\n }\n\n return ee;\n};\n\n/**\n * Return the number of listeners listening to a given event.\n *\n * @param {(String|Symbol)} event The event name.\n * @returns {Number} The number of listeners.\n * @public\n */\nEventEmitter.prototype.listenerCount = function listenerCount(event) {\n var evt = prefix ? prefix + event : event\n , listeners = this._events[evt];\n\n if (!listeners) return 0;\n if (listeners.fn) return 1;\n return listeners.length;\n};\n\n/**\n * Calls each of the listeners registered for a given event.\n *\n * @param {(String|Symbol)} event The event name.\n * @returns {Boolean} `true` if the event had listeners, else `false`.\n * @public\n */\nEventEmitter.prototype.emit = function emit(event, a1, a2, a3, a4, a5) {\n var evt = prefix ? prefix + event : event;\n\n if (!this._events[evt]) return false;\n\n var listeners = this._events[evt]\n , len = arguments.length\n , args\n , i;\n\n if (listeners.fn) {\n if (listeners.once) this.removeListener(event, listeners.fn, undefined, true);\n\n switch (len) {\n case 1: return listeners.fn.call(listeners.context), true;\n case 2: return listeners.fn.call(listeners.context, a1), true;\n case 3: return listeners.fn.call(listeners.context, a1, a2), true;\n case 4: return listeners.fn.call(listeners.context, a1, a2, a3), true;\n case 5: return listeners.fn.call(listeners.context, a1, a2, a3, a4), true;\n case 6: return listeners.fn.call(listeners.context, a1, a2, a3, a4, a5), true;\n }\n\n for (i = 1, args = new Array(len -1); i < len; i++) {\n args[i - 1] = arguments[i];\n }\n\n listeners.fn.apply(listeners.context, args);\n } else {\n var length = listeners.length\n , j;\n\n for (i = 0; i < length; i++) {\n if (listeners[i].once) this.removeListener(event, listeners[i].fn, undefined, true);\n\n switch (len) {\n case 1: listeners[i].fn.call(listeners[i].context); break;\n case 2: listeners[i].fn.call(listeners[i].context, a1); break;\n case 3: listeners[i].fn.call(listeners[i].context, a1, a2); break;\n case 4: listeners[i].fn.call(listeners[i].context, a1, a2, a3); break;\n default:\n if (!args) for (j = 1, args = new Array(len -1); j < len; j++) {\n args[j - 1] = arguments[j];\n }\n\n listeners[i].fn.apply(listeners[i].context, args);\n }\n }\n }\n\n return true;\n};\n\n/**\n * Add a listener for a given event.\n *\n * @param {(String|Symbol)} event The event name.\n * @param {Function} fn The listener function.\n * @param {*} [context=this] The context to invoke the listener with.\n * @returns {EventEmitter} `this`.\n * @public\n */\nEventEmitter.prototype.on = function on(event, fn, context) {\n return addListener(this, event, fn, context, false);\n};\n\n/**\n * Add a one-time listener for a given event.\n *\n * @param {(String|Symbol)} event The event name.\n * @param {Function} fn The listener function.\n * @param {*} [context=this] The context to invoke the listener with.\n * @returns {EventEmitter} `this`.\n * @public\n */\nEventEmitter.prototype.once = function once(event, fn, context) {\n return addListener(this, event, fn, context, true);\n};\n\n/**\n * Remove the listeners of a given event.\n *\n * @param {(String|Symbol)} event The event name.\n * @param {Function} fn Only remove the listeners that match this function.\n * @param {*} context Only remove the listeners that have this context.\n * @param {Boolean} once Only remove one-time listeners.\n * @returns {EventEmitter} `this`.\n * @public\n */\nEventEmitter.prototype.removeListener = function removeListener(event, fn, context, once) {\n var evt = prefix ? prefix + event : event;\n\n if (!this._events[evt]) return this;\n if (!fn) {\n clearEvent(this, evt);\n return this;\n }\n\n var listeners = this._events[evt];\n\n if (listeners.fn) {\n if (\n listeners.fn === fn &&\n (!once || listeners.once) &&\n (!context || listeners.context === context)\n ) {\n clearEvent(this, evt);\n }\n } else {\n for (var i = 0, events = [], length = listeners.length; i < length; i++) {\n if (\n listeners[i].fn !== fn ||\n (once && !listeners[i].once) ||\n (context && listeners[i].context !== context)\n ) {\n events.push(listeners[i]);\n }\n }\n\n //\n // Reset the array, or remove it completely if we have no more listeners.\n //\n if (events.length) this._events[evt] = events.length === 1 ? events[0] : events;\n else clearEvent(this, evt);\n }\n\n return this;\n};\n\n/**\n * Remove all listeners, or those of the specified event.\n *\n * @param {(String|Symbol)} [event] The event name.\n * @returns {EventEmitter} `this`.\n * @public\n */\nEventEmitter.prototype.removeAllListeners = function removeAllListeners(event) {\n var evt;\n\n if (event) {\n evt = prefix ? prefix + event : event;\n if (this._events[evt]) clearEvent(this, evt);\n } else {\n this._events = new Events();\n this._eventsCount = 0;\n }\n\n return this;\n};\n\n//\n// Alias methods names because people roll like that.\n//\nEventEmitter.prototype.off = EventEmitter.prototype.removeListener;\nEventEmitter.prototype.addListener = EventEmitter.prototype.on;\n\n//\n// Expose the prefix.\n//\nEventEmitter.prefixed = prefix;\n\n//\n// Allow `EventEmitter` to be imported as module namespace.\n//\nEventEmitter.EventEmitter = EventEmitter;\n\n//\n// Expose the module.\n//\nif ('undefined' !== typeof module) {\n module.exports = EventEmitter;\n}\n","\n\t\t\t\tvar addMethods = require(\"../../../node_modules/.pnpm/workerize-loader@2.0.2_webpack@5.38.1/node_modules/workerize-loader/dist/rpc-wrapper.js\")\n\t\t\t\tvar methods = [\"stopLayout\",\"calculateLayout\"]\n\t\t\t\tmodule.exports = function() {\n\t\t\t\t\tvar w = new Worker(URL.createObjectURL(new Blob([\"var t={d:(e,r)=>{for(var n in r)t.o(r,n)&&!t.o(e,n)&&Object.defineProperty(e,n,{enumerable:!0,get:r[n]})},o:(t,e)=>Object.prototype.hasOwnProperty.call(t,e)},e={};t.d(e,{calculateLayout:()=>jn,stopLayout:()=>Ln});var r=function(t,e){return r=Object.setPrototypeOf||{__proto__:[]}instanceof Array&&function(t,e){t.__proto__=e}||function(t,e){for(var r in e)Object.prototype.hasOwnProperty.call(e,r)&&(t[r]=e[r])},r(t,e)},n=function(){return n=Object.assign||function(t){for(var e,r=1,n=arguments.length;r<n;r++)for(var o in e=arguments[r])Object.prototype.hasOwnProperty.call(e,o)&&(t[o]=e[o]);return t},n.apply(this,arguments)};function o(t,e){var r={};for(var n in t)Object.prototype.hasOwnProperty.call(t,n)&&e.indexOf(n)<0&&(r[n]=t[n]);if(null!=t&&\\\"function\\\"==typeof Object.getOwnPropertySymbols){var o=0;for(n=Object.getOwnPropertySymbols(t);o<n.length;o++)e.indexOf(n[o])<0&&Object.prototype.propertyIsEnumerable.call(t,n[o])&&(r[n[o]]=t[n[o]])}return r}function i(t,e,r,n){return new(r||(r=Promise))((function(o,i){function a(t){try{u(n.next(t))}catch(t){i(t)}}function s(t){try{u(n.throw(t))}catch(t){i(t)}}function u(t){var e;t.done?o(t.value):(e=t.value,e instanceof r?e:new r((function(t){t(e)}))).then(a,s)}u((n=n.apply(t,e||[])).next())}))}function a(t,e){var r,n,o,i,a={label:0,sent:function(){if(1&o[0])throw o[1];return o[1]},trys:[],ops:[]};return i={next:s(0),throw:s(1),return:s(2)},\\\"function\\\"==typeof Symbol&&(i[Symbol.iterator]=function(){return this}),i;function s(s){return function(u){return function(s){if(r)throw new TypeError(\\\"Generator is already executing.\\\");for(;i&&(i=0,s[0]&&(a=0)),a;)try{if(r=1,n&&(o=2&s[0]?n.return:s[0]?n.throw||((o=n.return)&&o.call(n),0):n.next)&&!(o=o.call(n,s[1])).done)return o;switch(n=0,o&&(s=[2&s[0],o.value]),s[0]){case 0:case 1:o=s;break;case 4:return a.label++,{value:s[1],done:!1};case 5:a.label++,n=s[1],s=[0];continue;case 7:s=a.ops.pop(),a.trys.pop();continue;default:if(!((o=(o=a.trys).length>0&&o[o.length-1])||6!==s[0]&&2!==s[0])){a=0;continue}if(3===s[0]&&(!o||s[1]>o[0]&&s[1]<o[3])){a.label=s[1];break}if(6===s[0]&&a.label<o[1]){a.label=o[1],o=s;break}if(o&&a.label<o[2]){a.label=o[2],a.ops.push(s);break}o[2]&&a.ops.pop(),a.trys.pop();continue}s=e.call(t,a)}catch(t){s=[6,t],n=0}finally{r=o=0}if(5&s[0])throw s[1];return{value:s[0]?s[1]:void 0,done:!0}}([s,u])}}}function s(t,e){var r=\\\"function\\\"==typeof Symbol&&t[Symbol.iterator];if(!r)return t;var n,o,i=r.call(t),a=[];try{for(;(void 0===e||e-- >0)&&!(n=i.next()).done;)a.push(n.value)}catch(t){o={error:t}}finally{try{n&&!n.done&&(r=i.return)&&r.call(i)}finally{if(o)throw o.error}}return a}function u(t,e,r){if(r||2===arguments.length)for(var n,o=0,i=e.length;o<i;o++)!n&&o in e||(n||(n=Array.prototype.slice.call(e,0,o)),n[o]=e[o]);return t.concat(n||Array.prototype.slice.call(e))}Object.create,Object.create;const h=function(){function t(){this._events={}}return t.prototype.on=function(t,e,r){return this._events[t]||(this._events[t]=[]),this._events[t].push({callback:e,once:!!r}),this},t.prototype.once=function(t,e){return this.on(t,e,!0)},t.prototype.emit=function(t){for(var e=this,r=[],n=1;n<arguments.length;n++)r[n-1]=arguments[n];var o=this._events[t]||[],i=this._events[\\\"*\\\"]||[],a=function(n){for(var o=n.length,i=0;i<o;i++)if(n[i]){var a=n[i],s=a.callback;a.once&&(n.splice(i,1),0===n.length&&delete e._events[t],o--,i--),s.apply(e,r)}};a(o),a(i)},t.prototype.off=function(t,e){if(t)if(e){for(var r=this._events[t]||[],n=r.length,o=0;o<n;o++)r[o].callback===e&&(r.splice(o,1),n--,o--);0===r.length&&delete this._events[t]}else delete this._events[t];else this._events={};return this},t.prototype.getEvents=function(){return this._events},t}();function d(t,e,r,n){for(;t.length;){const o=t.shift();if(r(o))return!0;e.add(o.id),n(o.id).forEach((r=>{e.has(r.id)||(e.add(r.id),t.push(r))}))}return!1}function l(t,e,r,n){if(r(t))return!0;e.add(t.id);for(const o of n(t.id))if(!e.has(o.id)&&l(o,e,r,n))return!0;return!1}class c extends h{nodeMap=new Map;edgeMap=new Map;inEdgesMap=new Map;outEdgesMap=new Map;bothEdgesMap=new Map;treeIndices=new Map;changes=[];batchCount=0;onChanged=()=>{};constructor(t){super(),t&&(t.nodes&&this.addNodes(t.nodes),t.edges&&this.addEdges(t.edges),t.tree&&this.addTree(t.tree),t.onChanged&&(this.onChanged=t.onChanged))}batch=t=>{this.batchCount+=1,t(),this.batchCount-=1,this.batchCount||this.commit()};commit(){const t=this.changes;this.changes=[];const e={graph:this,changes:t};this.emit(\\\"changed\\\",e),this.onChanged(e)}reduceChanges(t){let e=[];return t.forEach((t=>{switch(t.type){case\\\"NodeRemoved\\\":{let r=!1;e=e.filter((e=>{if(\\\"NodeAdded\\\"===e.type){const n=e.value.id===t.value.id;return n&&(r=!0),!n}return\\\"NodeDataUpdated\\\"===e.type?e.id!==t.value.id:\\\"TreeStructureChanged\\\"!==e.type||e.nodeId!==t.value.id})),r||e.push(t);break}case\\\"EdgeRemoved\\\":{let r=!1;e=e.filter((e=>{if(\\\"EdgeAdded\\\"===e.type){const n=e.value.id===t.value.id;return n&&(r=!0),!n}return\\\"EdgeDataUpdated\\\"!==e.type&&\\\"EdgeUpdated\\\"!==e.type||e.id!==t.value.id})),r||e.push(t);break}case\\\"NodeDataUpdated\\\":case\\\"EdgeDataUpdated\\\":case\\\"EdgeUpdated\\\":{const r=e.find((e=>e.type===t.type&&e.id===t.id&&e.propertyName===t.propertyName));r?r.newValue=t.newValue:e.push(t);break}case\\\"TreeStructureDetached\\\":e=e.filter((e=>\\\"TreeStructureAttached\\\"===e.type?e.treeKey!==t.treeKey:\\\"TreeStructureChanged\\\"!==e.type||e.treeKey!==t.treeKey)),e.push(t);break;case\\\"TreeStructureChanged\\\":{const r=e.find((e=>\\\"TreeStructureChanged\\\"===e.type&&e.treeKey===t.treeKey&&e.nodeId===t.nodeId));r?r.newParentId=t.newParentId:e.push(t);break}default:e.push(t)}})),e}checkNodeExistence(t){this.getNode(t)}hasNode(t){return this.nodeMap.has(t)}areNeighbors(t,e){return this.getNeighbors(e).some((e=>e.id===t))}getNode(t){const e=this.nodeMap.get(t);if(!e)throw new Error(\\\"Node not found for id: \\\"+t);return e}getRelatedEdges(t,e){if(this.checkNodeExistence(t),\\\"in\\\"===e){const e=this.inEdgesMap.get(t);return Array.from(e)}if(\\\"out\\\"===e){const e=this.outEdgesMap.get(t);return Array.from(e)}{const e=this.bothEdgesMap.get(t);return Array.from(e)}}getDegree(t,e){return this.getRelatedEdges(t,e).length}getSuccessors(t){const e=this.getRelatedEdges(t,\\\"out\\\").map((t=>this.getNode(t.target)));return Array.from(new Set(e))}getPredecessors(t){const e=this.getRelatedEdges(t,\\\"in\\\").map((t=>this.getNode(t.source)));return Array.from(new Set(e))}getNeighbors(t){const e=this.getPredecessors(t),r=this.getSuccessors(t);return Array.from(new Set([...e,...r]))}doAddNode(t){if(this.hasNode(t.id))throw new Error(\\\"Node already exists: \\\"+t.id);this.nodeMap.set(t.id,t),this.inEdgesMap.set(t.id,new Set),this.outEdgesMap.set(t.id,new Set),this.bothEdgesMap.set(t.id,new Set),this.treeIndices.forEach((e=>{e.childrenMap.set(t.id,new Set)})),this.changes.push({type:\\\"NodeAdded\\\",value:t})}addNodes(t){this.batch((()=>{for(const e of t)this.doAddNode(e)}))}addNode(t){this.addNodes([t])}doRemoveNode(t){const e=this.getNode(t),r=this.bothEdgesMap.get(t);r?.forEach((t=>this.doRemoveEdge(t.id))),this.nodeMap.delete(t),this.treeIndices.forEach((e=>{e.childrenMap.get(t)?.forEach((t=>{e.parentMap.delete(t.id)})),e.parentMap.delete(t),e.childrenMap.delete(t)})),this.changes.push({type:\\\"NodeRemoved\\\",value:e})}removeNodes(t){this.batch((()=>{t.forEach((t=>this.doRemoveNode(t)))}))}removeNode(t){this.removeNodes([t])}updateNodeDataProperty(t,e,r){const n=this.getNode(t);this.batch((()=>{const o=n.data[e],i=r;n.data[e]=i,this.changes.push({type:\\\"NodeDataUpdated\\\",id:t,propertyName:e,oldValue:o,newValue:i})}))}mergeNodeData(t,e){this.batch((()=>{Object.entries(e).forEach((([e,r])=>{this.updateNodeDataProperty(t,e,r)}))}))}updateNodeData(...t){const e=t[0],r=this.getNode(e);if(\\\"string\\\"==typeof t[1])return void this.updateNodeDataProperty(e,t[1],t[2]);let n;if(\\\"function\\\"==typeof t[1]){const e=t[1];n=e(r.data)}else\\\"object\\\"==typeof t[1]&&(n=t[1]);this.batch((()=>{const t=r.data,o=n;r.data=n,this.changes.push({type:\\\"NodeDataUpdated\\\",id:e,oldValue:t,newValue:o})}))}checkEdgeExistence(t){if(!this.hasEdge(t))throw new Error(\\\"Edge not found for id: \\\"+t)}hasEdge(t){return this.edgeMap.has(t)}getEdge(t){return this.checkEdgeExistence(t),this.edgeMap.get(t)}getEdgeDetail(t){const e=this.getEdge(t);return{edge:e,source:this.getNode(e.source),target:this.getNode(e.target)}}doAddEdge(t){if(this.hasEdge(t.id))throw new Error(\\\"Edge already exists: \\\"+t.id);this.checkNodeExistence(t.source),this.checkNodeExistence(t.target),this.edgeMap.set(t.id,t);const e=this.inEdgesMap.get(t.target),r=this.outEdgesMap.get(t.source),n=this.bothEdgesMap.get(t.source),o=this.bothEdgesMap.get(t.target);e.add(t),r.add(t),n.add(t),o.add(t),this.changes.push({type:\\\"EdgeAdded\\\",value:t})}addEdges(t){this.batch((()=>{for(const e of t)this.doAddEdge(e)}))}addEdge(t){this.addEdges([t])}doRemoveEdge(t){const e=this.getEdge(t),r=this.outEdgesMap.get(e.source),n=this.inEdgesMap.get(e.target),o=this.bothEdgesMap.get(e.source),i=this.bothEdgesMap.get(e.target);r.delete(e),n.delete(e),o.delete(e),i.delete(e),this.edgeMap.delete(t),this.changes.push({type:\\\"EdgeRemoved\\\",value:e})}removeEdges(t){this.batch((()=>{t.forEach((t=>this.doRemoveEdge(t)))}))}removeEdge(t){this.removeEdges([t])}updateEdgeSource(t,e){const r=this.getEdge(t);this.checkNodeExistence(e);const n=r.source,o=e;this.outEdgesMap.get(n).delete(r),this.bothEdgesMap.get(n).delete(r),this.outEdgesMap.get(o).add(r),this.bothEdgesMap.get(o).add(r),r.source=e,this.batch((()=>{this.changes.push({type:\\\"EdgeUpdated\\\",id:t,propertyName:\\\"source\\\",oldValue:n,newValue:o})}))}updateEdgeTarget(t,e){const r=this.getEdge(t);this.checkNodeExistence(e);const n=r.target,o=e;this.inEdgesMap.get(n).delete(r),this.bothEdgesMap.get(n).delete(r),this.inEdgesMap.get(o).add(r),this.bothEdgesMap.get(o).add(r),r.target=e,this.batch((()=>{this.changes.push({type:\\\"EdgeUpdated\\\",id:t,propertyName:\\\"target\\\",oldValue:n,newValue:o})}))}updateEdgeDataProperty(t,e,r){const n=this.getEdge(t);this.batch((()=>{const o=n.data[e],i=r;n.data[e]=i,this.changes.push({type:\\\"EdgeDataUpdated\\\",id:t,propertyName:e,oldValue:o,newValue:i})}))}updateEdgeData(...t){const e=t[0],r=this.getEdge(e);if(\\\"string\\\"==typeof t[1])return void this.updateEdgeDataProperty(e,t[1],t[2]);let n;if(\\\"function\\\"==typeof t[1]){const e=t[1];n=e(r.data)}else\\\"object\\\"==typeof t[1]&&(n=t[1]);this.batch((()=>{const t=r.data,o=n;r.data=n,this.changes.push({type:\\\"EdgeDataUpdated\\\",id:e,oldValue:t,newValue:o})}))}mergeEdgeData(t,e){this.batch((()=>{Object.entries(e).forEach((([e,r])=>{this.updateEdgeDataProperty(t,e,r)}))}))}checkTreeExistence(t){if(!this.hasTreeStructure(t))throw new Error(\\\"Tree structure not found for treeKey: \\\"+t)}hasTreeStructure(t){return this.treeIndices.has(t)}attachTreeStructure(t){this.treeIndices.has(t)||(this.treeIndices.set(t,{parentMap:new Map,childrenMap:new Map}),this.batch((()=>{this.changes.push({type:\\\"TreeStructureAttached\\\",treeKey:t})})))}detachTreeStructure(t){this.checkTreeExistence(t),this.treeIndices.delete(t),this.batch((()=>{this.changes.push({type:\\\"TreeStructureDetached\\\",treeKey:t})}))}addTree(t,e){this.batch((()=>{this.attachTreeStructure(e);const r=[],n=Array.isArray(t)?t:[t];for(;n.length;){const t=n.shift();r.push(t),t.children&&n.push(...t.children)}this.addNodes(r),r.forEach((t=>{t.children?.forEach((r=>{this.setParent(r.id,t.id,e)}))}))}))}getRoots(t){return this.checkTreeExistence(t),this.getAllNodes().filter((e=>!this.getParent(e.id,t)))}getChildren(t,e){this.checkNodeExistence(t),this.checkTreeExistence(e);const r=this.treeIndices.get(e).childrenMap.get(t);return Array.from(r||[])}getParent(t,e){return this.checkNodeExistence(t),this.checkTreeExistence(e),this.treeIndices.get(e).parentMap.get(t)||null}getAncestors(t,e){const r=[];let n,o=this.getNode(t);for(;n=this.getParent(o.id,e);)r.push(n),o=n;return r}setParent(t,e,r){this.checkTreeExistence(r);const n=this.treeIndices.get(r),o=this.getNode(t),i=n.parentMap.get(t),a=this.getNode(e);n.parentMap.set(t,a),i&&n.childrenMap.get(i.id)?.delete(o);let s=n.childrenMap.get(a.id);s||(s=new Set,n.childrenMap.set(a.id,s)),s.add(o),this.batch((()=>{this.changes.push({type:\\\"TreeStructureChanged\\\",treeKey:r,nodeId:t,oldParentId:i?.id,newParentId:a.id})}))}dfsTree(t,e,r){return l(this.getNode(t),new Set,e,(t=>this.getChildren(t,r)))}bfsTree(t,e,r){return d([this.getNode(t)],new Set,e,(t=>this.getChildren(t,r)))}getAllNodes(){return Array.from(this.nodeMap.values())}getAllEdges(){return Array.from(this.edgeMap.values())}bfs(t,e,r=\\\"out\\\"){const n={in:this.getPredecessors.bind(this),out:this.getSuccessors.bind(this),both:this.getNeighbors.bind(this)}[r];return d([this.getNode(t)],new Set,e,n)}dfs(t,e,r=\\\"out\\\"){const n={in:this.getPredecessors.bind(this),out:this.getSuccessors.bind(this),both:this.getNeighbors.bind(this)}[r];return l(this.getNode(t),new Set,e,n)}clone(){const t=this.getAllNodes().map((t=>({...t,data:{...t.data}}))),e=this.getAllEdges().map((t=>({...t,data:{...t.data}}))),r=new c({nodes:t,edges:e});return this.treeIndices.forEach((({parentMap:t,childrenMap:e},n)=>{const o=new Map;t.forEach(((t,e)=>{o.set(e,r.getNode(t.id))}));const i=new Map;e.forEach(((t,e)=>{i.set(e,new Set(Array.from(t).map((t=>r.getNode(t.id)))))})),r.treeIndices.set(n,{parentMap:o,childrenMap:i})})),r}toJSON(){return JSON.stringify({nodes:this.getAllNodes(),edges:this.getAllEdges()})}}var f=/-(\\\\w)/g,g=(function(t){return t.replace(f,(function(t,e){return e?e.toUpperCase():\\\"\\\"}))},Object.create(null),Array.isArray),p=function(t){for(var e=[],r=t.length,n=0;n<r;n+=1){e[n]=[];for(var o=0;o<r;o+=1)n===o?e[n][o]=0:0!==t[n][o]&&t[n][o]?e[n][o]=t[n][o]:e[n][o]=1/0}for(var i=0;i<r;i+=1)for(n=0;n<r;n+=1)for(o=0;o<r;o+=1)e[n][o]>e[n][i]+e[i][o]&&(e[n][o]=e[n][i]+e[i][o]);return e},v=function(t,e){var r=t.nodes,n=t.edges,o=[],i={};if(!r)throw new Error(\\\"invalid nodes data!\\\");return r&&r.forEach((function(t,e){i[t.id]=e,o.push([])})),null==n||n.forEach((function(t){var r=t.source,n=t.target,a=i[r],s=i[n];void 0!==a&&void 0!==s&&(o[a][s]=1,e||(o[s][a]=1))})),o},y=function(t,e){return Math.sqrt((t.x-e.x)*(t.x-e.x)+(t.y-e.y)*(t.y-e.y))},m={}.toString;const w=function(t,e){return m.call(t)===\\\"[object \\\"+e+\\\"]\\\"},x=function(t){return w(t,\\\"Number\\\")};var E=function(t){if(null===t)return t;if(t instanceof Date)return new Date(t.getTime());if(t instanceof Array){var e=[];return t.forEach((function(t){e.push(t)})),e.map((function(t){return E(t)}))}if(\\\"object\\\"==typeof t){var r={};return Object.keys(t).forEach((function(e){r[e]=E(t[e])})),r}return t},N=function(t,e){var r=E(t);return r.data=r.data||{},e&&(x(r.data.x)||(r.data.x=Math.random()*e[0]),x(r.data.y)||(r.data.y=Math.random()*e[1])),r};const b=function(t){return\\\"function\\\"==typeof t},M=function(t){var e=typeof t;return null!==t&&\\\"object\\\"===e||\\\"function\\\"===e};function S(t,e){return b(e)?e:x(e)?function(){return e}:function(){return t}}function k(t,e,r){return void 0===r&&(r=!0),e||0===e?b(e)?e:x(e)?function(){return e}:g(e)?function(){if(r){var n=Math.max.apply(Math,u([],s(e)));return isNaN(n)?t:n}return e}:M(e)?function(){if(r){var n=Math.max(e.width,e.height);return isNaN(n)?t:n}return[e.width,e.height]}:function(){return t}:function(e){var r=(e.data||{}).size;return r?g(r)?r[0]>r[1]?r[0]:r[1]:M(r)?r.width>r.height?r.width:r.height:r:t}}var A=function(t,e){var r;return r=x(e)?function(){return e}:b(e)?e:function(){return 0},t?g(t)?function(e){return(t[0]>t[1]?t[0]:t[1])+r(e)}:function(e){return t+r(e)}:function(t){var e,n;if(null===(e=t.data)||void 0===e?void 0:e.bboxSize)return Math.max(t.data.bboxSize[0],t.data.bboxSize[1])+r(t);if(null===(n=t.data)||void 0===n?void 0:n.size){if(g(t.data.size))return Math.max(t.data.size[0],t.data.size[1])+r(t);var o=t.data.size;return M(o)?(o.width>o.height?o.width:o.height)+r(t):o+r(t)}return 10+r(t)}},_=function(t,e,r){var o=t.getAllNodes(),i=t.getAllEdges();return(null==o?void 0:o.length)?1===o.length?(e&&t.mergeNodeData(o[0].id,{x:r[0],y:r[1]}),{nodes:[n(n({},o[0]),{data:n(n({},o[0].data),{x:r[0],y:r[1]})})],edges:i}):void 0:{nodes:[],edges:i}},z={radius:null,startRadius:null,endRadius:null,startAngle:0,endAngle:2*Math.PI,clockwise:!0,divisions:1,ordering:null,angleRatio:1},R=function(){function t(t){void 0===t&&(t={}),this.options=t,this.id=\\\"circular\\\",this.options=n(n({},z),t)}return t.prototype.execute=function(t,e){return i(this,void 0,void 0,(function(){return a(this,(function(r){return[2,this.genericCircularLayout(!1,t,e)]}))}))},t.prototype.assign=function(t,e){return i(this,void 0,void 0,(function(){return a(this,(function(r){switch(r.label){case 0:return[4,this.genericCircularLayout(!0,t,e)];case 1:return r.sent(),[2]}}))}))},t.prototype.genericCircularLayout=function(t,e,r){return i(this,void 0,void 0,(function(){var o,i,u,h,d,l,c,f,g,p,v,y,m,w,x,E,b,M,A,z,R,O,P,T,C,q,L,j,F,V,B,G,W,$,U;return a(this,(function(a){if(o=n(n({},this.options),r),i=o.width,u=o.height,h=o.center,d=o.divisions,l=o.startAngle,c=void 0===l?0:l,f=o.endAngle,g=void 0===f?2*Math.PI:f,p=o.angleRatio,v=o.ordering,y=o.clockwise,m=o.nodeSpacing,w=o.nodeSize,x=e.getAllNodes(),E=e.getAllEdges(),b=s(D(i,u,h),3),M=b[0],A=b[1],z=b[2],!(R=null==x?void 0:x.length)||1===R)return[2,_(e,t,z)];for(O=(g-c)/R,P=o.radius,T=o.startRadius,C=o.endRadius,m?(q=S(10,m),L=k(10,w),j=-1/0,x.forEach((function(t){var e=L(t);j<e&&(j=e)})),F=0,x.forEach((function(t,e){F+=0===e?j||10:(q(t)||0)+(j||10)})),P=F/(2*Math.PI)):P||T||C?!T&&C?T=C:T&&!C&&(C=T):P=Math.min(A,M)/2,V=O*p,B=[],B=\\\"topology\\\"===v?I(e,x):\\\"topology-directed\\\"===v?I(e,x,!0):\\\"degree\\\"===v?function(t,e){var r=[];return e.forEach((function(t,e){r.push(N(t))})),r.sort((function(e,r){return t.getDegree(e.id,\\\"both\\\")-t.getDegree(r.id,\\\"both\\\")})),r}(e,x):x.map((function(t){return N(t)})),G=Math.ceil(R/d),W=0;W<R;++W)($=P)||null===T||null===C||($=T+W*(C-T)/(R-1)),$||($=10+100*W/(R-1)),U=c+W%G*V+2*Math.PI/d*Math.floor(W/G),y||(U=g-W%G*V-2*Math.PI/d*Math.floor(W/G)),B[W].data.x=z[0]+Math.cos(U)*$,B[W].data.y=z[1]+Math.sin(U)*$;return t&&B.forEach((function(t){e.mergeNodeData(t.id,{x:t.data.x,y:t.data.y})})),[2,{nodes:B,edges:E}]}))}))},t}(),I=function(t,e,r){void 0===r&&(r=!1);var n=[N(e[0])],o={},i=e.length;o[e[0].id]=!0;var a=0;return e.forEach((function(s,u){if(0!==u)if(u!==i-1&&t.getDegree(s.id,\\\"both\\\")===t.getDegree(e[u+1].id,\\\"both\\\")&&!t.areNeighbors(n[a].id,s.id)||o[s.id]){for(var h=r?t.getSuccessors(n[a].id):t.getNeighbors(n[a].id),d=!1,l=0;l<h.length;l++){var c=h[l];if(t.getDegree(c.id)===t.getDegree(s.id)&&!o[c.id]){n.push(N(c)),o[c.id]=!0,d=!0;break}}for(var f=0;!d&&(o[e[f].id]||(n.push(N(e[f])),o[e[f].id]=!0,d=!0),++f!==i););}else n.push(N(s)),o[s.id]=!0,a++})),n},D=function(t,e,r){var n=t,o=e,i=r;return n||\\\"undefined\\\"==typeof window||(n=window.innerWidth),o||\\\"undefined\\\"==typeof window||(o=window.innerHeight),i||(i=[n/2,o/2]),[n,o,i]};const O=function(t){return w(t,\\\"String\\\")};var P={nodeSize:30,nodeSpacing:10,preventOverlap:!1,sweep:void 0,equidistant:!1,startAngle:1.5*Math.PI,clockwise:!0,maxLevelDiff:void 0,sortBy:\\\"degree\\\"},T=function(){function t(t){void 0===t&&(t={}),this.options=t,this.id=\\\"concentric\\\",this.options=n(n({},P),t)}return t.prototype.execute=function(t,e){return i(this,void 0,void 0,(function(){return a(this,(function(r){return[2,this.genericConcentricLayout(!1,t,e)]}))}))},t.prototype.assign=function(t,e){return i(this,void 0,void 0,(function(){return a(this,(function(r){return this.genericConcentricLayout(!0,t,e),[2]}))}))},t.prototype.genericConcentricLayout=function(t,e,r){return i(this,void 0,void 0,(function(){var o,i,s,u,h,d,l,c,f,p,v,y,m,w,E,S,k,A,z,R,I,D,P,T,C,q,L,j,F,V,B,G,W,$,U,H,K,Y;return a(this,(function(a){if(o=n(n({},this.options),r),i=o.center,s=o.width,u=o.height,h=o.sortBy,d=o.maxLevelDiff,l=o.sweep,c=o.clockwise,f=o.equidistant,p=o.preventOverlap,v=o.startAngle,y=void 0===v?1.5*Math.PI:v,m=o.nodeSize,w=o.nodeSpacing,E=e.getAllNodes(),S=e.getAllEdges(),k=s||\\\"undefined\\\"==typeof window?s:window.innerWidth,A=u||\\\"undefined\\\"==typeof window?u:window.innerHeight,z=i||[k/2,A/2],!(null==E?void 0:E.length)||1===E.length)return[2,_(e,t,z)];if(R=[],D=0,I=g(m)?Math.max(m[0],m[1]):m,g(w)?D=Math.max(w[0],w[1]):x(w)&&(D=w),E.forEach((function(t){var e=N(t);R.push(e);var r=I,n=e.data;g(n.size)?r=Math.max(n.size[0],n.size[1]):x(n.size)?r=n.size:M(n.size)&&(r=Math.max(n.size.width,n.size.height)),I=Math.max(I,r),b(w)&&(D=Math.max(w(t),D))})),P={},R.forEach((function(t,e){P[t.id]=e})),O(T=h)&&void 0!==R[0].data[T]||(T=\\\"degree\\\"),\\\"degree\\\"===T?R.sort((function(t,r){return e.getDegree(r.id,\\\"both\\\")-e.getDegree(t.id,\\\"both\\\")})):R.sort((function(t,e){return e.data[T]-t.data[T]})),C=R[0],q=(d||(\\\"degree\\\"===T?e.getDegree(C.id,\\\"both\\\"):C.data[T]))/4,j=(L=[{nodes:[]}])[0],R.forEach((function(t){if(j.nodes.length>0){var r=\\\"degree\\\"===T?Math.abs(e.getDegree(j.nodes[0].id,\\\"both\\\")-e.getDegree(t.id,\\\"both\\\")):Math.abs(j.nodes[0].data[T]-t.data[T]);q&&r>=q&&(j={nodes:[]},L.push(j))}j.nodes.push(t)})),F=I+D,p||(V=L.length>0&&L[0].nodes.length>1,B=Math.min(k,A)/2-F,G=B/(L.length+(V?1:0)),F=Math.min(F,G)),W=0,L.forEach((function(t){var e=void 0===l?2*Math.PI-2*Math.PI/t.nodes.length:l;if(t.dTheta=e/Math.max(1,t.nodes.length-1),t.nodes.length>1&&p){var r=Math.cos(t.dTheta)-Math.cos(0),n=Math.sin(t.dTheta)-Math.sin(0),o=Math.sqrt(F*F/(r*r+n*n));W=Math.max(o,W)}t.r=W,W+=F})),f){for($=0,U=0,H=0;H<L.length;H++)K=L[H],Y=(K.r||0)-U,$=Math.max($,Y);U=0,L.forEach((function(t,e){0===e&&(U=t.r||0),t.r=U,U+=$}))}return L.forEach((function(t){var e=t.dTheta||0,r=t.r||0;t.nodes.forEach((function(t,n){var o=y+(c?1:-1)*e*n;t.data.x=z[0]+r*Math.cos(o),t.data.y=z[1]+r*Math.sin(o)}))})),t&&R.forEach((function(t){return e.mergeNodeData(t.id,{x:t.data.x,y:t.data.y})})),[2,{nodes:R,edges:S}]}))}))},t}();function C(t,e,r,n){if(isNaN(e)||isNaN(r))return t;var o,i,a,s,u,h,d,l,c,f=t._root,g={data:n},p=t._x0,v=t._y0,y=t._x1,m=t._y1;if(!f)return t._root=g,t;for(;f.length;)if((h=e>=(i=(p+y)/2))?p=i:y=i,(d=r>=(a=(v+m)/2))?v=a:m=a,o=f,!(f=f[l=d<<1|h]))return o[l]=g,t;if(s=+t._x.call(null,f.data),u=+t._y.call(null,f.data),e===s&&r===u)return g.next=f,o?o[l]=g:t._root=g,t;do{o=o?o[l]=new Array(4):t._root=new Array(4),(h=e>=(i=(p+y)/2))?p=i:y=i,(d=r>=(a=(v+m)/2))?v=a:m=a}while((l=d<<1|h)==(c=(u>=a)<<1|s>=i));return o[c]=f,o[l]=g,t}function q(t,e,r,n,o){this.node=t,this.x0=e,this.y0=r,this.x1=n,this.y1=o}function L(t){return t[0]}function j(t){return t[1]}function F(t,e,r){var n=new V(null==e?L:e,null==r?j:r,NaN,NaN,NaN,NaN);return null==t?n:n.addAll(t)}function V(t,e,r,n,o,i){this._x=t,this._y=e,this._x0=r,this._y0=n,this._x1=o,this._y1=i,this._root=void 0}function B(t){for(var e={data:t.data},r=e;t=t.next;)r=r.next={data:t.data};return e}var G=F.prototype=V.prototype;function W(t){return function(){return t}}function $(t){return 1e-6*(t()-.5)}G.copy=function(){var t,e,r=new V(this._x,this._y,this._x0,this._y0,this._x1,this._y1),n=this._root;if(!n)return r;if(!n.length)return r._root=B(n),r;for(t=[{source:n,target:r._root=new Array(4)}];n=t.pop();)for(var o=0;o<4;++o)(e=n.source[o])&&(e.length?t.push({source:e,target:n.target[o]=new Array(4)}):n.target[o]=B(e));return r},G.add=function(t){const e=+this._x.call(null,t),r=+this._y.call(null,t);return C(this.cover(e,r),e,r,t)},G.addAll=function(t){var e,r,n,o,i=t.length,a=new Array(i),s=new Array(i),u=1/0,h=1/0,d=-1/0,l=-1/0;for(r=0;r<i;++r)isNaN(n=+this._x.call(null,e=t[r]))||isNaN(o=+this._y.call(null,e))||(a[r]=n,s[r]=o,n<u&&(u=n),n>d&&(d=n),o<h&&(h=o),o>l&&(l=o));if(u>d||h>l)return this;for(this.cover(u,h).cover(d,l),r=0;r<i;++r)C(this,a[r],s[r],t[r]);return this},G.cover=function(t,e){if(isNaN(t=+t)||isNaN(e=+e))return this;var r=this._x0,n=this._y0,o=this._x1,i=this._y1;if(isNaN(r))o=(r=Math.floor(t))+1,i=(n=Math.floor(e))+1;else{for(var a,s,u=o-r||1,h=this._root;r>t||t>=o||n>e||e>=i;)switch(s=(e<n)<<1|t<r,(a=new Array(4))[s]=h,h=a,u*=2,s){case 0:o=r+u,i=n+u;break;case 1:r=o-u,i=n+u;break;case 2:o=r+u,n=i-u;break;case 3:r=o-u,n=i-u}this._root&&this._root.length&&(this._root=h)}return this._x0=r,this._y0=n,this._x1=o,this._y1=i,this},G.data=function(){var t=[];return this.visit((function(e){if(!e.length)do{t.push(e.data)}while(e=e.next)})),t},G.extent=function(t){return arguments.length?this.cover(+t[0][0],+t[0][1]).cover(+t[1][0],+t[1][1]):isNaN(this._x0)?void 0:[[this._x0,this._y0],[this._x1,this._y1]]},G.find=function(t,e,r){var n,o,i,a,s,u,h,d=this._x0,l=this._y0,c=this._x1,f=this._y1,g=[],p=this._root;for(p&&g.push(new q(p,d,l,c,f)),null==r?r=1/0:(d=t-r,l=e-r,c=t+r,f=e+r,r*=r);u=g.pop();)if(!(!(p=u.node)||(o=u.x0)>c||(i=u.y0)>f||(a=u.x1)<d||(s=u.y1)<l))if(p.length){var v=(o+a)/2,y=(i+s)/2;g.push(new q(p[3],v,y,a,s),new q(p[2],o,y,v,s),new q(p[1],v,i,a,y),new q(p[0],o,i,v,y)),(h=(e>=y)<<1|t>=v)&&(u=g[g.length-1],g[g.length-1]=g[g.length-1-h],g[g.length-1-h]=u)}else{var m=t-+this._x.call(null,p.data),w=e-+this._y.call(null,p.data),x=m*m+w*w;if(x<r){var E=Math.sqrt(r=x);d=t-E,l=e-E,c=t+E,f=e+E,n=p.data}}return n},G.remove=function(t){if(isNaN(i=+this._x.call(null,t))||isNaN(a=+this._y.call(null,t)))return this;var e,r,n,o,i,a,s,u,h,d,l,c,f=this._root,g=this._x0,p=this._y0,v=this._x1,y=this._y1;if(!f)return this;if(f.length)for(;;){if((h=i>=(s=(g+v)/2))?g=s:v=s,(d=a>=(u=(p+y)/2))?p=u:y=u,e=f,!(f=f[l=d<<1|h]))return this;if(!f.length)break;(e[l+1&3]||e[l+2&3]||e[l+3&3])&&(r=e,c=l)}for(;f.data!==t;)if(n=f,!(f=f.next))return this;return(o=f.next)&&delete f.next,n?(o?n.next=o:delete n.next,this):e?(o?e[l]=o:delete e[l],(f=e[0]||e[1]||e[2]||e[3])&&f===(e[3]||e[2]||e[1]||e[0])&&!f.length&&(r?r[c]=f:this._root=f),this):(this._root=o,this)},G.removeAll=function(t){for(var e=0,r=t.length;e<r;++e)this.remove(t[e]);return this},G.root=function(){return this._root},G.size=function(){var t=0;return this.visit((function(e){if(!e.length)do{++t}while(e=e.next)})),t},G.visit=function(t){var e,r,n,o,i,a,s=[],u=this._root;for(u&&s.push(new q(u,this._x0,this._y0,this._x1,this._y1));e=s.pop();)if(!t(u=e.node,n=e.x0,o=e.y0,i=e.x1,a=e.y1)&&u.length){var h=(n+i)/2,d=(o+a)/2;(r=u[3])&&s.push(new q(r,h,d,i,a)),(r=u[2])&&s.push(new q(r,n,d,h,a)),(r=u[1])&&s.push(new q(r,h,o,i,d)),(r=u[0])&&s.push(new q(r,n,o,h,d))}return this},G.visitAfter=function(t){var e,r=[],n=[];for(this._root&&r.push(new q(this._root,this._x0,this._y0,this._x1,this._y1));e=r.pop();){var o=e.node;if(o.length){var i,a=e.x0,s=e.y0,u=e.x1,h=e.y1,d=(a+u)/2,l=(s+h)/2;(i=o[0])&&r.push(new q(i,a,s,d,l)),(i=o[1])&&r.push(new q(i,d,s,u,l)),(i=o[2])&&r.push(new q(i,a,l,d,h)),(i=o[3])&&r.push(new q(i,d,l,u,h))}n.push(e)}for(;e=n.pop();)t(e.node,e.x0,e.y0,e.x1,e.y1);return this},G.x=function(t){return arguments.length?(this._x=t,this):this._x},G.y=function(t){return arguments.length?(this._y=t,this):this._y};var U={value:()=>{}};function H(){for(var t,e=0,r=arguments.length,n={};e<r;++e){if(!(t=arguments[e]+\\\"\\\")||t in n||/[\\\\s.]/.test(t))throw new Error(\\\"illegal type: \\\"+t);n[t]=[]}return new K(n)}function K(t){this._=t}function Y(t,e){for(var r,n=0,o=t.length;n<o;++n)if((r=t[n]).name===e)return r.value}function J(t,e,r){for(var n=0,o=t.length;n<o;++n)if(t[n].name===e){t[n]=U,t=t.slice(0,n).concat(t.slice(n+1));break}return null!=r&&t.push({name:e,value:r}),t}K.prototype=H.prototype={constructor:K,on:function(t,e){var r,n,o=this._,i=(n=o,(t+\\\"\\\").trim().split(/^|\\\\s+/).map((function(t){var e=\\\"\\\",r=t.indexOf(\\\".\\\");if(r>=0&&(e=t.slice(r+1),t=t.slice(0,r)),t&&!n.hasOwnProperty(t))throw new Error(\\\"unknown type: \\\"+t);return{type:t,name:e}}))),a=-1,s=i.length;if(!(arguments.length<2)){if(null!=e&&\\\"function\\\"!=typeof e)throw new Error(\\\"invalid callback: \\\"+e);for(;++a<s;)if(r=(t=i[a]).type)o[r]=J(o[r],t.name,e);else if(null==e)for(r in o)o[r]=J(o[r],t.name,null);return this}for(;++a<s;)if((r=(t=i[a]).type)&&(r=Y(o[r],t.name)))return r},copy:function(){var t={},e=this._;for(var r in e)t[r]=e[r].slice();return new K(t)},call:function(t,e){if((r=arguments.length-2)>0)for(var r,n,o=new Array(r),i=0;i<r;++i)o[i]=arguments[i+2];if(!this._.hasOwnProperty(t))throw new Error(\\\"unknown type: \\\"+t);for(i=0,r=(n=this._[t]).length;i<r;++i)n[i].value.apply(e,o)},apply:function(t,e,r){if(!this._.hasOwnProperty(t))throw new Error(\\\"unknown type: \\\"+t);for(var n=this._[t],o=0,i=n.length;o<i;++o)n[o].value.apply(e,r)}};const X=H;var Q,Z,tt=0,et=0,rt=0,nt=1e3,ot=0,it=0,at=0,st=\\\"object\\\"==typeof performance&&performance.now?performance:Date,ut=\\\"object\\\"==typeof window&&window.requestAnimationFrame?window.requestAnimationFrame.bind(window):function(t){setTimeout(t,17)};function ht(){return it||(ut(dt),it=st.now()+at)}function dt(){it=0}function lt(){this._call=this._time=this._next=null}function ct(t,e,r){var n=new lt;return n.restart(t,e,r),n}function ft(){it=(ot=st.now())+at,tt=et=0;try{!function(){ht(),++tt;for(var t,e=Q;e;)(t=it-e._time)>=0&&e._call.call(void 0,t),e=e._next;--tt}()}finally{tt=0,function(){for(var t,e,r=Q,n=1/0;r;)r._call?(n>r._time&&(n=r._time),t=r,r=r._next):(e=r._next,r._next=null,r=t?t._next=e:Q=e);Z=t,pt(n)}(),it=0}}function gt(){var t=st.now(),e=t-ot;e>nt&&(at-=e,ot=t)}function pt(t){tt||(et&&(et=clearTimeout(et)),t-it>24?(t<1/0&&(et=setTimeout(ft,t-st.now()-at)),rt&&(rt=clearInterval(rt))):(rt||(ot=st.now(),rt=setInterval(gt,nt)),tt=1,ut(ft)))}lt.prototype=ct.prototype={constructor:lt,restart:function(t,e,r){if(\\\"function\\\"!=typeof t)throw new TypeError(\\\"callback is not a function\\\");r=(null==r?ht():+r)+(null==e?0:+e),this._next||Z===this||(Z?Z._next=this:Q=this,Z=this),this._call=t,this._time=r,pt()},stop:function(){this._call&&(this._call=null,this._time=1/0,pt())}};const vt=1664525,yt=1013904223,mt=4294967296;function wt(t){return t.x}function xt(t){return t.y}var Et=10,Nt=Math.PI*(3-Math.sqrt(5));function bt(t){var e,r=1,n=.001,o=1-Math.pow(n,1/300),i=0,a=.6,s=new Map,u=ct(l),h=X(\\\"tick\\\",\\\"end\\\"),d=function(){let t=1;return()=>(t=(vt*t+yt)%mt)/mt}();function l(){c(),h.call(\\\"tick\\\",e),r<n&&(u.stop(),h.call(\\\"end\\\",e))}function c(n){var u,h,d=t.length;void 0===n&&(n=1);for(var l=0;l<n;++l)for(r+=(i-r)*o,s.forEach((function(t){t(r)})),u=0;u<d;++u)null==(h=t[u]).fx?h.x+=h.vx*=a:(h.x=h.fx,h.vx=0),null==h.fy?h.y+=h.vy*=a:(h.y=h.fy,h.vy=0);return e}function f(){for(var e,r=0,n=t.length;r<n;++r){if((e=t[r]).index=r,null!=e.fx&&(e.x=e.fx),null!=e.fy&&(e.y=e.fy),isNaN(e.x)||isNaN(e.y)){var o=Et*Math.sqrt(.5+r),i=r*Nt;e.x=o*Math.cos(i),e.y=o*Math.sin(i)}(isNaN(e.vx)||isNaN(e.vy))&&(e.vx=e.vy=0)}}function g(e){return e.initialize&&e.initialize(t,d),e}return null==t&&(t=[]),f(),e={tick:c,restart:function(){return u.restart(l),e},stop:function(){return u.stop(),e},nodes:function(r){return arguments.length?(t=r,f(),s.forEach(g),e):t},alpha:function(t){return arguments.length?(r=+t,e):r},alphaMin:function(t){return arguments.length?(n=+t,e):n},alphaDecay:function(t){return arguments.length?(o=+t,e):+o},alphaTarget:function(t){return arguments.length?(i=+t,e):i},velocityDecay:function(t){return arguments.length?(a=1-t,e):1-a},randomSource:function(t){return arguments.length?(d=t,s.forEach(g),e):d},force:function(t,r){return arguments.length>1?(null==r?s.delete(t):s.set(t,g(r)),e):s.get(t)},find:function(e,r,n){var o,i,a,s,u,h=0,d=t.length;for(null==n?n=1/0:n*=n,h=0;h<d;++h)(a=(o=e-(s=t[h]).x)*o+(i=r-s.y)*i)<n&&(u=s,n=a);return u},on:function(t,r){return arguments.length>1?(h.on(t,r),e):h.on(t)}}}function Mt(){var t,e,r,n,o,i=W(-30),a=1,s=1/0,u=.81;function h(r){var o,i=t.length,a=F(t,wt,xt).visitAfter(l);for(n=r,o=0;o<i;++o)e=t[o],a.visit(c)}function d(){if(t){var e,r,n=t.length;for(o=new Array(n),e=0;e<n;++e)r=t[e],o[r.index]=+i(r,e,t)}}function l(t){var e,r,n,i,a,s=0,u=0;if(t.length){for(n=i=a=0;a<4;++a)(e=t[a])&&(r=Math.abs(e.value))&&(s+=e.value,u+=r,n+=r*e.x,i+=r*e.y);t.x=n/u,t.y=i/u}else{(e=t).x=e.data.x,e.y=e.data.y;do{s+=o[e.data.index]}while(e=e.next)}t.value=s}function c(t,i,h,d){if(!t.value)return!0;var l=t.x-e.x,c=t.y-e.y,f=d-i,g=l*l+c*c;if(f*f/u<g)return g<s&&(0===l&&(g+=(l=$(r))*l),0===c&&(g+=(c=$(r))*c),g<a&&(g=Math.sqrt(a*g)),e.vx+=l*t.value*n/g,e.vy+=c*t.value*n/g),!0;if(!(t.length||g>=s)){(t.data!==e||t.next)&&(0===l&&(g+=(l=$(r))*l),0===c&&(g+=(c=$(r))*c),g<a&&(g=Math.sqrt(a*g)));do{t.data!==e&&(f=o[t.data.index]*n/g,e.vx+=l*f,e.vy+=c*f)}while(t=t.next)}}return h.initialize=function(e,n){t=e,r=n,d()},h.strength=function(t){return arguments.length?(i=\\\"function\\\"==typeof t?t:W(+t),d(),h):i},h.distanceMin=function(t){return arguments.length?(a=t*t,h):Math.sqrt(a)},h.distanceMax=function(t){return arguments.length?(s=t*t,h):Math.sqrt(s)},h.theta=function(t){return arguments.length?(u=t*t,h):Math.sqrt(u)},h}function St(t){return t.index}function kt(t,e){var r=t.get(e);if(!r)throw new Error(\\\"node not found: \\\"+e);return r}function At(t){var e,r,n,o,i,a,s=St,u=function(t){return 1/Math.min(o[t.source.index],o[t.target.index])},h=W(30),d=1;function l(n){for(var o=0,s=t.length;o<d;++o)for(var u,h,l,c,f,g,p,v=0;v<s;++v)h=(u=t[v]).source,c=(l=u.target).x+l.vx-h.x-h.vx||$(a),f=l.y+l.vy-h.y-h.vy||$(a),c*=g=((g=Math.sqrt(c*c+f*f))-r[v])/g*n*e[v],f*=g,l.vx-=c*(p=i[v]),l.vy-=f*p,h.vx+=c*(p=1-p),h.vy+=f*p}function c(){if(n){var a,u,h=n.length,d=t.length,l=new Map(n.map(((t,e)=>[s(t,e,n),t])));for(a=0,o=new Array(h);a<d;++a)(u=t[a]).index=a,\\\"object\\\"!=typeof u.source&&(u.source=kt(l,u.source)),\\\"object\\\"!=typeof u.target&&(u.target=kt(l,u.target)),o[u.source.index]=(o[u.source.index]||0)+1,o[u.target.index]=(o[u.target.index]||0)+1;for(a=0,i=new Array(d);a<d;++a)u=t[a],i[a]=o[u.source.index]/(o[u.source.index]+o[u.target.index]);e=new Array(d),f(),r=new Array(d),g()}}function f(){if(n)for(var r=0,o=t.length;r<o;++r)e[r]=+u(t[r],r,t)}function g(){if(n)for(var e=0,o=t.length;e<o;++e)r[e]=+h(t[e],e,t)}return null==t&&(t=[]),l.initialize=function(t,e){n=t,a=e,c()},l.links=function(e){return arguments.length?(t=e,c(),l):t},l.id=function(t){return arguments.length?(s=t,l):s},l.iterations=function(t){return arguments.length?(d=+t,l):d},l.strength=function(t){return arguments.length?(u=\\\"function\\\"==typeof t?t:W(+t),f(),l):u},l.distance=function(t){return arguments.length?(h=\\\"function\\\"==typeof t?t:W(+t),g(),l):h},l}function _t(t){return t.x+t.vx}function zt(t){return t.y+t.vy}function Rt(t){var e,r,n,o=1,i=1;function a(){for(var t,a,u,h,d,l,c,f=e.length,g=0;g<i;++g)for(a=F(e,_t,zt).visitAfter(s),t=0;t<f;++t)u=e[t],l=r[u.index],c=l*l,h=u.x+u.vx,d=u.y+u.vy,a.visit(p);function p(t,e,r,i,a){var s=t.data,f=t.r,g=l+f;if(!s)return e>h+g||i<h-g||r>d+g||a<d-g;if(s.index>u.index){var p=h-s.x-s.vx,v=d-s.y-s.vy,y=p*p+v*v;y<g*g&&(0===p&&(y+=(p=$(n))*p),0===v&&(y+=(v=$(n))*v),y=(g-(y=Math.sqrt(y)))/y*o,u.vx+=(p*=y)*(g=(f*=f)/(c+f)),u.vy+=(v*=y)*g,s.vx-=p*(g=1-g),s.vy-=v*g)}}}function s(t){if(t.data)return t.r=r[t.data.index];for(var e=t.r=0;e<4;++e)t[e]&&t[e].r>t.r&&(t.r=t[e].r)}function u(){if(e){var n,o,i=e.length;for(r=new Array(i),n=0;n<i;++n)o=e[n],r[o.index]=+t(o,n,e)}}return\\\"function\\\"!=typeof t&&(t=W(null==t?1:+t)),a.initialize=function(t,r){e=t,n=r,u()},a.iterations=function(t){return arguments.length?(i=+t,a):i},a.strength=function(t){return arguments.length?(o=+t,a):o},a.radius=function(e){return arguments.length?(t=\\\"function\\\"==typeof e?e:W(+e),u(),a):t},a}function It(t){var e,r,n,o=W(.1);function i(t){for(var o,i=0,a=e.length;i<a;++i)(o=e[i]).vx+=(n[i]-o.x)*r[i]*t}function a(){if(e){var i,a=e.length;for(r=new Array(a),n=new Array(a),i=0;i<a;++i)r[i]=isNaN(n[i]=+t(e[i],i,e))?0:+o(e[i],i,e)}}return\\\"function\\\"!=typeof t&&(t=W(null==t?0:+t)),i.initialize=function(t){e=t,a()},i.strength=function(t){return arguments.length?(o=\\\"function\\\"==typeof t?t:W(+t),a(),i):o},i.x=function(e){return arguments.length?(t=\\\"function\\\"==typeof e?e:W(+e),a(),i):t},i}function Dt(t){var e,r,n,o=W(.1);function i(t){for(var o,i=0,a=e.length;i<a;++i)(o=e[i]).vy+=(n[i]-o.y)*r[i]*t}function a(){if(e){var i,a=e.length;for(r=new Array(a),n=new Array(a),i=0;i<a;++i)r[i]=isNaN(n[i]=+t(e[i],i,e))?0:+o(e[i],i,e)}}return\\\"function\\\"!=typeof t&&(t=W(null==t?0:+t)),i.initialize=function(t){e=t,a()},i.strength=function(t){return arguments.length?(o=\\\"function\\\"==typeof t?t:W(+t),a(),i):o},i.y=function(e){return arguments.length?(t=\\\"function\\\"==typeof e?e:W(+e),a(),i):t},i}function Ot(){function t(t){return function(){return t}}var e,r=function(t){return t.cluster},n=t(1),o=t(-1),i=t(100),a=t(.1),u=[0,0],h=[],d={},l=[],c=100,f=100,g={none:{x:0,y:0}},p=[],v=\\\"force\\\",y=!0,m=.1;function w(t){if(!y)return w;e.tick(),E();for(var n=0,o=h.length,i=void 0,a=t*m;n<o;++n)(i=h[n]).vx+=(g[r(i)].x-i.x)*a,i.vy+=(g[r(i)].y-i.y)*a}function x(){h&&function(){if(h&&h.length){if(void 0===r(h[0]))throw Error(\\\"Couldnt find the grouping attribute for the nodes. Make sure to set it up with forceInBox.groupBy('clusterAttr') before calling .links()\\\");var t,u,g,v,y,m=(t=[],u=[],g={},{},y=[],v=function(t){var e={};return t.forEach((function(t){var n=r(t);e[n]||(e[n]={count:0,sumforceNodeSize:0})})),t.forEach((function(t){var o=r(t),i=n(t),a=e[o];a.count=a.count+1,a.sumforceNodeSize=a.sumforceNodeSize+Math.PI*(i*i)*1.3,e[o]=a})),e}(h),y=function(t){var e={},n=[];return t.forEach((function(t){var n,o,i,a,s,u=(o=(n=t).source,i=n.target,(a=r(d[o]))<=(s=r(d[i]))?a+\\\"~\\\"+s:s+\\\"~\\\"+a),h=0;void 0!==e[u]&&(h=e[u]),h+=1,e[u]=h})),Object.entries(e).forEach((function(t){var e=s(t,2),r=e[0],o=e[1],i=r.split(\\\"~\\\")[0],a=r.split(\\\"~\\\")[1];void 0!==i&&void 0!==a&&n.push({source:i,target:a,count:o})})),n}(l),Object.keys(v).forEach((function(e,r){var n=v[e];t.push({id:e,size:n.count,r:Math.sqrt(n.sumforceNodeSize/Math.PI)}),g[e]=r})),y.forEach((function(t){var e=t.source,r=t.target,n=g[e],o=g[r];void 0!==n&&void 0!==o&&u.push({source:n,target:o,count:t.count})})),{nodes:t,links:u});e=bt(m.nodes).force(\\\"x\\\",It(c).strength(.1)).force(\\\"y\\\",Dt(f).strength(.1)).force(\\\"collide\\\",Rt((function(t){return t.r})).iterations(4)).force(\\\"charge\\\",Mt().strength(o)).force(\\\"links\\\",At(m.nodes.length?m.links:[]).distance(i).strength(a)),p=e.nodes(),E()}}()}function E(){return g={none:{x:0,y:0}},p.forEach((function(t){g[t.id]={x:t.x-u[0],y:t.y-u[1]}})),g}return w.initialize=function(t){h=t,x()},w.template=function(t){return arguments.length?(v=t,x(),w):v},w.groupBy=function(t){return arguments.length?\\\"string\\\"==typeof t?(r=function(e){return e[t]},w):(r=t,w):r},w.enableGrouping=function(t){return arguments.length?(y=t,w):y},w.strength=function(t){return arguments.length?(m=t,w):m},w.centerX=function(t){return arguments.length?(c=t,w):c},w.centerY=function(t){return arguments.length?(f=t,w):f},w.nodes=function(t){return arguments.length?(function(t){d={},t.forEach((function(t){d[t.id]=t}))}(t||[]),h=t||[],w):h},w.links=function(t){return arguments.length?(l=t||[],x(),w):l},w.forceNodeSize=function(e){return arguments.length?(n=\\\"function\\\"==typeof e?e:t(+e),x(),w):n},w.nodeSize=w.forceNodeSize,w.forceCharge=function(e){return arguments.length?(o=\\\"function\\\"==typeof e?e:t(+e),x(),w):o},w.forceLinkDistance=function(e){return arguments.length?(i=\\\"function\\\"==typeof e?e:t(+e),x(),w):i},w.forceLinkStrength=function(e){return arguments.length?(a=\\\"function\\\"==typeof e?e:t(+e),x(),w):a},w.offset=function(t){return arguments.length?(u=t,w):u},w.getFocis=E,w}var Pt={center:[0,0],preventOverlap:!1,nodeSize:void 0,nodeSpacing:void 0,linkDistance:50,forceSimulation:null,alphaDecay:.028,alphaMin:.001,alpha:.3,collideStrength:1,clustering:!1,clusterNodeStrength:-1,clusterEdgeStrength:.1,clusterEdgeDistance:100,clusterFociStrength:.8,clusterNodeSize:10},Tt=function(){function t(t){void 0===t&&(t={}),this.options=t,this.id=\\\"d3force\\\",this.options=n(n({},Pt),t)}return t.prototype.execute=function(t,e){return i(this,void 0,void 0,(function(){return a(this,(function(r){return[2,this.genericForceLayout(!1,t,e)]}))}))},t.prototype.assign=function(t,e){return i(this,void 0,void 0,(function(){return a(this,(function(r){return this.genericForceLayout(!0,t,e),[2]}))}))},t.prototype.stop=function(){var t;null===(t=this.forceSimulation)||void 0===t||t.stop()},t.prototype.tick=function(t){var e=this;void 0===t&&(t=1),this.forceSimulation.tick(t);var r={nodes:Ct(this.lastLayoutNodes),edges:qt(this.lastLayoutEdges)};return this.lastAssign&&r.nodes.forEach((function(t){return e.lastGraph.mergeNodeData(t.id,{x:t.data.x,y:t.data.y})})),r},t.prototype.genericForceLayout=function(t,e,r){return i(this,void 0,void 0,(function(){var o,i,s,u,h,d,l,c,f,g,p,v,y,m,w,x,E,b,M,S,k,A,_,z,R,I,D=this;return a(this,(function(a){return o=n(n({},this.options),r),i=e.getAllNodes(),s=e.getAllEdges(),u=i.map((function(t){var e,r;return n(n({},N(t)),{x:null===(e=t.data)||void 0===e?void 0:e.x,y:null===(r=t.data)||void 0===r?void 0:r.y})})),h=s.map((function(t){return N(t)})),this.lastLayoutNodes=u,this.lastLayoutEdges=h,this.lastAssign=t,this.lastGraph=e,d=o.alphaMin,l=o.alphaDecay,c=o.alpha,f=o.nodeStrength,g=o.edgeStrength,p=o.linkDistance,v=o.clustering,y=o.clusterFociStrength,m=o.clusterEdgeDistance,w=o.clusterEdgeStrength,x=o.clusterNodeStrength,E=o.clusterNodeSize,b=o.collideStrength,M=void 0===b?1:b,S=o.center,k=void 0===S?[0,0]:S,A=o.preventOverlap,_=o.nodeSize,z=o.nodeSpacing,R=o.onTick,I=o.forceSimulation,[2,new Promise((function(r){if(I){v&&((i=Ot()).nodes(u),i.links(h)),I.nodes(u),h&&(s=At().id((function(t){return t.id})).links(h),g&&s.strength(g),p&&s.distance(p),I.force(\\\"link\\\",s)),A&&D.overlapProcess(I,{nodeSize:_,nodeSpacing:z,collideStrength:M}),I.alpha(c).restart();var n=Ct(u),o=qt(h);t&&n.forEach((function(t){return e.mergeNodeData(t.id,{x:t.data.x,y:t.data.y})})),r({nodes:n,edges:o})}else try{var i,a=Mt();if(f&&a.strength(f),I=bt().nodes(u),v&&((i=Ot()).centerX(k[0]).centerY(k[1]).template(\\\"force\\\").strength(y),h&&i.links(h),u&&i.nodes(u),i.forceLinkDistance(m).forceLinkStrength(w).forceCharge(x).forceNodeSize(E),I.force(\\\"group\\\",i)),I.force(\\\"center\\\",function(t,e){var r,n=1;function o(){var o,i,a=r.length,s=0,u=0;for(o=0;o<a;++o)s+=(i=r[o]).x,u+=i.y;for(s=(s/a-t)*n,u=(u/a-e)*n,o=0;o<a;++o)(i=r[o]).x-=s,i.y-=u}return null==t&&(t=0),null==e&&(e=0),o.initialize=function(t){r=t},o.x=function(e){return arguments.length?(t=+e,o):t},o.y=function(t){return arguments.length?(e=+t,o):e},o.strength=function(t){return arguments.length?(n=+t,o):n},o}(k[0],k[1])).force(\\\"charge\\\",a).alpha(c).alphaDecay(l).alphaMin(d),A&&D.overlapProcess(I,{nodeSize:_,nodeSpacing:z,collideStrength:M}),h){var s=At().id((function(t){return t.id})).links(h);g&&s.strength(g),p&&s.distance(p),I.force(\\\"link\\\",s)}I.on(\\\"tick\\\",(function(){var r=Ct(u);null==R||R({nodes:r,edges:qt(h)}),t&&r.forEach((function(t){return e.mergeNodeData(t.id,{x:t.data.x,y:t.data.y})}))})).on(\\\"end\\\",(function(){var n=Ct(u);t&&n.forEach((function(t){return e.mergeNodeData(t.id,{x:t.data.x,y:t.data.y})})),r({nodes:n,edges:qt(h)})}))}catch(t){console.warn(t)}D.forceSimulation=I}))]}))}))},t.prototype.overlapProcess=function(t,e){var r,n,o=e.nodeSize,i=e.nodeSpacing,a=e.collideStrength;if(n=x(i)?function(){return i}:b(i)?i:function(){return 0},o)if(b(o))r=function(t){return o(t)+n(t)};else if(g(o)){var s=(o[0]>o[1]?o[0]:o[1])/2;r=function(t){return s+n(t)}}else if(x(o)){var u=o/2;r=function(t){return u+n(t)}}else r=function(){return 10};else r=function(t){return t.size?g(t.size)?(t.size[0]>t.size[1]?t.size[0]:t.size[1])/2+n(t):M(t.size)?(t.size.width>t.size.height?t.size.width:t.size.height)/2+n(t):t.size/2+n(t):10+n(t)};t.force(\\\"collisionForce\\\",Rt(r).strength(a))},t}(),Ct=function(t){return t.map((function(t){var e=t.x,r=t.y,i=o(t,[\\\"x\\\",\\\"y\\\"]);return n(n({},i),{data:n(n({},i.data),{x:e,y:r})})}))},qt=function(t){return t.map((function(t){var e=t.source,r=t.target,i=o(t,[\\\"source\\\",\\\"target\\\"]);return n(n({},i),{source:e.id,target:r.id})}))};var Lt=function(t,e){if(\\\"next\\\"!==t&&\\\"prev\\\"!==t)return e},jt=function(t){t.prev.next=t.next,t.next.prev=t.prev,delete t.next,delete t.prev},Ft=function(t){function e(){return null!==t&&t.apply(this,arguments)||this}return function(t,e){if(\\\"function\\\"!=typeof e&&null!==e)throw new TypeError(\\\"Class extends value \\\"+String(e)+\\\" is not a constructor or null\\\");function n(){this.constructor=t}r(t,e),t.prototype=null===e?Object.create(e):(n.prototype=e.prototype,new n)}(e,t),e}(function(){function t(){var t={};t.prev=t,t.next=t.prev,this.shortcut=t}return t.prototype.dequeue=function(){var t=this.shortcut,e=t.prev;if(e&&e!==t)return jt(e),e},t.prototype.enqueue=function(t){var e=this.shortcut;t.prev&&t.next&&jt(t),t.next=e.next,e.next.prev=t,e.next=t,t.prev=e},t.prototype.toString=function(){for(var t=[],e=this.shortcut,r=e.prev;r!==e;)t.push(JSON.stringify(r,Lt)),r=null==r?void 0:r.prev;return\\\"[\\\"+t.join(\\\", \\\")+\\\"]\\\"},t}()),Vt=function(){return 1},Bt=function(t,e,r,o,i){var a,s,u=[];return t.hasNode(o.v)&&(null===(a=t.getRelatedEdges(o.v,\\\"in\\\"))||void 0===a||a.forEach((function(o){var a=o.data.weight,s=t.getNode(o.source);i&&u.push({v:o.source,w:o.target,in:0,out:0}),void 0===s.data.out&&(s.data.out=0),s.data.out-=a,Gt(e,r,n({v:s.id},s.data))})),null===(s=t.getRelatedEdges(o.v,\\\"out\\\"))||void 0===s||s.forEach((function(o){var i=o.data.weight,a=o.target,s=t.getNode(a);void 0===s.data.in&&(s.data.in=0),s.data.in-=i,Gt(e,r,n({v:s.id},s.data))})),t.removeNode(o.v)),i?u:void 0},Gt=function(t,e,r){r.out?r.in?t[r.out-r.in+e].enqueue(r):t[t.length-1].enqueue(r):t[0].enqueue(r)},Wt=function(t,e){var r=\\\"greedy\\\"===e?function(t,e){var r;if(t.getAllNodes().length<=1)return[];var o=function(t,e){var r=new c,o=0,i=0;t.getAllNodes().forEach((function(t){r.addNode({id:t.id,data:{v:t.id,in:0,out:0}})})),t.getAllEdges().forEach((function(t){var a=r.getRelatedEdges(t.source,\\\"out\\\").find((function(e){return e.target===t.target})),s=(null==e?void 0:e(t))||1;a?r.updateEdgeData(null==a?void 0:a.id,n(n({},a.data),{weight:a.data.weight+s})):r.addEdge({id:t.id,source:t.source,target:t.target,data:{weight:s}}),i=Math.max(i,r.getNode(t.source).data.out+=s),o=Math.max(o,r.getNode(t.target).data.in+=s)}));for(var a=[],s=i+o+3,u=0;u<s;u++)a.push(new Ft);var h=o+1;return r.getAllNodes().forEach((function(t){Gt(a,h,n({v:t.id},r.getNode(t.id).data))})),{buckets:a,zeroIdx:h,graph:r}}(t,function(t){return t.data.weight||1}||Vt);return null===(r=function(t,e,r){for(var n,o=[],i=e[e.length-1],a=e[0];t.getAllNodes().length;){for(;n=a.dequeue();)Bt(t,e,r,n);for(;n=i.dequeue();)Bt(t,e,r,n);if(t.getAllNodes().length)for(var s=e.length-2;s>0;--s)if(n=e[s].dequeue()){o=o.concat(Bt(t,e,r,n,!0));break}}return o}(o.graph,o.buckets,o.zeroIdx).map((function(e){return t.getRelatedEdges(e.v,\\\"out\\\").filter((function(t){return t.target===e.w}))})))||void 0===r?void 0:r.flat()}(t):$t(t);null==r||r.forEach((function(e){var r=e.data;t.removeEdge(e.id),r.forwardName=e.data.name,r.reversed=!0,t.addEdge({id:e.id,source:e.target,target:e.source,data:n({},r)})}))},$t=function(t){var e=[],r={},n={},o=function(i){n[i]||(n[i]=!0,r[i]=!0,t.getRelatedEdges(i,\\\"out\\\").forEach((function(t){r[t.target]?e.push(t):o(t.target)})),delete r[i])};return t.getAllNodes().forEach((function(t){return o(t.id)})),e},Ut=function(t,e,r,n){var o;do{o=\\\"\\\"+n+Math.random()}while(t.hasNode(o));return r.dummy=e,t.addNode({id:o,data:r}),o},Ht=function(t){var e=new c;return t.getAllNodes().forEach((function(r){t.getChildren(r.id).length||e.addNode(n({},r))})),t.getAllEdges().forEach((function(t){e.addEdge(t)})),e},Kt=function(t,e){var r,n,o=Number(t.x),i=Number(t.y),a=Number(e.x)-o,s=Number(e.y)-i,u=Number(t.width)/2,h=Number(t.height)/2;return a||s?(Math.abs(s)*u>Math.abs(a)*h?(s<0&&(h=-h),r=h*a/s,n=h):(a<0&&(u=-u),r=u,n=u*s/a),{x:o+r,y:i+n}):{x:0,y:0}},Yt=function(t){for(var e=[],r=Xt(t)+1,n=0;n<r;n++)e.push([]);for(t.getAllNodes().forEach((function(t){var r=t.data.rank;void 0!==r&&e[r]&&e[r].push(t.id)})),n=0;n<r;n++)e[n]=e[n].sort((function(e,r){return n=t.getNode(e).data.order,o=t.getNode(r).data.order,Number(n)-Number(o);var n,o}));return e},Jt=function(t,e,r,n){var o={width:0,height:0};return x(r)&&x(n)&&(o.rank=r,o.order=n),Ut(t,\\\"border\\\",o,e)},Xt=function(t){var e;return t.getAllNodes().forEach((function(t){var r=t.data.rank;void 0!==r&&(void 0===e||r>e)&&(e=r)})),e||(e=0),e},Qt=function(t,e){return t.reduce((function(t,r){return e(t)>e(r)?r:t}))},Zt=function(t,e,r,n,o,i){n.includes(e.id)||(n.push(e.id),r||i.push(e.id),o(e.id).forEach((function(e){return Zt(t,e,r,n,o,i)})),r&&i.push(e.id))},te=function(t,e,r,n){var o=Array.isArray(e)?e:[e],i=function(e){return n?t.getSuccessors(e):t.getNeighbors(e)},a=[],s=[];return o.forEach((function(e){if(!t.hasNode(e.id))throw new Error(\\\"Graph does not have node: \\\"+e);Zt(t,e,\\\"post\\\"===r,s,i,a)})),a},ee=\\\"edge-label\\\",re=function(t){var e={},r=function(n){var o,i,a=t.getNode(n);return a?e[n]?a.data.rank:(e[n]=!0,null===(o=t.getRelatedEdges(n,\\\"out\\\"))||void 0===o||o.forEach((function(t){var e=r(t.target)-t.data.minlen;e&&(void 0===i||e<i)&&(i=e)})),i||(i=0),a.data.rank=i,i):0};t.getAllNodes().filter((function(e){return 0===t.getRelatedEdges(e.id,\\\"in\\\").length})).forEach((function(t){return r(t.id)}))},ne=function(t,e){return t.getNode(e.target).data.rank-t.getNode(e.source).data.rank-e.data.minlen},oe=function(t,e){var r=function(n){e.getRelatedEdges(n,\\\"both\\\").forEach((function(o){var i=o.source,a=n===i?o.target:i;t.hasNode(a)||ne(e,o)||(t.addNode({id:a,data:{}}),t.addEdge({id:o.id,source:n,target:a,data:{}}),r(a))}))};return t.getAllNodes().forEach((function(t){return r(t.id)})),t.getAllNodes().length},ie=function(t,e){var r=function(n){var o;null===(o=e.getRelatedEdges(n,\\\"both\\\"))||void 0===o||o.forEach((function(o){var i=o.source,a=n===i?o.target:i;t.hasNode(a)||void 0===e.getNode(a).data.layer&&ne(e,o)||(t.addNode({id:a,data:{}}),t.addEdge({id:o.id,source:n,target:a,data:{}}),r(a))}))};return t.getAllNodes().forEach((function(t){return r(t.id)})),t.getAllNodes().length},ae=function(t,e){return Qt(e.getAllEdges(),(function(r){return t.hasNode(r.source)!==t.hasNode(r.target)?ne(e,r):1/0}))},se=function(t,e,r){t.getAllNodes().forEach((function(t){var n=e.getNode(t.id);n.data.rank||(n.data.rank=0),n.data.rank+=r}))},ue=function(t,e){var r=te(t,t.getAllNodes(),\\\"post\\\",!1);(r=r.slice(0,(null==r?void 0:r.length)-1)).forEach((function(r){he(t,e,r)}))},he=function(t,e,r){var n=t.getNode(r).data.parent;t.getRelatedEdges(r,\\\"both\\\").find((function(t){return t.target===n||t.source===n})).data.cutvalue=de(t,e,r)},de=function(t,e,r){var n=t.getNode(r).data.parent,o=!0,i=e.getRelatedEdges(r,\\\"out\\\").find((function(t){return t.target===n})),a=0;return i||(o=!1,i=e.getRelatedEdges(n,\\\"out\\\").find((function(t){return t.target===r}))),a=i.data.weight,e.getRelatedEdges(r,\\\"both\\\").forEach((function(e){var i=e.source===r,s=i?e.target:e.source;if(s!==n){var u=i===o,h=e.data.weight;if(a+=u?h:-h,ye(t,r,s)){var d=t.getRelatedEdges(r,\\\"both\\\").find((function(t){return t.source===s||t.target===s})).data.cutvalue;a+=u?-d:d}}})),a},le=function(t,e){void 0===e&&(e=t.getAllNodes()[0].id),ce(t,{},1,e)},ce=function(t,e,r,n,o){var i,a=r,s=r,u=t.getNode(n);return e[n]=!0,null===(i=t.getNeighbors(n))||void 0===i||i.forEach((function(r){e[r.id]||(s=ce(t,e,s,r.id,n))})),u.data.low=a,u.data.lim=s++,o?u.data.parent=o:delete u.data.parent,s},fe=function(t){return t.getAllEdges().find((function(t){return t.data.cutvalue<0}))},ge=function(t,e,r){var n=r.source,o=r.target;e.getRelatedEdges(n,\\\"out\\\").find((function(t){return t.target===o}))||(n=r.target,o=r.source);var i=t.getNode(n),a=t.getNode(o),s=i,u=!1;i.data.lim>a.data.lim&&(s=a,u=!0);var h=e.getAllEdges().filter((function(e){return u===me(t.getNode(e.source),s)&&u!==me(t.getNode(e.target),s)}));return Qt(h,(function(t){return ne(e,t)}))},pe=function(t,e,r,n){var o=t.getRelatedEdges(r.source,\\\"both\\\").find((function(t){return t.source===r.target||t.target===r.target}));o&&t.removeEdge(o.id),t.addEdge({id:\\\"e\\\"+Math.random(),source:n.source,target:n.target,data:{}}),le(t),ue(t,e),ve(t,e)},ve=function(t,e){var r=t.getAllNodes().find((function(t){return!t.data.parent})),n=te(t,r,\\\"pre\\\",!1);(n=n.slice(1)).forEach((function(r){var n=t.getNode(r).data.parent,o=e.getRelatedEdges(r,\\\"out\\\").find((function(t){return t.target===n})),i=!1;!o&&e.hasNode(n)&&(o=e.getRelatedEdges(n,\\\"out\\\").find((function(t){return t.target===r})),i=!0),e.getNode(r).data.rank=(e.hasNode(n)&&e.getNode(n).data.rank||0)+(i?null==o?void 0:o.data.minlen:-(null==o?void 0:o.data.minlen))}))},ye=function(t,e,r){return t.getRelatedEdges(e,\\\"both\\\").find((function(t){return t.source===r||t.target===r}))},me=function(t,e){return e.data.low<=t.data.lim&&t.data.lim<=e.data.lim},we=re,xe=function(t){!function(t){var e=function(t){var e=new c;return t.getAllNodes().forEach((function(t){e.addNode(n({},t))})),t.getAllEdges().forEach((function(t){var r=e.getRelatedEdges(t.source,\\\"out\\\").find((function(e){return e.target===t.target}));r?e.updateEdgeData(null==r?void 0:r.id,n(n({},r.data),{weight:r.data.weight+t.data.weight||0,minlen:Math.max(r.data.minlen,t.data.minlen||1)})):e.addEdge({id:t.id,source:t.source,target:t.target,data:{weight:t.data.weight||0,minlen:t.data.minlen||1}})})),e}(t);re(e);var r,o,i=function(t){var e,r,n=new c({tree:[]}),o=t.getAllNodes()[0],i=t.getAllNodes().length;for(n.addNode(o);oe(n,t)<i;)e=ae(n,t),r=n.hasNode(e.source)?ne(t,e):-ne(t,e),se(n,t,r);return n}(e);for(le(i),ue(i,e);r=fe(i);)o=ge(i,e,r),pe(i,e,r,o)}(t)},Ee=function(t,e,r,n,o,i,a){var s=t.getChildren(a);if(null==s?void 0:s.length){var u=Jt(t,\\\"_bt\\\"),h=Jt(t,\\\"_bb\\\"),d=t.getNode(a);t.setParent(u,a),d.data.borderTop=u,t.setParent(h,a),d.data.borderBottom=h,null==s||s.forEach((function(s){Ee(t,e,r,n,o,i,s.id);var d=s.data.borderTop?s.data.borderTop:s.id,l=s.data.borderBottom?s.data.borderBottom:s.id,c=s.data.borderTop?n:2*n,f=d!==l?1:o-i[a]+1;t.addEdge({id:\\\"e\\\"+Math.random(),source:u,target:d,data:{minlen:f,weight:c,nestingEdge:!0}}),t.addEdge({id:\\\"e\\\"+Math.random(),source:l,target:h,data:{minlen:f,weight:c,nestingEdge:!0}})})),t.getParent(a)||t.addEdge({id:\\\"e\\\"+Math.random(),source:e,target:u,data:{weight:0,minlen:o+i[a]}})}else a!==e&&t.addEdge({id:\\\"e\\\"+Math.random(),source:e,target:a,data:{weight:0,minlen:r}})},Ne=function(t,e,r,n,o,i){var a={rank:i,borderType:e,width:0,height:0},s=o.data[e][i-1],u=Ut(t,\\\"border\\\",a,r);o.data[e][i]=u,t.setParent(u,n),s&&t.addEdge({id:\\\"e\\\"+Math.random(),source:s,target:u,data:{weight:1}})},be=function(t){t.getAllNodes().forEach((function(t){Me(t)})),t.getAllEdges().forEach((function(t){Me(t)}))},Me=function(t){var e=t.data.width;t.data.width=t.data.height,t.data.height=e},Se=function(t){(null==t?void 0:t.y)&&(t.y=-t.y)},ke=function(t){var e=t.x;t.x=t.y,t.y=e},Ae=function(t){for(var e={},r=t.getAllNodes(),n=r.map((function(t){var e;return null!==(e=t.data.rank)&&void 0!==e?e:-1/0})),o=Math.max.apply(Math,u([],s(n))),i=[],a=0;a<o+1;a++)i.push([]);var h=r.sort((function(e,r){return t.getNode(e.id).data.rank-t.getNode(r.id).data.rank})),d=h.filter((function(e){return void 0!==t.getNode(e.id).data.fixorder})).sort((function(e,r){return t.getNode(e.id).data.fixorder-t.getNode(r.id).data.fixorder}));return null==d||d.forEach((function(r){isNaN(t.getNode(r.id).data.rank)||i[t.getNode(r.id).data.rank].push(r.id),e[r.id]=!0})),null==h||h.forEach((function(r){return t.dfsTree(r.id,(function(t){if(e.hasOwnProperty(t.id))return!0;e[t.id]=!0,isNaN(t.data.rank)||i[t.data.rank].push(t.id)}))})),i},_e=function(t,e,r){for(var n=function(t,e){return null==t?void 0:t.reduce((function(t,r,n){return t[r]=e[n],t}),{})}(r,r.map((function(t,e){return e}))),o=e.map((function(e){var r=t.getRelatedEdges(e,\\\"out\\\").map((function(t){return{pos:n[t.target]||0,weight:t.data.weight}}));return null==r?void 0:r.sort((function(t,e){return t.pos-e.pos}))})),i=o.flat().filter((function(t){return void 0!==t})),a=1;a<r.length;)a<<=1;var s=2*a-1;a-=1;var u=Array(s).fill(0,0,s),h=0;return null==i||i.forEach((function(t){if(t){var e=t.pos+a;u[e]+=t.weight;for(var r=0;e>0;)e%2&&(r+=u[e+1]),u[e=e-1>>1]+=t.weight;h+=t.weight*r}})),h},ze=function(t,e){for(var r=0,n=1;n<(null==e?void 0:e.length);n+=1)r+=_e(t,e[n-1],e[n]);return r},Re=function(t,e){var r,n=0,o=0;t.weight&&(n+=t.barycenter*t.weight,o+=t.weight),e.weight&&(n+=e.barycenter*e.weight,o+=e.weight),t.vs=null===(r=e.vs)||void 0===r?void 0:r.concat(t.vs),t.barycenter=n/o,t.weight=o,t.i=Math.min(e.i,t.i),e.merged=!0};const Ie=function(t,e){var r,n,o,i={};return null==t||t.forEach((function(t,e){i[t.v]={i:e,indegree:0,in:[],out:[],vs:[t.v]};var r=i[t.v];void 0!==t.barycenter&&(r.barycenter=t.barycenter,r.weight=t.weight)})),null===(r=e.getAllEdges())||void 0===r||r.forEach((function(t){var e=i[t.source],r=i[t.target];void 0!==e&&void 0!==r&&(r.indegree++,e.out.push(i[t.target]))})),function(t){for(var e,r,n=[],o=function(){var o=t.pop();n.push(o),null===(e=o.in.reverse())||void 0===e||e.forEach((function(t){return(e=o,function(t){t.merged||(void 0===t.barycenter||void 0===e.barycenter||t.barycenter>=e.barycenter)&&Re(e,t)})(t);var e})),null===(r=o.out)||void 0===r||r.forEach((function(e){return(r=o,function(e){e.in.push(r),0==--e.indegree&&t.push(e)})(e);var r}))};null==t?void 0:t.length;)o();var i=n.filter((function(t){return!t.merged})),a=[\\\"vs\\\",\\\"i\\\",\\\"barycenter\\\",\\\"weight\\\"];return i.map((function(t){var e={};return null==a||a.forEach((function(r){void 0!==t[r]&&(e[r]=t[r])})),e}))}(null===(o=(n=Object.values(i)).filter)||void 0===o?void 0:o.call(n,(function(t){return!t.indegree})))};var De=function(t,e,r){for(var n,o=r;e.length&&(n=e[e.length-1]).i<=o;)e.pop(),null==t||t.push(n.vs),o++;return o},Oe=function(t,e,r,n,o,i){var a,s,u,h,d=t.getChildren(e).map((function(t){return t.id})),l=t.getNode(e),c=l?l.data.borderLeft:void 0,f=l?l.data.borderRight:void 0,g={};c&&(d=null==d?void 0:d.filter((function(t){return t!==c&&t!==f})));var p=function(t,e){return e.map((function(e){var r=t.getRelatedEdges(e,\\\"in\\\");if(!(null==r?void 0:r.length))return{v:e};var n={sum:0,weight:0};return null==r||r.forEach((function(e){var r=t.getNode(e.source);n.sum+=e.data.weight*r.data.order,n.weight+=e.data.weight})),{v:e,barycenter:n.sum/n.weight,weight:n.weight}}))}(t,d||[]);null==p||p.forEach((function(e){var o;if(null===(o=t.getChildren(e.v))||void 0===o?void 0:o.length){var a=Oe(t,e.v,r,n,i);g[e.v]=a,a.hasOwnProperty(\\\"barycenter\\\")&&Te(e,a)}}));var v=Ie(p,r);Pe(v,g),null===(a=v.filter((function(t){return t.vs.length>0})))||void 0===a||a.forEach((function(e){var r=t.getNode(e.vs[0]);r&&(e.fixorder=r.data.fixorder,e.order=r.data.order)}));var y=function(t,e,r,n){var o=function(t,e){var r={lhs:[],rhs:[]};return null==t||t.forEach((function(t){var e,o;o=(e=t).hasOwnProperty(\\\"fixorder\\\")&&!isNaN(e.fixorder),(n?!o&&e.hasOwnProperty(\\\"barycenter\\\"):o||e.hasOwnProperty(\\\"barycenter\\\"))?r.lhs.push(t):r.rhs.push(t)})),r}(t),i=o.lhs,a=o.rhs.sort((function(t,e){return-t.i- -e.i})),s=[],u=0,h=0,d=0;null==i||i.sort(function(t,e){return function(r,n){if(void 0!==r.fixorder&&void 0!==n.fixorder)return r.fixorder-n.fixorder;if(r.barycenter<n.barycenter)return-1;if(r.barycenter>n.barycenter)return 1;if(e&&void 0!==r.order&&void 0!==n.order){if(r.order<n.order)return-1;if(r.order>n.order)return 1}return t?n.i-r.i:r.i-n.i}}(!!e,!!r)),d=De(s,a,d),null==i||i.forEach((function(t){var e;d+=null===(e=t.vs)||void 0===e?void 0:e.length,s.push(t.vs),u+=t.barycenter*t.weight,h+=t.weight,d=De(s,a,d)}));var l={vs:s.flat()};return h&&(l.barycenter=u/h,l.weight=h),l}(v,n,o,i);if(c&&(y.vs=[c,y.vs,f].flat(),null===(s=t.getPredecessors(c))||void 0===s?void 0:s.length)){var m=t.getNode((null===(u=t.getPredecessors(c))||void 0===u?void 0:u[0].id)||\\\"\\\"),w=t.getNode((null===(h=t.getPredecessors(f))||void 0===h?void 0:h[0].id)||\\\"\\\");y.hasOwnProperty(\\\"barycenter\\\")||(y.barycenter=0,y.weight=0),y.barycenter=(y.barycenter*y.weight+m.data.order+w.data.order)/(y.weight+2),y.weight+=2}return y},Pe=function(t,e){null==t||t.forEach((function(t){var r,n=null===(r=t.vs)||void 0===r?void 0:r.map((function(t){return e[t]?e[t].vs:t}));t.vs=n.flat()}))},Te=function(t,e){void 0!==t.barycenter?(t.barycenter=(t.barycenter*t.weight+e.barycenter*e.weight)/(t.weight+e.weight),t.weight+=e.weight):(t.barycenter=e.barycenter,t.weight=e.weight)},Ce=function(t){if(\\\"object\\\"!=typeof t||null===t)return t;var e,r;if(r=t,Array.isArray?Array.isArray(r):w(r,\\\"Array\\\")){e=[];for(var n=0,o=t.length;n<o;n++)\\\"object\\\"==typeof t[n]&&null!=t[n]?e[n]=Ce(t[n]):e[n]=t[n]}else for(var i in e={},t)\\\"object\\\"==typeof t[i]&&null!=t[i]?e[i]=Ce(t[i]):e[i]=t[i];return e};const qe=Ce;var Le=function(t,e,r){return e.map((function(e){return function(t,e,r){var o=function(t){for(var e;t.hasNode(e=\\\"_root\\\"+Math.random()););return e}(t),i=new c({tree:[{id:o,children:[],data:{}}]});return t.getAllNodes().forEach((function(a){var s=t.getParent(a.id);(a.data.rank===e||a.data.minRank<=e&&e<=a.data.maxRank)&&(i.hasNode(a.id)||i.addNode(n({},a)),(null==s?void 0:s.id)&&!i.hasNode(null==s?void 0:s.id)&&i.addNode(n({},s)),i.setParent(a.id,(null==s?void 0:s.id)||o),t.getRelatedEdges(a.id,r).forEach((function(e){var r=e.source===a.id?e.target:e.source;i.hasNode(r)||i.addNode(n({},t.getNode(r)));var o=i.getRelatedEdges(r,\\\"out\\\").find((function(t){return t.target===a.id})),s=void 0!==o?o.data.weight:0;o?i.updateEdgeData(o.id,n(n({},o.data),{weight:e.data.weight+s})):i.addEdge({id:e.id,source:r,target:a.id,data:{weight:e.data.weight+s}})})),a.data.hasOwnProperty(\\\"minRank\\\")&&i.updateNodeData(a.id,n(n({},a.data),{borderLeft:a.data.borderLeft[e],borderRight:a.data.borderRight[e]})))})),i}(t,e,r)}))},je=function(t,e,r,n){var o=new c;null==t||t.forEach((function(t){for(var i,a=t.getRoots()[0].id,s=Oe(t,a,o,e,r,n),u=0;u<(null===(i=s.vs)||void 0===i?void 0:i.length);u++){var h=t.getNode(s.vs[u]);h&&(h.data.order=u)}!function(t,e,r){var n,o={};null==r||r.forEach((function(r){for(var i,a,s=t.getParent(r);s;){if((i=t.getParent(s.id))?(a=o[i.id],o[i.id]=s.id):(a=n,n=s.id),a&&a!==s.id)return e.addNodes([{id:a,data:{}},{id:s.id,data:{}}]),void e.addEdge({id:\\\"e\\\"+a+\\\"-\\\"+s.id,source:a,target:s.id,data:{}});s=i}}))}(t,o,s.vs)}))},Fe=function(t,e){null==e||e.forEach((function(e){null==e||e.forEach((function(e,r){t.getNode(e).data.order=r}))}))},Ve=function(t,e){var r={};function n(e,n,o,i,a){for(var s,u,h,d=n;d<o;d++)h=e[d],(null===(s=t.getNode(h))||void 0===s?void 0:s.data.dummy)&&(null===(u=t.getPredecessors(h))||void 0===u||u.forEach((function(e){var n=t.getNode(e.id);n.data.dummy&&(n.data.order<i||n.data.order>a)&&Ge(r,e.id,h)})))}function o(t,e){var r=function(t){return JSON.stringify(t.slice(1))}(t);e.get(r)||(n.apply(void 0,u([],s(t))),e.set(r,!0))}return(null==e?void 0:e.length)&&e.reduce((function(e,r){var n,i=-1,a=0,s=new Map;return null==r||r.forEach((function(u,h){var d;if(\\\"border\\\"===(null===(d=t.getNode(u))||void 0===d?void 0:d.data.dummy)){var l=t.getPredecessors(u)||[];l.length&&(n=t.getNode(l[0].id).data.order,o([r,a,h,i,n],s),a=h,i=n)}o([r,a,r.length,n,e.length],s)})),r})),r},Be=function(t,e){var r,n;if(null===(r=t.getNode(e))||void 0===r?void 0:r.data.dummy)return null===(n=t.getPredecessors(e))||void 0===n?void 0:n.find((function(e){return t.getNode(e.id).data.dummy}))},Ge=function(t,e,r){var n=e,o=r;if(n>o){var i=n;n=o,o=i}var a=t[n];a||(t[n]=a={}),a[o]=!0},We=function(t,e,r){var n=e;return n>r&&(n=r),!!t[n]},$e=function(t,e,r,o,i,a){var s=new c,u=Ue(o,i,a);return null==e||e.forEach((function(e){var o;null==e||e.forEach((function(e){var i=r[e];if(s.hasNode(i)||s.addNode({id:i,data:{}}),o){var a=r[o],h=s.getRelatedEdges(a,\\\"out\\\").find((function(t){return t.target===i}));h?s.updateEdgeData(h.id,n(n({},h.data),{weight:Math.max(u(t,e,o),h.data.weight||0)})):s.addEdge({id:\\\"e\\\"+Math.random(),source:a,target:i,data:{weight:Math.max(u(t,e,o),0)}})}o=e}))})),s};var Ue=function(t,e,r){return function(n,o,i){var a=n.getNode(o),s=n.getNode(i),u=0,h=0;if(u+=a.data.width/2,a.data.hasOwnProperty(\\\"labelpos\\\"))switch((a.data.labelpos||\\\"\\\").toLowerCase()){case\\\"l\\\":h=-a.data.width/2;break;case\\\"r\\\":h=a.data.width/2}if(h&&(u+=r?h:-h),h=0,u+=(a.data.dummy?e:t)/2,u+=(s.data.dummy?e:t)/2,u+=s.data.width/2,s.data.labelpos)switch((s.data.labelpos||\\\"\\\").toLowerCase()){case\\\"l\\\":h=s.data.width/2;break;case\\\"r\\\":h=-s.data.width/2}return h&&(u+=r?h:-h),h=0,u}},He=function(t,e){return t.getNode(e).data.width||0},Ke=function(t,e){var r,n=Ht(t);!function(t,e){var r=(e||{}).ranksep,n=void 0===r?0:r,o=Yt(t),i=0;null==o||o.forEach((function(e){var r=e.map((function(e){return t.getNode(e).data.height})),o=Math.max.apply(Math,u(u([],s(r)),[0]));null==e||e.forEach((function(e){t.getNode(e).data.y=i+o/2})),i+=o+n}))}(n,e);var o=function(t,e){var r=e||{},n=r.align,o=r.nodesep,i=void 0===o?0:o,a=r.edgesep,h=void 0===a?0:a,d=Yt(t),l=Object.assign(function(t,e){var r={};return(null==e?void 0:e.length)&&e.reduce((function(e,n){var o=0,i=0,a=e.length,s=null==n?void 0:n[(null==n?void 0:n.length)-1];return null==n||n.forEach((function(e,u){var h,d=Be(t,e),l=d?t.getNode(d.id).data.order:a;(d||e===s)&&(null===(h=n.slice(i,u+1))||void 0===h||h.forEach((function(e){var n;null===(n=t.getPredecessors(e))||void 0===n||n.forEach((function(n){var i,a=t.getNode(n.id),s=a.data.order;!(s<o||l<s)||a.data.dummy&&(null===(i=t.getNode(e))||void 0===i?void 0:i.data.dummy)||Ge(r,n.id,e)}))})),i=u+1,o=l)})),n})),r}(t,d),Ve(t,d)),c={},f=[];[\\\"u\\\",\\\"d\\\"].forEach((function(e){f=\\\"u\\\"===e?d:Object.values(d).reverse(),[\\\"l\\\",\\\"r\\\"].forEach((function(r){\\\"r\\\"===r&&(f=f.map((function(t){return Object.values(t).reverse()})));var n=(\\\"u\\\"===e?t.getPredecessors:t.getSuccessors).bind(t),o=function(t,e,r,n){var o={},i={},a={};return null==e||e.forEach((function(t){null==t||t.forEach((function(t,e){o[t]=t,i[t]=t,a[t]=e}))})),null==e||e.forEach((function(t){var e=-1;null==t||t.forEach((function(t){var s=n(t).map((function(t){return t.id}));if(s.length){s=s.sort((function(t,e){return a[t]-a[e]}));for(var u=(s.length-1)/2,h=Math.floor(u),d=Math.ceil(u);h<=d;++h){var l=s[h];i[t]===t&&e<a[l]&&!We(r,t,l)&&(i[l]=t,i[t]=o[t]=o[l],e=a[l])}}}))})),{root:o,align:i}}(0,f,l,n),a=function(t,e,r,n,o,i,a){var s,u={},h=$e(t,e,r,o,i,a),d=a?\\\"borderLeft\\\":\\\"borderRight\\\",l=function(t,e){for(var r=h.getAllNodes(),n=r.pop(),o={};n;)o[n.id]?t(n.id):(o[n.id]=!0,r.push(n),r=r.concat(e(n.id))),n=r.pop()};return l((function(t){u[t]=(h.getRelatedEdges(t,\\\"in\\\")||[]).reduce((function(t,e){return Math.max(t,(u[e.source]||0)+e.data.weight)}),0)}),h.getPredecessors.bind(h)),l((function(e){var r=(h.getRelatedEdges(e,\\\"out\\\")||[]).reduce((function(t,e){return Math.min(t,(u[e.target]||0)-e.data.weight)}),Number.POSITIVE_INFINITY),n=t.getNode(e);r!==Number.POSITIVE_INFINITY&&n.data.borderType!==d&&(u[e]=Math.max(u[e],r))}),h.getSuccessors.bind(h)),null===(s=Object.values(n))||void 0===s||s.forEach((function(t){u[t]=u[r[t]]})),u}(t,f,o.root,o.align,i,h,\\\"r\\\"===r);\\\"r\\\"===r&&Object.keys(a).forEach((function(t){return a[t]=-a[t]})),c[e+r]=a}))}));var g=function(t,e){return Qt(Object.values(e),(function(e){var r,n=Number.NEGATIVE_INFINITY,o=Number.POSITIVE_INFINITY;return null===(r=Object.keys(e))||void 0===r||r.forEach((function(r){var i=e[r],a=He(t,r)/2;n=Math.max(i+a,n),o=Math.min(i-a,o)})),n-o}))}(t,c);return g&&function(t,e){var r=Object.values(e),n=Math.min.apply(Math,u([],s(r))),o=Math.max.apply(Math,u([],s(r)));[\\\"u\\\",\\\"d\\\"].forEach((function(r){[\\\"l\\\",\\\"r\\\"].forEach((function(i){var a,h=r+i,d=t[h];if(d!==e){var l=Object.values(d);(a=\\\"l\\\"===i?n-Math.min.apply(Math,u([],s(l))):o-Math.max.apply(Math,u([],s(l))))&&(t[h]={},Object.keys(d).forEach((function(e){t[h][e]=d[e]+a})))}}))}))}(c,g),function(t,e){var r={};return Object.keys(t.ul).forEach((function(n){if(e)r[n]=t[e.toLowerCase()][n];else{var o=Object.values(t).map((function(t){return t[n]}));r[n]=(o[0]+o[1])/2}})),r}(c,n)}(n,e);null===(r=Object.keys(o))||void 0===r||r.forEach((function(t){n.getNode(t).data.x=o[t]}))},Ye=function(t,e){var r=e.acyclicer,o=e.ranker,i=e.rankdir,a=void 0===i?\\\"tb\\\":i,h=e.nodeOrder,d=e.keepNodeOrder,l=e.align,f=e.nodesep,g=void 0===f?50:f,p=e.edgesep,v=void 0===p?20:p,y=e.ranksep,m=void 0===y?50:y;hr(t),Wt(t,r);var w=function(t){var e=Ut(t,\\\"root\\\",{},\\\"_root\\\"),r=function(t){var e={},r=function(n,o){var i=t.getChildren(n);null==i||i.forEach((function(t){return r(t.id,o+1)})),e[n]=o};return t.getRoots().forEach((function(t){return r(t.id,1)})),e}(t),n=Math.max.apply(Math,u([],s(Object.values(r))));Math.abs(n)===1/0&&(n=1);var o=n-1,i=2*o+1;t.getAllEdges().forEach((function(t){t.data.minlen*=i}));var a=function(t){var e=0;return t.getAllEdges().forEach((function(t){e+=t.data.weight})),e}(t)+1;return t.getRoots().forEach((function(n){Ee(t,e,i,a,o,r,n.id)})),{nestingRoot:e,nodeRankFactor:i}}(t),x=w.nestingRoot,E=w.nodeRankFactor;!function(t,e){switch(e){case\\\"network-simplex\\\":xe(t);break;case\\\"tight-tree\\\":default:!function(t){!function(t){var e,r={},n=function(o){var i,a,s=t.getNode(o);return s?r[o]?s.data.rank:(r[o]=!0,null===(i=t.getRelatedEdges(o,\\\"out\\\"))||void 0===i||i.forEach((function(t){var e=n(t.target)-t.data.minlen;e&&(void 0===a||e<a)&&(a=e)})),a||(a=0),(void 0===e||a<e)&&(e=a),s.data.rank=a,a):0};t.getAllNodes().filter((function(e){return 0===t.getRelatedEdges(e.id,\\\"in\\\").length})).forEach((function(t){t&&n(t.id)})),void 0===e&&(e=0);var o={},i=function(e,r){var n,a=t.getNode(e),s=isNaN(a.data.layer)?r:a.data.layer;(void 0===a.data.rank||a.data.rank<s)&&(a.data.rank=s),o[e]||(o[e]=!0,null===(n=t.getRelatedEdges(e,\\\"out\\\"))||void 0===n||n.forEach((function(t){i(t.target,s+t.data.minlen)})))};t.getAllNodes().forEach((function(t){var r=t.data;r&&(isNaN(r.layer)?r.rank-=e:i(t.id,r.layer))}))}(t),function(t){var e,r,n=new c({tree:[]}),o=t.getAllNodes()[0],i=t.getAllNodes().length;for(n.addNode(o);ie(n,t)<i;)e=ae(n,t),r=n.hasNode(e.source)?ne(t,e):-ne(t,e),se(n,t,r)}(t)}(t);break;case\\\"longest-path\\\":we(t)}}(Ht(t),o),er(t),function(t,e){void 0===e&&(e=0);var r=t.getAllNodes(),n=r.filter((function(t){return void 0!==t.data.rank})).map((function(t){return t.data.rank})),o=Math.min.apply(Math,u([],s(n))),i=[];r.forEach((function(t){var e=(t.data.rank||0)-o;i[e]||(i[e]=[]),i[e].push(t.id)}));for(var a=0,h=0;h<i.length;h++){var d=i[h];void 0===d?h%e!=0&&(a-=1):a&&(null==d||d.forEach((function(e){var r=t.getNode(e);r&&(r.data.rank=r.data.rank||0,r.data.rank+=a)})))}}(t,E),function(t,e){e&&t.removeNode(e),t.getAllEdges().forEach((function(e){e.data.nestingEdge&&t.removeEdge(e.id)}))}(t,x),function(t){var e=t.getAllNodes().filter((function(t){return void 0!==t.data.rank})).map((function(t){return t.data.rank})),r=Math.min.apply(Math,u([],s(e)));t.getAllNodes().forEach((function(t){t.data.hasOwnProperty(\\\"rank\\\")&&r!==1/0&&(t.data.rank-=r)}))}(t),rr(t),nr(t);var N=[];!function(t,e){t.getAllEdges().forEach((function(r){return function(t,e,r){var n=e.source,o=t.getNode(n).data.rank,i=e.target,a=t.getNode(i).data.rank,s=e.data.labelRank;if(a!==o+1){var u,h,d;for(t.removeEdge(e.id),d=0,++o;o<a;++d,++o)e.data.points=[],u=Ut(t,\\\"edge\\\",h={originalEdge:e,width:0,height:0,rank:o},\\\"_d\\\"),o===s&&(h.width=e.data.width,h.height=e.data.height,h.dummy=ee,h.labelpos=e.data.labelpos),t.addEdge({id:\\\"e\\\"+Math.random(),source:n,target:u,data:{weight:e.data.weight}}),0===d&&r.push(u),n=u;t.addEdge({id:\\\"e\\\"+Math.random(),source:n,target:i,data:{weight:e.data.weight}})}}(t,r,e)}))}(t,N),function(t,e){var r=function(t){var e={},r=0,n=function(o){var i=r;t.getChildren(o).forEach((function(t){return n(t.id)})),e[o]={low:i,lim:r++}};return t.getRoots().forEach((function(t){return n(t.id)})),e}(t);e.forEach((function(e){var n,o,i=e,a=t.getNode(i),s=a.data.originalEdge;if(s)for(var u=function(t,e,r,n){var o,i,a,s,u=[],h=[],d=Math.min(e[r].low,e[n].low),l=Math.max(e[r].lim,e[n].lim);a=r;do{a=null===(o=t.getParent(a))||void 0===o?void 0:o.id,u.push(a)}while(a&&(e[a].low>d||l>e[a].lim));for(s=a,a=n;a&&a!==s;)h.push(a),a=null===(i=t.getParent(a))||void 0===i?void 0:i.id;return{lca:s,path:u.concat(h.reverse())}}(t,r,s.source,s.target),h=u.path,d=u.lca,l=0,c=h[l],f=!0;i!==s.target;){if(a=t.getNode(i),f){for(;c!==d&&(null===(n=t.getNode(c))||void 0===n?void 0:n.data.maxRank)<a.data.rank;)c=h[++l];c===d&&(f=!1)}if(!f){for(;l<h.length-1&&(null===(o=t.getNode(h[l+1]))||void 0===o?void 0:o.data.minRank)<=a.data.rank;)l++;c=h[l]}t.hasNode(c)&&t.setParent(i,c),i=t.getSuccessors(i)[0].id}}))}(t,N),function(t){var e=function(r){var n=t.getChildren(r),o=t.getNode(r);if((null==n?void 0:n.length)&&n.forEach((function(t){return e(t.id)})),o.data.hasOwnProperty(\\\"minRank\\\")){o.data.borderLeft=[],o.data.borderRight=[];for(var i=o.data.minRank,a=o.data.maxRank+1;i<a;i+=1)Ne(t,\\\"borderLeft\\\",\\\"_bl\\\",r,o,i),Ne(t,\\\"borderRight\\\",\\\"_br\\\",r,o,i)}};t.getRoots().forEach((function(t){return e(t.id)}))}(t),d&&function(t,e){for(var r=t.getAllNodes().filter((function(e){var r;return!(null===(r=t.getChildren(e.id))||void 0===r?void 0:r.length)})).map((function(t){return t.data.rank})),n=Math.max.apply(Math,u([],s(r))),o=[],i=0;i<n+1;i++)o[i]=[];null==e||e.forEach((function(e){var r=t.getNode(e);r&&!r.data.dummy&&(isNaN(r.data.rank)||(r.data.fixorder=o[r.data.rank].length,o[r.data.rank].push(e)))}))}(t,h),function(t,e){for(var r=Xt(t),n=[],o=[],i=1;i<r+1;i++)n.push(i);for(i=r-1;i>-1;i--)o.push(i);var a=Le(t,n,\\\"in\\\"),s=Le(t,o,\\\"out\\\"),u=Ae(t);Fe(t,u);for(var h,d=Number.POSITIVE_INFINITY,l=(i=0,0);l<4;++i,++l)je(i%2?a:s,i%4>=2,!1,e),u=Yt(t),(c=ze(t,u))<d&&(l=0,h=qe(u),d=c);for(u=Ae(t),Fe(t,u),i=0,l=0;l<4;++i,++l){var c;je(i%2?a:s,i%4>=2,!0,e),u=Yt(t),(c=ze(t,u))<d&&(l=0,h=qe(u),d=c)}Fe(t,h)}(t,d),dr(t),function(t,e){var r=e.toLowerCase();\\\"lr\\\"!==r&&\\\"rl\\\"!==r||be(t)}(t,a),Ke(t,{align:l,nodesep:g,edgesep:v,ranksep:m}),lr(t),ur(t),function(t,e){e.forEach((function(e){var r,n=t.getNode(e),o=n.data.originalEdge;o&&t.addEdge(o);for(var i=e;n.data.dummy;)r=t.getSuccessors(i)[0],t.removeNode(i),o.data.points.push({x:n.data.x,y:n.data.y}),n.data.dummy===ee&&(o.data.x=n.data.x,o.data.y=n.data.y,o.data.width=n.data.width,o.data.height=n.data.height),i=r.id,n=t.getNode(i)}))}(t,N),ar(t),function(t,e){var r=e.toLowerCase();\\\"bt\\\"!==r&&\\\"rl\\\"!==r||function(t){t.getAllNodes().forEach((function(t){Se(t.data)})),t.getAllEdges().forEach((function(t){var e;null===(e=t.data.points)||void 0===e||e.forEach((function(t){return Se(t)})),t.data.hasOwnProperty(\\\"y\\\")&&Se(t.data)}))}(t),\\\"lr\\\"!==r&&\\\"rl\\\"!==r||(function(t){t.getAllNodes().forEach((function(t){ke(t.data)})),t.getAllEdges().forEach((function(t){var e;null===(e=t.data.points)||void 0===e||e.forEach((function(t){return ke(t)})),t.data.hasOwnProperty(\\\"x\\\")&&ke(t.data)}))}(t),be(t))}(t,a);var b=or(t),M=b.width,S=b.height;return ir(t),sr(t),function(t){t.getAllEdges().forEach((function(e){var r=e.data;if(r.reversed){t.removeEdge(e.id);var o=r.forwardName;delete r.reversed,delete r.forwardName,t.addEdge({id:e.id,source:e.target,target:e.source,data:n(n({},r),{forwardName:o})})}}))}(t),{width:M,height:S}},Je=[\\\"width\\\",\\\"height\\\",\\\"layer\\\",\\\"fixorder\\\"],Xe={width:0,height:0},Qe=[\\\"minlen\\\",\\\"weight\\\",\\\"width\\\",\\\"height\\\",\\\"labeloffset\\\"],Ze={minlen:1,weight:1,width:0,height:0,labeloffset:10,labelpos:\\\"r\\\"},tr=[\\\"labelpos\\\"],er=function(t){t.getAllEdges().forEach((function(e){if(e.data.width&&e.data.height){var r=t.getNode(e.source),n={e,rank:(t.getNode(e.target).data.rank-r.data.rank)/2+r.data.rank};Ut(t,\\\"edge-proxy\\\",n,\\\"_ep\\\")}}))},rr=function(t){var e=0;return t.getAllNodes().forEach((function(r){var n,o;r.data.borderTop&&(r.data.minRank=null===(n=t.getNode(r.data.borderTop))||void 0===n?void 0:n.data.rank,r.data.maxRank=null===(o=t.getNode(r.data.borderBottom))||void 0===o?void 0:o.data.rank,e=Math.max(e,r.data.maxRank||-1/0))})),e},nr=function(t){t.getAllNodes().forEach((function(e){\\\"edge-proxy\\\"===e.data.dummy&&(t.getEdge(e.data.e.id).data.labelRank=e.data.rank,t.removeNode(e.id))}))},or=function(t,e){var r,n,o=0,i=0,a=e||{},s=a.marginx,u=void 0===s?0:s,h=a.marginy,d=void 0===h?0:h,l=function(t){if(t.data){var e=t.data.x,a=t.data.y,s=t.data.width,u=t.data.height;isNaN(e)||isNaN(s)||(void 0===r&&(r=e-s/2),r=Math.min(r,e-s/2),o=Math.max(o,e+s/2)),isNaN(a)||isNaN(u)||(void 0===n&&(n=a-u/2),n=Math.min(n,a-u/2),i=Math.max(i,a+u/2))}};return t.getAllNodes().forEach((function(t){l(t)})),t.getAllEdges().forEach((function(t){(null==t?void 0:t.data.hasOwnProperty(\\\"x\\\"))&&l(t)})),r-=u,n-=d,t.getAllNodes().forEach((function(t){t.data.x-=r,t.data.y-=n})),t.getAllEdges().forEach((function(t){var e;null===(e=t.data.points)||void 0===e||e.forEach((function(t){t.x-=r,t.y-=n})),t.data.hasOwnProperty(\\\"x\\\")&&(t.data.x-=r),t.data.hasOwnProperty(\\\"y\\\")&&(t.data.y-=n)})),{width:o-r+u,height:i-n+d}},ir=function(t){t.getAllEdges().forEach((function(e){var r,n,o=t.getNode(e.source),i=t.getNode(e.target);e.data.points?(r=e.data.points[0],n=e.data.points[e.data.points.length-1]):(e.data.points=[],r={x:i.data.x,y:i.data.y},n={x:o.data.x,y:o.data.y}),e.data.points.unshift(Kt(o.data,r)),e.data.points.push(Kt(i.data,n))}))},ar=function(t){t.getAllEdges().forEach((function(t){if(t.data.hasOwnProperty(\\\"x\\\"))switch(\\\"l\\\"!==t.data.labelpos&&\\\"r\\\"!==t.data.labelpos||(t.data.width-=t.data.labeloffset),t.data.labelpos){case\\\"l\\\":t.data.x-=t.data.width/2+t.data.labeloffset;break;case\\\"r\\\":t.data.x+=t.data.width/2+t.data.labeloffset}}))},sr=function(t){t.getAllEdges().forEach((function(t){var e;t.data.reversed&&(null===(e=t.data.points)||void 0===e||e.reverse())}))},ur=function(t){t.getAllNodes().forEach((function(e){var r,n,o;if(null===(r=t.getChildren(e.id))||void 0===r?void 0:r.length){var i=t.getNode(e.id),a=t.getNode(i.data.borderTop),s=t.getNode(i.data.borderBottom),u=t.getNode(i.data.borderLeft[(null===(n=i.data.borderLeft)||void 0===n?void 0:n.length)-1]),h=t.getNode(i.data.borderRight[(null===(o=i.data.borderRight)||void 0===o?void 0:o.length)-1]);i.data.width=Math.abs((null==h?void 0:h.data.x)-(null==u?void 0:u.data.x))||10,i.data.height=Math.abs((null==s?void 0:s.data.y)-(null==a?void 0:a.data.y))||10,i.data.x=((null==u?void 0:u.data.x)||0)+i.data.width/2,i.data.y=((null==a?void 0:a.data.y)||0)+i.data.height/2}})),t.getAllNodes().forEach((function(e){\\\"border\\\"===e.data.dummy&&t.removeNode(e.id)}))},hr=function(t){t.getAllEdges().forEach((function(e){if(e.source===e.target){var r=t.getNode(e.source);r.data.selfEdges||(r.data.selfEdges=[]),r.data.selfEdges.push(e),t.removeEdge(e.id)}}))},dr=function(t){var e=Yt(t);null==e||e.forEach((function(e){var r=0;null==e||e.forEach((function(e,n){var o,i=t.getNode(e);i.data.order=n+r,null===(o=i.data.selfEdges)||void 0===o||o.forEach((function(e){Ut(t,\\\"selfedge\\\",{width:e.data.width,height:e.data.height,rank:i.data.rank,order:n+ ++r,e},\\\"_se\\\")})),delete i.data.selfEdges}))}))},lr=function(t){t.getAllNodes().forEach((function(e){var r=t.getNode(e.id);if(\\\"selfedge\\\"===r.data.dummy){var n=t.getNode(r.data.e.source),o=n.data.x+n.data.width/2,i=n.data.y,a=r.data.x-o,s=n.data.height/2;t.hasEdge(r.data.e.id)?t.updateEdgeData(r.data.e.id,r.data.e.data):t.addEdge({id:r.data.e.id,source:r.data.e.source,target:r.data.e.target,data:r.data.e.data}),t.removeNode(e.id),r.data.e.data.points=[{x:o+2*a/3,y:i-s},{x:o+5*a/6,y:i-s},{y:i,x:o+a},{x:o+5*a/6,y:i+s},{x:o+2*a/3,y:i+s}],r.data.e.data.x=r.data.x,r.data.e.data.y=r.data.y}}))},cr=function(t,e){var r={};return null==e||e.forEach((function(e){void 0!==t[e]&&(r[e]=+t[e])})),r},fr=function(t){void 0===t&&(t={});var e={};return Object.keys(t).forEach((function(r){e[r.toLowerCase()]=t[r]})),e},gr={rankdir:\\\"TB\\\",nodesep:50,ranksep:50,edgeLabelSpace:!0,controlPoints:!1,radial:!1,focusNode:null},pr=function(){function t(t){void 0===t&&(t={}),this.options=t,this.id=\\\"dagre\\\",this.layoutNode=function(t){return t.data.layout},this.options=n(n({},gr),t)}return t.prototype.execute=function(t,e){return i(this,void 0,void 0,(function(){return a(this,(function(r){return[2,this.genericDagreLayout(!1,t,e)]}))}))},t.prototype.assign=function(t,e){return i(this,void 0,void 0,(function(){return a(this,(function(r){switch(r.label){case 0:return[4,this.genericDagreLayout(!0,t,e)];case 1:return r.sent(),[2]}}))}))},t.prototype.genericDagreLayout=function(t,e,r){return i(this,void 0,void 0,(function(){var o,i,s,u,h,d,l,f,g,p,v,y,m,w,E,b,M,k,_,z,R,I,D,O,P,T,C,q,L,j,F,V,B,G=this;return a(this,(function(a){return o=n(n({},this.options),r),i=o.nodeSize,s=o.align,u=o.rankdir,h=void 0===u?\\\"TB\\\":u,d=o.ranksep,l=o.nodesep,f=o.ranksepFunc,g=o.nodesepFunc,p=o.edgeLabelSpace,v=o.nodeOrder,y=o.begin,m=o.controlPoints,w=o.radial,E=new c({tree:[]}),b=S(d||50,f),M=S(l||50,g),k=M,_=b,\\\"LR\\\"!==h&&\\\"RL\\\"!==h||(k=b,_=M),z=A(i,void 0),R=e.getAllNodes(),I=e.getAllEdges(),R.filter((function(t){return t.data.layout})).forEach((function(t){var e=z(t),r=_(t),n=e+2*k(t),o=e+2*r,i=t.data.layer;x(i)?E.addNode({id:t.id,data:{width:n,height:o,layer:i}}):E.addNode({id:t.id,data:{width:n,height:o}})})),I.forEach((function(t){G.layoutNode(E.getNode(t.source))&&G.layoutNode(E.getNode(t.target))&&E.addEdge({id:t.id,source:t.source,target:t.target,data:{weight:t.data.weight||1}})})),function(t,e){var r,o,i=e.edgeLabelSpace,a=e.keepNodeOrder,s=e.prevGraph,u=e.rankdir,h=e.ranksep;!a&&s&&(o=s,(r=t).getAllNodes().forEach((function(t){var e=r.getNode(t.id),n=o.getNode(t.id);void 0!==n?(e.data.fixorder=n.data._order,delete n.data._order):delete e.data.fixorder})));var d=function(t){var e=new c({tree:[]});return t.getAllNodes().forEach((function(r){var o=fr(t.getNode(r.id).data),i=n(n({},Xe),o),a=cr(i,Je);e.hasNode(r.id)||e.addNode({id:r.id,data:n({},a)});var s=t.getParent(r.id);null==s||(e.hasNode(s.id)||e.addNode(n({},s)),e.setParent(r.id,s.id))})),t.getAllEdges().forEach((function(r){var n=fr(t.getEdge(r.id).data),o={};null==tr||tr.forEach((function(t){void 0!==n[t]&&(o[t]=n[t])})),e.addEdge({id:r.id,source:r.source,target:r.target,data:Object.assign({},Ze,cr(n,Qe),o)})})),e}(t);i&&(e.ranksep=function(t,e){var r=e.ranksep,n=void 0===r?0:r,o=e.rankdir;return t.getAllNodes().forEach((function(t){isNaN(t.data.layer)||t.data.layer||(t.data.layer=0)})),t.getAllEdges().forEach((function(t){var e;t.data.minlen*=2,\\\"c\\\"!==(null===(e=t.data.labelpos)||void 0===e?void 0:e.toLowerCase())&&(\\\"TB\\\"===o||\\\"BT\\\"===o?t.data.width+=t.data.labeloffset:t.data.height+=t.data.labeloffset)})),n/2}(d,{rankdir:u,ranksep:h}));try{Ye(d,e)}catch(t){if(\\\"Not possible to find intersection inside of the rectangle\\\"===t.message)return void console.error(\\\"The following error may be caused by improper layer setting, please make sure your manual layer setting does not violate the graph's structure:\\\\n\\\",t);throw t}!function(t,e){t.getAllNodes().forEach((function(r){var n,o=t.getNode(r.id);if(o){var i=e.getNode(r.id);o.data.x=i.data.x,o.data.y=i.data.y,o.data._order=i.data.order,o.data._rank=i.data.rank,(null===(n=e.getChildren(r.id))||void 0===n?void 0:n.length)&&(o.data.width=i.data.width,o.data.height=i.data.height)}})),t.getAllEdges().forEach((function(r){var n=t.getEdge(r.id),o=e.getEdge(r.id);n.data.points=o?o.data.points:[],o&&o.data.hasOwnProperty(\\\"x\\\")&&(n.data.x=o.data.x,n.data.y=o.data.y)}))}(t,d)}(E,{prevGraph:null,edgeLabelSpace:p,keepNodeOrder:!!v,nodeOrder:v||[],acyclicer:\\\"greedy\\\",ranker:\\\"network-simplex\\\",rankdir:h,nodesep:l,align:s}),D=[0,0],y&&(O=1/0,P=1/0,E.getAllNodes().forEach((function(t){O>t.data.x&&(O=t.data.x),P>t.data.y&&(P=t.data.y)})),E.getAllEdges().forEach((function(t){var e;null===(e=t.data.points)||void 0===e||e.forEach((function(t){O>t.x&&(O=t.x),P>t.y&&(P=t.y)}))})),D[0]=y[0]-O,D[1]=y[1]-P),T=\\\"LR\\\"===h||\\\"RL\\\"===h,w||(C=new Set,q=\\\"BT\\\"===h||\\\"RL\\\"===h?function(t,e){return e-t}:function(t,e){return t-e},E.getAllNodes().forEach((function(t){t.data.x=t.data.x+D[0],t.data.y=t.data.y+D[1],C.add(T?t.data.x:t.data.y)})),L=Array.from(C).sort(q),j=T?function(t,e){return t.x!==e.x}:function(t,e){return t.y!==e.y},F=T?function(t,e,r){var n=Math.max(e.y,r.y),o=Math.min(e.y,r.y);return t.filter((function(t){return t.y<=n&&t.y>=o}))}:function(t,e,r){var n=Math.max(e.x,r.x),o=Math.min(e.x,r.x);return t.filter((function(t){return t.x<=n&&t.x>=o}))},E.getAllEdges().forEach((function(t,e){var r;p&&m&&\\\"loop\\\"!==t.data.type&&(t.data.controlPoints=vr(null===(r=t.data.points)||void 0===r?void 0:r.map((function(t){var e=t.x,r=t.y;return{x:e+D[0],y:r+D[1]}})),E.getNode(t.source),E.getNode(t.target),L,T,j,F))}))),V=[],V=E.getAllNodes().map((function(t){return N(t)})),B=E.getAllEdges(),t&&(V.forEach((function(t){e.mergeNodeData(t.id,{x:t.data.x,y:t.data.y})})),B.forEach((function(t){e.mergeEdgeData(t.id,{controlPoints:t.data.controlPoints})}))),[2,{nodes:V,edges:B}]}))}))},t}(),vr=function(t,e,r,n,o,i,a){var s=(null==t?void 0:t.slice(1,t.length-1))||[];if(e&&r){var u=e.data,h=u.x,d=u.y,l=r.data,c=l.x,f=l.y;if(o&&(h=e.data.y,d=e.data.x,c=r.data.y,f=r.data.x),f!==d&&h!==c){var g=n.indexOf(d),p=n[g+1];if(p){var v=s[0],y=o?{x:(d+p)/2,y:(null==v?void 0:v.y)||c}:{x:(null==v?void 0:v.x)||c,y:(d+p)/2};v&&!i(v,y)||s.unshift(y)}var m=n.indexOf(f),w=Math.abs(m-g);if(1===w)(s=a(s,e.data,r.data)).length||s.push(o?{x:(d+f)/2,y:h}:{x:h,y:(d+f)/2});else if(w>1){var x=n[m-1];if(x){var E=s[s.length-1],N=o?{x:(f+x)/2,y:(null==E?void 0:E.y)||c}:{x:(null==E?void 0:E.x)||h,y:(f+x)/2};E&&!i(E,N)||s.push(N)}}}}return s};function yr(t,e,r,n,o){if(isNaN(e)||isNaN(r)||isNaN(n))return t;var i,a,s,u,h,d,l,c,f,g,p,v,y=t._root,m={data:o},w=t._x0,x=t._y0,E=t._z0,N=t._x1,b=t._y1,M=t._z1;if(!y)return t._root=m,t;for(;y.length;)if((c=e>=(a=(w+N)/2))?w=a:N=a,(f=r>=(s=(x+b)/2))?x=s:b=s,(g=n>=(u=(E+M)/2))?E=u:M=u,i=y,!(y=y[p=g<<2|f<<1|c]))return i[p]=m,t;if(h=+t._x.call(null,y.data),d=+t._y.call(null,y.data),l=+t._z.call(null,y.data),e===h&&r===d&&n===l)return m.next=y,i?i[p]=m:t._root=m,t;do{i=i?i[p]=new Array(8):t._root=new Array(8),(c=e>=(a=(w+N)/2))?w=a:N=a,(f=r>=(s=(x+b)/2))?x=s:b=s,(g=n>=(u=(E+M)/2))?E=u:M=u}while((p=g<<2|f<<1|c)==(v=(l>=u)<<2|(d>=s)<<1|h>=a));return i[v]=y,i[p]=m,t}function mr(t,e,r,n,o,i,a){this.node=t,this.x0=e,this.y0=r,this.z0=n,this.x1=o,this.y1=i,this.z1=a}function wr(t){return t[0]}function xr(t){return t[1]}function Er(t){return t[2]}function Nr(t,e,r,n){var o=new br(null==e?wr:e,null==r?xr:r,null==n?Er:n,NaN,NaN,NaN,NaN,NaN,NaN);return null==t?o:o.addAll(t)}function br(t,e,r,n,o,i,a,s,u){this._x=t,this._y=e,this._z=r,this._x0=n,this._y0=o,this._z0=i,this._x1=a,this._y1=s,this._z1=u,this._root=void 0}function Mr(t){for(var e={data:t.data},r=e;t=t.next;)r=r.next={data:t.data};return e}var Sr=Nr.prototype=br.prototype;function kr(t){var e=0,r=0,n=0,o=0,i=t.length;if(i){for(var a=0;a<i;a++)(s=t[a])&&s.weight&&(e+=s.weight,r+=s.x*s.weight,n+=s.y*s.weight,o+=s.z*s.weight);t.x=r/e,t.y=n/e,t.z=o/e,t.weight=e}else{var s=t;t.x=s.data.x,t.y=s.data.y,t.z=s.data.z,t.weight=s.data.weight}}Sr.copy=function(){var t,e,r=new br(this._x,this._y,this._z,this._x0,this._y0,this._z0,this._x1,this._y1,this._z1),n=this._root;if(!n)return r;if(!n.length)return r._root=Mr(n),r;for(t=[{source:n,target:r._root=new Array(8)}];n=t.pop();)for(var o=0;o<8;++o)(e=n.source[o])&&(e.length?t.push({source:e,target:n.target[o]=new Array(8)}):n.target[o]=Mr(e));return r},Sr.add=function(t){const e=+this._x.call(null,t),r=+this._y.call(null,t),n=+this._z.call(null,t);return yr(this.cover(e,r,n),e,r,n,t)},Sr.addAll=function(t){Array.isArray(t)||(t=Array.from(t));const e=t.length,r=new Float64Array(e),n=new Float64Array(e),o=new Float64Array(e);let i=1/0,a=1/0,s=1/0,u=-1/0,h=-1/0,d=-1/0;for(let l,c,f,g,p=0;p<e;++p)isNaN(c=+this._x.call(null,l=t[p]))||isNaN(f=+this._y.call(null,l))||isNaN(g=+this._z.call(null,l))||(r[p]=c,n[p]=f,o[p]=g,c<i&&(i=c),c>u&&(u=c),f<a&&(a=f),f>h&&(h=f),g<s&&(s=g),g>d&&(d=g));if(i>u||a>h||s>d)return this;this.cover(i,a,s).cover(u,h,d);for(let i=0;i<e;++i)yr(this,r[i],n[i],o[i],t[i]);return this},Sr.cover=function(t,e,r){if(isNaN(t=+t)||isNaN(e=+e)||isNaN(r=+r))return this;var n=this._x0,o=this._y0,i=this._z0,a=this._x1,s=this._y1,u=this._z1;if(isNaN(n))a=(n=Math.floor(t))+1,s=(o=Math.floor(e))+1,u=(i=Math.floor(r))+1;else{for(var h,d,l=a-n||1,c=this._root;n>t||t>=a||o>e||e>=s||i>r||r>=u;)switch(d=(r<i)<<2|(e<o)<<1|t<n,(h=new Array(8))[d]=c,c=h,l*=2,d){case 0:a=n+l,s=o+l,u=i+l;break;case 1:n=a-l,s=o+l,u=i+l;break;case 2:a=n+l,o=s-l,u=i+l;break;case 3:n=a-l,o=s-l,u=i+l;break;case 4:a=n+l,s=o+l,i=u-l;break;case 5:n=a-l,s=o+l,i=u-l;break;case 6:a=n+l,o=s-l,i=u-l;break;case 7:n=a-l,o=s-l,i=u-l}this._root&&this._root.length&&(this._root=c)}return this._x0=n,this._y0=o,this._z0=i,this._x1=a,this._y1=s,this._z1=u,this},Sr.data=function(){var t=[];return this.visit((function(e){if(!e.length)do{t.push(e.data)}while(e=e.next)})),t},Sr.extent=function(t){return arguments.length?this.cover(+t[0][0],+t[0][1],+t[0][2]).cover(+t[1][0],+t[1][1],+t[1][2]):isNaN(this._x0)?void 0:[[this._x0,this._y0,this._z0],[this._x1,this._y1,this._z1]]},Sr.find=function(t,e,r,n){var o,i,a,s,u,h,d,l,c,f=this._x0,g=this._y0,p=this._z0,v=this._x1,y=this._y1,m=this._z1,w=[],x=this._root;for(x&&w.push(new mr(x,f,g,p,v,y,m)),null==n?n=1/0:(f=t-n,g=e-n,p=r-n,v=t+n,y=e+n,m=r+n,n*=n);l=w.pop();)if(!(!(x=l.node)||(i=l.x0)>v||(a=l.y0)>y||(s=l.z0)>m||(u=l.x1)<f||(h=l.y1)<g||(d=l.z1)<p))if(x.length){var E=(i+u)/2,N=(a+h)/2,b=(s+d)/2;w.push(new mr(x[7],E,N,b,u,h,d),new mr(x[6],i,N,b,E,h,d),new mr(x[5],E,a,b,u,N,d),new mr(x[4],i,a,b,E,N,d),new mr(x[3],E,N,s,u,h,b),new mr(x[2],i,N,s,E,h,b),new mr(x[1],E,a,s,u,N,b),new mr(x[0],i,a,s,E,N,b)),(c=(r>=b)<<2|(e>=N)<<1|t>=E)&&(l=w[w.length-1],w[w.length-1]=w[w.length-1-c],w[w.length-1-c]=l)}else{var M=t-+this._x.call(null,x.data),S=e-+this._y.call(null,x.data),k=r-+this._z.call(null,x.data),A=M*M+S*S+k*k;if(A<n){var _=Math.sqrt(n=A);f=t-_,g=e-_,p=r-_,v=t+_,y=e+_,m=r+_,o=x.data}}return o},Sr.remove=function(t){if(isNaN(i=+this._x.call(null,t))||isNaN(a=+this._y.call(null,t))||isNaN(s=+this._z.call(null,t)))return this;var e,r,n,o,i,a,s,u,h,d,l,c,f,g,p,v=this._root,y=this._x0,m=this._y0,w=this._z0,x=this._x1,E=this._y1,N=this._z1;if(!v)return this;if(v.length)for(;;){if((l=i>=(u=(y+x)/2))?y=u:x=u,(c=a>=(h=(m+E)/2))?m=h:E=h,(f=s>=(d=(w+N)/2))?w=d:N=d,e=v,!(v=v[g=f<<2|c<<1|l]))return this;if(!v.length)break;(e[g+1&7]||e[g+2&7]||e[g+3&7]||e[g+4&7]||e[g+5&7]||e[g+6&7]||e[g+7&7])&&(r=e,p=g)}for(;v.data!==t;)if(n=v,!(v=v.next))return this;return(o=v.next)&&delete v.next,n?(o?n.next=o:delete n.next,this):e?(o?e[g]=o:delete e[g],(v=e[0]||e[1]||e[2]||e[3]||e[4]||e[5]||e[6]||e[7])&&v===(e[7]||e[6]||e[5]||e[4]||e[3]||e[2]||e[1]||e[0])&&!v.length&&(r?r[p]=v:this._root=v),this):(this._root=o,this)},Sr.removeAll=function(t){for(var e=0,r=t.length;e<r;++e)this.remove(t[e]);return this},Sr.root=function(){return this._root},Sr.size=function(){var t=0;return this.visit((function(e){if(!e.length)do{++t}while(e=e.next)})),t},Sr.visit=function(t){var e,r,n,o,i,a,s,u,h=[],d=this._root;for(d&&h.push(new mr(d,this._x0,this._y0,this._z0,this._x1,this._y1,this._z1));e=h.pop();)if(!t(d=e.node,n=e.x0,o=e.y0,i=e.z0,a=e.x1,s=e.y1,u=e.z1)&&d.length){var l=(n+a)/2,c=(o+s)/2,f=(i+u)/2;(r=d[7])&&h.push(new mr(r,l,c,f,a,s,u)),(r=d[6])&&h.push(new mr(r,n,c,f,l,s,u)),(r=d[5])&&h.push(new mr(r,l,o,f,a,c,u)),(r=d[4])&&h.push(new mr(r,n,o,f,l,c,u)),(r=d[3])&&h.push(new mr(r,l,c,i,a,s,f)),(r=d[2])&&h.push(new mr(r,n,c,i,l,s,f)),(r=d[1])&&h.push(new mr(r,l,o,i,a,c,f)),(r=d[0])&&h.push(new mr(r,n,o,i,l,c,f))}return this},Sr.visitAfter=function(t){var e,r=[],n=[];for(this._root&&r.push(new mr(this._root,this._x0,this._y0,this._z0,this._x1,this._y1,this._z1));e=r.pop();){var o=e.node;if(o.length){var i,a=e.x0,s=e.y0,u=e.z0,h=e.x1,d=e.y1,l=e.z1,c=(a+h)/2,f=(s+d)/2,g=(u+l)/2;(i=o[0])&&r.push(new mr(i,a,s,u,c,f,g)),(i=o[1])&&r.push(new mr(i,c,s,u,h,f,g)),(i=o[2])&&r.push(new mr(i,a,f,u,c,d,g)),(i=o[3])&&r.push(new mr(i,c,f,u,h,d,g)),(i=o[4])&&r.push(new mr(i,a,s,g,c,f,l)),(i=o[5])&&r.push(new mr(i,c,s,g,h,f,l)),(i=o[6])&&r.push(new mr(i,a,f,g,c,d,l)),(i=o[7])&&r.push(new mr(i,c,f,g,h,d,l))}n.push(e)}for(;e=n.pop();)t(e.node,e.x0,e.y0,e.z0,e.x1,e.y1,e.z1);return this},Sr.x=function(t){return arguments.length?(this._x=t,this):this._x},Sr.y=function(t){return arguments.length?(this._y=t,this):this._y},Sr.z=function(t){return arguments.length?(this._z=t,this):this._z};var Ar=function(t,e,r,n,o,i,a){var s=[r,n,o][a-1],u=i.x-t.x||.1,h=i.y-t.y||.1,d=i.z-t.z||.1,l=s-e,c=u*u+h*h+d*d,f=Math.sqrt(c)*c;if(l*l*.81<c){var g=t.weight/f;return i.vx+=u*g,i.vy+=h*g,i.vz+=d*g,!0}if(t.length)return!1;t.data!==i&&(g=t.data.weight/f,i.vx+=u*g,i.vy+=h*g,i.vz+=d*g)},_r={dimensions:2,maxIteration:500,gravity:10,factor:1,edgeStrength:200,nodeStrength:1e3,coulombDisScale:.005,damping:.9,maxSpeed:500,minMovement:.4,interval:.02,linkDistance:200,clusterNodeStrength:20,preventOverlap:!0,distanceThresholdMode:\\\"mean\\\"},zr=function(){function t(t){void 0===t&&(t={}),this.options=t,this.id=\\\"force\\\",this.timeInterval=0,this.judgingDistance=0,this.running=!1,this.options=n(n({},_r),t)}return t.prototype.execute=function(t,e){return i(this,void 0,void 0,(function(){return a(this,(function(r){return[2,this.genericForceLayout(!1,t,e)]}))}))},t.prototype.assign=function(t,e){return i(this,void 0,void 0,(function(){return a(this,(function(r){return this.genericForceLayout(!0,t,e),[2]}))}))},t.prototype.stop=function(){this.timeInterval&&\\\"undefined\\\"!=typeof window&&window.clearInterval(this.timeInterval),this.running=!1},t.prototype.tick=function(t){var e=this;if(void 0===t&&(t=this.options.maxIteration||1),this.lastResult)return this.lastResult;for(var r=0;(this.judgingDistance>this.lastOptions.minMovement||r<1)&&r<t;r++)this.runOneStep(this.lastCalcGraph,this.lastGraph,r,this.lastVelMap,this.lastOptions),this.updatePosition(this.lastGraph,this.lastCalcGraph,this.lastVelMap,this.lastOptions);var n={nodes:this.lastLayoutNodes,edges:this.lastLayoutEdges};return this.lastAssign&&n.nodes.forEach((function(t){return e.lastGraph.mergeNodeData(t.id,{x:t.data.x,y:t.data.y,z:3===e.options.dimensions?t.data.z:void 0})})),n},t.prototype.genericForceLayout=function(t,e,r){return i(this,void 0,void 0,(function(){var o,i,s,u,h,d,l,f,g,p,v,y,m,w,E,N,b,M,S,k,A=this;return a(this,(function(a){return o=n(n({},this.options),r),i=e.getAllNodes(),s=e.getAllEdges(),u=this.formatOptions(o,e),h=u.dimensions,d=u.width,l=u.height,f=u.nodeSize,g=u.getMass,p=u.nodeStrength,v=u.edgeStrength,y=u.linkDistance,m=i.map((function(t,e){return n(n({},t),{data:n(n({},t.data),{x:x(t.data.x)?t.data.x:Math.random()*d,y:x(t.data.y)?t.data.y:Math.random()*l,z:x(t.data.z)?t.data.z:Math.random()*Math.sqrt(d*l),size:f(t)||30,mass:g(t),nodeStrength:p(t)})})})),w=s.map((function(t){return n(n({},t),{data:n(n({},t.data),{edgeStrength:v(t),linkDistance:y(t,e.getNode(t.source),e.getNode(t.target))})})})),(null==i?void 0:i.length)?(E={},i.forEach((function(t,e){E[t.id]={x:0,y:0,z:0}})),N=new c({nodes:m,edges:w}),this.formatCentripetal(u,N),b=u.maxIteration,M=u.minMovement,S=u.onTick,this.lastLayoutNodes=m,this.lastLayoutEdges=w,this.lastAssign=t,this.lastGraph=e,this.lastCalcGraph=N,this.lastOptions=u,this.lastVelMap=E,\\\"undefined\\\"==typeof window?[2]:(k=0,[2,new Promise((function(r){A.timeInterval=window.setInterval((function(){i&&A.running||r({nodes:Pr(e,m),edges:s}),A.runOneStep(N,e,k,E,u),A.updatePosition(e,N,E,u),t&&m.forEach((function(t){return e.mergeNodeData(t.id,{x:t.data.x,y:t.data.y,z:3===h?t.data.z:void 0})})),null==S||S({nodes:Pr(e,m),edges:s}),(++k>=b||A.judgingDistance<M)&&(window.clearInterval(A.timeInterval),r({nodes:Pr(e,m),edges:s}))}),0),A.running=!0}))])):(this.lastResult={nodes:[],edges:s},[2,{nodes:[],edges:s}])}))}))},t.prototype.formatOptions=function(t,e){var r=t,n=t.width,o=t.height,i=t.getMass;if(r.width=n||\\\"undefined\\\"==typeof window?n:window.innerWidth,r.height=o||\\\"undefined\\\"==typeof window?o:window.innerHeight,t.center||(r.center=[r.width/2,r.height/2]),i||(r.getMass=function(t){var r=1;x(null==t?void 0:t.data.mass)&&(r=null==t?void 0:t.data.mass);var n=e.getDegree(t.id,\\\"both\\\");return!n||n<5?r:5*n*r}),t.preventOverlap){var a=S(0,t.nodeSpacing);t.nodeSize?g(t.nodeSize)?r.nodeSize=function(e){var r=t.nodeSize;return Math.max(r[0],r[1])+a(e)}:r.nodeSize=function(e){return t.nodeSize+a(e)}:r.nodeSize=function(t){var e=((null==t?void 0:t.data)||{}).size;return e?g(e)?Math.max(e[0],e[1])+a(t):M(e)?Math.max(e.width,e.height)+a(t):e+a(t):10+a(t)}}return r.linkDistance=t.linkDistance?S(1,t.linkDistance):function(t){return 1+r.nodeSize(e.getNode(t.source))+r.nodeSize(e.getNode(t.target))},r.nodeStrength=S(1,t.nodeStrength),r.edgeStrength=S(1,t.edgeStrength),t},t.prototype.formatCentripetal=function(t,e){var r,n=t.centripetalOptions,o=t.center,i=t.clusterNodeStrength,a=t.leafCluster,s=t.clustering,u=t.nodeClusterBy,h=e.getAllNodes(),d=n||{leaf:2,single:2,others:1,center:function(t){return{x:o[0],y:o[1]}}};\\\"function\\\"!=typeof i&&(t.clusterNodeStrength=function(t){return i});var l=[];if(a&&u&&(r=Rr(e,u),l=Array.from(new Set(null==h?void 0:h.map((function(t){return t.data[u]}))))||[],t.centripetalOptions=Object.assign(d,{single:100,leaf:function(e){var n=r[e.id]||{},o=n.siblingLeaves,i=n.sameTypeLeaves;return(null==i?void 0:i.length)===(null==o?void 0:o.length)||1===(null==l?void 0:l.length)?1:t.clusterNodeStrength(e)},others:1,center:function(t){var n,o=e.getDegree(t.id,\\\"both\\\");if(!o)return{x:100,y:100};if(1===o){var i=(r[t.id]||{}).sameTypeLeaves,a=void 0===i?[]:i;1===a.length?n=void 0:a.length>1&&(n=Or(a))}else n=void 0;return{x:null==n?void 0:n.x,y:null==n?void 0:n.y}}})),s&&u){r||(r=Rr(e,u)),l||(l=Array.from(new Set(h.map((function(t){return t.data[u]}))))),l=l.filter((function(t){return void 0!==t}));var c={};l.forEach((function(t){var r=h.filter((function(e){return e.data[u]===t})).map((function(t){return e.getNode(t.id)}));c[t]=Or(r)})),t.centripetalOptions=Object.assign(d,{single:function(e){return t.clusterNodeStrength(e)},leaf:function(e){return t.clusterNodeStrength(e)},others:function(e){return t.clusterNodeStrength(e)},center:function(t){var e=c[t.data[u]];return{x:null==e?void 0:e.x,y:null==e?void 0:e.y}}})}var f=t.centripetalOptions||{},g=f.leaf,p=f.single,v=f.others;g&&\\\"function\\\"!=typeof g&&(t.centripetalOptions.leaf=function(){return g}),p&&\\\"function\\\"!=typeof p&&(t.centripetalOptions.single=function(){return p}),v&&\\\"function\\\"!=typeof v&&(t.centripetalOptions.others=function(){return v})},t.prototype.runOneStep=function(t,e,r,n,o){var i={},a=t.getAllNodes(),s=t.getAllEdges();if(null==a?void 0:a.length){var u=o.monitor;this.calRepulsive(t,i,o),s&&this.calAttractive(t,i,o),this.calGravity(t,e,i,o),this.updateVelocity(t,i,n,o),u&&u({energy:this.calTotalEnergy(i,a),nodes:e.getAllNodes(),edges:e.getAllEdges(),iterations:r})}},t.prototype.calTotalEnergy=function(t,e){var r=this;if(!(null==e?void 0:e.length))return 0;var n=0;return e.forEach((function(e,o){var i=t[e.id].x,a=t[e.id].y,s=3===r.options.dimensions?t[e.id].z:0,u=i*i+a*a+s*s,h=e.data.mass;n+=(void 0===h?1:h)*u*.5})),n},t.prototype.calRepulsive=function(t,e,r){var n=r.dimensions,o=r.factor,i=r.coulombDisScale;!function(t,e,r,n,o){var i=e/r,a=t.getAllNodes(),s=a.map((function(t,e){var r=t.data,n=r.nodeStrength;return{x:r.x,y:r.y,z:r.z,size:r.size,index:e,vx:0,vy:0,vz:0,weight:i*n}})),u=(2===o?F(s,(function(t){return t.x}),(function(t){return t.y})):Nr(s,(function(t){return t.x}),(function(t){return t.y}),(function(t){return t.z}))).visitAfter(kr);s.forEach((function(t){!function(t,e,r){e.visit((function(e,n,o,i,a){return Ar(e,n,o,i,a,t,r)}))}(t,u,o)})),s.map((function(t,e){var r=a[e],o=r.id,i=r.data.mass,s=void 0===i?1:i;n[o]={x:t.vx/s,y:t.vy/s,z:t.vz/s}}))}(t,o,i*i,e,n)},t.prototype.calAttractive=function(t,e,r){var n=r.dimensions;t.getAllEdges().forEach((function(r,o){var i=r.source,a=r.target,s=t.getNode(i),u=t.getNode(a);if(s&&u){var h=u.data.x-s.data.x,d=u.data.y-s.data.y,l=3===n?u.data.z-s.data.z:0;h||d||(h=.01*Math.random(),d=.01*Math.random(),3!==n||l||(l=.01*Math.random()));var c=Math.sqrt(h*h+d*d+l*l),f=h/c,g=d/c,p=l/c,v=r.data||{},y=v.linkDistance,m=void 0===y?200:y,w=v.edgeStrength,x=(m-c)*(void 0===w?200:w),E=1/(s.data.mass||1),N=1/(u.data.mass||1),b=f*x,M=g*x,S=p*x;e[i].x-=b*E,e[i].y-=M*E,e[i].z-=S*E,e[a].x+=b*N,e[a].y+=M*N,e[a].z+=S*N}}))},t.prototype.calGravity=function(t,e,r,n){var o=n.getCenter,i=t.getAllNodes(),a=e.getAllNodes(),u=e.getAllEdges(),h=n.width,d=n.height,l=n.center,c=n.gravity,f=n.centripetalOptions;i&&i.forEach((function(n){var i=n.id,g=n.data,p=g.mass,v=g.x,y=g.y,m=g.z,w=e.getNode(i),E=0,N=0,b=0,M=c,S=t.getDegree(i,\\\"in\\\"),k=t.getDegree(i,\\\"out\\\"),A=t.getDegree(i,\\\"both\\\"),_=null==o?void 0:o(w,A);if(_){var z=s(_,3);E=v-z[0],N=y-z[1],M=z[2]}else E=v-l[0],N=y-l[1],b=m-l[2];if(M&&(r[i].x-=M*E/p,r[i].y-=M*N/p,r[i].z-=M*b/p),f){var R=f.leaf,I=f.single,D=f.others,O=f.center,P=(null==O?void 0:O(w,a,u,h,d))||{x:0,y:0,z:0,centerStrength:0},T=P.x,C=P.y,q=P.z,L=P.centerStrength;if(!x(T)||!x(C))return;var j=(v-T)/p,F=(y-C)/p,V=(m-q)/p;if(L&&(r[i].x-=L*j,r[i].y-=L*F,r[i].z-=L*V),0===A){var B=I(w);if(!B)return;return r[i].x-=B*j,r[i].y-=B*F,void(r[i].z-=B*V)}if(0===S||0===k){var G=R(w,a,u);if(!G)return;return r[i].x-=G*j,r[i].y-=G*F,void(r[i].z-=G*V)}var W=D(w);if(!W)return;r[i].x-=W*j,r[i].y-=W*F,r[i].z-=W*V}}))},t.prototype.updateVelocity=function(t,e,r,n){var o=n.damping,i=n.maxSpeed,a=n.interval,s=n.dimensions,u=t.getAllNodes();(null==u?void 0:u.length)&&u.forEach((function(t){var n=t.id,u=(r[n].x+e[n].x*a)*o||.01,h=(r[n].y+e[n].y*a)*o||.01,d=3===s?(r[n].z+e[n].z*a)*o||.01:0,l=Math.sqrt(u*u+h*h+d*d);if(l>i){var c=i/l;u*=c,h*=c,d*=c}r[n]={x:u,y:h,z:d}}))},t.prototype.updatePosition=function(t,e,r,n){var o=this,i=n.distanceThresholdMode,a=n.interval,s=n.dimensions,u=e.getAllNodes();if(null==u?void 0:u.length){var h=0;\\\"max\\\"===i?this.judgingDistance=-1/0:\\\"min\\\"===i&&(this.judgingDistance=1/0),u.forEach((function(n){var u=n.id,d=t.getNode(u);if(x(d.data.fx)&&x(d.data.fy))e.mergeNodeData(u,{x:d.data.fx,y:d.data.fy,z:3===s?d.data.fz:void 0});else{var l=r[u].x*a,c=r[u].y*a,f=3===s?r[u].z*a:0;e.mergeNodeData(u,{x:n.data.x+l,y:n.data.y+c,z:n.data.z+f});var g=Math.sqrt(l*l+c*c+f*f);switch(i){case\\\"max\\\":o.judgingDistance<g&&(o.judgingDistance=g);break;case\\\"min\\\":o.judgingDistance>g&&(o.judgingDistance=g);break;default:h+=g}}})),i&&\\\"mean\\\"!==i||(this.judgingDistance=h/u.length)}else this.judgingDistance=0},t}(),Rr=function(t,e){var r=t.getAllNodes();if(!(null==r?void 0:r.length))return{};var n={};return r.forEach((function(r,o){1===t.getDegree(r.id,\\\"both\\\")&&(n[r.id]=Ir(t,\\\"leaf\\\",r,e))})),n},Ir=function(t,e,r,n){var o=t.getDegree(r.id,\\\"in\\\"),i=t.getDegree(r.id,\\\"out\\\"),a=r,s=[];return 0===o?(a=t.getSuccessors(r.id)[0],s=t.getNeighbors(a.id)):0===i&&(a=t.getPredecessors(r.id)[0],s=t.getNeighbors(a.id)),s=s.filter((function(e){return 0===t.getDegree(e.id,\\\"in\\\")||0===t.getDegree(e.id,\\\"out\\\")})),{coreNode:a,siblingLeaves:s,sameTypeLeaves:Dr(t,e,n,r,s)}},Dr=function(t,e,r,n,o){var i=n.data[r]||\\\"\\\",a=(null==o?void 0:o.filter((function(t){return t.data[r]===i})))||[];return\\\"leaf\\\"===e&&(a=a.filter((function(e){return 0===t.getDegree(e.id,\\\"in\\\")||0===t.getDegree(e.id,\\\"out\\\")}))),a},Or=function(t){var e={x:0,y:0};t.forEach((function(t){var r=t.data,n=r.x,o=r.y;e.x+=n||0,e.y+=o||0}));var r=t.length||1;return{x:e.x/r,y:e.y/r}},Pr=function(t,e){return e.map((function(e){var r=e.id,o=e.data,i=t.getNode(r);return n(n({},i),{data:n(n({},i.data),{x:o.x,y:o.y,z:o.z})})}))},Tr=function(){function t(t){this.id=t.id||0,this.rx=t.rx,this.ry=t.ry,this.fx=0,this.fy=0,this.mass=t.mass,this.degree=t.degree,this.g=t.g||0}return t.prototype.distanceTo=function(t){var e=this.rx-t.rx,r=this.ry-t.ry;return Math.hypot(e,r)},t.prototype.setPos=function(t,e){this.rx=t,this.ry=e},t.prototype.resetForce=function(){this.fx=0,this.fy=0},t.prototype.addForce=function(t){var e=t.rx-this.rx,r=t.ry-this.ry,n=Math.hypot(e,r);n=n<1e-4?1e-4:n;var o=this.g*(this.degree+1)*(t.degree+1)/n;this.fx+=o*e/n,this.fy+=o*r/n},t.prototype.in=function(t){return t.contains(this.rx,this.ry)},t.prototype.add=function(e){var r=this.mass+e.mass;return new t({rx:(this.rx*this.mass+e.rx*e.mass)/r,ry:(this.ry*this.mass+e.ry*e.mass)/r,mass:r,degree:this.degree+e.degree})},t}();const Cr=Tr;const qr=function(){function t(t){this.xmid=t.xmid,this.ymid=t.ymid,this.length=t.length,this.massCenter=t.massCenter||[0,0],this.mass=t.mass||1}return t.prototype.getLength=function(){return this.length},t.prototype.contains=function(t,e){var r=this.length/2;return t<=this.xmid+r&&t>=this.xmid-r&&e<=this.ymid+r&&e>=this.ymid-r},t.prototype.NW=function(){return new t({xmid:this.xmid-this.length/4,ymid:this.ymid+this.length/4,length:this.length/2})},t.prototype.NE=function(){return new t({xmid:this.xmid+this.length/4,ymid:this.ymid+this.length/4,length:this.length/2})},t.prototype.SW=function(){return new t({xmid:this.xmid-this.length/4,ymid:this.ymid-this.length/4,length:this.length/2})},t.prototype.SE=function(){return new t({xmid:this.xmid+this.length/4,ymid:this.ymid-this.length/4,length:this.length/2})},t}(),Lr=function(){function t(t){this.body=null,this.quad=null,this.NW=null,this.NE=null,this.SW=null,this.SE=null,this.theta=.5,null!=t&&(this.quad=t)}return t.prototype.insert=function(e){null!=this.body?this._isExternal()?(this.quad&&(this.NW=new t(this.quad.NW()),this.NE=new t(this.quad.NE()),this.SW=new t(this.quad.SW()),this.SE=new t(this.quad.SE())),this._putBody(this.body),this._putBody(e),this.body=this.body.add(e)):(this.body=this.body.add(e),this._putBody(e)):this.body=e},t.prototype._putBody=function(t){this.quad&&(t.in(this.quad.NW())&&this.NW?this.NW.insert(t):t.in(this.quad.NE())&&this.NE?this.NE.insert(t):t.in(this.quad.SW())&&this.SW?this.SW.insert(t):t.in(this.quad.SE())&&this.SE&&this.SE.insert(t))},t.prototype._isExternal=function(){return null==this.NW&&null==this.NE&&null==this.SW&&null==this.SE},t.prototype.updateForce=function(t){null!=this.body&&t!==this.body&&(this._isExternal()||(this.quad?this.quad.getLength():0)/this.body.distanceTo(t)<this.theta?t.addForce(this.body):(this.NW&&this.NW.updateForce(t),this.NE&&this.NE.updateForce(t),this.SW&&this.SW.updateForce(t),this.SE&&this.SE.updateForce(t)))},t}();var jr={center:[0,0],width:300,height:300,kr:5,kg:1,mode:\\\"normal\\\",preventOverlap:!1,dissuadeHubs:!1,maxIteration:0,ks:.1,ksmax:10,tao:.1},Fr=function(){function t(t){void 0===t&&(t={}),this.options=t,this.id=\\\"forceAtlas2\\\",this.options=n(n({},jr),t)}return t.prototype.execute=function(t,e){return i(this,void 0,void 0,(function(){return a(this,(function(r){return[2,this.genericForceAtlas2Layout(!1,t,e)]}))}))},t.prototype.assign=function(t,e){return i(this,void 0,void 0,(function(){return a(this,(function(r){return this.genericForceAtlas2Layout(!0,t,e),[2]}))}))},t.prototype.genericForceAtlas2Layout=function(t,e,r){return i(this,void 0,void 0,(function(){var o,i,s,u,h,d,l,f,g,p,v,y,m,w,x,E,b,M,S,k,A,z;return a(this,(function(a){if(o=e.getAllEdges(),i=e.getAllNodes(),s=this.formatOptions(r,i.length),u=s.width,h=s.height,d=s.prune,l=s.maxIteration,f=s.nodeSize,g=s.center,!(null==i?void 0:i.length)||1===i.length)return[2,_(e,t,g)];if(p=i.map((function(t){return N(t,[u,h])})),v=o.filter((function(t){return t.source!==t.target})),y=new c({nodes:p,edges:v}),m=this.getSizes(y,e,f),this.run(y,e,l,m,t,s),d){for(w=0;w<v.length;w+=1)x=v[w],E=x.source,b=x.target,M=y.getDegree(E),S=y.getDegree(E),M<=1?(k=y.getNode(b),y.mergeNodeData(E,{x:k.data.x,y:k.data.y})):S<=1&&(A=y.getNode(E),y.mergeNodeData(b,{x:A.data.x,y:A.data.y}));z=n(n({},s),{prune:!1,barnesHut:!1}),this.run(y,e,100,m,t,z)}return[2,{nodes:p,edges:o}]}))}))},t.prototype.getSizes=function(t,e,r){for(var n=t.getAllNodes(),o={},i=0;i<n.length;i+=1){var a=n[i],h=a.id,d=a.data;if(o[h]=10,x(d.size))o[h]=d.size;else if(g(d.size))isNaN(d.size[0])||(o[h]=Math.max(d.size[0])),isNaN(d.size[1])||(o[h]=Math.max(d.size[1]));else if(M(d.size))o[h]=Math.max(d.size.width,d.size.height);else if(b(r)){var l=r(e.getNode(h));g(l)?o[h]=Math.max.apply(Math,u([],s(l))):o[h]=l}else g(r)?o[h]=Math.max.apply(Math,u([],s(r))):x(r)&&(o[h]=r)}return o},t.prototype.formatOptions=function(t,e){void 0===t&&(t={});var r=n(n({},this.options),t),o=r.center,i=r.width,a=r.height,s=r.barnesHut,u=r.prune,h=r.maxIteration,d=r.kr,l=r.kg;return r.width=i||\\\"undefined\\\"==typeof window?i:window.innerWidth,r.height=a||\\\"undefined\\\"==typeof window?a:window.innerHeight,r.center=o||[r.width/2,r.height/2],void 0===s&&e>250&&(r.barnesHut=!0),void 0===u&&e>100&&(r.prune=!0),0!==h||u?0===h&&u&&(r.maxIteration=100,e<=200&&e>100?r.maxIteration=500:e>200&&(r.maxIteration=950)):(r.maxIteration=250,e<=200&&e>100?r.maxIteration=1e3:e>200&&(r.maxIteration=1200)),d||(r.kr=50,e>100&&e<=500?r.kr=20:e>500&&(r.kr=1)),l||(r.kg=20,e>100&&e<=500?r.kg=10:e>500&&(r.kg=1)),r},t.prototype.run=function(t,e,r,n,o,i){for(var a=i.kr,s=i.barnesHut,u=i.onTick,h=t.getAllNodes(),d=0,l=r,c={},f={},g={},p=0;p<h.length;p+=1){var v=h[p],y=v.data,m=v.id;if(c[m]=[0,0],s){var w={id:p,rx:y.x,ry:y.y,mass:1,g:a,degree:t.getDegree(m)};g[m]=new Cr(w)}}for(;l>0;)d=this.oneStep(t,{iter:l,preventOverlapIters:50,krPrime:100,sg:d,forces:c,preForces:f,bodies:g,sizes:n},i),l--,null==u||u({nodes:h,edges:e.getAllEdges()});return t},t.prototype.oneStep=function(t,e,r){for(var n=e.iter,o=e.preventOverlapIters,i=e.krPrime,a=e.sg,h=e.preForces,d=e.bodies,l=e.sizes,c=e.forces,f=r.preventOverlap,g=r.barnesHut,p=t.getAllNodes(),v=0;v<p.length;v+=1){var y=p[v].id;h[y]=u([],s(c[y])),c[y]=[0,0]}return c=this.getAttrForces(t,n,o,l,c,r),c=g&&(f&&n>o||!f)?this.getOptRepGraForces(t,c,d,r):this.getRepGraForces(t,n,o,c,i,l,r),this.updatePos(t,c,h,a,r)},t.prototype.getAttrForces=function(t,e,r,n,o,i){for(var a=i.preventOverlap,s=i.dissuadeHubs,u=i.mode,h=i.prune,d=t.getAllEdges(),l=0;l<d.length;l+=1){var c=d[l],f=c.source,g=c.target,p=t.getNode(f),v=t.getNode(g),y=t.getDegree(f),m=t.getDegree(g);if(!h||!(y<=1||m<=1)){var w=[v.data.x-p.data.x,v.data.y-p.data.y],x=Math.hypot(w[0],w[1]);x=x<1e-4?1e-4:x,w[0]=w[0]/x,w[1]=w[1]/x,a&&e<r&&(x=x-n[f]-n[g]);var E=x,N=E;\\\"linlog\\\"===u&&(N=E=Math.log(1+x)),s&&(E=x/y,N=x/m),a&&e<r&&x<=0?(E=0,N=0):a&&e<r&&x>0&&(E=x,N=x),o[f][0]+=E*w[0],o[g][0]-=N*w[0],o[f][1]+=E*w[1],o[g][1]-=N*w[1]}}return o},t.prototype.getOptRepGraForces=function(t,e,r,n){for(var o=n.kg,i=n.center,a=n.prune,s=t.getAllNodes(),u=s.length,h=9e10,d=-9e10,l=9e10,c=-9e10,f=0;f<u;f+=1){var g=s[f],p=g.id,v=g.data;a&&t.getDegree(p)<=1||(r[p].setPos(v.x,v.y),v.x>=d&&(d=v.x),v.x<=h&&(h=v.x),v.y>=c&&(c=v.y),v.y<=l&&(l=v.y))}var y=Math.max(d-h,c-l),m=new qr({xmid:(d+h)/2,ymid:(c+l)/2,length:y,massCenter:i,mass:u}),w=new Lr(m);for(f=0;f<u;f+=1)p=s[f].id,a&&t.getDegree(p)<=1||r[p].in(m)&&w.insert(r[p]);for(f=0;f<u;f+=1){var x=s[f],E=(p=x.id,v=x.data,t.getDegree(p));if(!(a&&E<=1)){r[p].resetForce(),w.updateForce(r[p]),e[p][0]-=r[p].fx,e[p][1]-=r[p].fy;var N=[v.x-i[0],v.y-i[1]],b=Math.hypot(N[0],N[1]);b=b<1e-4?1e-4:b,N[0]=N[0]/b,N[1]=N[1]/b;var M=o*(E+1);e[p][0]-=M*N[0],e[p][1]-=M*N[1]}}return e},t.prototype.getRepGraForces=function(t,e,r,n,o,i,a){for(var s=a.preventOverlap,u=a.kr,h=a.kg,d=a.center,l=a.prune,c=t.getAllNodes(),f=c.length,g=0;g<f;g+=1){for(var p=c[g],v=t.getDegree(p.id),y=g+1;y<f;y+=1){var m=c[y],w=t.getDegree(m.id);if(!l||!(v<=1||w<=1)){var x=[m.data.x-p.data.x,m.data.y-p.data.y],E=Math.hypot(x[0],x[1]);E=E<1e-4?1e-4:E,x[0]=x[0]/E,x[1]=x[1]/E,s&&e<r&&(E=E-i[p.id]-i[m.id]);var N=u*(v+1)*(w+1)/E;s&&e<r&&E<0?N=o*(v+1)*(w+1):s&&e<r&&0===E?N=0:s&&e<r&&E>0&&(N=u*(v+1)*(w+1)/E),n[p.id][0]-=N*x[0],n[m.id][0]+=N*x[0],n[p.id][1]-=N*x[1],n[m.id][1]+=N*x[1]}}var b=[p.data.x-d[0],p.data.y-d[1]],M=Math.hypot(b[0],b[1]);b[0]=b[0]/M,b[1]=b[1]/M;var S=h*(v+1);n[p.id][0]-=S*b[0],n[p.id][1]-=S*b[1]}return n},t.prototype.updatePos=function(t,e,r,n,o){for(var i=o.ks,a=o.tao,s=o.prune,u=o.ksmax,h=t.getAllNodes(),d=h.length,l=[],c=[],f=0,g=0,p=n,v=0;v<d;v+=1){var y=h[v].id,m=t.getDegree(y);if(!(s&&m<=1)){var w=[e[y][0]-r[y][0],e[y][1]-r[y][1]],E=Math.hypot(w[0],w[1]),N=[e[y][0]+r[y][0],e[y][1]+r[y][1]],b=Math.hypot(N[0],N[1]);l[v]=E,c[v]=b/2,f+=(m+1)*l[v],g+=(m+1)*c[v]}}var M=p;for(p=a*g/f,0!==M&&(p=p>1.5*M?1.5*M:p),v=0;v<d;v+=1){var S=h[v],k=(y=S.id,S.data);if(m=t.getDegree(y),!(s&&m<=1||x(k.fx)&&x(k.fy))){var A=i*p/(1+p*Math.sqrt(l[v])),_=Math.hypot(e[y][0],e[y][1]),z=u/(_=_<1e-4?1e-4:_),R=(A=A>z?z:A)*e[y][0],I=A*e[y][1];t.mergeNodeData(y,{x:k.x+R,y:k.y+I})}}return p},t}(),Vr={maxIteration:1e3,gravity:10,speed:5,clustering:!1,clusterGravity:10,width:300,height:300,nodeClusterBy:\\\"cluster\\\"},Br=function(){function t(t){void 0===t&&(t={}),this.options=t,this.id=\\\"fruchterman\\\",this.timeInterval=0,this.running=!1,this.options=n(n({},Vr),t)}return t.prototype.execute=function(t,e){return i(this,void 0,void 0,(function(){return a(this,(function(r){return[2,this.genericFruchtermanLayout(!1,t,e)]}))}))},t.prototype.assign=function(t,e){return i(this,void 0,void 0,(function(){return a(this,(function(r){return this.genericFruchtermanLayout(!0,t,e),[2]}))}))},t.prototype.stop=function(){this.timeInterval&&\\\"undefined\\\"!=typeof window&&window.clearInterval(this.timeInterval),this.running=!1},t.prototype.tick=function(t){var e=this;if(void 0===t&&(t=this.options.maxIteration||1),this.lastResult)return this.lastResult;for(var r=0;r<t;r++)this.runOneStep(this.lastGraph,this.lastClusterMap,this.lastOptions);var n={nodes:this.lastLayoutNodes,edges:this.lastLayoutEdges};return this.lastAssign&&n.nodes.forEach((function(t){return e.lastGraph.mergeNodeData(t.id,{x:t.data.x,y:t.data.y,z:3===e.options.dimensions?t.data.z:void 0})})),n},t.prototype.genericFruchtermanLayout=function(t,e,r){return i(this,void 0,void 0,(function(){var o,i,s,u,h,d,l,f,g,p,v,y,m,w,x,E,b=this;return a(this,(function(a){return this.running?[2]:(o=this.formatOptions(r),i=o.dimensions,s=o.width,u=o.height,h=o.center,d=o.clustering,l=o.nodeClusterBy,f=o.maxIteration,g=o.onTick,p=e.getAllNodes(),v=e.getAllEdges(),(null==p?void 0:p.length)?1===p.length?(t&&e.mergeNodeData(p[0].id,{x:h[0],y:h[1],z:3===i?h[2]:void 0}),y={nodes:[n(n({},p[0]),{data:n(n({},p[0].data),{x:h[0],y:h[1],z:3===i?h[2]:void 0})})],edges:v},this.lastResult=y,[2,y]):(m=p.map((function(t){return N(t,[s,u])})),w=new c({nodes:m,edges:v}),x={},d&&m.forEach((function(t){var e=t.data[l];x[e]||(x[e]={name:e,cx:0,cy:0,count:0})})),this.lastLayoutNodes=m,this.lastLayoutEdges=v,this.lastAssign=t,this.lastGraph=w,this.lastOptions=o,this.lastClusterMap=x,\\\"undefined\\\"==typeof window?[2]:(E=0,[2,new Promise((function(r){b.timeInterval=window.setInterval((function(){b.running?(b.runOneStep(w,x,o),t&&m.forEach((function(t){var r=t.id,n=t.data;return e.mergeNodeData(r,{x:n.x,y:n.y,z:3===i?n.z:void 0})})),null==g||g({nodes:m,edges:v}),++E>=f&&(window.clearInterval(b.timeInterval),r({nodes:m,edges:v}))):r({nodes:m,edges:v})}),0),b.running=!0}))])):(y={nodes:[],edges:v},this.lastResult=y,[2,y]))}))}))},t.prototype.formatOptions=function(t){void 0===t&&(t={});var e=n(n({},this.options),t),r=e.clustering,o=e.nodeClusterBy,i=e.center,a=e.width,s=e.height;return e.width=a||\\\"undefined\\\"==typeof window?a:window.innerWidth,e.height=s||\\\"undefined\\\"==typeof window?s:window.innerHeight,e.center=i||[e.width/2,e.height/2],e.clustering=r&&!!o,e},t.prototype.runOneStep=function(t,e,r){var n=r.dimensions,o=r.height,i=r.width,a=r.gravity,s=r.center,u=r.speed,h=r.clustering,d=r.nodeClusterBy,l=r.clusterGravity,c=o*i,f=Math.sqrt(c)/10,g=t.getAllNodes(),p=c/(g.length+1),v=Math.sqrt(p),y={};if(this.applyCalculate(t,y,v,p),h){for(var m in e)e[m].cx=0,e[m].cy=0,e[m].count=0;for(var m in g.forEach((function(t){var r=t.data,n=e[r[d]];x(r.x)&&(n.cx+=r.x),x(r.y)&&(n.cy+=r.y),n.count++})),e)e[m].cx/=e[m].count,e[m].cy/=e[m].count;var w=l||a;g.forEach((function(t,r){var n=t.id,o=t.data;if(x(o.x)&&x(o.y)){var i=e[o[d]],a=Math.sqrt((o.x-i.cx)*(o.x-i.cx)+(o.y-i.cy)*(o.y-i.cy)),s=v*w;y[n].x-=s*(o.x-i.cx)/a,y[n].y-=s*(o.y-i.cy)/a}}))}g.forEach((function(t,e){var r=t.id,o=t.data;if(x(o.x)&&x(o.y)){var i=.01*v*a;y[r].x-=i*(o.x-s[0]),y[r].y-=i*(o.y-s[1]),3===n&&(y[r].z-=i*(o.z-s[2]))}})),g.forEach((function(e,r){var o=e.id,i=e.data;if(x(i.fx)&&x(i.fy))return i.x=i.fx,i.y=i.fy,void(3===n&&(i.z=i.fz));if(x(i.x)&&x(i.y)){var a=Math.sqrt(y[o].x*y[o].x+y[o].y*y[o].y+(3===n?y[o].z*y[o].z:0));if(a>0){var s=Math.min(f*(u/800),a);t.mergeNodeData(o,{x:i.x+y[o].x/a*s,y:i.y+y[o].y/a*s,z:3===n?i.z+y[o].z/a*s:void 0})}}}))},t.prototype.applyCalculate=function(t,e,r,n){this.calRepulsive(t,e,n),this.calAttractive(t,e,r)},t.prototype.calRepulsive=function(t,e,r){var n=this,o=t.getAllNodes();o.forEach((function(t,i){var a=t.data,s=t.id;e[s]={x:0,y:0,z:0},o.forEach((function(t,o){var u=t.data,h=t.id;if(!(i<=o)&&x(a.x)&&x(u.x)&&x(a.y)&&x(u.y)){var d=a.x-u.x,l=a.y-u.y,c=3===n.options.dimensions?a.z-u.z:0,f=d*d+l*l+c*c;0===f&&(f=1,d=.01,l=.01,c=.01);var g=r/f,p=d*g,v=l*g,y=c*g;e[s].x+=p,e[s].y+=v,e[h].x-=p,e[h].y-=v,3===n.options.dimensions&&(e[s].z+=y,e[h].z-=y)}}))}))},t.prototype.calAttractive=function(t,e,r){var n=this;t.getAllEdges().forEach((function(o){var i=o.source,a=o.target;if(i&&a&&i!==a){var s=t.getNode(i).data,u=t.getNode(a).data;if(x(u.x)&&x(s.x)&&x(u.y)&&x(s.y)){var h=u.x-s.x,d=u.y-s.y,l=3===n.options.dimensions?u.z-s.z:0,c=Math.sqrt(h*h+d*d+l*l)/r,f=h*c,g=d*c,p=l*c;e[i].x+=f,e[i].y+=g,e[a].x-=f,e[a].y-=g,3===n.options.dimensions&&(e[i].z+=p,e[a].z-=p)}}}))},t}(),Gr={begin:[0,0],preventOverlap:!0,preventOverlapPadding:10,condense:!1,rows:void 0,cols:void 0,position:void 0,sortBy:\\\"degree\\\",nodeSize:30,width:300,height:300},Wr=function(){function t(t){void 0===t&&(t={}),this.options=t,this.id=\\\"grid\\\",this.options=n(n({},Gr),t)}return t.prototype.execute=function(t,e){return i(this,void 0,void 0,(function(){return a(this,(function(r){return[2,this.genericGridLayout(!1,t,e)]}))}))},t.prototype.assign=function(t,e){return i(this,void 0,void 0,(function(){return a(this,(function(r){return this.genericGridLayout(!0,t,e),[2]}))}))},t.prototype.genericGridLayout=function(t,e,r){return i(this,void 0,void 0,(function(){var o,i,s,u,h,d,l,c,f,p,v,y,m,w,E,b,M,A,z,R,I,D,P,T,C,q,L,j,F,V,B,G,W,$,U,H,K;return a(this,(function(a){if(o=n(n({},this.options),r),i=o.begin,s=void 0===i?[0,0]:i,u=o.condense,h=o.preventOverlapPadding,d=o.preventOverlap,l=o.rows,c=o.cols,f=o.nodeSpacing,p=o.nodeSize,v=o.width,y=o.height,m=o.position,w=o.sortBy,E=e.getAllNodes(),b=e.getAllEdges(),!(M=null==E?void 0:E.length)||1===M)return[2,_(e,t,s)];if(A=E.map((function(t){return N(t)})),\\\"id\\\"===w||O(w)&&void 0!==A[0].data[w]||(w=\\\"degree\\\"),\\\"degree\\\"===w?A.sort((function(t,r){return e.getDegree(r.id,\\\"both\\\")-e.getDegree(t.id,\\\"both\\\")})):\\\"id\\\"===w?A.sort((function(t,e){return x(e.id)&&x(t.id)?e.id-t.id:(\\\"\\\"+t.id).localeCompare(\\\"\\\"+e.id)})):A.sort((function(t,e){return e.data[w]-t.data[w]})),z=v||\\\"undefined\\\"==typeof window?v:window.innerWidth,R=y||\\\"undefined\\\"==typeof window?y:window.innerHeight,I=M,D={rows:l,cols:c},null!=l&&null!=c?(D.rows=l,D.cols=c):null!=l&&null==c?(D.rows=l,D.cols=Math.ceil(I/D.rows)):null==l&&null!=c?(D.cols=c,D.rows=Math.ceil(I/D.cols)):(P=Math.sqrt(I*R/z),D.rows=Math.round(P),D.cols=Math.round(z/R*P)),D.rows=Math.max(D.rows,1),D.cols=Math.max(D.cols,1),D.cols*D.rows>I)T=$r(D),C=Ur(D),(T-1)*C>=I?$r(D,T-1):(C-1)*T>=I&&Ur(D,C-1);else for(;D.cols*D.rows<I;)T=$r(D),((C=Ur(D))+1)*T>=I?Ur(D,C+1):$r(D,T+1);for(q=u?0:z/D.cols,L=u?0:R/D.rows,(d||f)&&(j=S(10,f),F=k(30,p,!1),A.forEach((function(t){t.data.x&&t.data.y||(t.data.x=0,t.data.y=0);var r,n,o=e.getNode(t.id),i=F(o)||30;g(i)?(r=i[0],n=i[1]):(r=i,n=i);var a=void 0!==j?j(t):h,s=r+a,u=n+a;q=Math.max(q,s),L=Math.max(L,u)}))),V={},B={row:0,col:0},G={},W=0;W<A.length;W++){if($=A[W],U=void 0,m&&(U=m(e.getNode($.id))),U&&(void 0!==U.row||void 0!==U.col)){if(void 0===(H={row:U.row,col:U.col}).col)for(H.col=0;Hr(V,H);)H.col++;else if(void 0===H.row)for(H.row=0;Hr(V,H);)H.row++;G[$.id]=H,Kr(V,H)}Jr($,s,q,L,G,D,B,V)}return K={nodes:A,edges:b},t&&A.forEach((function(t){e.mergeNodeData(t.id,{x:t.data.x,y:t.data.y})})),[2,K]}))}))},t}(),$r=function(t,e){var r,n=t.rows||5,o=t.cols||5;return null==e?r=Math.min(n,o):Math.min(n,o)===t.rows?t.rows=e:t.cols=e,r},Ur=function(t,e){var r,n=t.rows||5,o=t.cols||5;return null==e?r=Math.max(n,o):Math.max(n,o)===t.rows?t.rows=e:t.cols=e,r},Hr=function(t,e){return t[\\\"c-\\\"+e.row+\\\"-\\\"+e.col]||!1},Kr=function(t,e){return t[\\\"c-\\\"+e.row+\\\"-\\\"+e.col]=!0},Yr=function(t,e){var r=t.cols||5;e.col++,e.col>=r&&(e.col=0,e.row++)},Jr=function(t,e,r,n,o,i,a,s){var u,h,d=o[t.id];if(d)u=d.col*r+r/2+e[0],h=d.row*n+n/2+e[1];else{for(;Hr(s,a);)Yr(i,a);u=a.col*r+r/2+e[0],h=a.row*n+n/2+e[1],Kr(s,a),Yr(i,a)}t.data.x=u,t.data.y=h};const Xr=Object.prototype.toString;function Qr(t){const e=Xr.call(t);return e.endsWith(\\\"Array]\\\")&&!e.includes(\\\"Big\\\")}function Zr(t){var e,r=arguments.length>1&&void 0!==arguments[1]?arguments[1]:{};if(!Qr(t))throw new TypeError(\\\"input must be an array\\\");if(0===t.length)throw new TypeError(\\\"input must not be empty\\\");if(void 0!==r.output){if(!Qr(r.output))throw new TypeError(\\\"output option must be an array if specified\\\");e=r.output}else e=new Array(t.length);var n=function(t){var e=arguments.length>1&&void 0!==arguments[1]?arguments[1]:{};if(!Qr(t))throw new TypeError(\\\"input must be an array\\\");if(0===t.length)throw new TypeError(\\\"input must not be empty\\\");var r=e.fromIndex,n=void 0===r?0:r,o=e.toIndex,i=void 0===o?t.length:o;if(n<0||n>=t.length||!Number.isInteger(n))throw new Error(\\\"fromIndex must be a positive integer smaller than length\\\");if(i<=n||i>t.length||!Number.isInteger(i))throw new Error(\\\"toIndex must be an integer greater than fromIndex and at most equal to length\\\");for(var a=t[n],s=n+1;s<i;s++)t[s]<a&&(a=t[s]);return a}(t),o=function(t){var e=arguments.length>1&&void 0!==arguments[1]?arguments[1]:{};if(!Qr(t))throw new TypeError(\\\"input must be an array\\\");if(0===t.length)throw new TypeError(\\\"input must not be empty\\\");var r=e.fromIndex,n=void 0===r?0:r,o=e.toIndex,i=void 0===o?t.length:o;if(n<0||n>=t.length||!Number.isInteger(n))throw new Error(\\\"fromIndex must be a positive integer smaller than length\\\");if(i<=n||i>t.length||!Number.isInteger(i))throw new Error(\\\"toIndex must be an integer greater than fromIndex and at most equal to length\\\");for(var a=t[n],s=n+1;s<i;s++)t[s]>a&&(a=t[s]);return a}(t);if(n===o)throw new RangeError(\\\"minimum and maximum input values are equal. Cannot rescale a constant array\\\");var i=r.min,a=void 0===i?r.autoMinMax?n:0:i,s=r.max,u=void 0===s?r.autoMinMax?o:1:s;if(a>=u)throw new RangeError(\\\"min option must be smaller than max option\\\");for(var h=(u-a)/(o-n),d=0;d<t.length;d++)e[d]=(t[d]-n)*h+a;return e}const tn=\\\" \\\".repeat(2),en=\\\" \\\".repeat(4);function rn(t,e={}){const{maxRows:r=15,maxColumns:n=10,maxNumSize:o=8,padMinus:i=\\\"auto\\\"}=e;return`${t.constructor.name} {\\\\n${tn}[\\\\n${en}${function(t,e,r,n,o){const{rows:i,columns:a}=t,s=Math.min(i,e),u=Math.min(a,r),h=[];if(\\\"auto\\\"===o){o=!1;t:for(let e=0;e<s;e++)for(let r=0;r<u;r++)if(t.get(e,r)<0){o=!0;break t}}for(let e=0;e<s;e++){let r=[];for(let i=0;i<u;i++)r.push(nn(t.get(e,i),n,o));h.push(`${r.join(\\\" \\\")}`)}return u!==a&&(h[h.length-1]+=` ... ${a-r} more columns`),s!==i&&h.push(`... ${i-e} more rows`),h.join(`\\\\n${en}`)}(t,r,n,o,i)}\\\\n${tn}]\\\\n${tn}rows: ${t.rows}\\\\n${tn}columns: ${t.columns}\\\\n}`}function nn(t,e,r){return(t>=0&&r?` ${on(t,e-1)}`:on(t,e)).padEnd(e)}function on(t,e){let r=t.toString();if(r.length<=e)return r;let n=t.toFixed(e);if(n.length>e&&(n=t.toFixed(Math.max(0,e-(n.length-e)))),n.length<=e&&!n.startsWith(\\\"0.000\\\")&&!n.startsWith(\\\"-0.000\\\"))return n;let o=t.toExponential(e);return o.length>e&&(o=t.toExponential(Math.max(0,e-(o.length-e)))),o.slice(0)}function an(t,e,r){let n=r?t.rows:t.rows-1;if(e<0||e>n)throw new RangeError(\\\"Row index out of range\\\")}function sn(t,e,r){let n=r?t.columns:t.columns-1;if(e<0||e>n)throw new RangeError(\\\"Column index out of range\\\")}function un(t,e){if(e.to1DArray&&(e=e.to1DArray()),e.length!==t.columns)throw new RangeError(\\\"vector size must be the same as the number of columns\\\");return e}function hn(t,e){if(e.to1DArray&&(e=e.to1DArray()),e.length!==t.rows)throw new RangeError(\\\"vector size must be the same as the number of rows\\\");return e}function dn(t,e,r,n,o){if(5!==arguments.length)throw new RangeError(\\\"expected 4 arguments\\\");if(cn(\\\"startRow\\\",e),cn(\\\"endRow\\\",r),cn(\\\"startColumn\\\",n),cn(\\\"endColumn\\\",o),e>r||n>o||e<0||e>=t.rows||r<0||r>=t.rows||n<0||n>=t.columns||o<0||o>=t.columns)throw new RangeError(\\\"Submatrix indices are out of range\\\")}function ln(t,e=0){let r=[];for(let n=0;n<t;n++)r.push(e);return r}function cn(t,e){if(\\\"number\\\"!=typeof e)throw new TypeError(`${t} must be a number`)}function fn(t){if(t.isEmpty())throw new Error(\\\"Empty matrix has no elements to index\\\")}class gn{static from1DArray(t,e,r){if(t*e!==r.length)throw new RangeError(\\\"data length does not match given dimensions\\\");let n=new vn(t,e);for(let o=0;o<t;o++)for(let t=0;t<e;t++)n.set(o,t,r[o*e+t]);return n}static rowVector(t){let e=new vn(1,t.length);for(let r=0;r<t.length;r++)e.set(0,r,t[r]);return e}static columnVector(t){let e=new vn(t.length,1);for(let r=0;r<t.length;r++)e.set(r,0,t[r]);return e}static zeros(t,e){return new vn(t,e)}static ones(t,e){return new vn(t,e).fill(1)}static rand(t,e,r={}){if(\\\"object\\\"!=typeof r)throw new TypeError(\\\"options must be an object\\\");const{random:n=Math.random}=r;let o=new vn(t,e);for(let r=0;r<t;r++)for(let t=0;t<e;t++)o.set(r,t,n());return o}static randInt(t,e,r={}){if(\\\"object\\\"!=typeof r)throw new TypeError(\\\"options must be an object\\\");const{min:n=0,max:o=1e3,random:i=Math.random}=r;if(!Number.isInteger(n))throw new TypeError(\\\"min must be an integer\\\");if(!Number.isInteger(o))throw new TypeError(\\\"max must be an integer\\\");if(n>=o)throw new RangeError(\\\"min must be smaller than max\\\");let a=o-n,s=new vn(t,e);for(let r=0;r<t;r++)for(let t=0;t<e;t++){let e=n+Math.round(i()*a);s.set(r,t,e)}return s}static eye(t,e,r){void 0===e&&(e=t),void 0===r&&(r=1);let n=Math.min(t,e),o=this.zeros(t,e);for(let t=0;t<n;t++)o.set(t,t,r);return o}static diag(t,e,r){let n=t.length;void 0===e&&(e=n),void 0===r&&(r=e);let o=Math.min(n,e,r),i=this.zeros(e,r);for(let e=0;e<o;e++)i.set(e,e,t[e]);return i}static min(t,e){t=this.checkMatrix(t),e=this.checkMatrix(e);let r=t.rows,n=t.columns,o=new vn(r,n);for(let i=0;i<r;i++)for(let r=0;r<n;r++)o.set(i,r,Math.min(t.get(i,r),e.get(i,r)));return o}static max(t,e){t=this.checkMatrix(t),e=this.checkMatrix(e);let r=t.rows,n=t.columns,o=new this(r,n);for(let i=0;i<r;i++)for(let r=0;r<n;r++)o.set(i,r,Math.max(t.get(i,r),e.get(i,r)));return o}static checkMatrix(t){return gn.isMatrix(t)?t:new vn(t)}static isMatrix(t){return null!=t&&\\\"Matrix\\\"===t.klass}get size(){return this.rows*this.columns}apply(t){if(\\\"function\\\"!=typeof t)throw new TypeError(\\\"callback must be a function\\\");for(let e=0;e<this.rows;e++)for(let r=0;r<this.columns;r++)t.call(this,e,r);return this}to1DArray(){let t=[];for(let e=0;e<this.rows;e++)for(let r=0;r<this.columns;r++)t.push(this.get(e,r));return t}to2DArray(){let t=[];for(let e=0;e<this.rows;e++){t.push([]);for(let r=0;r<this.columns;r++)t[e].push(this.get(e,r))}return t}toJSON(){return this.to2DArray()}isRowVector(){return 1===this.rows}isColumnVector(){return 1===this.columns}isVector(){return 1===this.rows||1===this.columns}isSquare(){return this.rows===this.columns}isEmpty(){return 0===this.rows||0===this.columns}isSymmetric(){if(this.isSquare()){for(let t=0;t<this.rows;t++)for(let e=0;e<=t;e++)if(this.get(t,e)!==this.get(e,t))return!1;return!0}return!1}isEchelonForm(){let t=0,e=0,r=-1,n=!0,o=!1;for(;t<this.rows&&n;){for(e=0,o=!1;e<this.columns&&!1===o;)0===this.get(t,e)?e++:1===this.get(t,e)&&e>r?(o=!0,r=e):(n=!1,o=!0);t++}return n}isReducedEchelonForm(){let t=0,e=0,r=-1,n=!0,o=!1;for(;t<this.rows&&n;){for(e=0,o=!1;e<this.columns&&!1===o;)0===this.get(t,e)?e++:1===this.get(t,e)&&e>r?(o=!0,r=e):(n=!1,o=!0);for(let r=e+1;r<this.rows;r++)0!==this.get(t,r)&&(n=!1);t++}return n}echelonForm(){let t=this.clone(),e=0,r=0;for(;e<t.rows&&r<t.columns;){let n=e;for(let o=e;o<t.rows;o++)t.get(o,r)>t.get(n,r)&&(n=o);if(0===t.get(n,r))r++;else{t.swapRows(e,n);let o=t.get(e,r);for(let n=r;n<t.columns;n++)t.set(e,n,t.get(e,n)/o);for(let n=e+1;n<t.rows;n++){let o=t.get(n,r)/t.get(e,r);t.set(n,r,0);for(let i=r+1;i<t.columns;i++)t.set(n,i,t.get(n,i)-t.get(e,i)*o)}e++,r++}}return t}reducedEchelonForm(){let t=this.echelonForm(),e=t.columns,r=t.rows,n=r-1;for(;n>=0;)if(0===t.maxRow(n))n--;else{let o=0,i=!1;for(;o<r&&!1===i;)1===t.get(n,o)?i=!0:o++;for(let r=0;r<n;r++){let i=t.get(r,o);for(let a=o;a<e;a++){let e=t.get(r,a)-i*t.get(n,a);t.set(r,a,e)}}n--}return t}set(){throw new Error(\\\"set method is unimplemented\\\")}get(){throw new Error(\\\"get method is unimplemented\\\")}repeat(t={}){if(\\\"object\\\"!=typeof t)throw new TypeError(\\\"options must be an object\\\");const{rows:e=1,columns:r=1}=t;if(!Number.isInteger(e)||e<=0)throw new TypeError(\\\"rows must be a positive integer\\\");if(!Number.isInteger(r)||r<=0)throw new TypeError(\\\"columns must be a positive integer\\\");let n=new vn(this.rows*e,this.columns*r);for(let t=0;t<e;t++)for(let e=0;e<r;e++)n.setSubMatrix(this,this.rows*t,this.columns*e);return n}fill(t){for(let e=0;e<this.rows;e++)for(let r=0;r<this.columns;r++)this.set(e,r,t);return this}neg(){return this.mulS(-1)}getRow(t){an(this,t);let e=[];for(let r=0;r<this.columns;r++)e.push(this.get(t,r));return e}getRowVector(t){return vn.rowVector(this.getRow(t))}setRow(t,e){an(this,t),e=un(this,e);for(let r=0;r<this.columns;r++)this.set(t,r,e[r]);return this}swapRows(t,e){an(this,t),an(this,e);for(let r=0;r<this.columns;r++){let n=this.get(t,r);this.set(t,r,this.get(e,r)),this.set(e,r,n)}return this}getColumn(t){sn(this,t);let e=[];for(let r=0;r<this.rows;r++)e.push(this.get(r,t));return e}getColumnVector(t){return vn.columnVector(this.getColumn(t))}setColumn(t,e){sn(this,t),e=hn(this,e);for(let r=0;r<this.rows;r++)this.set(r,t,e[r]);return this}swapColumns(t,e){sn(this,t),sn(this,e);for(let r=0;r<this.rows;r++){let n=this.get(r,t);this.set(r,t,this.get(r,e)),this.set(r,e,n)}return this}addRowVector(t){t=un(this,t);for(let e=0;e<this.rows;e++)for(let r=0;r<this.columns;r++)this.set(e,r,this.get(e,r)+t[r]);return this}subRowVector(t){t=un(this,t);for(let e=0;e<this.rows;e++)for(let r=0;r<this.columns;r++)this.set(e,r,this.get(e,r)-t[r]);return this}mulRowVector(t){t=un(this,t);for(let e=0;e<this.rows;e++)for(let r=0;r<this.columns;r++)this.set(e,r,this.get(e,r)*t[r]);return this}divRowVector(t){t=un(this,t);for(let e=0;e<this.rows;e++)for(let r=0;r<this.columns;r++)this.set(e,r,this.get(e,r)/t[r]);return this}addColumnVector(t){t=hn(this,t);for(let e=0;e<this.rows;e++)for(let r=0;r<this.columns;r++)this.set(e,r,this.get(e,r)+t[e]);return this}subColumnVector(t){t=hn(this,t);for(let e=0;e<this.rows;e++)for(let r=0;r<this.columns;r++)this.set(e,r,this.get(e,r)-t[e]);return this}mulColumnVector(t){t=hn(this,t);for(let e=0;e<this.rows;e++)for(let r=0;r<this.columns;r++)this.set(e,r,this.get(e,r)*t[e]);return this}divColumnVector(t){t=hn(this,t);for(let e=0;e<this.rows;e++)for(let r=0;r<this.columns;r++)this.set(e,r,this.get(e,r)/t[e]);return this}mulRow(t,e){an(this,t);for(let r=0;r<this.columns;r++)this.set(t,r,this.get(t,r)*e);return this}mulColumn(t,e){sn(this,t);for(let r=0;r<this.rows;r++)this.set(r,t,this.get(r,t)*e);return this}max(t){if(this.isEmpty())return NaN;switch(t){case\\\"row\\\":{const t=new Array(this.rows).fill(Number.NEGATIVE_INFINITY);for(let e=0;e<this.rows;e++)for(let r=0;r<this.columns;r++)this.get(e,r)>t[e]&&(t[e]=this.get(e,r));return t}case\\\"column\\\":{const t=new Array(this.columns).fill(Number.NEGATIVE_INFINITY);for(let e=0;e<this.rows;e++)for(let r=0;r<this.columns;r++)this.get(e,r)>t[r]&&(t[r]=this.get(e,r));return t}case void 0:{let t=this.get(0,0);for(let e=0;e<this.rows;e++)for(let r=0;r<this.columns;r++)this.get(e,r)>t&&(t=this.get(e,r));return t}default:throw new Error(`invalid option: ${t}`)}}maxIndex(){fn(this);let t=this.get(0,0),e=[0,0];for(let r=0;r<this.rows;r++)for(let n=0;n<this.columns;n++)this.get(r,n)>t&&(t=this.get(r,n),e[0]=r,e[1]=n);return e}min(t){if(this.isEmpty())return NaN;switch(t){case\\\"row\\\":{const t=new Array(this.rows).fill(Number.POSITIVE_INFINITY);for(let e=0;e<this.rows;e++)for(let r=0;r<this.columns;r++)this.get(e,r)<t[e]&&(t[e]=this.get(e,r));return t}case\\\"column\\\":{const t=new Array(this.columns).fill(Number.POSITIVE_INFINITY);for(let e=0;e<this.rows;e++)for(let r=0;r<this.columns;r++)this.get(e,r)<t[r]&&(t[r]=this.get(e,r));return t}case void 0:{let t=this.get(0,0);for(let e=0;e<this.rows;e++)for(let r=0;r<this.columns;r++)this.get(e,r)<t&&(t=this.get(e,r));return t}default:throw new Error(`invalid option: ${t}`)}}minIndex(){fn(this);let t=this.get(0,0),e=[0,0];for(let r=0;r<this.rows;r++)for(let n=0;n<this.columns;n++)this.get(r,n)<t&&(t=this.get(r,n),e[0]=r,e[1]=n);return e}maxRow(t){if(an(this,t),this.isEmpty())return NaN;let e=this.get(t,0);for(let r=1;r<this.columns;r++)this.get(t,r)>e&&(e=this.get(t,r));return e}maxRowIndex(t){an(this,t),fn(this);let e=this.get(t,0),r=[t,0];for(let n=1;n<this.columns;n++)this.get(t,n)>e&&(e=this.get(t,n),r[1]=n);return r}minRow(t){if(an(this,t),this.isEmpty())return NaN;let e=this.get(t,0);for(let r=1;r<this.columns;r++)this.get(t,r)<e&&(e=this.get(t,r));return e}minRowIndex(t){an(this,t),fn(this);let e=this.get(t,0),r=[t,0];for(let n=1;n<this.columns;n++)this.get(t,n)<e&&(e=this.get(t,n),r[1]=n);return r}maxColumn(t){if(sn(this,t),this.isEmpty())return NaN;let e=this.get(0,t);for(let r=1;r<this.rows;r++)this.get(r,t)>e&&(e=this.get(r,t));return e}maxColumnIndex(t){sn(this,t),fn(this);let e=this.get(0,t),r=[0,t];for(let n=1;n<this.rows;n++)this.get(n,t)>e&&(e=this.get(n,t),r[0]=n);return r}minColumn(t){if(sn(this,t),this.isEmpty())return NaN;let e=this.get(0,t);for(let r=1;r<this.rows;r++)this.get(r,t)<e&&(e=this.get(r,t));return e}minColumnIndex(t){sn(this,t),fn(this);let e=this.get(0,t),r=[0,t];for(let n=1;n<this.rows;n++)this.get(n,t)<e&&(e=this.get(n,t),r[0]=n);return r}diag(){let t=Math.min(this.rows,this.columns),e=[];for(let r=0;r<t;r++)e.push(this.get(r,r));return e}norm(t=\\\"frobenius\\\"){let e=0;if(\\\"max\\\"===t)return this.max();if(\\\"frobenius\\\"===t){for(let t=0;t<this.rows;t++)for(let r=0;r<this.columns;r++)e+=this.get(t,r)*this.get(t,r);return Math.sqrt(e)}throw new RangeError(`unknown norm type: ${t}`)}cumulativeSum(){let t=0;for(let e=0;e<this.rows;e++)for(let r=0;r<this.columns;r++)t+=this.get(e,r),this.set(e,r,t);return this}dot(t){gn.isMatrix(t)&&(t=t.to1DArray());let e=this.to1DArray();if(e.length!==t.length)throw new RangeError(\\\"vectors do not have the same size\\\");let r=0;for(let n=0;n<e.length;n++)r+=e[n]*t[n];return r}mmul(t){t=vn.checkMatrix(t);let e=this.rows,r=this.columns,n=t.columns,o=new vn(e,n),i=new Float64Array(r);for(let a=0;a<n;a++){for(let e=0;e<r;e++)i[e]=t.get(e,a);for(let t=0;t<e;t++){let e=0;for(let n=0;n<r;n++)e+=this.get(t,n)*i[n];o.set(t,a,e)}}return o}strassen2x2(t){t=vn.checkMatrix(t);let e=new vn(2,2);const r=this.get(0,0),n=t.get(0,0),o=this.get(0,1),i=t.get(0,1),a=this.get(1,0),s=t.get(1,0),u=this.get(1,1),h=t.get(1,1),d=(r+u)*(n+h),l=(a+u)*n,c=r*(i-h),f=u*(s-n),g=(r+o)*h,p=d+f-g+(o-u)*(s+h),v=c+g,y=l+f,m=d-l+c+(a-r)*(n+i);return e.set(0,0,p),e.set(0,1,v),e.set(1,0,y),e.set(1,1,m),e}strassen3x3(t){t=vn.checkMatrix(t);let e=new vn(3,3);const r=this.get(0,0),n=this.get(0,1),o=this.get(0,2),i=this.get(1,0),a=this.get(1,1),s=this.get(1,2),u=this.get(2,0),h=this.get(2,1),d=this.get(2,2),l=t.get(0,0),c=t.get(0,1),f=t.get(0,2),g=t.get(1,0),p=t.get(1,1),v=t.get(1,2),y=t.get(2,0),m=t.get(2,1),w=t.get(2,2),x=(r-i)*(-c+p),E=(-r+i+a)*(l-c+p),N=(i+a)*(-l+c),b=r*l,M=(-r+u+h)*(l-f+v),S=(-r+u)*(f-v),k=(u+h)*(-l+f),A=(-o+h+d)*(p+y-m),_=(o-d)*(p-m),z=o*y,R=(h+d)*(-y+m),I=(-o+a+s)*(v+y-w),D=(o-s)*(v-w),O=(a+s)*(-y+w),P=b+z+n*g,T=(r+n+o-i-a-h-d)*p+E+N+b+A+z+R,C=b+M+k+(r+n+o-a-s-u-h)*v+z+I+O,q=x+a*(-l+c+g-p-v-y+w)+E+b+z+I+D,L=x+E+N+b+s*m,j=z+I+D+O+i*f,F=b+M+S+h*(-l+f+g-p-v-y+m)+A+_+z,V=A+_+z+R+u*c,B=b+M+S+k+d*w;return e.set(0,0,P),e.set(0,1,T),e.set(0,2,C),e.set(1,0,q),e.set(1,1,L),e.set(1,2,j),e.set(2,0,F),e.set(2,1,V),e.set(2,2,B),e}mmulStrassen(t){t=vn.checkMatrix(t);let e=this.clone(),r=e.rows,n=e.columns,o=t.rows,i=t.columns;function a(t,e,r){let n=t.rows,o=t.columns;if(n===e&&o===r)return t;{let n=gn.zeros(e,r);return n=n.setSubMatrix(t,0,0),n}}n!==o&&console.warn(`Multiplying ${r} x ${n} and ${o} x ${i} matrix: dimensions do not match.`);let s=Math.max(r,o),u=Math.max(n,i);return e=a(e,s,u),function t(e,r,n,o){if(n<=512||o<=512)return e.mmul(r);n%2==1&&o%2==1?(e=a(e,n+1,o+1),r=a(r,n+1,o+1)):n%2==1?(e=a(e,n+1,o),r=a(r,n+1,o)):o%2==1&&(e=a(e,n,o+1),r=a(r,n,o+1));let i=parseInt(e.rows/2,10),s=parseInt(e.columns/2,10),u=e.subMatrix(0,i-1,0,s-1),h=r.subMatrix(0,i-1,0,s-1),d=e.subMatrix(0,i-1,s,e.columns-1),l=r.subMatrix(0,i-1,s,r.columns-1),c=e.subMatrix(i,e.rows-1,0,s-1),f=r.subMatrix(i,r.rows-1,0,s-1),g=e.subMatrix(i,e.rows-1,s,e.columns-1),p=r.subMatrix(i,r.rows-1,s,r.columns-1),v=t(gn.add(u,g),gn.add(h,p),i,s),y=t(gn.add(c,g),h,i,s),m=t(u,gn.sub(l,p),i,s),w=t(g,gn.sub(f,h),i,s),x=t(gn.add(u,d),p,i,s),E=t(gn.sub(c,u),gn.add(h,l),i,s),N=t(gn.sub(d,g),gn.add(f,p),i,s),b=gn.add(v,w);b.sub(x),b.add(N);let M=gn.add(m,x),S=gn.add(y,w),k=gn.sub(v,y);k.add(m),k.add(E);let A=gn.zeros(2*b.rows,2*b.columns);return A=A.setSubMatrix(b,0,0),A=A.setSubMatrix(M,b.rows,0),A=A.setSubMatrix(S,0,b.columns),A=A.setSubMatrix(k,b.rows,b.columns),A.subMatrix(0,n-1,0,o-1)}(e,t=a(t,s,u),s,u)}scaleRows(t={}){if(\\\"object\\\"!=typeof t)throw new TypeError(\\\"options must be an object\\\");const{min:e=0,max:r=1}=t;if(!Number.isFinite(e))throw new TypeError(\\\"min must be a number\\\");if(!Number.isFinite(r))throw new TypeError(\\\"max must be a number\\\");if(e>=r)throw new RangeError(\\\"min must be smaller than max\\\");let n=new vn(this.rows,this.columns);for(let t=0;t<this.rows;t++){const o=this.getRow(t);o.length>0&&Zr(o,{min:e,max:r,output:o}),n.setRow(t,o)}return n}scaleColumns(t={}){if(\\\"object\\\"!=typeof t)throw new TypeError(\\\"options must be an object\\\");const{min:e=0,max:r=1}=t;if(!Number.isFinite(e))throw new TypeError(\\\"min must be a number\\\");if(!Number.isFinite(r))throw new TypeError(\\\"max must be a number\\\");if(e>=r)throw new RangeError(\\\"min must be smaller than max\\\");let n=new vn(this.rows,this.columns);for(let t=0;t<this.columns;t++){const o=this.getColumn(t);o.length&&Zr(o,{min:e,max:r,output:o}),n.setColumn(t,o)}return n}flipRows(){const t=Math.ceil(this.columns/2);for(let e=0;e<this.rows;e++)for(let r=0;r<t;r++){let t=this.get(e,r),n=this.get(e,this.columns-1-r);this.set(e,r,n),this.set(e,this.columns-1-r,t)}return this}flipColumns(){const t=Math.ceil(this.rows/2);for(let e=0;e<this.columns;e++)for(let r=0;r<t;r++){let t=this.get(r,e),n=this.get(this.rows-1-r,e);this.set(r,e,n),this.set(this.rows-1-r,e,t)}return this}kroneckerProduct(t){t=vn.checkMatrix(t);let e=this.rows,r=this.columns,n=t.rows,o=t.columns,i=new vn(e*n,r*o);for(let a=0;a<e;a++)for(let e=0;e<r;e++)for(let r=0;r<n;r++)for(let s=0;s<o;s++)i.set(n*a+r,o*e+s,this.get(a,e)*t.get(r,s));return i}kroneckerSum(t){if(t=vn.checkMatrix(t),!this.isSquare()||!t.isSquare())throw new Error(\\\"Kronecker Sum needs two Square Matrices\\\");let e=this.rows,r=t.rows,n=this.kroneckerProduct(vn.eye(r,r)),o=vn.eye(e,e).kroneckerProduct(t);return n.add(o)}transpose(){let t=new vn(this.columns,this.rows);for(let e=0;e<this.rows;e++)for(let r=0;r<this.columns;r++)t.set(r,e,this.get(e,r));return t}sortRows(t=pn){for(let e=0;e<this.rows;e++)this.setRow(e,this.getRow(e).sort(t));return this}sortColumns(t=pn){for(let e=0;e<this.columns;e++)this.setColumn(e,this.getColumn(e).sort(t));return this}subMatrix(t,e,r,n){dn(this,t,e,r,n);let o=new vn(e-t+1,n-r+1);for(let i=t;i<=e;i++)for(let e=r;e<=n;e++)o.set(i-t,e-r,this.get(i,e));return o}subMatrixRow(t,e,r){if(void 0===e&&(e=0),void 0===r&&(r=this.columns-1),e>r||e<0||e>=this.columns||r<0||r>=this.columns)throw new RangeError(\\\"Argument out of range\\\");let n=new vn(t.length,r-e+1);for(let o=0;o<t.length;o++)for(let i=e;i<=r;i++){if(t[o]<0||t[o]>=this.rows)throw new RangeError(`Row index out of range: ${t[o]}`);n.set(o,i-e,this.get(t[o],i))}return n}subMatrixColumn(t,e,r){if(void 0===e&&(e=0),void 0===r&&(r=this.rows-1),e>r||e<0||e>=this.rows||r<0||r>=this.rows)throw new RangeError(\\\"Argument out of range\\\");let n=new vn(r-e+1,t.length);for(let o=0;o<t.length;o++)for(let i=e;i<=r;i++){if(t[o]<0||t[o]>=this.columns)throw new RangeError(`Column index out of range: ${t[o]}`);n.set(i-e,o,this.get(i,t[o]))}return n}setSubMatrix(t,e,r){if((t=vn.checkMatrix(t)).isEmpty())return this;dn(this,e,e+t.rows-1,r,r+t.columns-1);for(let n=0;n<t.rows;n++)for(let o=0;o<t.columns;o++)this.set(e+n,r+o,t.get(n,o));return this}selection(t,e){!function(t,e){if(!Qr(e))throw new TypeError(\\\"row indices must be an array\\\");for(let r=0;r<e.length;r++)if(e[r]<0||e[r]>=t.rows)throw new RangeError(\\\"row indices are out of range\\\")}(this,t),function(t,e){if(!Qr(e))throw new TypeError(\\\"column indices must be an array\\\");for(let r=0;r<e.length;r++)if(e[r]<0||e[r]>=t.columns)throw new RangeError(\\\"column indices are out of range\\\")}(this,e);let r=new vn(t.length,e.length);for(let n=0;n<t.length;n++){let o=t[n];for(let t=0;t<e.length;t++){let i=e[t];r.set(n,t,this.get(o,i))}}return r}trace(){let t=Math.min(this.rows,this.columns),e=0;for(let r=0;r<t;r++)e+=this.get(r,r);return e}clone(){let t=new vn(this.rows,this.columns);for(let e=0;e<this.rows;e++)for(let r=0;r<this.columns;r++)t.set(e,r,this.get(e,r));return t}sum(t){switch(t){case\\\"row\\\":return function(t){let e=ln(t.rows);for(let r=0;r<t.rows;++r)for(let n=0;n<t.columns;++n)e[r]+=t.get(r,n);return e}(this);case\\\"column\\\":return function(t){let e=ln(t.columns);for(let r=0;r<t.rows;++r)for(let n=0;n<t.columns;++n)e[n]+=t.get(r,n);return e}(this);case void 0:return function(t){let e=0;for(let r=0;r<t.rows;r++)for(let n=0;n<t.columns;n++)e+=t.get(r,n);return e}(this);default:throw new Error(`invalid option: ${t}`)}}product(t){switch(t){case\\\"row\\\":return function(t){let e=ln(t.rows,1);for(let r=0;r<t.rows;++r)for(let n=0;n<t.columns;++n)e[r]*=t.get(r,n);return e}(this);case\\\"column\\\":return function(t){let e=ln(t.columns,1);for(let r=0;r<t.rows;++r)for(let n=0;n<t.columns;++n)e[n]*=t.get(r,n);return e}(this);case void 0:return function(t){let e=1;for(let r=0;r<t.rows;r++)for(let n=0;n<t.columns;n++)e*=t.get(r,n);return e}(this);default:throw new Error(`invalid option: ${t}`)}}mean(t){const e=this.sum(t);switch(t){case\\\"row\\\":for(let t=0;t<this.rows;t++)e[t]/=this.columns;return e;case\\\"column\\\":for(let t=0;t<this.columns;t++)e[t]/=this.rows;return e;case void 0:return e/this.size;default:throw new Error(`invalid option: ${t}`)}}variance(t,e={}){if(\\\"object\\\"==typeof t&&(e=t,t=void 0),\\\"object\\\"!=typeof e)throw new TypeError(\\\"options must be an object\\\");const{unbiased:r=!0,mean:n=this.mean(t)}=e;if(\\\"boolean\\\"!=typeof r)throw new TypeError(\\\"unbiased must be a boolean\\\");switch(t){case\\\"row\\\":if(!Qr(n))throw new TypeError(\\\"mean must be an array\\\");return function(t,e,r){const n=t.rows,o=t.columns,i=[];for(let a=0;a<n;a++){let n=0,s=0,u=0;for(let e=0;e<o;e++)u=t.get(a,e)-r[a],n+=u,s+=u*u;e?i.push((s-n*n/o)/(o-1)):i.push((s-n*n/o)/o)}return i}(this,r,n);case\\\"column\\\":if(!Qr(n))throw new TypeError(\\\"mean must be an array\\\");return function(t,e,r){const n=t.rows,o=t.columns,i=[];for(let a=0;a<o;a++){let o=0,s=0,u=0;for(let e=0;e<n;e++)u=t.get(e,a)-r[a],o+=u,s+=u*u;e?i.push((s-o*o/n)/(n-1)):i.push((s-o*o/n)/n)}return i}(this,r,n);case void 0:if(\\\"number\\\"!=typeof n)throw new TypeError(\\\"mean must be a number\\\");return function(t,e,r){const n=t.rows,o=t.columns,i=n*o;let a=0,s=0,u=0;for(let e=0;e<n;e++)for(let n=0;n<o;n++)u=t.get(e,n)-r,a+=u,s+=u*u;return e?(s-a*a/i)/(i-1):(s-a*a/i)/i}(this,r,n);default:throw new Error(`invalid option: ${t}`)}}standardDeviation(t,e){\\\"object\\\"==typeof t&&(e=t,t=void 0);const r=this.variance(t,e);if(void 0===t)return Math.sqrt(r);for(let t=0;t<r.length;t++)r[t]=Math.sqrt(r[t]);return r}center(t,e={}){if(\\\"object\\\"==typeof t&&(e=t,t=void 0),\\\"object\\\"!=typeof e)throw new TypeError(\\\"options must be an object\\\");const{center:r=this.mean(t)}=e;switch(t){case\\\"row\\\":if(!Qr(r))throw new TypeError(\\\"center must be an array\\\");return function(t,e){for(let r=0;r<t.rows;r++)for(let n=0;n<t.columns;n++)t.set(r,n,t.get(r,n)-e[r])}(this,r),this;case\\\"column\\\":if(!Qr(r))throw new TypeError(\\\"center must be an array\\\");return function(t,e){for(let r=0;r<t.rows;r++)for(let n=0;n<t.columns;n++)t.set(r,n,t.get(r,n)-e[n])}(this,r),this;case void 0:if(\\\"number\\\"!=typeof r)throw new TypeError(\\\"center must be a number\\\");return function(t,e){for(let r=0;r<t.rows;r++)for(let n=0;n<t.columns;n++)t.set(r,n,t.get(r,n)-e)}(this,r),this;default:throw new Error(`invalid option: ${t}`)}}scale(t,e={}){if(\\\"object\\\"==typeof t&&(e=t,t=void 0),\\\"object\\\"!=typeof e)throw new TypeError(\\\"options must be an object\\\");let r=e.scale;switch(t){case\\\"row\\\":if(void 0===r)r=function(t){const e=[];for(let r=0;r<t.rows;r++){let n=0;for(let e=0;e<t.columns;e++)n+=Math.pow(t.get(r,e),2)/(t.columns-1);e.push(Math.sqrt(n))}return e}(this);else if(!Qr(r))throw new TypeError(\\\"scale must be an array\\\");return function(t,e){for(let r=0;r<t.rows;r++)for(let n=0;n<t.columns;n++)t.set(r,n,t.get(r,n)/e[r])}(this,r),this;case\\\"column\\\":if(void 0===r)r=function(t){const e=[];for(let r=0;r<t.columns;r++){let n=0;for(let e=0;e<t.rows;e++)n+=Math.pow(t.get(e,r),2)/(t.rows-1);e.push(Math.sqrt(n))}return e}(this);else if(!Qr(r))throw new TypeError(\\\"scale must be an array\\\");return function(t,e){for(let r=0;r<t.rows;r++)for(let n=0;n<t.columns;n++)t.set(r,n,t.get(r,n)/e[n])}(this,r),this;case void 0:if(void 0===r)r=function(t){const e=t.size-1;let r=0;for(let n=0;n<t.columns;n++)for(let o=0;o<t.rows;o++)r+=Math.pow(t.get(o,n),2)/e;return Math.sqrt(r)}(this);else if(\\\"number\\\"!=typeof r)throw new TypeError(\\\"scale must be a number\\\");return function(t,e){for(let r=0;r<t.rows;r++)for(let n=0;n<t.columns;n++)t.set(r,n,t.get(r,n)/e)}(this,r),this;default:throw new Error(`invalid option: ${t}`)}}toString(t){return rn(this,t)}}function pn(t,e){return t-e}gn.prototype.klass=\\\"Matrix\\\",\\\"undefined\\\"!=typeof Symbol&&(gn.prototype[Symbol.for(\\\"nodejs.util.inspect.custom\\\")]=function(){return rn(this)}),gn.random=gn.rand,gn.randomInt=gn.randInt,gn.diagonal=gn.diag,gn.prototype.diagonal=gn.prototype.diag,gn.identity=gn.eye,gn.prototype.negate=gn.prototype.neg,gn.prototype.tensorProduct=gn.prototype.kroneckerProduct;class vn extends gn{constructor(t,e){if(super(),vn.isMatrix(t))return t.clone();if(Number.isInteger(t)&&t>=0){if(this.data=[],!(Number.isInteger(e)&&e>=0))throw new TypeError(\\\"nColumns must be a positive integer\\\");for(let r=0;r<t;r++)this.data.push(new Float64Array(e))}else{if(!Qr(t))throw new TypeError(\\\"First argument must be a positive number or an array\\\");{const r=t;if(\\\"number\\\"!=typeof(e=(t=r.length)?r[0].length:0))throw new TypeError(\\\"Data must be a 2D array with at least one element\\\");this.data=[];for(let n=0;n<t;n++){if(r[n].length!==e)throw new RangeError(\\\"Inconsistent array dimensions\\\");if(!r[n].every((t=>\\\"number\\\"==typeof t)))throw new TypeError(\\\"Input data contains non-numeric values\\\");this.data.push(Float64Array.from(r[n]))}}}this.rows=t,this.columns=e}set(t,e,r){return this.data[t][e]=r,this}get(t,e){return this.data[t][e]}removeRow(t){return an(this,t),this.data.splice(t,1),this.rows-=1,this}addRow(t,e){return void 0===e&&(e=t,t=this.rows),an(this,t,!0),e=Float64Array.from(un(this,e)),this.data.splice(t,0,e),this.rows+=1,this}removeColumn(t){sn(this,t);for(let e=0;e<this.rows;e++){const r=new Float64Array(this.columns-1);for(let n=0;n<t;n++)r[n]=this.data[e][n];for(let n=t+1;n<this.columns;n++)r[n-1]=this.data[e][n];this.data[e]=r}return this.columns-=1,this}addColumn(t,e){void 0===e&&(e=t,t=this.columns),sn(this,t,!0),e=hn(this,e);for(let r=0;r<this.rows;r++){const n=new Float64Array(this.columns+1);let o=0;for(;o<t;o++)n[o]=this.data[r][o];for(n[o++]=e[r];o<this.columns+1;o++)n[o]=this.data[r][o-1];this.data[r]=n}return this.columns+=1,this}}!function(t,e){t.prototype.add=function(t){return\\\"number\\\"==typeof t?this.addS(t):this.addM(t)},t.prototype.addS=function(t){for(let e=0;e<this.rows;e++)for(let r=0;r<this.columns;r++)this.set(e,r,this.get(e,r)+t);return this},t.prototype.addM=function(t){if(t=e.checkMatrix(t),this.rows!==t.rows||this.columns!==t.columns)throw new RangeError(\\\"Matrices dimensions must be equal\\\");for(let e=0;e<this.rows;e++)for(let r=0;r<this.columns;r++)this.set(e,r,this.get(e,r)+t.get(e,r));return this},t.add=function(t,r){return new e(t).add(r)},t.prototype.sub=function(t){return\\\"number\\\"==typeof t?this.subS(t):this.subM(t)},t.prototype.subS=function(t){for(let e=0;e<this.rows;e++)for(let r=0;r<this.columns;r++)this.set(e,r,this.get(e,r)-t);return this},t.prototype.subM=function(t){if(t=e.checkMatrix(t),this.rows!==t.rows||this.columns!==t.columns)throw new RangeError(\\\"Matrices dimensions must be equal\\\");for(let e=0;e<this.rows;e++)for(let r=0;r<this.columns;r++)this.set(e,r,this.get(e,r)-t.get(e,r));return this},t.sub=function(t,r){return new e(t).sub(r)},t.prototype.subtract=t.prototype.sub,t.prototype.subtractS=t.prototype.subS,t.prototype.subtractM=t.prototype.subM,t.subtract=t.sub,t.prototype.mul=function(t){return\\\"number\\\"==typeof t?this.mulS(t):this.mulM(t)},t.prototype.mulS=function(t){for(let e=0;e<this.rows;e++)for(let r=0;r<this.columns;r++)this.set(e,r,this.get(e,r)*t);return this},t.prototype.mulM=function(t){if(t=e.checkMatrix(t),this.rows!==t.rows||this.columns!==t.columns)throw new RangeError(\\\"Matrices dimensions must be equal\\\");for(let e=0;e<this.rows;e++)for(let r=0;r<this.columns;r++)this.set(e,r,this.get(e,r)*t.get(e,r));return this},t.mul=function(t,r){return new e(t).mul(r)},t.prototype.multiply=t.prototype.mul,t.prototype.multiplyS=t.prototype.mulS,t.prototype.multiplyM=t.prototype.mulM,t.multiply=t.mul,t.prototype.div=function(t){return\\\"number\\\"==typeof t?this.divS(t):this.divM(t)},t.prototype.divS=function(t){for(let e=0;e<this.rows;e++)for(let r=0;r<this.columns;r++)this.set(e,r,this.get(e,r)/t);return this},t.prototype.divM=function(t){if(t=e.checkMatrix(t),this.rows!==t.rows||this.columns!==t.columns)throw new RangeError(\\\"Matrices dimensions must be equal\\\");for(let e=0;e<this.rows;e++)for(let r=0;r<this.columns;r++)this.set(e,r,this.get(e,r)/t.get(e,r));return this},t.div=function(t,r){return new e(t).div(r)},t.prototype.divide=t.prototype.div,t.prototype.divideS=t.prototype.divS,t.prototype.divideM=t.prototype.divM,t.divide=t.div,t.prototype.mod=function(t){return\\\"number\\\"==typeof t?this.modS(t):this.modM(t)},t.prototype.modS=function(t){for(let e=0;e<this.rows;e++)for(let r=0;r<this.columns;r++)this.set(e,r,this.get(e,r)%t);return this},t.prototype.modM=function(t){if(t=e.checkMatrix(t),this.rows!==t.rows||this.columns!==t.columns)throw new RangeError(\\\"Matrices dimensions must be equal\\\");for(let e=0;e<this.rows;e++)for(let r=0;r<this.columns;r++)this.set(e,r,this.get(e,r)%t.get(e,r));return this},t.mod=function(t,r){return new e(t).mod(r)},t.prototype.modulus=t.prototype.mod,t.prototype.modulusS=t.prototype.modS,t.prototype.modulusM=t.prototype.modM,t.modulus=t.mod,t.prototype.and=function(t){return\\\"number\\\"==typeof t?this.andS(t):this.andM(t)},t.prototype.andS=function(t){for(let e=0;e<this.rows;e++)for(let r=0;r<this.columns;r++)this.set(e,r,this.get(e,r)&t);return this},t.prototype.andM=function(t){if(t=e.checkMatrix(t),this.rows!==t.rows||this.columns!==t.columns)throw new RangeError(\\\"Matrices dimensions must be equal\\\");for(let e=0;e<this.rows;e++)for(let r=0;r<this.columns;r++)this.set(e,r,this.get(e,r)&t.get(e,r));return this},t.and=function(t,r){return new e(t).and(r)},t.prototype.or=function(t){return\\\"number\\\"==typeof t?this.orS(t):this.orM(t)},t.prototype.orS=function(t){for(let e=0;e<this.rows;e++)for(let r=0;r<this.columns;r++)this.set(e,r,this.get(e,r)|t);return this},t.prototype.orM=function(t){if(t=e.checkMatrix(t),this.rows!==t.rows||this.columns!==t.columns)throw new RangeError(\\\"Matrices dimensions must be equal\\\");for(let e=0;e<this.rows;e++)for(let r=0;r<this.columns;r++)this.set(e,r,this.get(e,r)|t.get(e,r));return this},t.or=function(t,r){return new e(t).or(r)},t.prototype.xor=function(t){return\\\"number\\\"==typeof t?this.xorS(t):this.xorM(t)},t.prototype.xorS=function(t){for(let e=0;e<this.rows;e++)for(let r=0;r<this.columns;r++)this.set(e,r,this.get(e,r)^t);return this},t.prototype.xorM=function(t){if(t=e.checkMatrix(t),this.rows!==t.rows||this.columns!==t.columns)throw new RangeError(\\\"Matrices dimensions must be equal\\\");for(let e=0;e<this.rows;e++)for(let r=0;r<this.columns;r++)this.set(e,r,this.get(e,r)^t.get(e,r));return this},t.xor=function(t,r){return new e(t).xor(r)},t.prototype.leftShift=function(t){return\\\"number\\\"==typeof t?this.leftShiftS(t):this.leftShiftM(t)},t.prototype.leftShiftS=function(t){for(let e=0;e<this.rows;e++)for(let r=0;r<this.columns;r++)this.set(e,r,this.get(e,r)<<t);return this},t.prototype.leftShiftM=function(t){if(t=e.checkMatrix(t),this.rows!==t.rows||this.columns!==t.columns)throw new RangeError(\\\"Matrices dimensions must be equal\\\");for(let e=0;e<this.rows;e++)for(let r=0;r<this.columns;r++)this.set(e,r,this.get(e,r)<<t.get(e,r));return this},t.leftShift=function(t,r){return new e(t).leftShift(r)},t.prototype.signPropagatingRightShift=function(t){return\\\"number\\\"==typeof t?this.signPropagatingRightShiftS(t):this.signPropagatingRightShiftM(t)},t.prototype.signPropagatingRightShiftS=function(t){for(let e=0;e<this.rows;e++)for(let r=0;r<this.columns;r++)this.set(e,r,this.get(e,r)>>t);return this},t.prototype.signPropagatingRightShiftM=function(t){if(t=e.checkMatrix(t),this.rows!==t.rows||this.columns!==t.columns)throw new RangeError(\\\"Matrices dimensions must be equal\\\");for(let e=0;e<this.rows;e++)for(let r=0;r<this.columns;r++)this.set(e,r,this.get(e,r)>>t.get(e,r));return this},t.signPropagatingRightShift=function(t,r){return new e(t).signPropagatingRightShift(r)},t.prototype.rightShift=function(t){return\\\"number\\\"==typeof t?this.rightShiftS(t):this.rightShiftM(t)},t.prototype.rightShiftS=function(t){for(let e=0;e<this.rows;e++)for(let r=0;r<this.columns;r++)this.set(e,r,this.get(e,r)>>>t);return this},t.prototype.rightShiftM=function(t){if(t=e.checkMatrix(t),this.rows!==t.rows||this.columns!==t.columns)throw new RangeError(\\\"Matrices dimensions must be equal\\\");for(let e=0;e<this.rows;e++)for(let r=0;r<this.columns;r++)this.set(e,r,this.get(e,r)>>>t.get(e,r));return this},t.rightShift=function(t,r){return new e(t).rightShift(r)},t.prototype.zeroFillRightShift=t.prototype.rightShift,t.prototype.zeroFillRightShiftS=t.prototype.rightShiftS,t.prototype.zeroFillRightShiftM=t.prototype.rightShiftM,t.zeroFillRightShift=t.rightShift,t.prototype.not=function(){for(let t=0;t<this.rows;t++)for(let e=0;e<this.columns;e++)this.set(t,e,~this.get(t,e));return this},t.not=function(t){return new e(t).not()},t.prototype.abs=function(){for(let t=0;t<this.rows;t++)for(let e=0;e<this.columns;e++)this.set(t,e,Math.abs(this.get(t,e)));return this},t.abs=function(t){return new e(t).abs()},t.prototype.acos=function(){for(let t=0;t<this.rows;t++)for(let e=0;e<this.columns;e++)this.set(t,e,Math.acos(this.get(t,e)));return this},t.acos=function(t){return new e(t).acos()},t.prototype.acosh=function(){for(let t=0;t<this.rows;t++)for(let e=0;e<this.columns;e++)this.set(t,e,Math.acosh(this.get(t,e)));return this},t.acosh=function(t){return new e(t).acosh()},t.prototype.asin=function(){for(let t=0;t<this.rows;t++)for(let e=0;e<this.columns;e++)this.set(t,e,Math.asin(this.get(t,e)));return this},t.asin=function(t){return new e(t).asin()},t.prototype.asinh=function(){for(let t=0;t<this.rows;t++)for(let e=0;e<this.columns;e++)this.set(t,e,Math.asinh(this.get(t,e)));return this},t.asinh=function(t){return new e(t).asinh()},t.prototype.atan=function(){for(let t=0;t<this.rows;t++)for(let e=0;e<this.columns;e++)this.set(t,e,Math.atan(this.get(t,e)));return this},t.atan=function(t){return new e(t).atan()},t.prototype.atanh=function(){for(let t=0;t<this.rows;t++)for(let e=0;e<this.columns;e++)this.set(t,e,Math.atanh(this.get(t,e)));return this},t.atanh=function(t){return new e(t).atanh()},t.prototype.cbrt=function(){for(let t=0;t<this.rows;t++)for(let e=0;e<this.columns;e++)this.set(t,e,Math.cbrt(this.get(t,e)));return this},t.cbrt=function(t){return new e(t).cbrt()},t.prototype.ceil=function(){for(let t=0;t<this.rows;t++)for(let e=0;e<this.columns;e++)this.set(t,e,Math.ceil(this.get(t,e)));return this},t.ceil=function(t){return new e(t).ceil()},t.prototype.clz32=function(){for(let t=0;t<this.rows;t++)for(let e=0;e<this.columns;e++)this.set(t,e,Math.clz32(this.get(t,e)));return this},t.clz32=function(t){return new e(t).clz32()},t.prototype.cos=function(){for(let t=0;t<this.rows;t++)for(let e=0;e<this.columns;e++)this.set(t,e,Math.cos(this.get(t,e)));return this},t.cos=function(t){return new e(t).cos()},t.prototype.cosh=function(){for(let t=0;t<this.rows;t++)for(let e=0;e<this.columns;e++)this.set(t,e,Math.cosh(this.get(t,e)));return this},t.cosh=function(t){return new e(t).cosh()},t.prototype.exp=function(){for(let t=0;t<this.rows;t++)for(let e=0;e<this.columns;e++)this.set(t,e,Math.exp(this.get(t,e)));return this},t.exp=function(t){return new e(t).exp()},t.prototype.expm1=function(){for(let t=0;t<this.rows;t++)for(let e=0;e<this.columns;e++)this.set(t,e,Math.expm1(this.get(t,e)));return this},t.expm1=function(t){return new e(t).expm1()},t.prototype.floor=function(){for(let t=0;t<this.rows;t++)for(let e=0;e<this.columns;e++)this.set(t,e,Math.floor(this.get(t,e)));return this},t.floor=function(t){return new e(t).floor()},t.prototype.fround=function(){for(let t=0;t<this.rows;t++)for(let e=0;e<this.columns;e++)this.set(t,e,Math.fround(this.get(t,e)));return this},t.fround=function(t){return new e(t).fround()},t.prototype.log=function(){for(let t=0;t<this.rows;t++)for(let e=0;e<this.columns;e++)this.set(t,e,Math.log(this.get(t,e)));return this},t.log=function(t){return new e(t).log()},t.prototype.log1p=function(){for(let t=0;t<this.rows;t++)for(let e=0;e<this.columns;e++)this.set(t,e,Math.log1p(this.get(t,e)));return this},t.log1p=function(t){return new e(t).log1p()},t.prototype.log10=function(){for(let t=0;t<this.rows;t++)for(let e=0;e<this.columns;e++)this.set(t,e,Math.log10(this.get(t,e)));return this},t.log10=function(t){return new e(t).log10()},t.prototype.log2=function(){for(let t=0;t<this.rows;t++)for(let e=0;e<this.columns;e++)this.set(t,e,Math.log2(this.get(t,e)));return this},t.log2=function(t){return new e(t).log2()},t.prototype.round=function(){for(let t=0;t<this.rows;t++)for(let e=0;e<this.columns;e++)this.set(t,e,Math.round(this.get(t,e)));return this},t.round=function(t){return new e(t).round()},t.prototype.sign=function(){for(let t=0;t<this.rows;t++)for(let e=0;e<this.columns;e++)this.set(t,e,Math.sign(this.get(t,e)));return this},t.sign=function(t){return new e(t).sign()},t.prototype.sin=function(){for(let t=0;t<this.rows;t++)for(let e=0;e<this.columns;e++)this.set(t,e,Math.sin(this.get(t,e)));return this},t.sin=function(t){return new e(t).sin()},t.prototype.sinh=function(){for(let t=0;t<this.rows;t++)for(let e=0;e<this.columns;e++)this.set(t,e,Math.sinh(this.get(t,e)));return this},t.sinh=function(t){return new e(t).sinh()},t.prototype.sqrt=function(){for(let t=0;t<this.rows;t++)for(let e=0;e<this.columns;e++)this.set(t,e,Math.sqrt(this.get(t,e)));return this},t.sqrt=function(t){return new e(t).sqrt()},t.prototype.tan=function(){for(let t=0;t<this.rows;t++)for(let e=0;e<this.columns;e++)this.set(t,e,Math.tan(this.get(t,e)));return this},t.tan=function(t){return new e(t).tan()},t.prototype.tanh=function(){for(let t=0;t<this.rows;t++)for(let e=0;e<this.columns;e++)this.set(t,e,Math.tanh(this.get(t,e)));return this},t.tanh=function(t){return new e(t).tanh()},t.prototype.trunc=function(){for(let t=0;t<this.rows;t++)for(let e=0;e<this.columns;e++)this.set(t,e,Math.trunc(this.get(t,e)));return this},t.trunc=function(t){return new e(t).trunc()},t.pow=function(t,r){return new e(t).pow(r)},t.prototype.pow=function(t){return\\\"number\\\"==typeof t?this.powS(t):this.powM(t)},t.prototype.powS=function(t){for(let e=0;e<this.rows;e++)for(let r=0;r<this.columns;r++)this.set(e,r,Math.pow(this.get(e,r),t));return this},t.prototype.powM=function(t){if(t=e.checkMatrix(t),this.rows!==t.rows||this.columns!==t.columns)throw new RangeError(\\\"Matrices dimensions must be equal\\\");for(let e=0;e<this.rows;e++)for(let r=0;r<this.columns;r++)this.set(e,r,Math.pow(this.get(e,r),t.get(e,r)));return this}}(gn,vn);class yn extends gn{constructor(t){super(),this.data=t,this.rows=t.length,this.columns=t[0].length}set(t,e,r){return this.data[t][e]=r,this}get(t,e){return this.data[t][e]}}function mn(t,e){let r=0;return Math.abs(t)>Math.abs(e)?(r=e/t,Math.abs(t)*Math.sqrt(1+r*r)):0!==e?(r=t/e,Math.abs(e)*Math.sqrt(1+r*r)):0}class wn{constructor(t,e={}){if((t=yn.checkMatrix(t)).isEmpty())throw new Error(\\\"Matrix must be non-empty\\\");let r=t.rows,n=t.columns;const{computeLeftSingularVectors:o=!0,computeRightSingularVectors:i=!0,autoTranspose:a=!1}=e;let s,u=Boolean(o),h=Boolean(i),d=!1;if(r<n)if(a){s=t.transpose(),r=s.rows,n=s.columns,d=!0;let e=u;u=h,h=e}else s=t.clone(),console.warn(\\\"Computing SVD on a matrix with more columns than rows. Consider enabling autoTranspose\\\");else s=t.clone();let l=Math.min(r,n),c=Math.min(r+1,n),f=new Float64Array(c),g=new vn(r,l),p=new vn(n,n),v=new Float64Array(n),y=new Float64Array(r),m=new Float64Array(c);for(let t=0;t<c;t++)m[t]=t;let w=Math.min(r-1,n),x=Math.max(0,Math.min(n-2,r)),E=Math.max(w,x);for(let t=0;t<E;t++){if(t<w){f[t]=0;for(let e=t;e<r;e++)f[t]=mn(f[t],s.get(e,t));if(0!==f[t]){s.get(t,t)<0&&(f[t]=-f[t]);for(let e=t;e<r;e++)s.set(e,t,s.get(e,t)/f[t]);s.set(t,t,s.get(t,t)+1)}f[t]=-f[t]}for(let e=t+1;e<n;e++){if(t<w&&0!==f[t]){let n=0;for(let o=t;o<r;o++)n+=s.get(o,t)*s.get(o,e);n=-n/s.get(t,t);for(let o=t;o<r;o++)s.set(o,e,s.get(o,e)+n*s.get(o,t))}v[e]=s.get(t,e)}if(u&&t<w)for(let e=t;e<r;e++)g.set(e,t,s.get(e,t));if(t<x){v[t]=0;for(let e=t+1;e<n;e++)v[t]=mn(v[t],v[e]);if(0!==v[t]){v[t+1]<0&&(v[t]=0-v[t]);for(let e=t+1;e<n;e++)v[e]/=v[t];v[t+1]+=1}if(v[t]=-v[t],t+1<r&&0!==v[t]){for(let e=t+1;e<r;e++)y[e]=0;for(let e=t+1;e<r;e++)for(let r=t+1;r<n;r++)y[e]+=v[r]*s.get(e,r);for(let e=t+1;e<n;e++){let n=-v[e]/v[t+1];for(let o=t+1;o<r;o++)s.set(o,e,s.get(o,e)+n*y[o])}}if(h)for(let e=t+1;e<n;e++)p.set(e,t,v[e])}}let N=Math.min(n,r+1);if(w<n&&(f[w]=s.get(w,w)),r<N&&(f[N-1]=0),x+1<N&&(v[x]=s.get(x,N-1)),v[N-1]=0,u){for(let t=w;t<l;t++){for(let e=0;e<r;e++)g.set(e,t,0);g.set(t,t,1)}for(let t=w-1;t>=0;t--)if(0!==f[t]){for(let e=t+1;e<l;e++){let n=0;for(let o=t;o<r;o++)n+=g.get(o,t)*g.get(o,e);n=-n/g.get(t,t);for(let o=t;o<r;o++)g.set(o,e,g.get(o,e)+n*g.get(o,t))}for(let e=t;e<r;e++)g.set(e,t,-g.get(e,t));g.set(t,t,1+g.get(t,t));for(let e=0;e<t-1;e++)g.set(e,t,0)}else{for(let e=0;e<r;e++)g.set(e,t,0);g.set(t,t,1)}}if(h)for(let t=n-1;t>=0;t--){if(t<x&&0!==v[t])for(let e=t+1;e<n;e++){let r=0;for(let o=t+1;o<n;o++)r+=p.get(o,t)*p.get(o,e);r=-r/p.get(t+1,t);for(let o=t+1;o<n;o++)p.set(o,e,p.get(o,e)+r*p.get(o,t))}for(let e=0;e<n;e++)p.set(e,t,0);p.set(t,t,1)}let b=N-1,M=0,S=Number.EPSILON;for(;N>0;){let t,e;for(t=N-2;t>=-1&&-1!==t;t--){const e=Number.MIN_VALUE+S*Math.abs(f[t]+Math.abs(f[t+1]));if(Math.abs(v[t])<=e||Number.isNaN(v[t])){v[t]=0;break}}if(t===N-2)e=4;else{let r;for(r=N-1;r>=t&&r!==t;r--){let e=(r!==N?Math.abs(v[r]):0)+(r!==t+1?Math.abs(v[r-1]):0);if(Math.abs(f[r])<=S*e){f[r]=0;break}}r===t?e=3:r===N-1?e=1:(e=2,t=r)}switch(t++,e){case 1:{let e=v[N-2];v[N-2]=0;for(let r=N-2;r>=t;r--){let o=mn(f[r],e),i=f[r]/o,a=e/o;if(f[r]=o,r!==t&&(e=-a*v[r-1],v[r-1]=i*v[r-1]),h)for(let t=0;t<n;t++)o=i*p.get(t,r)+a*p.get(t,N-1),p.set(t,N-1,-a*p.get(t,r)+i*p.get(t,N-1)),p.set(t,r,o)}break}case 2:{let e=v[t-1];v[t-1]=0;for(let n=t;n<N;n++){let o=mn(f[n],e),i=f[n]/o,a=e/o;if(f[n]=o,e=-a*v[n],v[n]=i*v[n],u)for(let e=0;e<r;e++)o=i*g.get(e,n)+a*g.get(e,t-1),g.set(e,t-1,-a*g.get(e,n)+i*g.get(e,t-1)),g.set(e,n,o)}break}case 3:{const e=Math.max(Math.abs(f[N-1]),Math.abs(f[N-2]),Math.abs(v[N-2]),Math.abs(f[t]),Math.abs(v[t])),o=f[N-1]/e,i=f[N-2]/e,a=v[N-2]/e,s=f[t]/e,d=v[t]/e,l=((i+o)*(i-o)+a*a)/2,c=o*a*(o*a);let y=0;0===l&&0===c||(y=l<0?0-Math.sqrt(l*l+c):Math.sqrt(l*l+c),y=c/(l+y));let m=(s+o)*(s-o)+y,w=s*d;for(let e=t;e<N-1;e++){let o=mn(m,w);0===o&&(o=Number.MIN_VALUE);let i=m/o,a=w/o;if(e!==t&&(v[e-1]=o),m=i*f[e]+a*v[e],v[e]=i*v[e]-a*f[e],w=a*f[e+1],f[e+1]=i*f[e+1],h)for(let t=0;t<n;t++)o=i*p.get(t,e)+a*p.get(t,e+1),p.set(t,e+1,-a*p.get(t,e)+i*p.get(t,e+1)),p.set(t,e,o);if(o=mn(m,w),0===o&&(o=Number.MIN_VALUE),i=m/o,a=w/o,f[e]=o,m=i*v[e]+a*f[e+1],f[e+1]=-a*v[e]+i*f[e+1],w=a*v[e+1],v[e+1]=i*v[e+1],u&&e<r-1)for(let t=0;t<r;t++)o=i*g.get(t,e)+a*g.get(t,e+1),g.set(t,e+1,-a*g.get(t,e)+i*g.get(t,e+1)),g.set(t,e,o)}v[N-2]=m,M+=1;break}case 4:if(f[t]<=0&&(f[t]=f[t]<0?-f[t]:0,h))for(let e=0;e<=b;e++)p.set(e,t,-p.get(e,t));for(;t<b&&!(f[t]>=f[t+1]);){let e=f[t];if(f[t]=f[t+1],f[t+1]=e,h&&t<n-1)for(let r=0;r<n;r++)e=p.get(r,t+1),p.set(r,t+1,p.get(r,t)),p.set(r,t,e);if(u&&t<r-1)for(let n=0;n<r;n++)e=g.get(n,t+1),g.set(n,t+1,g.get(n,t)),g.set(n,t,e);t++}M=0,N--}}if(d){let t=p;p=g,g=t}this.m=r,this.n=n,this.s=f,this.U=g,this.V=p}solve(t){let e=t,r=this.threshold,n=this.s.length,o=vn.zeros(n,n);for(let t=0;t<n;t++)Math.abs(this.s[t])<=r?o.set(t,t,0):o.set(t,t,1/this.s[t]);let i=this.U,a=this.rightSingularVectors,s=a.mmul(o),u=a.rows,h=i.rows,d=vn.zeros(u,h);for(let t=0;t<u;t++)for(let e=0;e<h;e++){let r=0;for(let o=0;o<n;o++)r+=s.get(t,o)*i.get(e,o);d.set(t,e,r)}return d.mmul(e)}solveForDiagonal(t){return this.solve(vn.diag(t))}inverse(){let t=this.V,e=this.threshold,r=t.rows,n=t.columns,o=new vn(r,this.s.length);for(let i=0;i<r;i++)for(let r=0;r<n;r++)Math.abs(this.s[r])>e&&o.set(i,r,t.get(i,r)/this.s[r]);let i=this.U,a=i.rows,s=i.columns,u=new vn(r,a);for(let t=0;t<r;t++)for(let e=0;e<a;e++){let r=0;for(let n=0;n<s;n++)r+=o.get(t,n)*i.get(e,n);u.set(t,e,r)}return u}get condition(){return this.s[0]/this.s[Math.min(this.m,this.n)-1]}get norm2(){return this.s[0]}get rank(){let t=Math.max(this.m,this.n)*this.s[0]*Number.EPSILON,e=0,r=this.s;for(let n=0,o=r.length;n<o;n++)r[n]>t&&e++;return e}get diagonal(){return Array.from(this.s)}get threshold(){return Number.EPSILON/2*Math.max(this.m,this.n)*this.s[0]}get leftSingularVectors(){return this.U}get rightSingularVectors(){return this.V}get diagonalMatrix(){return vn.diag(this.s)}}var xn,En={center:[0,0],linkDistance:50},Nn=function(){function t(t){void 0===t&&(t={}),this.options=t,this.id=\\\"mds\\\",this.options=n(n({},En),t)}return t.prototype.execute=function(t,e){return i(this,void 0,void 0,(function(){return a(this,(function(r){return[2,this.genericMDSLayout(!1,t,e)]}))}))},t.prototype.assign=function(t,e){return i(this,void 0,void 0,(function(){return a(this,(function(r){return this.genericMDSLayout(!0,t,e),[2]}))}))},t.prototype.genericMDSLayout=function(t,e,r){return i(this,void 0,void 0,(function(){var o,i,s,u,h,d,l,c,f,g,y;return a(this,(function(a){return o=n(n({},this.options),r),i=o.center,s=void 0===i?[0,0]:i,u=o.linkDistance,h=void 0===u?50:u,d=e.getAllNodes(),l=e.getAllEdges(),(null==d?void 0:d.length)&&1!==d.length?(c=v({nodes:d,edges:l},!1),f=p(c),bn(f),m=h,w=[],f.forEach((function(t){var e=[];t.forEach((function(t){e.push(t*m)})),w.push(e)})),g=Mn(w),y=[],g.forEach((function(t,e){var r=N(d[e]);r.data.x=t[0]+s[0],r.data.y=t[1]+s[1],y.push(r)})),t&&y.forEach((function(t){return e.mergeNodeData(t.id,{x:t.data.x,y:t.data.y})})),[2,{nodes:y,edges:l}]):[2,_(e,t,s)];var m,w}))}))},t}(),bn=function(t){var e=-999999;t.forEach((function(t){t.forEach((function(t){t!==1/0&&e<t&&(e=t)}))})),t.forEach((function(r,n){r.forEach((function(r,o){r===1/0&&(t[n][o]=e)}))}))},Mn=function(t){var e=vn.mul(vn.pow(t,2),-.5),r=e.mean(\\\"row\\\"),n=e.mean(\\\"column\\\"),o=e.mean();e.add(o).subRowVector(r).subColumnVector(n);var i=new wn(e),a=vn.sqrt(i.diagonalMatrix).diagonal();return i.leftSingularVectors.toJSON().map((function(t){return vn.mul([t],[a]).toJSON()[0].splice(0,2)}))},Sn={iterations:10,height:10,width:10,speed:100,gravity:10,k:5},kn=function(t,e,r,n,o,i){e.forEach((function(a,s){r[s]={x:0,y:0},e.forEach((function(e,u){if(s!==u&&o[s]===o[u]){var h=a.x-e.x,d=a.y-e.y,l=Math.sqrt(h*h+d*d);if(0===l){l=1;var c=s>u?1:-1;h=.01*c,d=.01*c}if(l<i(t[s])/2+i(t[u])/2){var f=n*n/l;r[s].x+=h/l*f,r[s].y+=d/l*f}}}))}))},An=function(t,e,r,n,o,i,a,s){var u=i||a/10;return n&&e.forEach((function(e,r){var n=t[r].x-t[o].x,i=t[r].y-t[o].y,a=Math.sqrt(n*n+i*i),s=i/a,u=-n/a,h=Math.sqrt(e.x*e.x+e.y*e.y),d=Math.acos((s*e.x+u*e.y)/h);d>Math.PI/2&&(d-=Math.PI/2,s*=-1,u*=-1);var l=Math.cos(d)*h;e.x=s*l,e.y=u*l})),t.forEach((function(i,a){if(a!==o){var h=Math.sqrt(e[a].x*e[a].x+e[a].y*e[a].y);if(h>0&&a!==o){var d=Math.min(u*(r/800),h);if(i.x+=e[a].x/h*d,i.y+=e[a].y/h*d,n){var l=i.x-t[o].x,c=i.y-t[o].y,f=Math.sqrt(l*l+c*c);l=l/f*s[a],c=c/f*s[a],i.x=t[o].x+l,i.y=t[o].y+c}}}})),t},_n={maxIteration:1e3,focusNode:null,unitRadius:null,linkDistance:50,preventOverlap:!1,strictRadial:!0,maxPreventOverlapIteration:200,sortStrength:10},zn=function(){function t(t){void 0===t&&(t={}),this.options=t,this.id=\\\"radial\\\",this.options=n(n({},_n),t)}return t.prototype.execute=function(t,e){return i(this,void 0,void 0,(function(){return a(this,(function(r){return[2,this.genericRadialLayout(!1,t,e)]}))}))},t.prototype.assign=function(t,e){return i(this,void 0,void 0,(function(){return a(this,(function(r){return this.genericRadialLayout(!0,t,e),[2]}))}))},t.prototype.genericRadialLayout=function(t,e,r){return i(this,void 0,void 0,(function(){var o,i,h,d,l,c,f,g,y,m,w,x,E,b,M,S,k,z,R,I,D,P,T,C,q,L,j,F,V,B,G,W,$,U,H,K,Y,J,X,Q,Z,tt,et;return a(this,(function(a){if(o=n(n({},this.options),r),i=o.width,h=o.height,d=o.center,l=o.focusNode,c=o.unitRadius,f=o.nodeSize,g=o.nodeSpacing,y=o.strictRadial,m=o.preventOverlap,w=o.maxPreventOverlapIteration,x=o.sortBy,E=o.linkDistance,b=void 0===E?50:E,M=o.sortStrength,S=void 0===M?10:M,k=o.maxIteration,z=void 0===k?1e3:k,R=e.getAllNodes(),I=e.getAllEdges(),D=i||\\\"undefined\\\"==typeof window?i:window.innerWidth,P=h||\\\"undefined\\\"==typeof window?h:window.innerHeight,T=d||[D/2,P/2],!(null==R?void 0:R.length)||1===R.length)return[2,_(e,t,T)];if(C=R[0],O(l)){for(q=0;q<R.length;q++)if(R[q].id===l){C=R[q];break}}else C=l||R[0];return L=Dn(R,C.id),j=v({nodes:R,edges:I},!1),F=p(j),V=Pn(F,L),On(F,L,V+1),B=F[L],G=D-T[0]>T[0]?T[0]:D-T[0],W=P-T[1]>T[1]?T[1]:P-T[1],0===G&&(G=D/2),0===W&&(W=P/2),$=Math.min(G,W),U=Math.max.apply(Math,u([],s(B))),H=[],K=c||$/U,B.forEach((function(t,e){H[e]=t*K})),Y=Rn(R,F,b,H,K,x,S),J=In(Y),X=function(t,e,r){try{var n=vn.mul(vn.pow(e,2),-.5),o=n.mean(\\\"row\\\"),i=n.mean(\\\"column\\\"),a=n.mean();n.add(a).subRowVector(o).subColumnVector(i);var s=new wn(n),u=vn.sqrt(s.diagonalMatrix).diagonal();return s.leftSingularVectors.toJSON().map((function(e){return vn.mul([e],[u]).toJSON()[0].splice(0,t)}))}catch(t){for(var h=[],d=0;d<e.length;d++){var l=Math.random()*r,c=Math.random()*r;h.push([l,c])}return h}}(b,Y,b),Q=X.map((function(t){var e=s(t,2),r=e[0],n=e[1];return{x:(isNaN(r)?Math.random()*b:r)-X[L][0],y:(isNaN(n)?Math.random()*b:n)-X[L][1]}})),this.run(z,Q,J,Y,H,L),m&&(Z=A(f,g),tt={nodes:R,nodeSizeFunc:Z,positions:Q,radii:H,height:P,width:D,strictRadial:Boolean(y),focusIdx:L,iterations:w||200,k:Q.length/4.5},Q=function(t,e){for(var r=n(n({},Sn),e),o=r.positions,i=r.iterations,a=r.width,s=r.k,u=r.speed,h=void 0===u?100:u,d=r.strictRadial,l=r.focusIdx,c=r.radii,f=void 0===c?[]:c,g=r.nodeSizeFunc,p=t.getAllNodes(),v=[],y=a/10,m=0;m<i;m++)o.forEach((function(t,e){v[e]={x:0,y:0}})),kn(p,o,v,s,f,g),An(o,v,h,d,l,y,a,f);return o}(e,tt)),et=[],Q.forEach((function(t,e){var r=N(R[e]);r.data.x=t.x+T[0],r.data.y=t.y+T[1],et.push(r)})),t&&et.forEach((function(t){return e.mergeNodeData(t.id,{x:t.data.x,y:t.data.y})})),[2,{nodes:et,edges:I}]}))}))},t.prototype.run=function(t,e,r,n,o,i){for(var a=0;a<=t;a++){var s=a/t;this.oneIteration(s,e,o,n,r,i)}},t.prototype.oneIteration=function(t,e,r,n,o,i){var a=1-t;e.forEach((function(s,u){var h=y(s,{x:0,y:0}),d=0===h?0:1/h;if(u!==i){var l=0,c=0,f=0;e.forEach((function(t,e){if(u!==e){var r=y(s,t),i=0===r?0:1/r,a=n[e][u];f+=o[u][e],l+=o[u][e]*(t.x+a*(s.x-t.x)*i),c+=o[u][e]*(t.y+a*(s.y-t.y)*i)}}));var g=0===r[u]?0:1/r[u];f*=a,f+=t*g*g,l*=a,l+=t*g*s.x*d,s.x=l/f,c*=a,c+=t*g*s.y*d,s.y=c/f}}))},t}(),Rn=function(t,e,r,n,o,i,a){if(!t)return[];var s=[];if(e){var u={};e.forEach((function(e,h){var d=[];e.forEach((function(e,s){var l,c;if(h===s)d.push(0);else if(n[h]===n[s])if(\\\"data\\\"===i)d.push(e*(Math.abs(h-s)*a)/(n[h]/o));else if(i){var f=void 0,g=void 0;if(u[t[h].id])f=u[t[h].id];else{var p=(\\\"id\\\"===i?t[h].id:null===(l=t[h].data)||void 0===l?void 0:l[i])||0;f=O(p)?p.charCodeAt(0):p,u[t[h].id]=f}u[t[s].id]?g=u[t[s].id]:(p=(\\\"id\\\"===i?t[s].id:null===(c=t[s].data)||void 0===c?void 0:c[i])||0,g=O(p)?p.charCodeAt(0):p,u[t[s].id]=g),d.push(e*(Math.abs(f-g)*a)/(n[h]/o))}else d.push(e*r/(n[h]/o));else{var v=(r+o)/2;d.push(e*v)}})),s.push(d)}))}return s},In=function(t){for(var e=t.length,r=t[0].length,n=[],o=0;o<e;o++){for(var i=[],a=0;a<r;a++)0!==t[o][a]?i.push(1/(t[o][a]*t[o][a])):i.push(0);n.push(i)}return n},Dn=function(t,e){var r=-1;return t.forEach((function(t,n){t.id===e&&(r=n)})),Math.max(r,0)},On=function(t,e,r){for(var n=t.length,o=0;o<n;o++)if(t[e][o]===1/0){t[e][o]=r,t[o][e]=r;for(var i=0;i<n;i++)t[o][i]!==1/0&&t[e][i]===1/0&&(t[e][i]=r+t[o][i],t[i][e]=r+t[o][i])}for(o=0;o<n;o++)if(o!==e)for(i=0;i<n;i++)if(t[o][i]===1/0){var a=Math.abs(t[e][o]-t[e][i]);a=0===a?1:a,t[o][i]=a}},Pn=function(t,e){for(var r=0,n=0;n<t[e].length;n++)t[e][n]!==1/0&&(r=t[e][n]>r?t[e][n]:r);return r},Tn={center:[0,0],width:300,height:300},Cn=function(){function t(t){void 0===t&&(t={}),this.options=t,this.id=\\\"random\\\",this.options=n(n({},Tn),t)}return t.prototype.execute=function(t,e){return i(this,void 0,void 0,(function(){return a(this,(function(r){return[2,this.genericRandomLayout(!1,t,e)]}))}))},t.prototype.assign=function(t,e){return i(this,void 0,void 0,(function(){return a(this,(function(r){return this.genericRandomLayout(!0,t,e),[2]}))}))},t.prototype.genericRandomLayout=function(t,e,r){return i(this,void 0,void 0,(function(){var o,i,s,u,h,d,l,c,f;return a(this,(function(a){return o=n(n({},this.options),r),i=o.center,s=o.width,u=o.height,h=e.getAllNodes(),d=s||\\\"undefined\\\"==typeof window?s:window.innerWidth,l=u||\\\"undefined\\\"==typeof window?u:window.innerHeight,c=i||[d/2,l/2],f=[],h&&h.forEach((function(t){f.push({id:t.id,data:{x:.9*(Math.random()-.5)*d+c[0],y:.9*(Math.random()-.5)*l+c[1]}})})),t&&f.forEach((function(t){return e.mergeNodeData(t.id,{x:t.data.x,y:t.data.y})})),[2,{nodes:f,edges:e.getAllEdges()}]}))}))},t}(),qn={circular:R,concentric:T,mds:Nn,random:Cn,grid:Wr,radial:zn,force:zr,d3force:Tt,fruchterman:Br,forceAtlas2:Fr,dagre:pr};function Ln(){var t;(null===(t=xn)||void 0===t?void 0:t.stop)&&xn.stop()}function jn(t,e){return i(this,void 0,void 0,(function(){var r,n,o,i,s,u,h,d,l;return a(this,(function(a){switch(a.label){case 0:if(r=t.layout,n=r.id,o=r.options,i=r.iterations,s=t.nodes,u=t.edges,h=new c({nodes:s,edges:u}),!(d=qn[n]))throw new Error(\\\"Unknown layout id: \\\"+n);return[4,(xn=new d(o)).execute(h)];case 1:return l=a.sent(),!!(f=xn).tick&&!!f.stop&&(xn.stop(),l=xn.tick(i)),[2,[l,e]]}var f}))}))}addEventListener(\\\"message\\\",(function(t){var r,n=t.data,o=n.type,i=n.method,a=n.id,s=n.params;\\\"RPC\\\"===o&&i&&((r=e[i])?Promise.resolve().then((function(){return r.apply(e,s)})):Promise.reject(\\\"No such method\\\")).then((function(t){postMessage({type:\\\"RPC\\\",id:a,result:t})})).catch((function(t){var e={message:t};t.stack&&(e.message=t.message,e.stack=t.stack,e.name=t.name),postMessage({type:\\\"RPC\\\",id:a,error:e})}))})),postMessage({type:\\\"RPC\\\",method:\\\"ready\\\"});\\n//# sourceMappingURL=5e37927bd3e57252658c.worker.js.map\"])), { name: \"[fullhash].worker.js\" })\n\t\t\t\t\tURL.revokeObjectURL(URL.createObjectURL(new Blob([\"var t={d:(e,r)=>{for(var n in r)t.o(r,n)&&!t.o(e,n)&&Object.defineProperty(e,n,{enumerable:!0,get:r[n]})},o:(t,e)=>Object.prototype.hasOwnProperty.call(t,e)},e={};t.d(e,{calculateLayout:()=>jn,stopLayout:()=>Ln});var r=function(t,e){return r=Object.setPrototypeOf||{__proto__:[]}instanceof Array&&function(t,e){t.__proto__=e}||function(t,e){for(var r in e)Object.prototype.hasOwnProperty.call(e,r)&&(t[r]=e[r])},r(t,e)},n=function(){return n=Object.assign||function(t){for(var e,r=1,n=arguments.length;r<n;r++)for(var o in e=arguments[r])Object.prototype.hasOwnProperty.call(e,o)&&(t[o]=e[o]);return t},n.apply(this,arguments)};function o(t,e){var r={};for(var n in t)Object.prototype.hasOwnProperty.call(t,n)&&e.indexOf(n)<0&&(r[n]=t[n]);if(null!=t&&\\\"function\\\"==typeof Object.getOwnPropertySymbols){var o=0;for(n=Object.getOwnPropertySymbols(t);o<n.length;o++)e.indexOf(n[o])<0&&Object.prototype.propertyIsEnumerable.call(t,n[o])&&(r[n[o]]=t[n[o]])}return r}function i(t,e,r,n){return new(r||(r=Promise))((function(o,i){function a(t){try{u(n.next(t))}catch(t){i(t)}}function s(t){try{u(n.throw(t))}catch(t){i(t)}}function u(t){var e;t.done?o(t.value):(e=t.value,e instanceof r?e:new r((function(t){t(e)}))).then(a,s)}u((n=n.apply(t,e||[])).next())}))}function a(t,e){var r,n,o,i,a={label:0,sent:function(){if(1&o[0])throw o[1];return o[1]},trys:[],ops:[]};return i={next:s(0),throw:s(1),return:s(2)},\\\"function\\\"==typeof Symbol&&(i[Symbol.iterator]=function(){return this}),i;function s(s){return function(u){return function(s){if(r)throw new TypeError(\\\"Generator is already executing.\\\");for(;i&&(i=0,s[0]&&(a=0)),a;)try{if(r=1,n&&(o=2&s[0]?n.return:s[0]?n.throw||((o=n.return)&&o.call(n),0):n.next)&&!(o=o.call(n,s[1])).done)return o;switch(n=0,o&&(s=[2&s[0],o.value]),s[0]){case 0:case 1:o=s;break;case 4:return a.label++,{value:s[1],done:!1};case 5:a.label++,n=s[1],s=[0];continue;case 7:s=a.ops.pop(),a.trys.pop();continue;default:if(!((o=(o=a.trys).length>0&&o[o.length-1])||6!==s[0]&&2!==s[0])){a=0;continue}if(3===s[0]&&(!o||s[1]>o[0]&&s[1]<o[3])){a.label=s[1];break}if(6===s[0]&&a.label<o[1]){a.label=o[1],o=s;break}if(o&&a.label<o[2]){a.label=o[2],a.ops.push(s);break}o[2]&&a.ops.pop(),a.trys.pop();continue}s=e.call(t,a)}catch(t){s=[6,t],n=0}finally{r=o=0}if(5&s[0])throw s[1];return{value:s[0]?s[1]:void 0,done:!0}}([s,u])}}}function s(t,e){var r=\\\"function\\\"==typeof Symbol&&t[Symbol.iterator];if(!r)return t;var n,o,i=r.call(t),a=[];try{for(;(void 0===e||e-- >0)&&!(n=i.next()).done;)a.push(n.value)}catch(t){o={error:t}}finally{try{n&&!n.done&&(r=i.return)&&r.call(i)}finally{if(o)throw o.error}}return a}function u(t,e,r){if(r||2===arguments.length)for(var n,o=0,i=e.length;o<i;o++)!n&&o in e||(n||(n=Array.prototype.slice.call(e,0,o)),n[o]=e[o]);return t.concat(n||Array.prototype.slice.call(e))}Object.create,Object.create;const h=function(){function t(){this._events={}}return t.prototype.on=function(t,e,r){return this._events[t]||(this._events[t]=[]),this._events[t].push({callback:e,once:!!r}),this},t.prototype.once=function(t,e){return this.on(t,e,!0)},t.prototype.emit=function(t){for(var e=this,r=[],n=1;n<arguments.length;n++)r[n-1]=arguments[n];var o=this._events[t]||[],i=this._events[\\\"*\\\"]||[],a=function(n){for(var o=n.length,i=0;i<o;i++)if(n[i]){var a=n[i],s=a.callback;a.once&&(n.splice(i,1),0===n.length&&delete e._events[t],o--,i--),s.apply(e,r)}};a(o),a(i)},t.prototype.off=function(t,e){if(t)if(e){for(var r=this._events[t]||[],n=r.length,o=0;o<n;o++)r[o].callback===e&&(r.splice(o,1),n--,o--);0===r.length&&delete this._events[t]}else delete this._events[t];else this._events={};return this},t.prototype.getEvents=function(){return this._events},t}();function d(t,e,r,n){for(;t.length;){const o=t.shift();if(r(o))return!0;e.add(o.id),n(o.id).forEach((r=>{e.has(r.id)||(e.add(r.id),t.push(r))}))}return!1}function l(t,e,r,n){if(r(t))return!0;e.add(t.id);for(const o of n(t.id))if(!e.has(o.id)&&l(o,e,r,n))return!0;return!1}class c extends h{nodeMap=new Map;edgeMap=new Map;inEdgesMap=new Map;outEdgesMap=new Map;bothEdgesMap=new Map;treeIndices=new Map;changes=[];batchCount=0;onChanged=()=>{};constructor(t){super(),t&&(t.nodes&&this.addNodes(t.nodes),t.edges&&this.addEdges(t.edges),t.tree&&this.addTree(t.tree),t.onChanged&&(this.onChanged=t.onChanged))}batch=t=>{this.batchCount+=1,t(),this.batchCount-=1,this.batchCount||this.commit()};commit(){const t=this.changes;this.changes=[];const e={graph:this,changes:t};this.emit(\\\"changed\\\",e),this.onChanged(e)}reduceChanges(t){let e=[];return t.forEach((t=>{switch(t.type){case\\\"NodeRemoved\\\":{let r=!1;e=e.filter((e=>{if(\\\"NodeAdded\\\"===e.type){const n=e.value.id===t.value.id;return n&&(r=!0),!n}return\\\"NodeDataUpdated\\\"===e.type?e.id!==t.value.id:\\\"TreeStructureChanged\\\"!==e.type||e.nodeId!==t.value.id})),r||e.push(t);break}case\\\"EdgeRemoved\\\":{let r=!1;e=e.filter((e=>{if(\\\"EdgeAdded\\\"===e.type){const n=e.value.id===t.value.id;return n&&(r=!0),!n}return\\\"EdgeDataUpdated\\\"!==e.type&&\\\"EdgeUpdated\\\"!==e.type||e.id!==t.value.id})),r||e.push(t);break}case\\\"NodeDataUpdated\\\":case\\\"EdgeDataUpdated\\\":case\\\"EdgeUpdated\\\":{const r=e.find((e=>e.type===t.type&&e.id===t.id&&e.propertyName===t.propertyName));r?r.newValue=t.newValue:e.push(t);break}case\\\"TreeStructureDetached\\\":e=e.filter((e=>\\\"TreeStructureAttached\\\"===e.type?e.treeKey!==t.treeKey:\\\"TreeStructureChanged\\\"!==e.type||e.treeKey!==t.treeKey)),e.push(t);break;case\\\"TreeStructureChanged\\\":{const r=e.find((e=>\\\"TreeStructureChanged\\\"===e.type&&e.treeKey===t.treeKey&&e.nodeId===t.nodeId));r?r.newParentId=t.newParentId:e.push(t);break}default:e.push(t)}})),e}checkNodeExistence(t){this.getNode(t)}hasNode(t){return this.nodeMap.has(t)}areNeighbors(t,e){return this.getNeighbors(e).some((e=>e.id===t))}getNode(t){const e=this.nodeMap.get(t);if(!e)throw new Error(\\\"Node not found for id: \\\"+t);return e}getRelatedEdges(t,e){if(this.checkNodeExistence(t),\\\"in\\\"===e){const e=this.inEdgesMap.get(t);return Array.from(e)}if(\\\"out\\\"===e){const e=this.outEdgesMap.get(t);return Array.from(e)}{const e=this.bothEdgesMap.get(t);return Array.from(e)}}getDegree(t,e){return this.getRelatedEdges(t,e).length}getSuccessors(t){const e=this.getRelatedEdges(t,\\\"out\\\").map((t=>this.getNode(t.target)));return Array.from(new Set(e))}getPredecessors(t){const e=this.getRelatedEdges(t,\\\"in\\\").map((t=>this.getNode(t.source)));return Array.from(new Set(e))}getNeighbors(t){const e=this.getPredecessors(t),r=this.getSuccessors(t);return Array.from(new Set([...e,...r]))}doAddNode(t){if(this.hasNode(t.id))throw new Error(\\\"Node already exists: \\\"+t.id);this.nodeMap.set(t.id,t),this.inEdgesMap.set(t.id,new Set),this.outEdgesMap.set(t.id,new Set),this.bothEdgesMap.set(t.id,new Set),this.treeIndices.forEach((e=>{e.childrenMap.set(t.id,new Set)})),this.changes.push({type:\\\"NodeAdded\\\",value:t})}addNodes(t){this.batch((()=>{for(const e of t)this.doAddNode(e)}))}addNode(t){this.addNodes([t])}doRemoveNode(t){const e=this.getNode(t),r=this.bothEdgesMap.get(t);r?.forEach((t=>this.doRemoveEdge(t.id))),this.nodeMap.delete(t),this.treeIndices.forEach((e=>{e.childrenMap.get(t)?.forEach((t=>{e.parentMap.delete(t.id)})),e.parentMap.delete(t),e.childrenMap.delete(t)})),this.changes.push({type:\\\"NodeRemoved\\\",value:e})}removeNodes(t){this.batch((()=>{t.forEach((t=>this.doRemoveNode(t)))}))}removeNode(t){this.removeNodes([t])}updateNodeDataProperty(t,e,r){const n=this.getNode(t);this.batch((()=>{const o=n.data[e],i=r;n.data[e]=i,this.changes.push({type:\\\"NodeDataUpdated\\\",id:t,propertyName:e,oldValue:o,newValue:i})}))}mergeNodeData(t,e){this.batch((()=>{Object.entries(e).forEach((([e,r])=>{this.updateNodeDataProperty(t,e,r)}))}))}updateNodeData(...t){const e=t[0],r=this.getNode(e);if(\\\"string\\\"==typeof t[1])return void this.updateNodeDataProperty(e,t[1],t[2]);let n;if(\\\"function\\\"==typeof t[1]){const e=t[1];n=e(r.data)}else\\\"object\\\"==typeof t[1]&&(n=t[1]);this.batch((()=>{const t=r.data,o=n;r.data=n,this.changes.push({type:\\\"NodeDataUpdated\\\",id:e,oldValue:t,newValue:o})}))}checkEdgeExistence(t){if(!this.hasEdge(t))throw new Error(\\\"Edge not found for id: \\\"+t)}hasEdge(t){return this.edgeMap.has(t)}getEdge(t){return this.checkEdgeExistence(t),this.edgeMap.get(t)}getEdgeDetail(t){const e=this.getEdge(t);return{edge:e,source:this.getNode(e.source),target:this.getNode(e.target)}}doAddEdge(t){if(this.hasEdge(t.id))throw new Error(\\\"Edge already exists: \\\"+t.id);this.checkNodeExistence(t.source),this.checkNodeExistence(t.target),this.edgeMap.set(t.id,t);const e=this.inEdgesMap.get(t.target),r=this.outEdgesMap.get(t.source),n=this.bothEdgesMap.get(t.source),o=this.bothEdgesMap.get(t.target);e.add(t),r.add(t),n.add(t),o.add(t),this.changes.push({type:\\\"EdgeAdded\\\",value:t})}addEdges(t){this.batch((()=>{for(const e of t)this.doAddEdge(e)}))}addEdge(t){this.addEdges([t])}doRemoveEdge(t){const e=this.getEdge(t),r=this.outEdgesMap.get(e.source),n=this.inEdgesMap.get(e.target),o=this.bothEdgesMap.get(e.source),i=this.bothEdgesMap.get(e.target);r.delete(e),n.delete(e),o.delete(e),i.delete(e),this.edgeMap.delete(t),this.changes.push({type:\\\"EdgeRemoved\\\",value:e})}removeEdges(t){this.batch((()=>{t.forEach((t=>this.doRemoveEdge(t)))}))}removeEdge(t){this.removeEdges([t])}updateEdgeSource(t,e){const r=this.getEdge(t);this.checkNodeExistence(e);const n=r.source,o=e;this.outEdgesMap.get(n).delete(r),this.bothEdgesMap.get(n).delete(r),this.outEdgesMap.get(o).add(r),this.bothEdgesMap.get(o).add(r),r.source=e,this.batch((()=>{this.changes.push({type:\\\"EdgeUpdated\\\",id:t,propertyName:\\\"source\\\",oldValue:n,newValue:o})}))}updateEdgeTarget(t,e){const r=this.getEdge(t);this.checkNodeExistence(e);const n=r.target,o=e;this.inEdgesMap.get(n).delete(r),this.bothEdgesMap.get(n).delete(r),this.inEdgesMap.get(o).add(r),this.bothEdgesMap.get(o).add(r),r.target=e,this.batch((()=>{this.changes.push({type:\\\"EdgeUpdated\\\",id:t,propertyName:\\\"target\\\",oldValue:n,newValue:o})}))}updateEdgeDataProperty(t,e,r){const n=this.getEdge(t);this.batch((()=>{const o=n.data[e],i=r;n.data[e]=i,this.changes.push({type:\\\"EdgeDataUpdated\\\",id:t,propertyName:e,oldValue:o,newValue:i})}))}updateEdgeData(...t){const e=t[0],r=this.getEdge(e);if(\\\"string\\\"==typeof t[1])return void this.updateEdgeDataProperty(e,t[1],t[2]);let n;if(\\\"function\\\"==typeof t[1]){const e=t[1];n=e(r.data)}else\\\"object\\\"==typeof t[1]&&(n=t[1]);this.batch((()=>{const t=r.data,o=n;r.data=n,this.changes.push({type:\\\"EdgeDataUpdated\\\",id:e,oldValue:t,newValue:o})}))}mergeEdgeData(t,e){this.batch((()=>{Object.entries(e).forEach((([e,r])=>{this.updateEdgeDataProperty(t,e,r)}))}))}checkTreeExistence(t){if(!this.hasTreeStructure(t))throw new Error(\\\"Tree structure not found for treeKey: \\\"+t)}hasTreeStructure(t){return this.treeIndices.has(t)}attachTreeStructure(t){this.treeIndices.has(t)||(this.treeIndices.set(t,{parentMap:new Map,childrenMap:new Map}),this.batch((()=>{this.changes.push({type:\\\"TreeStructureAttached\\\",treeKey:t})})))}detachTreeStructure(t){this.checkTreeExistence(t),this.treeIndices.delete(t),this.batch((()=>{this.changes.push({type:\\\"TreeStructureDetached\\\",treeKey:t})}))}addTree(t,e){this.batch((()=>{this.attachTreeStructure(e);const r=[],n=Array.isArray(t)?t:[t];for(;n.length;){const t=n.shift();r.push(t),t.children&&n.push(...t.children)}this.addNodes(r),r.forEach((t=>{t.children?.forEach((r=>{this.setParent(r.id,t.id,e)}))}))}))}getRoots(t){return this.checkTreeExistence(t),this.getAllNodes().filter((e=>!this.getParent(e.id,t)))}getChildren(t,e){this.checkNodeExistence(t),this.checkTreeExistence(e);const r=this.treeIndices.get(e).childrenMap.get(t);return Array.from(r||[])}getParent(t,e){return this.checkNodeExistence(t),this.checkTreeExistence(e),this.treeIndices.get(e).parentMap.get(t)||null}getAncestors(t,e){const r=[];let n,o=this.getNode(t);for(;n=this.getParent(o.id,e);)r.push(n),o=n;return r}setParent(t,e,r){this.checkTreeExistence(r);const n=this.treeIndices.get(r),o=this.getNode(t),i=n.parentMap.get(t),a=this.getNode(e);n.parentMap.set(t,a),i&&n.childrenMap.get(i.id)?.delete(o);let s=n.childrenMap.get(a.id);s||(s=new Set,n.childrenMap.set(a.id,s)),s.add(o),this.batch((()=>{this.changes.push({type:\\\"TreeStructureChanged\\\",treeKey:r,nodeId:t,oldParentId:i?.id,newParentId:a.id})}))}dfsTree(t,e,r){return l(this.getNode(t),new Set,e,(t=>this.getChildren(t,r)))}bfsTree(t,e,r){return d([this.getNode(t)],new Set,e,(t=>this.getChildren(t,r)))}getAllNodes(){return Array.from(this.nodeMap.values())}getAllEdges(){return Array.from(this.edgeMap.values())}bfs(t,e,r=\\\"out\\\"){const n={in:this.getPredecessors.bind(this),out:this.getSuccessors.bind(this),both:this.getNeighbors.bind(this)}[r];return d([this.getNode(t)],new Set,e,n)}dfs(t,e,r=\\\"out\\\"){const n={in:this.getPredecessors.bind(this),out:this.getSuccessors.bind(this),both:this.getNeighbors.bind(this)}[r];return l(this.getNode(t),new Set,e,n)}clone(){const t=this.getAllNodes().map((t=>({...t,data:{...t.data}}))),e=this.getAllEdges().map((t=>({...t,data:{...t.data}}))),r=new c({nodes:t,edges:e});return this.treeIndices.forEach((({parentMap:t,childrenMap:e},n)=>{const o=new Map;t.forEach(((t,e)=>{o.set(e,r.getNode(t.id))}));const i=new Map;e.forEach(((t,e)=>{i.set(e,new Set(Array.from(t).map((t=>r.getNode(t.id)))))})),r.treeIndices.set(n,{parentMap:o,childrenMap:i})})),r}toJSON(){return JSON.stringify({nodes:this.getAllNodes(),edges:this.getAllEdges()})}}var f=/-(\\\\w)/g,g=(function(t){return t.replace(f,(function(t,e){return e?e.toUpperCase():\\\"\\\"}))},Object.create(null),Array.isArray),p=function(t){for(var e=[],r=t.length,n=0;n<r;n+=1){e[n]=[];for(var o=0;o<r;o+=1)n===o?e[n][o]=0:0!==t[n][o]&&t[n][o]?e[n][o]=t[n][o]:e[n][o]=1/0}for(var i=0;i<r;i+=1)for(n=0;n<r;n+=1)for(o=0;o<r;o+=1)e[n][o]>e[n][i]+e[i][o]&&(e[n][o]=e[n][i]+e[i][o]);return e},v=function(t,e){var r=t.nodes,n=t.edges,o=[],i={};if(!r)throw new Error(\\\"invalid nodes data!\\\");return r&&r.forEach((function(t,e){i[t.id]=e,o.push([])})),null==n||n.forEach((function(t){var r=t.source,n=t.target,a=i[r],s=i[n];void 0!==a&&void 0!==s&&(o[a][s]=1,e||(o[s][a]=1))})),o},y=function(t,e){return Math.sqrt((t.x-e.x)*(t.x-e.x)+(t.y-e.y)*(t.y-e.y))},m={}.toString;const w=function(t,e){return m.call(t)===\\\"[object \\\"+e+\\\"]\\\"},x=function(t){return w(t,\\\"Number\\\")};var E=function(t){if(null===t)return t;if(t instanceof Date)return new Date(t.getTime());if(t instanceof Array){var e=[];return t.forEach((function(t){e.push(t)})),e.map((function(t){return E(t)}))}if(\\\"object\\\"==typeof t){var r={};return Object.keys(t).forEach((function(e){r[e]=E(t[e])})),r}return t},N=function(t,e){var r=E(t);return r.data=r.data||{},e&&(x(r.data.x)||(r.data.x=Math.random()*e[0]),x(r.data.y)||(r.data.y=Math.random()*e[1])),r};const b=function(t){return\\\"function\\\"==typeof t},M=function(t){var e=typeof t;return null!==t&&\\\"object\\\"===e||\\\"function\\\"===e};function S(t,e){return b(e)?e:x(e)?function(){return e}:function(){return t}}function k(t,e,r){return void 0===r&&(r=!0),e||0===e?b(e)?e:x(e)?function(){return e}:g(e)?function(){if(r){var n=Math.max.apply(Math,u([],s(e)));return isNaN(n)?t:n}return e}:M(e)?function(){if(r){var n=Math.max(e.width,e.height);return isNaN(n)?t:n}return[e.width,e.height]}:function(){return t}:function(e){var r=(e.data||{}).size;return r?g(r)?r[0]>r[1]?r[0]:r[1]:M(r)?r.width>r.height?r.width:r.height:r:t}}var A=function(t,e){var r;return r=x(e)?function(){return e}:b(e)?e:function(){return 0},t?g(t)?function(e){return(t[0]>t[1]?t[0]:t[1])+r(e)}:function(e){return t+r(e)}:function(t){var e,n;if(null===(e=t.data)||void 0===e?void 0:e.bboxSize)return Math.max(t.data.bboxSize[0],t.data.bboxSize[1])+r(t);if(null===(n=t.data)||void 0===n?void 0:n.size){if(g(t.data.size))return Math.max(t.data.size[0],t.data.size[1])+r(t);var o=t.data.size;return M(o)?(o.width>o.height?o.width:o.height)+r(t):o+r(t)}return 10+r(t)}},_=function(t,e,r){var o=t.getAllNodes(),i=t.getAllEdges();return(null==o?void 0:o.length)?1===o.length?(e&&t.mergeNodeData(o[0].id,{x:r[0],y:r[1]}),{nodes:[n(n({},o[0]),{data:n(n({},o[0].data),{x:r[0],y:r[1]})})],edges:i}):void 0:{nodes:[],edges:i}},z={radius:null,startRadius:null,endRadius:null,startAngle:0,endAngle:2*Math.PI,clockwise:!0,divisions:1,ordering:null,angleRatio:1},R=function(){function t(t){void 0===t&&(t={}),this.options=t,this.id=\\\"circular\\\",this.options=n(n({},z),t)}return t.prototype.execute=function(t,e){return i(this,void 0,void 0,(function(){return a(this,(function(r){return[2,this.genericCircularLayout(!1,t,e)]}))}))},t.prototype.assign=function(t,e){return i(this,void 0,void 0,(function(){return a(this,(function(r){switch(r.label){case 0:return[4,this.genericCircularLayout(!0,t,e)];case 1:return r.sent(),[2]}}))}))},t.prototype.genericCircularLayout=function(t,e,r){return i(this,void 0,void 0,(function(){var o,i,u,h,d,l,c,f,g,p,v,y,m,w,x,E,b,M,A,z,R,O,P,T,C,q,L,j,F,V,B,G,W,$,U;return a(this,(function(a){if(o=n(n({},this.options),r),i=o.width,u=o.height,h=o.center,d=o.divisions,l=o.startAngle,c=void 0===l?0:l,f=o.endAngle,g=void 0===f?2*Math.PI:f,p=o.angleRatio,v=o.ordering,y=o.clockwise,m=o.nodeSpacing,w=o.nodeSize,x=e.getAllNodes(),E=e.getAllEdges(),b=s(D(i,u,h),3),M=b[0],A=b[1],z=b[2],!(R=null==x?void 0:x.length)||1===R)return[2,_(e,t,z)];for(O=(g-c)/R,P=o.radius,T=o.startRadius,C=o.endRadius,m?(q=S(10,m),L=k(10,w),j=-1/0,x.forEach((function(t){var e=L(t);j<e&&(j=e)})),F=0,x.forEach((function(t,e){F+=0===e?j||10:(q(t)||0)+(j||10)})),P=F/(2*Math.PI)):P||T||C?!T&&C?T=C:T&&!C&&(C=T):P=Math.min(A,M)/2,V=O*p,B=[],B=\\\"topology\\\"===v?I(e,x):\\\"topology-directed\\\"===v?I(e,x,!0):\\\"degree\\\"===v?function(t,e){var r=[];return e.forEach((function(t,e){r.push(N(t))})),r.sort((function(e,r){return t.getDegree(e.id,\\\"both\\\")-t.getDegree(r.id,\\\"both\\\")})),r}(e,x):x.map((function(t){return N(t)})),G=Math.ceil(R/d),W=0;W<R;++W)($=P)||null===T||null===C||($=T+W*(C-T)/(R-1)),$||($=10+100*W/(R-1)),U=c+W%G*V+2*Math.PI/d*Math.floor(W/G),y||(U=g-W%G*V-2*Math.PI/d*Math.floor(W/G)),B[W].data.x=z[0]+Math.cos(U)*$,B[W].data.y=z[1]+Math.sin(U)*$;return t&&B.forEach((function(t){e.mergeNodeData(t.id,{x:t.data.x,y:t.data.y})})),[2,{nodes:B,edges:E}]}))}))},t}(),I=function(t,e,r){void 0===r&&(r=!1);var n=[N(e[0])],o={},i=e.length;o[e[0].id]=!0;var a=0;return e.forEach((function(s,u){if(0!==u)if(u!==i-1&&t.getDegree(s.id,\\\"both\\\")===t.getDegree(e[u+1].id,\\\"both\\\")&&!t.areNeighbors(n[a].id,s.id)||o[s.id]){for(var h=r?t.getSuccessors(n[a].id):t.getNeighbors(n[a].id),d=!1,l=0;l<h.length;l++){var c=h[l];if(t.getDegree(c.id)===t.getDegree(s.id)&&!o[c.id]){n.push(N(c)),o[c.id]=!0,d=!0;break}}for(var f=0;!d&&(o[e[f].id]||(n.push(N(e[f])),o[e[f].id]=!0,d=!0),++f!==i););}else n.push(N(s)),o[s.id]=!0,a++})),n},D=function(t,e,r){var n=t,o=e,i=r;return n||\\\"undefined\\\"==typeof window||(n=window.innerWidth),o||\\\"undefined\\\"==typeof window||(o=window.innerHeight),i||(i=[n/2,o/2]),[n,o,i]};const O=function(t){return w(t,\\\"String\\\")};var P={nodeSize:30,nodeSpacing:10,preventOverlap:!1,sweep:void 0,equidistant:!1,startAngle:1.5*Math.PI,clockwise:!0,maxLevelDiff:void 0,sortBy:\\\"degree\\\"},T=function(){function t(t){void 0===t&&(t={}),this.options=t,this.id=\\\"concentric\\\",this.options=n(n({},P),t)}return t.prototype.execute=function(t,e){return i(this,void 0,void 0,(function(){return a(this,(function(r){return[2,this.genericConcentricLayout(!1,t,e)]}))}))},t.prototype.assign=function(t,e){return i(this,void 0,void 0,(function(){return a(this,(function(r){return this.genericConcentricLayout(!0,t,e),[2]}))}))},t.prototype.genericConcentricLayout=function(t,e,r){return i(this,void 0,void 0,(function(){var o,i,s,u,h,d,l,c,f,p,v,y,m,w,E,S,k,A,z,R,I,D,P,T,C,q,L,j,F,V,B,G,W,$,U,H,K,Y;return a(this,(function(a){if(o=n(n({},this.options),r),i=o.center,s=o.width,u=o.height,h=o.sortBy,d=o.maxLevelDiff,l=o.sweep,c=o.clockwise,f=o.equidistant,p=o.preventOverlap,v=o.startAngle,y=void 0===v?1.5*Math.PI:v,m=o.nodeSize,w=o.nodeSpacing,E=e.getAllNodes(),S=e.getAllEdges(),k=s||\\\"undefined\\\"==typeof window?s:window.innerWidth,A=u||\\\"undefined\\\"==typeof window?u:window.innerHeight,z=i||[k/2,A/2],!(null==E?void 0:E.length)||1===E.length)return[2,_(e,t,z)];if(R=[],D=0,I=g(m)?Math.max(m[0],m[1]):m,g(w)?D=Math.max(w[0],w[1]):x(w)&&(D=w),E.forEach((function(t){var e=N(t);R.push(e);var r=I,n=e.data;g(n.size)?r=Math.max(n.size[0],n.size[1]):x(n.size)?r=n.size:M(n.size)&&(r=Math.max(n.size.width,n.size.height)),I=Math.max(I,r),b(w)&&(D=Math.max(w(t),D))})),P={},R.forEach((function(t,e){P[t.id]=e})),O(T=h)&&void 0!==R[0].data[T]||(T=\\\"degree\\\"),\\\"degree\\\"===T?R.sort((function(t,r){return e.getDegree(r.id,\\\"both\\\")-e.getDegree(t.id,\\\"both\\\")})):R.sort((function(t,e){return e.data[T]-t.data[T]})),C=R[0],q=(d||(\\\"degree\\\"===T?e.getDegree(C.id,\\\"both\\\"):C.data[T]))/4,j=(L=[{nodes:[]}])[0],R.forEach((function(t){if(j.nodes.length>0){var r=\\\"degree\\\"===T?Math.abs(e.getDegree(j.nodes[0].id,\\\"both\\\")-e.getDegree(t.id,\\\"both\\\")):Math.abs(j.nodes[0].data[T]-t.data[T]);q&&r>=q&&(j={nodes:[]},L.push(j))}j.nodes.push(t)})),F=I+D,p||(V=L.length>0&&L[0].nodes.length>1,B=Math.min(k,A)/2-F,G=B/(L.length+(V?1:0)),F=Math.min(F,G)),W=0,L.forEach((function(t){var e=void 0===l?2*Math.PI-2*Math.PI/t.nodes.length:l;if(t.dTheta=e/Math.max(1,t.nodes.length-1),t.nodes.length>1&&p){var r=Math.cos(t.dTheta)-Math.cos(0),n=Math.sin(t.dTheta)-Math.sin(0),o=Math.sqrt(F*F/(r*r+n*n));W=Math.max(o,W)}t.r=W,W+=F})),f){for($=0,U=0,H=0;H<L.length;H++)K=L[H],Y=(K.r||0)-U,$=Math.max($,Y);U=0,L.forEach((function(t,e){0===e&&(U=t.r||0),t.r=U,U+=$}))}return L.forEach((function(t){var e=t.dTheta||0,r=t.r||0;t.nodes.forEach((function(t,n){var o=y+(c?1:-1)*e*n;t.data.x=z[0]+r*Math.cos(o),t.data.y=z[1]+r*Math.sin(o)}))})),t&&R.forEach((function(t){return e.mergeNodeData(t.id,{x:t.data.x,y:t.data.y})})),[2,{nodes:R,edges:S}]}))}))},t}();function C(t,e,r,n){if(isNaN(e)||isNaN(r))return t;var o,i,a,s,u,h,d,l,c,f=t._root,g={data:n},p=t._x0,v=t._y0,y=t._x1,m=t._y1;if(!f)return t._root=g,t;for(;f.length;)if((h=e>=(i=(p+y)/2))?p=i:y=i,(d=r>=(a=(v+m)/2))?v=a:m=a,o=f,!(f=f[l=d<<1|h]))return o[l]=g,t;if(s=+t._x.call(null,f.data),u=+t._y.call(null,f.data),e===s&&r===u)return g.next=f,o?o[l]=g:t._root=g,t;do{o=o?o[l]=new Array(4):t._root=new Array(4),(h=e>=(i=(p+y)/2))?p=i:y=i,(d=r>=(a=(v+m)/2))?v=a:m=a}while((l=d<<1|h)==(c=(u>=a)<<1|s>=i));return o[c]=f,o[l]=g,t}function q(t,e,r,n,o){this.node=t,this.x0=e,this.y0=r,this.x1=n,this.y1=o}function L(t){return t[0]}function j(t){return t[1]}function F(t,e,r){var n=new V(null==e?L:e,null==r?j:r,NaN,NaN,NaN,NaN);return null==t?n:n.addAll(t)}function V(t,e,r,n,o,i){this._x=t,this._y=e,this._x0=r,this._y0=n,this._x1=o,this._y1=i,this._root=void 0}function B(t){for(var e={data:t.data},r=e;t=t.next;)r=r.next={data:t.data};return e}var G=F.prototype=V.prototype;function W(t){return function(){return t}}function $(t){return 1e-6*(t()-.5)}G.copy=function(){var t,e,r=new V(this._x,this._y,this._x0,this._y0,this._x1,this._y1),n=this._root;if(!n)return r;if(!n.length)return r._root=B(n),r;for(t=[{source:n,target:r._root=new Array(4)}];n=t.pop();)for(var o=0;o<4;++o)(e=n.source[o])&&(e.length?t.push({source:e,target:n.target[o]=new Array(4)}):n.target[o]=B(e));return r},G.add=function(t){const e=+this._x.call(null,t),r=+this._y.call(null,t);return C(this.cover(e,r),e,r,t)},G.addAll=function(t){var e,r,n,o,i=t.length,a=new Array(i),s=new Array(i),u=1/0,h=1/0,d=-1/0,l=-1/0;for(r=0;r<i;++r)isNaN(n=+this._x.call(null,e=t[r]))||isNaN(o=+this._y.call(null,e))||(a[r]=n,s[r]=o,n<u&&(u=n),n>d&&(d=n),o<h&&(h=o),o>l&&(l=o));if(u>d||h>l)return this;for(this.cover(u,h).cover(d,l),r=0;r<i;++r)C(this,a[r],s[r],t[r]);return this},G.cover=function(t,e){if(isNaN(t=+t)||isNaN(e=+e))return this;var r=this._x0,n=this._y0,o=this._x1,i=this._y1;if(isNaN(r))o=(r=Math.floor(t))+1,i=(n=Math.floor(e))+1;else{for(var a,s,u=o-r||1,h=this._root;r>t||t>=o||n>e||e>=i;)switch(s=(e<n)<<1|t<r,(a=new Array(4))[s]=h,h=a,u*=2,s){case 0:o=r+u,i=n+u;break;case 1:r=o-u,i=n+u;break;case 2:o=r+u,n=i-u;break;case 3:r=o-u,n=i-u}this._root&&this._root.length&&(this._root=h)}return this._x0=r,this._y0=n,this._x1=o,this._y1=i,this},G.data=function(){var t=[];return this.visit((function(e){if(!e.length)do{t.push(e.data)}while(e=e.next)})),t},G.extent=function(t){return arguments.length?this.cover(+t[0][0],+t[0][1]).cover(+t[1][0],+t[1][1]):isNaN(this._x0)?void 0:[[this._x0,this._y0],[this._x1,this._y1]]},G.find=function(t,e,r){var n,o,i,a,s,u,h,d=this._x0,l=this._y0,c=this._x1,f=this._y1,g=[],p=this._root;for(p&&g.push(new q(p,d,l,c,f)),null==r?r=1/0:(d=t-r,l=e-r,c=t+r,f=e+r,r*=r);u=g.pop();)if(!(!(p=u.node)||(o=u.x0)>c||(i=u.y0)>f||(a=u.x1)<d||(s=u.y1)<l))if(p.length){var v=(o+a)/2,y=(i+s)/2;g.push(new q(p[3],v,y,a,s),new q(p[2],o,y,v,s),new q(p[1],v,i,a,y),new q(p[0],o,i,v,y)),(h=(e>=y)<<1|t>=v)&&(u=g[g.length-1],g[g.length-1]=g[g.length-1-h],g[g.length-1-h]=u)}else{var m=t-+this._x.call(null,p.data),w=e-+this._y.call(null,p.data),x=m*m+w*w;if(x<r){var E=Math.sqrt(r=x);d=t-E,l=e-E,c=t+E,f=e+E,n=p.data}}return n},G.remove=function(t){if(isNaN(i=+this._x.call(null,t))||isNaN(a=+this._y.call(null,t)))return this;var e,r,n,o,i,a,s,u,h,d,l,c,f=this._root,g=this._x0,p=this._y0,v=this._x1,y=this._y1;if(!f)return this;if(f.length)for(;;){if((h=i>=(s=(g+v)/2))?g=s:v=s,(d=a>=(u=(p+y)/2))?p=u:y=u,e=f,!(f=f[l=d<<1|h]))return this;if(!f.length)break;(e[l+1&3]||e[l+2&3]||e[l+3&3])&&(r=e,c=l)}for(;f.data!==t;)if(n=f,!(f=f.next))return this;return(o=f.next)&&delete f.next,n?(o?n.next=o:delete n.next,this):e?(o?e[l]=o:delete e[l],(f=e[0]||e[1]||e[2]||e[3])&&f===(e[3]||e[2]||e[1]||e[0])&&!f.length&&(r?r[c]=f:this._root=f),this):(this._root=o,this)},G.removeAll=function(t){for(var e=0,r=t.length;e<r;++e)this.remove(t[e]);return this},G.root=function(){return this._root},G.size=function(){var t=0;return this.visit((function(e){if(!e.length)do{++t}while(e=e.next)})),t},G.visit=function(t){var e,r,n,o,i,a,s=[],u=this._root;for(u&&s.push(new q(u,this._x0,this._y0,this._x1,this._y1));e=s.pop();)if(!t(u=e.node,n=e.x0,o=e.y0,i=e.x1,a=e.y1)&&u.length){var h=(n+i)/2,d=(o+a)/2;(r=u[3])&&s.push(new q(r,h,d,i,a)),(r=u[2])&&s.push(new q(r,n,d,h,a)),(r=u[1])&&s.push(new q(r,h,o,i,d)),(r=u[0])&&s.push(new q(r,n,o,h,d))}return this},G.visitAfter=function(t){var e,r=[],n=[];for(this._root&&r.push(new q(this._root,this._x0,this._y0,this._x1,this._y1));e=r.pop();){var o=e.node;if(o.length){var i,a=e.x0,s=e.y0,u=e.x1,h=e.y1,d=(a+u)/2,l=(s+h)/2;(i=o[0])&&r.push(new q(i,a,s,d,l)),(i=o[1])&&r.push(new q(i,d,s,u,l)),(i=o[2])&&r.push(new q(i,a,l,d,h)),(i=o[3])&&r.push(new q(i,d,l,u,h))}n.push(e)}for(;e=n.pop();)t(e.node,e.x0,e.y0,e.x1,e.y1);return this},G.x=function(t){return arguments.length?(this._x=t,this):this._x},G.y=function(t){return arguments.length?(this._y=t,this):this._y};var U={value:()=>{}};function H(){for(var t,e=0,r=arguments.length,n={};e<r;++e){if(!(t=arguments[e]+\\\"\\\")||t in n||/[\\\\s.]/.test(t))throw new Error(\\\"illegal type: \\\"+t);n[t]=[]}return new K(n)}function K(t){this._=t}function Y(t,e){for(var r,n=0,o=t.length;n<o;++n)if((r=t[n]).name===e)return r.value}function J(t,e,r){for(var n=0,o=t.length;n<o;++n)if(t[n].name===e){t[n]=U,t=t.slice(0,n).concat(t.slice(n+1));break}return null!=r&&t.push({name:e,value:r}),t}K.prototype=H.prototype={constructor:K,on:function(t,e){var r,n,o=this._,i=(n=o,(t+\\\"\\\").trim().split(/^|\\\\s+/).map((function(t){var e=\\\"\\\",r=t.indexOf(\\\".\\\");if(r>=0&&(e=t.slice(r+1),t=t.slice(0,r)),t&&!n.hasOwnProperty(t))throw new Error(\\\"unknown type: \\\"+t);return{type:t,name:e}}))),a=-1,s=i.length;if(!(arguments.length<2)){if(null!=e&&\\\"function\\\"!=typeof e)throw new Error(\\\"invalid callback: \\\"+e);for(;++a<s;)if(r=(t=i[a]).type)o[r]=J(o[r],t.name,e);else if(null==e)for(r in o)o[r]=J(o[r],t.name,null);return this}for(;++a<s;)if((r=(t=i[a]).type)&&(r=Y(o[r],t.name)))return r},copy:function(){var t={},e=this._;for(var r in e)t[r]=e[r].slice();return new K(t)},call:function(t,e){if((r=arguments.length-2)>0)for(var r,n,o=new Array(r),i=0;i<r;++i)o[i]=arguments[i+2];if(!this._.hasOwnProperty(t))throw new Error(\\\"unknown type: \\\"+t);for(i=0,r=(n=this._[t]).length;i<r;++i)n[i].value.apply(e,o)},apply:function(t,e,r){if(!this._.hasOwnProperty(t))throw new Error(\\\"unknown type: \\\"+t);for(var n=this._[t],o=0,i=n.length;o<i;++o)n[o].value.apply(e,r)}};const X=H;var Q,Z,tt=0,et=0,rt=0,nt=1e3,ot=0,it=0,at=0,st=\\\"object\\\"==typeof performance&&performance.now?performance:Date,ut=\\\"object\\\"==typeof window&&window.requestAnimationFrame?window.requestAnimationFrame.bind(window):function(t){setTimeout(t,17)};function ht(){return it||(ut(dt),it=st.now()+at)}function dt(){it=0}function lt(){this._call=this._time=this._next=null}function ct(t,e,r){var n=new lt;return n.restart(t,e,r),n}function ft(){it=(ot=st.now())+at,tt=et=0;try{!function(){ht(),++tt;for(var t,e=Q;e;)(t=it-e._time)>=0&&e._call.call(void 0,t),e=e._next;--tt}()}finally{tt=0,function(){for(var t,e,r=Q,n=1/0;r;)r._call?(n>r._time&&(n=r._time),t=r,r=r._next):(e=r._next,r._next=null,r=t?t._next=e:Q=e);Z=t,pt(n)}(),it=0}}function gt(){var t=st.now(),e=t-ot;e>nt&&(at-=e,ot=t)}function pt(t){tt||(et&&(et=clearTimeout(et)),t-it>24?(t<1/0&&(et=setTimeout(ft,t-st.now()-at)),rt&&(rt=clearInterval(rt))):(rt||(ot=st.now(),rt=setInterval(gt,nt)),tt=1,ut(ft)))}lt.prototype=ct.prototype={constructor:lt,restart:function(t,e,r){if(\\\"function\\\"!=typeof t)throw new TypeError(\\\"callback is not a function\\\");r=(null==r?ht():+r)+(null==e?0:+e),this._next||Z===this||(Z?Z._next=this:Q=this,Z=this),this._call=t,this._time=r,pt()},stop:function(){this._call&&(this._call=null,this._time=1/0,pt())}};const vt=1664525,yt=1013904223,mt=4294967296;function wt(t){return t.x}function xt(t){return t.y}var Et=10,Nt=Math.PI*(3-Math.sqrt(5));function bt(t){var e,r=1,n=.001,o=1-Math.pow(n,1/300),i=0,a=.6,s=new Map,u=ct(l),h=X(\\\"tick\\\",\\\"end\\\"),d=function(){let t=1;return()=>(t=(vt*t+yt)%mt)/mt}();function l(){c(),h.call(\\\"tick\\\",e),r<n&&(u.stop(),h.call(\\\"end\\\",e))}function c(n){var u,h,d=t.length;void 0===n&&(n=1);for(var l=0;l<n;++l)for(r+=(i-r)*o,s.forEach((function(t){t(r)})),u=0;u<d;++u)null==(h=t[u]).fx?h.x+=h.vx*=a:(h.x=h.fx,h.vx=0),null==h.fy?h.y+=h.vy*=a:(h.y=h.fy,h.vy=0);return e}function f(){for(var e,r=0,n=t.length;r<n;++r){if((e=t[r]).index=r,null!=e.fx&&(e.x=e.fx),null!=e.fy&&(e.y=e.fy),isNaN(e.x)||isNaN(e.y)){var o=Et*Math.sqrt(.5+r),i=r*Nt;e.x=o*Math.cos(i),e.y=o*Math.sin(i)}(isNaN(e.vx)||isNaN(e.vy))&&(e.vx=e.vy=0)}}function g(e){return e.initialize&&e.initialize(t,d),e}return null==t&&(t=[]),f(),e={tick:c,restart:function(){return u.restart(l),e},stop:function(){return u.stop(),e},nodes:function(r){return arguments.length?(t=r,f(),s.forEach(g),e):t},alpha:function(t){return arguments.length?(r=+t,e):r},alphaMin:function(t){return arguments.length?(n=+t,e):n},alphaDecay:function(t){return arguments.length?(o=+t,e):+o},alphaTarget:function(t){return arguments.length?(i=+t,e):i},velocityDecay:function(t){return arguments.length?(a=1-t,e):1-a},randomSource:function(t){return arguments.length?(d=t,s.forEach(g),e):d},force:function(t,r){return arguments.length>1?(null==r?s.delete(t):s.set(t,g(r)),e):s.get(t)},find:function(e,r,n){var o,i,a,s,u,h=0,d=t.length;for(null==n?n=1/0:n*=n,h=0;h<d;++h)(a=(o=e-(s=t[h]).x)*o+(i=r-s.y)*i)<n&&(u=s,n=a);return u},on:function(t,r){return arguments.length>1?(h.on(t,r),e):h.on(t)}}}function Mt(){var t,e,r,n,o,i=W(-30),a=1,s=1/0,u=.81;function h(r){var o,i=t.length,a=F(t,wt,xt).visitAfter(l);for(n=r,o=0;o<i;++o)e=t[o],a.visit(c)}function d(){if(t){var e,r,n=t.length;for(o=new Array(n),e=0;e<n;++e)r=t[e],o[r.index]=+i(r,e,t)}}function l(t){var e,r,n,i,a,s=0,u=0;if(t.length){for(n=i=a=0;a<4;++a)(e=t[a])&&(r=Math.abs(e.value))&&(s+=e.value,u+=r,n+=r*e.x,i+=r*e.y);t.x=n/u,t.y=i/u}else{(e=t).x=e.data.x,e.y=e.data.y;do{s+=o[e.data.index]}while(e=e.next)}t.value=s}function c(t,i,h,d){if(!t.value)return!0;var l=t.x-e.x,c=t.y-e.y,f=d-i,g=l*l+c*c;if(f*f/u<g)return g<s&&(0===l&&(g+=(l=$(r))*l),0===c&&(g+=(c=$(r))*c),g<a&&(g=Math.sqrt(a*g)),e.vx+=l*t.value*n/g,e.vy+=c*t.value*n/g),!0;if(!(t.length||g>=s)){(t.data!==e||t.next)&&(0===l&&(g+=(l=$(r))*l),0===c&&(g+=(c=$(r))*c),g<a&&(g=Math.sqrt(a*g)));do{t.data!==e&&(f=o[t.data.index]*n/g,e.vx+=l*f,e.vy+=c*f)}while(t=t.next)}}return h.initialize=function(e,n){t=e,r=n,d()},h.strength=function(t){return arguments.length?(i=\\\"function\\\"==typeof t?t:W(+t),d(),h):i},h.distanceMin=function(t){return arguments.length?(a=t*t,h):Math.sqrt(a)},h.distanceMax=function(t){return arguments.length?(s=t*t,h):Math.sqrt(s)},h.theta=function(t){return arguments.length?(u=t*t,h):Math.sqrt(u)},h}function St(t){return t.index}function kt(t,e){var r=t.get(e);if(!r)throw new Error(\\\"node not found: \\\"+e);return r}function At(t){var e,r,n,o,i,a,s=St,u=function(t){return 1/Math.min(o[t.source.index],o[t.target.index])},h=W(30),d=1;function l(n){for(var o=0,s=t.length;o<d;++o)for(var u,h,l,c,f,g,p,v=0;v<s;++v)h=(u=t[v]).source,c=(l=u.target).x+l.vx-h.x-h.vx||$(a),f=l.y+l.vy-h.y-h.vy||$(a),c*=g=((g=Math.sqrt(c*c+f*f))-r[v])/g*n*e[v],f*=g,l.vx-=c*(p=i[v]),l.vy-=f*p,h.vx+=c*(p=1-p),h.vy+=f*p}function c(){if(n){var a,u,h=n.length,d=t.length,l=new Map(n.map(((t,e)=>[s(t,e,n),t])));for(a=0,o=new Array(h);a<d;++a)(u=t[a]).index=a,\\\"object\\\"!=typeof u.source&&(u.source=kt(l,u.source)),\\\"object\\\"!=typeof u.target&&(u.target=kt(l,u.target)),o[u.source.index]=(o[u.source.index]||0)+1,o[u.target.index]=(o[u.target.index]||0)+1;for(a=0,i=new Array(d);a<d;++a)u=t[a],i[a]=o[u.source.index]/(o[u.source.index]+o[u.target.index]);e=new Array(d),f(),r=new Array(d),g()}}function f(){if(n)for(var r=0,o=t.length;r<o;++r)e[r]=+u(t[r],r,t)}function g(){if(n)for(var e=0,o=t.length;e<o;++e)r[e]=+h(t[e],e,t)}return null==t&&(t=[]),l.initialize=function(t,e){n=t,a=e,c()},l.links=function(e){return arguments.length?(t=e,c(),l):t},l.id=function(t){return arguments.length?(s=t,l):s},l.iterations=function(t){return arguments.length?(d=+t,l):d},l.strength=function(t){return arguments.length?(u=\\\"function\\\"==typeof t?t:W(+t),f(),l):u},l.distance=function(t){return arguments.length?(h=\\\"function\\\"==typeof t?t:W(+t),g(),l):h},l}function _t(t){return t.x+t.vx}function zt(t){return t.y+t.vy}function Rt(t){var e,r,n,o=1,i=1;function a(){for(var t,a,u,h,d,l,c,f=e.length,g=0;g<i;++g)for(a=F(e,_t,zt).visitAfter(s),t=0;t<f;++t)u=e[t],l=r[u.index],c=l*l,h=u.x+u.vx,d=u.y+u.vy,a.visit(p);function p(t,e,r,i,a){var s=t.data,f=t.r,g=l+f;if(!s)return e>h+g||i<h-g||r>d+g||a<d-g;if(s.index>u.index){var p=h-s.x-s.vx,v=d-s.y-s.vy,y=p*p+v*v;y<g*g&&(0===p&&(y+=(p=$(n))*p),0===v&&(y+=(v=$(n))*v),y=(g-(y=Math.sqrt(y)))/y*o,u.vx+=(p*=y)*(g=(f*=f)/(c+f)),u.vy+=(v*=y)*g,s.vx-=p*(g=1-g),s.vy-=v*g)}}}function s(t){if(t.data)return t.r=r[t.data.index];for(var e=t.r=0;e<4;++e)t[e]&&t[e].r>t.r&&(t.r=t[e].r)}function u(){if(e){var n,o,i=e.length;for(r=new Array(i),n=0;n<i;++n)o=e[n],r[o.index]=+t(o,n,e)}}return\\\"function\\\"!=typeof t&&(t=W(null==t?1:+t)),a.initialize=function(t,r){e=t,n=r,u()},a.iterations=function(t){return arguments.length?(i=+t,a):i},a.strength=function(t){return arguments.length?(o=+t,a):o},a.radius=function(e){return arguments.length?(t=\\\"function\\\"==typeof e?e:W(+e),u(),a):t},a}function It(t){var e,r,n,o=W(.1);function i(t){for(var o,i=0,a=e.length;i<a;++i)(o=e[i]).vx+=(n[i]-o.x)*r[i]*t}function a(){if(e){var i,a=e.length;for(r=new Array(a),n=new Array(a),i=0;i<a;++i)r[i]=isNaN(n[i]=+t(e[i],i,e))?0:+o(e[i],i,e)}}return\\\"function\\\"!=typeof t&&(t=W(null==t?0:+t)),i.initialize=function(t){e=t,a()},i.strength=function(t){return arguments.length?(o=\\\"function\\\"==typeof t?t:W(+t),a(),i):o},i.x=function(e){return arguments.length?(t=\\\"function\\\"==typeof e?e:W(+e),a(),i):t},i}function Dt(t){var e,r,n,o=W(.1);function i(t){for(var o,i=0,a=e.length;i<a;++i)(o=e[i]).vy+=(n[i]-o.y)*r[i]*t}function a(){if(e){var i,a=e.length;for(r=new Array(a),n=new Array(a),i=0;i<a;++i)r[i]=isNaN(n[i]=+t(e[i],i,e))?0:+o(e[i],i,e)}}return\\\"function\\\"!=typeof t&&(t=W(null==t?0:+t)),i.initialize=function(t){e=t,a()},i.strength=function(t){return arguments.length?(o=\\\"function\\\"==typeof t?t:W(+t),a(),i):o},i.y=function(e){return arguments.length?(t=\\\"function\\\"==typeof e?e:W(+e),a(),i):t},i}function Ot(){function t(t){return function(){return t}}var e,r=function(t){return t.cluster},n=t(1),o=t(-1),i=t(100),a=t(.1),u=[0,0],h=[],d={},l=[],c=100,f=100,g={none:{x:0,y:0}},p=[],v=\\\"force\\\",y=!0,m=.1;function w(t){if(!y)return w;e.tick(),E();for(var n=0,o=h.length,i=void 0,a=t*m;n<o;++n)(i=h[n]).vx+=(g[r(i)].x-i.x)*a,i.vy+=(g[r(i)].y-i.y)*a}function x(){h&&function(){if(h&&h.length){if(void 0===r(h[0]))throw Error(\\\"Couldnt find the grouping attribute for the nodes. Make sure to set it up with forceInBox.groupBy('clusterAttr') before calling .links()\\\");var t,u,g,v,y,m=(t=[],u=[],g={},{},y=[],v=function(t){var e={};return t.forEach((function(t){var n=r(t);e[n]||(e[n]={count:0,sumforceNodeSize:0})})),t.forEach((function(t){var o=r(t),i=n(t),a=e[o];a.count=a.count+1,a.sumforceNodeSize=a.sumforceNodeSize+Math.PI*(i*i)*1.3,e[o]=a})),e}(h),y=function(t){var e={},n=[];return t.forEach((function(t){var n,o,i,a,s,u=(o=(n=t).source,i=n.target,(a=r(d[o]))<=(s=r(d[i]))?a+\\\"~\\\"+s:s+\\\"~\\\"+a),h=0;void 0!==e[u]&&(h=e[u]),h+=1,e[u]=h})),Object.entries(e).forEach((function(t){var e=s(t,2),r=e[0],o=e[1],i=r.split(\\\"~\\\")[0],a=r.split(\\\"~\\\")[1];void 0!==i&&void 0!==a&&n.push({source:i,target:a,count:o})})),n}(l),Object.keys(v).forEach((function(e,r){var n=v[e];t.push({id:e,size:n.count,r:Math.sqrt(n.sumforceNodeSize/Math.PI)}),g[e]=r})),y.forEach((function(t){var e=t.source,r=t.target,n=g[e],o=g[r];void 0!==n&&void 0!==o&&u.push({source:n,target:o,count:t.count})})),{nodes:t,links:u});e=bt(m.nodes).force(\\\"x\\\",It(c).strength(.1)).force(\\\"y\\\",Dt(f).strength(.1)).force(\\\"collide\\\",Rt((function(t){return t.r})).iterations(4)).force(\\\"charge\\\",Mt().strength(o)).force(\\\"links\\\",At(m.nodes.length?m.links:[]).distance(i).strength(a)),p=e.nodes(),E()}}()}function E(){return g={none:{x:0,y:0}},p.forEach((function(t){g[t.id]={x:t.x-u[0],y:t.y-u[1]}})),g}return w.initialize=function(t){h=t,x()},w.template=function(t){return arguments.length?(v=t,x(),w):v},w.groupBy=function(t){return arguments.length?\\\"string\\\"==typeof t?(r=function(e){return e[t]},w):(r=t,w):r},w.enableGrouping=function(t){return arguments.length?(y=t,w):y},w.strength=function(t){return arguments.length?(m=t,w):m},w.centerX=function(t){return arguments.length?(c=t,w):c},w.centerY=function(t){return arguments.length?(f=t,w):f},w.nodes=function(t){return arguments.length?(function(t){d={},t.forEach((function(t){d[t.id]=t}))}(t||[]),h=t||[],w):h},w.links=function(t){return arguments.length?(l=t||[],x(),w):l},w.forceNodeSize=function(e){return arguments.length?(n=\\\"function\\\"==typeof e?e:t(+e),x(),w):n},w.nodeSize=w.forceNodeSize,w.forceCharge=function(e){return arguments.length?(o=\\\"function\\\"==typeof e?e:t(+e),x(),w):o},w.forceLinkDistance=function(e){return arguments.length?(i=\\\"function\\\"==typeof e?e:t(+e),x(),w):i},w.forceLinkStrength=function(e){return arguments.length?(a=\\\"function\\\"==typeof e?e:t(+e),x(),w):a},w.offset=function(t){return arguments.length?(u=t,w):u},w.getFocis=E,w}var Pt={center:[0,0],preventOverlap:!1,nodeSize:void 0,nodeSpacing:void 0,linkDistance:50,forceSimulation:null,alphaDecay:.028,alphaMin:.001,alpha:.3,collideStrength:1,clustering:!1,clusterNodeStrength:-1,clusterEdgeStrength:.1,clusterEdgeDistance:100,clusterFociStrength:.8,clusterNodeSize:10},Tt=function(){function t(t){void 0===t&&(t={}),this.options=t,this.id=\\\"d3force\\\",this.options=n(n({},Pt),t)}return t.prototype.execute=function(t,e){return i(this,void 0,void 0,(function(){return a(this,(function(r){return[2,this.genericForceLayout(!1,t,e)]}))}))},t.prototype.assign=function(t,e){return i(this,void 0,void 0,(function(){return a(this,(function(r){return this.genericForceLayout(!0,t,e),[2]}))}))},t.prototype.stop=function(){var t;null===(t=this.forceSimulation)||void 0===t||t.stop()},t.prototype.tick=function(t){var e=this;void 0===t&&(t=1),this.forceSimulation.tick(t);var r={nodes:Ct(this.lastLayoutNodes),edges:qt(this.lastLayoutEdges)};return this.lastAssign&&r.nodes.forEach((function(t){return e.lastGraph.mergeNodeData(t.id,{x:t.data.x,y:t.data.y})})),r},t.prototype.genericForceLayout=function(t,e,r){return i(this,void 0,void 0,(function(){var o,i,s,u,h,d,l,c,f,g,p,v,y,m,w,x,E,b,M,S,k,A,_,z,R,I,D=this;return a(this,(function(a){return o=n(n({},this.options),r),i=e.getAllNodes(),s=e.getAllEdges(),u=i.map((function(t){var e,r;return n(n({},N(t)),{x:null===(e=t.data)||void 0===e?void 0:e.x,y:null===(r=t.data)||void 0===r?void 0:r.y})})),h=s.map((function(t){return N(t)})),this.lastLayoutNodes=u,this.lastLayoutEdges=h,this.lastAssign=t,this.lastGraph=e,d=o.alphaMin,l=o.alphaDecay,c=o.alpha,f=o.nodeStrength,g=o.edgeStrength,p=o.linkDistance,v=o.clustering,y=o.clusterFociStrength,m=o.clusterEdgeDistance,w=o.clusterEdgeStrength,x=o.clusterNodeStrength,E=o.clusterNodeSize,b=o.collideStrength,M=void 0===b?1:b,S=o.center,k=void 0===S?[0,0]:S,A=o.preventOverlap,_=o.nodeSize,z=o.nodeSpacing,R=o.onTick,I=o.forceSimulation,[2,new Promise((function(r){if(I){v&&((i=Ot()).nodes(u),i.links(h)),I.nodes(u),h&&(s=At().id((function(t){return t.id})).links(h),g&&s.strength(g),p&&s.distance(p),I.force(\\\"link\\\",s)),A&&D.overlapProcess(I,{nodeSize:_,nodeSpacing:z,collideStrength:M}),I.alpha(c).restart();var n=Ct(u),o=qt(h);t&&n.forEach((function(t){return e.mergeNodeData(t.id,{x:t.data.x,y:t.data.y})})),r({nodes:n,edges:o})}else try{var i,a=Mt();if(f&&a.strength(f),I=bt().nodes(u),v&&((i=Ot()).centerX(k[0]).centerY(k[1]).template(\\\"force\\\").strength(y),h&&i.links(h),u&&i.nodes(u),i.forceLinkDistance(m).forceLinkStrength(w).forceCharge(x).forceNodeSize(E),I.force(\\\"group\\\",i)),I.force(\\\"center\\\",function(t,e){var r,n=1;function o(){var o,i,a=r.length,s=0,u=0;for(o=0;o<a;++o)s+=(i=r[o]).x,u+=i.y;for(s=(s/a-t)*n,u=(u/a-e)*n,o=0;o<a;++o)(i=r[o]).x-=s,i.y-=u}return null==t&&(t=0),null==e&&(e=0),o.initialize=function(t){r=t},o.x=function(e){return arguments.length?(t=+e,o):t},o.y=function(t){return arguments.length?(e=+t,o):e},o.strength=function(t){return arguments.length?(n=+t,o):n},o}(k[0],k[1])).force(\\\"charge\\\",a).alpha(c).alphaDecay(l).alphaMin(d),A&&D.overlapProcess(I,{nodeSize:_,nodeSpacing:z,collideStrength:M}),h){var s=At().id((function(t){return t.id})).links(h);g&&s.strength(g),p&&s.distance(p),I.force(\\\"link\\\",s)}I.on(\\\"tick\\\",(function(){var r=Ct(u);null==R||R({nodes:r,edges:qt(h)}),t&&r.forEach((function(t){return e.mergeNodeData(t.id,{x:t.data.x,y:t.data.y})}))})).on(\\\"end\\\",(function(){var n=Ct(u);t&&n.forEach((function(t){return e.mergeNodeData(t.id,{x:t.data.x,y:t.data.y})})),r({nodes:n,edges:qt(h)})}))}catch(t){console.warn(t)}D.forceSimulation=I}))]}))}))},t.prototype.overlapProcess=function(t,e){var r,n,o=e.nodeSize,i=e.nodeSpacing,a=e.collideStrength;if(n=x(i)?function(){return i}:b(i)?i:function(){return 0},o)if(b(o))r=function(t){return o(t)+n(t)};else if(g(o)){var s=(o[0]>o[1]?o[0]:o[1])/2;r=function(t){return s+n(t)}}else if(x(o)){var u=o/2;r=function(t){return u+n(t)}}else r=function(){return 10};else r=function(t){return t.size?g(t.size)?(t.size[0]>t.size[1]?t.size[0]:t.size[1])/2+n(t):M(t.size)?(t.size.width>t.size.height?t.size.width:t.size.height)/2+n(t):t.size/2+n(t):10+n(t)};t.force(\\\"collisionForce\\\",Rt(r).strength(a))},t}(),Ct=function(t){return t.map((function(t){var e=t.x,r=t.y,i=o(t,[\\\"x\\\",\\\"y\\\"]);return n(n({},i),{data:n(n({},i.data),{x:e,y:r})})}))},qt=function(t){return t.map((function(t){var e=t.source,r=t.target,i=o(t,[\\\"source\\\",\\\"target\\\"]);return n(n({},i),{source:e.id,target:r.id})}))};var Lt=function(t,e){if(\\\"next\\\"!==t&&\\\"prev\\\"!==t)return e},jt=function(t){t.prev.next=t.next,t.next.prev=t.prev,delete t.next,delete t.prev},Ft=function(t){function e(){return null!==t&&t.apply(this,arguments)||this}return function(t,e){if(\\\"function\\\"!=typeof e&&null!==e)throw new TypeError(\\\"Class extends value \\\"+String(e)+\\\" is not a constructor or null\\\");function n(){this.constructor=t}r(t,e),t.prototype=null===e?Object.create(e):(n.prototype=e.prototype,new n)}(e,t),e}(function(){function t(){var t={};t.prev=t,t.next=t.prev,this.shortcut=t}return t.prototype.dequeue=function(){var t=this.shortcut,e=t.prev;if(e&&e!==t)return jt(e),e},t.prototype.enqueue=function(t){var e=this.shortcut;t.prev&&t.next&&jt(t),t.next=e.next,e.next.prev=t,e.next=t,t.prev=e},t.prototype.toString=function(){for(var t=[],e=this.shortcut,r=e.prev;r!==e;)t.push(JSON.stringify(r,Lt)),r=null==r?void 0:r.prev;return\\\"[\\\"+t.join(\\\", \\\")+\\\"]\\\"},t}()),Vt=function(){return 1},Bt=function(t,e,r,o,i){var a,s,u=[];return t.hasNode(o.v)&&(null===(a=t.getRelatedEdges(o.v,\\\"in\\\"))||void 0===a||a.forEach((function(o){var a=o.data.weight,s=t.getNode(o.source);i&&u.push({v:o.source,w:o.target,in:0,out:0}),void 0===s.data.out&&(s.data.out=0),s.data.out-=a,Gt(e,r,n({v:s.id},s.data))})),null===(s=t.getRelatedEdges(o.v,\\\"out\\\"))||void 0===s||s.forEach((function(o){var i=o.data.weight,a=o.target,s=t.getNode(a);void 0===s.data.in&&(s.data.in=0),s.data.in-=i,Gt(e,r,n({v:s.id},s.data))})),t.removeNode(o.v)),i?u:void 0},Gt=function(t,e,r){r.out?r.in?t[r.out-r.in+e].enqueue(r):t[t.length-1].enqueue(r):t[0].enqueue(r)},Wt=function(t,e){var r=\\\"greedy\\\"===e?function(t,e){var r;if(t.getAllNodes().length<=1)return[];var o=function(t,e){var r=new c,o=0,i=0;t.getAllNodes().forEach((function(t){r.addNode({id:t.id,data:{v:t.id,in:0,out:0}})})),t.getAllEdges().forEach((function(t){var a=r.getRelatedEdges(t.source,\\\"out\\\").find((function(e){return e.target===t.target})),s=(null==e?void 0:e(t))||1;a?r.updateEdgeData(null==a?void 0:a.id,n(n({},a.data),{weight:a.data.weight+s})):r.addEdge({id:t.id,source:t.source,target:t.target,data:{weight:s}}),i=Math.max(i,r.getNode(t.source).data.out+=s),o=Math.max(o,r.getNode(t.target).data.in+=s)}));for(var a=[],s=i+o+3,u=0;u<s;u++)a.push(new Ft);var h=o+1;return r.getAllNodes().forEach((function(t){Gt(a,h,n({v:t.id},r.getNode(t.id).data))})),{buckets:a,zeroIdx:h,graph:r}}(t,function(t){return t.data.weight||1}||Vt);return null===(r=function(t,e,r){for(var n,o=[],i=e[e.length-1],a=e[0];t.getAllNodes().length;){for(;n=a.dequeue();)Bt(t,e,r,n);for(;n=i.dequeue();)Bt(t,e,r,n);if(t.getAllNodes().length)for(var s=e.length-2;s>0;--s)if(n=e[s].dequeue()){o=o.concat(Bt(t,e,r,n,!0));break}}return o}(o.graph,o.buckets,o.zeroIdx).map((function(e){return t.getRelatedEdges(e.v,\\\"out\\\").filter((function(t){return t.target===e.w}))})))||void 0===r?void 0:r.flat()}(t):$t(t);null==r||r.forEach((function(e){var r=e.data;t.removeEdge(e.id),r.forwardName=e.data.name,r.reversed=!0,t.addEdge({id:e.id,source:e.target,target:e.source,data:n({},r)})}))},$t=function(t){var e=[],r={},n={},o=function(i){n[i]||(n[i]=!0,r[i]=!0,t.getRelatedEdges(i,\\\"out\\\").forEach((function(t){r[t.target]?e.push(t):o(t.target)})),delete r[i])};return t.getAllNodes().forEach((function(t){return o(t.id)})),e},Ut=function(t,e,r,n){var o;do{o=\\\"\\\"+n+Math.random()}while(t.hasNode(o));return r.dummy=e,t.addNode({id:o,data:r}),o},Ht=function(t){var e=new c;return t.getAllNodes().forEach((function(r){t.getChildren(r.id).length||e.addNode(n({},r))})),t.getAllEdges().forEach((function(t){e.addEdge(t)})),e},Kt=function(t,e){var r,n,o=Number(t.x),i=Number(t.y),a=Number(e.x)-o,s=Number(e.y)-i,u=Number(t.width)/2,h=Number(t.height)/2;return a||s?(Math.abs(s)*u>Math.abs(a)*h?(s<0&&(h=-h),r=h*a/s,n=h):(a<0&&(u=-u),r=u,n=u*s/a),{x:o+r,y:i+n}):{x:0,y:0}},Yt=function(t){for(var e=[],r=Xt(t)+1,n=0;n<r;n++)e.push([]);for(t.getAllNodes().forEach((function(t){var r=t.data.rank;void 0!==r&&e[r]&&e[r].push(t.id)})),n=0;n<r;n++)e[n]=e[n].sort((function(e,r){return n=t.getNode(e).data.order,o=t.getNode(r).data.order,Number(n)-Number(o);var n,o}));return e},Jt=function(t,e,r,n){var o={width:0,height:0};return x(r)&&x(n)&&(o.rank=r,o.order=n),Ut(t,\\\"border\\\",o,e)},Xt=function(t){var e;return t.getAllNodes().forEach((function(t){var r=t.data.rank;void 0!==r&&(void 0===e||r>e)&&(e=r)})),e||(e=0),e},Qt=function(t,e){return t.reduce((function(t,r){return e(t)>e(r)?r:t}))},Zt=function(t,e,r,n,o,i){n.includes(e.id)||(n.push(e.id),r||i.push(e.id),o(e.id).forEach((function(e){return Zt(t,e,r,n,o,i)})),r&&i.push(e.id))},te=function(t,e,r,n){var o=Array.isArray(e)?e:[e],i=function(e){return n?t.getSuccessors(e):t.getNeighbors(e)},a=[],s=[];return o.forEach((function(e){if(!t.hasNode(e.id))throw new Error(\\\"Graph does not have node: \\\"+e);Zt(t,e,\\\"post\\\"===r,s,i,a)})),a},ee=\\\"edge-label\\\",re=function(t){var e={},r=function(n){var o,i,a=t.getNode(n);return a?e[n]?a.data.rank:(e[n]=!0,null===(o=t.getRelatedEdges(n,\\\"out\\\"))||void 0===o||o.forEach((function(t){var e=r(t.target)-t.data.minlen;e&&(void 0===i||e<i)&&(i=e)})),i||(i=0),a.data.rank=i,i):0};t.getAllNodes().filter((function(e){return 0===t.getRelatedEdges(e.id,\\\"in\\\").length})).forEach((function(t){return r(t.id)}))},ne=function(t,e){return t.getNode(e.target).data.rank-t.getNode(e.source).data.rank-e.data.minlen},oe=function(t,e){var r=function(n){e.getRelatedEdges(n,\\\"both\\\").forEach((function(o){var i=o.source,a=n===i?o.target:i;t.hasNode(a)||ne(e,o)||(t.addNode({id:a,data:{}}),t.addEdge({id:o.id,source:n,target:a,data:{}}),r(a))}))};return t.getAllNodes().forEach((function(t){return r(t.id)})),t.getAllNodes().length},ie=function(t,e){var r=function(n){var o;null===(o=e.getRelatedEdges(n,\\\"both\\\"))||void 0===o||o.forEach((function(o){var i=o.source,a=n===i?o.target:i;t.hasNode(a)||void 0===e.getNode(a).data.layer&&ne(e,o)||(t.addNode({id:a,data:{}}),t.addEdge({id:o.id,source:n,target:a,data:{}}),r(a))}))};return t.getAllNodes().forEach((function(t){return r(t.id)})),t.getAllNodes().length},ae=function(t,e){return Qt(e.getAllEdges(),(function(r){return t.hasNode(r.source)!==t.hasNode(r.target)?ne(e,r):1/0}))},se=function(t,e,r){t.getAllNodes().forEach((function(t){var n=e.getNode(t.id);n.data.rank||(n.data.rank=0),n.data.rank+=r}))},ue=function(t,e){var r=te(t,t.getAllNodes(),\\\"post\\\",!1);(r=r.slice(0,(null==r?void 0:r.length)-1)).forEach((function(r){he(t,e,r)}))},he=function(t,e,r){var n=t.getNode(r).data.parent;t.getRelatedEdges(r,\\\"both\\\").find((function(t){return t.target===n||t.source===n})).data.cutvalue=de(t,e,r)},de=function(t,e,r){var n=t.getNode(r).data.parent,o=!0,i=e.getRelatedEdges(r,\\\"out\\\").find((function(t){return t.target===n})),a=0;return i||(o=!1,i=e.getRelatedEdges(n,\\\"out\\\").find((function(t){return t.target===r}))),a=i.data.weight,e.getRelatedEdges(r,\\\"both\\\").forEach((function(e){var i=e.source===r,s=i?e.target:e.source;if(s!==n){var u=i===o,h=e.data.weight;if(a+=u?h:-h,ye(t,r,s)){var d=t.getRelatedEdges(r,\\\"both\\\").find((function(t){return t.source===s||t.target===s})).data.cutvalue;a+=u?-d:d}}})),a},le=function(t,e){void 0===e&&(e=t.getAllNodes()[0].id),ce(t,{},1,e)},ce=function(t,e,r,n,o){var i,a=r,s=r,u=t.getNode(n);return e[n]=!0,null===(i=t.getNeighbors(n))||void 0===i||i.forEach((function(r){e[r.id]||(s=ce(t,e,s,r.id,n))})),u.data.low=a,u.data.lim=s++,o?u.data.parent=o:delete u.data.parent,s},fe=function(t){return t.getAllEdges().find((function(t){return t.data.cutvalue<0}))},ge=function(t,e,r){var n=r.source,o=r.target;e.getRelatedEdges(n,\\\"out\\\").find((function(t){return t.target===o}))||(n=r.target,o=r.source);var i=t.getNode(n),a=t.getNode(o),s=i,u=!1;i.data.lim>a.data.lim&&(s=a,u=!0);var h=e.getAllEdges().filter((function(e){return u===me(t.getNode(e.source),s)&&u!==me(t.getNode(e.target),s)}));return Qt(h,(function(t){return ne(e,t)}))},pe=function(t,e,r,n){var o=t.getRelatedEdges(r.source,\\\"both\\\").find((function(t){return t.source===r.target||t.target===r.target}));o&&t.removeEdge(o.id),t.addEdge({id:\\\"e\\\"+Math.random(),source:n.source,target:n.target,data:{}}),le(t),ue(t,e),ve(t,e)},ve=function(t,e){var r=t.getAllNodes().find((function(t){return!t.data.parent})),n=te(t,r,\\\"pre\\\",!1);(n=n.slice(1)).forEach((function(r){var n=t.getNode(r).data.parent,o=e.getRelatedEdges(r,\\\"out\\\").find((function(t){return t.target===n})),i=!1;!o&&e.hasNode(n)&&(o=e.getRelatedEdges(n,\\\"out\\\").find((function(t){return t.target===r})),i=!0),e.getNode(r).data.rank=(e.hasNode(n)&&e.getNode(n).data.rank||0)+(i?null==o?void 0:o.data.minlen:-(null==o?void 0:o.data.minlen))}))},ye=function(t,e,r){return t.getRelatedEdges(e,\\\"both\\\").find((function(t){return t.source===r||t.target===r}))},me=function(t,e){return e.data.low<=t.data.lim&&t.data.lim<=e.data.lim},we=re,xe=function(t){!function(t){var e=function(t){var e=new c;return t.getAllNodes().forEach((function(t){e.addNode(n({},t))})),t.getAllEdges().forEach((function(t){var r=e.getRelatedEdges(t.source,\\\"out\\\").find((function(e){return e.target===t.target}));r?e.updateEdgeData(null==r?void 0:r.id,n(n({},r.data),{weight:r.data.weight+t.data.weight||0,minlen:Math.max(r.data.minlen,t.data.minlen||1)})):e.addEdge({id:t.id,source:t.source,target:t.target,data:{weight:t.data.weight||0,minlen:t.data.minlen||1}})})),e}(t);re(e);var r,o,i=function(t){var e,r,n=new c({tree:[]}),o=t.getAllNodes()[0],i=t.getAllNodes().length;for(n.addNode(o);oe(n,t)<i;)e=ae(n,t),r=n.hasNode(e.source)?ne(t,e):-ne(t,e),se(n,t,r);return n}(e);for(le(i),ue(i,e);r=fe(i);)o=ge(i,e,r),pe(i,e,r,o)}(t)},Ee=function(t,e,r,n,o,i,a){var s=t.getChildren(a);if(null==s?void 0:s.length){var u=Jt(t,\\\"_bt\\\"),h=Jt(t,\\\"_bb\\\"),d=t.getNode(a);t.setParent(u,a),d.data.borderTop=u,t.setParent(h,a),d.data.borderBottom=h,null==s||s.forEach((function(s){Ee(t,e,r,n,o,i,s.id);var d=s.data.borderTop?s.data.borderTop:s.id,l=s.data.borderBottom?s.data.borderBottom:s.id,c=s.data.borderTop?n:2*n,f=d!==l?1:o-i[a]+1;t.addEdge({id:\\\"e\\\"+Math.random(),source:u,target:d,data:{minlen:f,weight:c,nestingEdge:!0}}),t.addEdge({id:\\\"e\\\"+Math.random(),source:l,target:h,data:{minlen:f,weight:c,nestingEdge:!0}})})),t.getParent(a)||t.addEdge({id:\\\"e\\\"+Math.random(),source:e,target:u,data:{weight:0,minlen:o+i[a]}})}else a!==e&&t.addEdge({id:\\\"e\\\"+Math.random(),source:e,target:a,data:{weight:0,minlen:r}})},Ne=function(t,e,r,n,o,i){var a={rank:i,borderType:e,width:0,height:0},s=o.data[e][i-1],u=Ut(t,\\\"border\\\",a,r);o.data[e][i]=u,t.setParent(u,n),s&&t.addEdge({id:\\\"e\\\"+Math.random(),source:s,target:u,data:{weight:1}})},be=function(t){t.getAllNodes().forEach((function(t){Me(t)})),t.getAllEdges().forEach((function(t){Me(t)}))},Me=function(t){var e=t.data.width;t.data.width=t.data.height,t.data.height=e},Se=function(t){(null==t?void 0:t.y)&&(t.y=-t.y)},ke=function(t){var e=t.x;t.x=t.y,t.y=e},Ae=function(t){for(var e={},r=t.getAllNodes(),n=r.map((function(t){var e;return null!==(e=t.data.rank)&&void 0!==e?e:-1/0})),o=Math.max.apply(Math,u([],s(n))),i=[],a=0;a<o+1;a++)i.push([]);var h=r.sort((function(e,r){return t.getNode(e.id).data.rank-t.getNode(r.id).data.rank})),d=h.filter((function(e){return void 0!==t.getNode(e.id).data.fixorder})).sort((function(e,r){return t.getNode(e.id).data.fixorder-t.getNode(r.id).data.fixorder}));return null==d||d.forEach((function(r){isNaN(t.getNode(r.id).data.rank)||i[t.getNode(r.id).data.rank].push(r.id),e[r.id]=!0})),null==h||h.forEach((function(r){return t.dfsTree(r.id,(function(t){if(e.hasOwnProperty(t.id))return!0;e[t.id]=!0,isNaN(t.data.rank)||i[t.data.rank].push(t.id)}))})),i},_e=function(t,e,r){for(var n=function(t,e){return null==t?void 0:t.reduce((function(t,r,n){return t[r]=e[n],t}),{})}(r,r.map((function(t,e){return e}))),o=e.map((function(e){var r=t.getRelatedEdges(e,\\\"out\\\").map((function(t){return{pos:n[t.target]||0,weight:t.data.weight}}));return null==r?void 0:r.sort((function(t,e){return t.pos-e.pos}))})),i=o.flat().filter((function(t){return void 0!==t})),a=1;a<r.length;)a<<=1;var s=2*a-1;a-=1;var u=Array(s).fill(0,0,s),h=0;return null==i||i.forEach((function(t){if(t){var e=t.pos+a;u[e]+=t.weight;for(var r=0;e>0;)e%2&&(r+=u[e+1]),u[e=e-1>>1]+=t.weight;h+=t.weight*r}})),h},ze=function(t,e){for(var r=0,n=1;n<(null==e?void 0:e.length);n+=1)r+=_e(t,e[n-1],e[n]);return r},Re=function(t,e){var r,n=0,o=0;t.weight&&(n+=t.barycenter*t.weight,o+=t.weight),e.weight&&(n+=e.barycenter*e.weight,o+=e.weight),t.vs=null===(r=e.vs)||void 0===r?void 0:r.concat(t.vs),t.barycenter=n/o,t.weight=o,t.i=Math.min(e.i,t.i),e.merged=!0};const Ie=function(t,e){var r,n,o,i={};return null==t||t.forEach((function(t,e){i[t.v]={i:e,indegree:0,in:[],out:[],vs:[t.v]};var r=i[t.v];void 0!==t.barycenter&&(r.barycenter=t.barycenter,r.weight=t.weight)})),null===(r=e.getAllEdges())||void 0===r||r.forEach((function(t){var e=i[t.source],r=i[t.target];void 0!==e&&void 0!==r&&(r.indegree++,e.out.push(i[t.target]))})),function(t){for(var e,r,n=[],o=function(){var o=t.pop();n.push(o),null===(e=o.in.reverse())||void 0===e||e.forEach((function(t){return(e=o,function(t){t.merged||(void 0===t.barycenter||void 0===e.barycenter||t.barycenter>=e.barycenter)&&Re(e,t)})(t);var e})),null===(r=o.out)||void 0===r||r.forEach((function(e){return(r=o,function(e){e.in.push(r),0==--e.indegree&&t.push(e)})(e);var r}))};null==t?void 0:t.length;)o();var i=n.filter((function(t){return!t.merged})),a=[\\\"vs\\\",\\\"i\\\",\\\"barycenter\\\",\\\"weight\\\"];return i.map((function(t){var e={};return null==a||a.forEach((function(r){void 0!==t[r]&&(e[r]=t[r])})),e}))}(null===(o=(n=Object.values(i)).filter)||void 0===o?void 0:o.call(n,(function(t){return!t.indegree})))};var De=function(t,e,r){for(var n,o=r;e.length&&(n=e[e.length-1]).i<=o;)e.pop(),null==t||t.push(n.vs),o++;return o},Oe=function(t,e,r,n,o,i){var a,s,u,h,d=t.getChildren(e).map((function(t){return t.id})),l=t.getNode(e),c=l?l.data.borderLeft:void 0,f=l?l.data.borderRight:void 0,g={};c&&(d=null==d?void 0:d.filter((function(t){return t!==c&&t!==f})));var p=function(t,e){return e.map((function(e){var r=t.getRelatedEdges(e,\\\"in\\\");if(!(null==r?void 0:r.length))return{v:e};var n={sum:0,weight:0};return null==r||r.forEach((function(e){var r=t.getNode(e.source);n.sum+=e.data.weight*r.data.order,n.weight+=e.data.weight})),{v:e,barycenter:n.sum/n.weight,weight:n.weight}}))}(t,d||[]);null==p||p.forEach((function(e){var o;if(null===(o=t.getChildren(e.v))||void 0===o?void 0:o.length){var a=Oe(t,e.v,r,n,i);g[e.v]=a,a.hasOwnProperty(\\\"barycenter\\\")&&Te(e,a)}}));var v=Ie(p,r);Pe(v,g),null===(a=v.filter((function(t){return t.vs.length>0})))||void 0===a||a.forEach((function(e){var r=t.getNode(e.vs[0]);r&&(e.fixorder=r.data.fixorder,e.order=r.data.order)}));var y=function(t,e,r,n){var o=function(t,e){var r={lhs:[],rhs:[]};return null==t||t.forEach((function(t){var e,o;o=(e=t).hasOwnProperty(\\\"fixorder\\\")&&!isNaN(e.fixorder),(n?!o&&e.hasOwnProperty(\\\"barycenter\\\"):o||e.hasOwnProperty(\\\"barycenter\\\"))?r.lhs.push(t):r.rhs.push(t)})),r}(t),i=o.lhs,a=o.rhs.sort((function(t,e){return-t.i- -e.i})),s=[],u=0,h=0,d=0;null==i||i.sort(function(t,e){return function(r,n){if(void 0!==r.fixorder&&void 0!==n.fixorder)return r.fixorder-n.fixorder;if(r.barycenter<n.barycenter)return-1;if(r.barycenter>n.barycenter)return 1;if(e&&void 0!==r.order&&void 0!==n.order){if(r.order<n.order)return-1;if(r.order>n.order)return 1}return t?n.i-r.i:r.i-n.i}}(!!e,!!r)),d=De(s,a,d),null==i||i.forEach((function(t){var e;d+=null===(e=t.vs)||void 0===e?void 0:e.length,s.push(t.vs),u+=t.barycenter*t.weight,h+=t.weight,d=De(s,a,d)}));var l={vs:s.flat()};return h&&(l.barycenter=u/h,l.weight=h),l}(v,n,o,i);if(c&&(y.vs=[c,y.vs,f].flat(),null===(s=t.getPredecessors(c))||void 0===s?void 0:s.length)){var m=t.getNode((null===(u=t.getPredecessors(c))||void 0===u?void 0:u[0].id)||\\\"\\\"),w=t.getNode((null===(h=t.getPredecessors(f))||void 0===h?void 0:h[0].id)||\\\"\\\");y.hasOwnProperty(\\\"barycenter\\\")||(y.barycenter=0,y.weight=0),y.barycenter=(y.barycenter*y.weight+m.data.order+w.data.order)/(y.weight+2),y.weight+=2}return y},Pe=function(t,e){null==t||t.forEach((function(t){var r,n=null===(r=t.vs)||void 0===r?void 0:r.map((function(t){return e[t]?e[t].vs:t}));t.vs=n.flat()}))},Te=function(t,e){void 0!==t.barycenter?(t.barycenter=(t.barycenter*t.weight+e.barycenter*e.weight)/(t.weight+e.weight),t.weight+=e.weight):(t.barycenter=e.barycenter,t.weight=e.weight)},Ce=function(t){if(\\\"object\\\"!=typeof t||null===t)return t;var e,r;if(r=t,Array.isArray?Array.isArray(r):w(r,\\\"Array\\\")){e=[];for(var n=0,o=t.length;n<o;n++)\\\"object\\\"==typeof t[n]&&null!=t[n]?e[n]=Ce(t[n]):e[n]=t[n]}else for(var i in e={},t)\\\"object\\\"==typeof t[i]&&null!=t[i]?e[i]=Ce(t[i]):e[i]=t[i];return e};const qe=Ce;var Le=function(t,e,r){return e.map((function(e){return function(t,e,r){var o=function(t){for(var e;t.hasNode(e=\\\"_root\\\"+Math.random()););return e}(t),i=new c({tree:[{id:o,children:[],data:{}}]});return t.getAllNodes().forEach((function(a){var s=t.getParent(a.id);(a.data.rank===e||a.data.minRank<=e&&e<=a.data.maxRank)&&(i.hasNode(a.id)||i.addNode(n({},a)),(null==s?void 0:s.id)&&!i.hasNode(null==s?void 0:s.id)&&i.addNode(n({},s)),i.setParent(a.id,(null==s?void 0:s.id)||o),t.getRelatedEdges(a.id,r).forEach((function(e){var r=e.source===a.id?e.target:e.source;i.hasNode(r)||i.addNode(n({},t.getNode(r)));var o=i.getRelatedEdges(r,\\\"out\\\").find((function(t){return t.target===a.id})),s=void 0!==o?o.data.weight:0;o?i.updateEdgeData(o.id,n(n({},o.data),{weight:e.data.weight+s})):i.addEdge({id:e.id,source:r,target:a.id,data:{weight:e.data.weight+s}})})),a.data.hasOwnProperty(\\\"minRank\\\")&&i.updateNodeData(a.id,n(n({},a.data),{borderLeft:a.data.borderLeft[e],borderRight:a.data.borderRight[e]})))})),i}(t,e,r)}))},je=function(t,e,r,n){var o=new c;null==t||t.forEach((function(t){for(var i,a=t.getRoots()[0].id,s=Oe(t,a,o,e,r,n),u=0;u<(null===(i=s.vs)||void 0===i?void 0:i.length);u++){var h=t.getNode(s.vs[u]);h&&(h.data.order=u)}!function(t,e,r){var n,o={};null==r||r.forEach((function(r){for(var i,a,s=t.getParent(r);s;){if((i=t.getParent(s.id))?(a=o[i.id],o[i.id]=s.id):(a=n,n=s.id),a&&a!==s.id)return e.addNodes([{id:a,data:{}},{id:s.id,data:{}}]),void e.addEdge({id:\\\"e\\\"+a+\\\"-\\\"+s.id,source:a,target:s.id,data:{}});s=i}}))}(t,o,s.vs)}))},Fe=function(t,e){null==e||e.forEach((function(e){null==e||e.forEach((function(e,r){t.getNode(e).data.order=r}))}))},Ve=function(t,e){var r={};function n(e,n,o,i,a){for(var s,u,h,d=n;d<o;d++)h=e[d],(null===(s=t.getNode(h))||void 0===s?void 0:s.data.dummy)&&(null===(u=t.getPredecessors(h))||void 0===u||u.forEach((function(e){var n=t.getNode(e.id);n.data.dummy&&(n.data.order<i||n.data.order>a)&&Ge(r,e.id,h)})))}function o(t,e){var r=function(t){return JSON.stringify(t.slice(1))}(t);e.get(r)||(n.apply(void 0,u([],s(t))),e.set(r,!0))}return(null==e?void 0:e.length)&&e.reduce((function(e,r){var n,i=-1,a=0,s=new Map;return null==r||r.forEach((function(u,h){var d;if(\\\"border\\\"===(null===(d=t.getNode(u))||void 0===d?void 0:d.data.dummy)){var l=t.getPredecessors(u)||[];l.length&&(n=t.getNode(l[0].id).data.order,o([r,a,h,i,n],s),a=h,i=n)}o([r,a,r.length,n,e.length],s)})),r})),r},Be=function(t,e){var r,n;if(null===(r=t.getNode(e))||void 0===r?void 0:r.data.dummy)return null===(n=t.getPredecessors(e))||void 0===n?void 0:n.find((function(e){return t.getNode(e.id).data.dummy}))},Ge=function(t,e,r){var n=e,o=r;if(n>o){var i=n;n=o,o=i}var a=t[n];a||(t[n]=a={}),a[o]=!0},We=function(t,e,r){var n=e;return n>r&&(n=r),!!t[n]},$e=function(t,e,r,o,i,a){var s=new c,u=Ue(o,i,a);return null==e||e.forEach((function(e){var o;null==e||e.forEach((function(e){var i=r[e];if(s.hasNode(i)||s.addNode({id:i,data:{}}),o){var a=r[o],h=s.getRelatedEdges(a,\\\"out\\\").find((function(t){return t.target===i}));h?s.updateEdgeData(h.id,n(n({},h.data),{weight:Math.max(u(t,e,o),h.data.weight||0)})):s.addEdge({id:\\\"e\\\"+Math.random(),source:a,target:i,data:{weight:Math.max(u(t,e,o),0)}})}o=e}))})),s};var Ue=function(t,e,r){return function(n,o,i){var a=n.getNode(o),s=n.getNode(i),u=0,h=0;if(u+=a.data.width/2,a.data.hasOwnProperty(\\\"labelpos\\\"))switch((a.data.labelpos||\\\"\\\").toLowerCase()){case\\\"l\\\":h=-a.data.width/2;break;case\\\"r\\\":h=a.data.width/2}if(h&&(u+=r?h:-h),h=0,u+=(a.data.dummy?e:t)/2,u+=(s.data.dummy?e:t)/2,u+=s.data.width/2,s.data.labelpos)switch((s.data.labelpos||\\\"\\\").toLowerCase()){case\\\"l\\\":h=s.data.width/2;break;case\\\"r\\\":h=-s.data.width/2}return h&&(u+=r?h:-h),h=0,u}},He=function(t,e){return t.getNode(e).data.width||0},Ke=function(t,e){var r,n=Ht(t);!function(t,e){var r=(e||{}).ranksep,n=void 0===r?0:r,o=Yt(t),i=0;null==o||o.forEach((function(e){var r=e.map((function(e){return t.getNode(e).data.height})),o=Math.max.apply(Math,u(u([],s(r)),[0]));null==e||e.forEach((function(e){t.getNode(e).data.y=i+o/2})),i+=o+n}))}(n,e);var o=function(t,e){var r=e||{},n=r.align,o=r.nodesep,i=void 0===o?0:o,a=r.edgesep,h=void 0===a?0:a,d=Yt(t),l=Object.assign(function(t,e){var r={};return(null==e?void 0:e.length)&&e.reduce((function(e,n){var o=0,i=0,a=e.length,s=null==n?void 0:n[(null==n?void 0:n.length)-1];return null==n||n.forEach((function(e,u){var h,d=Be(t,e),l=d?t.getNode(d.id).data.order:a;(d||e===s)&&(null===(h=n.slice(i,u+1))||void 0===h||h.forEach((function(e){var n;null===(n=t.getPredecessors(e))||void 0===n||n.forEach((function(n){var i,a=t.getNode(n.id),s=a.data.order;!(s<o||l<s)||a.data.dummy&&(null===(i=t.getNode(e))||void 0===i?void 0:i.data.dummy)||Ge(r,n.id,e)}))})),i=u+1,o=l)})),n})),r}(t,d),Ve(t,d)),c={},f=[];[\\\"u\\\",\\\"d\\\"].forEach((function(e){f=\\\"u\\\"===e?d:Object.values(d).reverse(),[\\\"l\\\",\\\"r\\\"].forEach((function(r){\\\"r\\\"===r&&(f=f.map((function(t){return Object.values(t).reverse()})));var n=(\\\"u\\\"===e?t.getPredecessors:t.getSuccessors).bind(t),o=function(t,e,r,n){var o={},i={},a={};return null==e||e.forEach((function(t){null==t||t.forEach((function(t,e){o[t]=t,i[t]=t,a[t]=e}))})),null==e||e.forEach((function(t){var e=-1;null==t||t.forEach((function(t){var s=n(t).map((function(t){return t.id}));if(s.length){s=s.sort((function(t,e){return a[t]-a[e]}));for(var u=(s.length-1)/2,h=Math.floor(u),d=Math.ceil(u);h<=d;++h){var l=s[h];i[t]===t&&e<a[l]&&!We(r,t,l)&&(i[l]=t,i[t]=o[t]=o[l],e=a[l])}}}))})),{root:o,align:i}}(0,f,l,n),a=function(t,e,r,n,o,i,a){var s,u={},h=$e(t,e,r,o,i,a),d=a?\\\"borderLeft\\\":\\\"borderRight\\\",l=function(t,e){for(var r=h.getAllNodes(),n=r.pop(),o={};n;)o[n.id]?t(n.id):(o[n.id]=!0,r.push(n),r=r.concat(e(n.id))),n=r.pop()};return l((function(t){u[t]=(h.getRelatedEdges(t,\\\"in\\\")||[]).reduce((function(t,e){return Math.max(t,(u[e.source]||0)+e.data.weight)}),0)}),h.getPredecessors.bind(h)),l((function(e){var r=(h.getRelatedEdges(e,\\\"out\\\")||[]).reduce((function(t,e){return Math.min(t,(u[e.target]||0)-e.data.weight)}),Number.POSITIVE_INFINITY),n=t.getNode(e);r!==Number.POSITIVE_INFINITY&&n.data.borderType!==d&&(u[e]=Math.max(u[e],r))}),h.getSuccessors.bind(h)),null===(s=Object.values(n))||void 0===s||s.forEach((function(t){u[t]=u[r[t]]})),u}(t,f,o.root,o.align,i,h,\\\"r\\\"===r);\\\"r\\\"===r&&Object.keys(a).forEach((function(t){return a[t]=-a[t]})),c[e+r]=a}))}));var g=function(t,e){return Qt(Object.values(e),(function(e){var r,n=Number.NEGATIVE_INFINITY,o=Number.POSITIVE_INFINITY;return null===(r=Object.keys(e))||void 0===r||r.forEach((function(r){var i=e[r],a=He(t,r)/2;n=Math.max(i+a,n),o=Math.min(i-a,o)})),n-o}))}(t,c);return g&&function(t,e){var r=Object.values(e),n=Math.min.apply(Math,u([],s(r))),o=Math.max.apply(Math,u([],s(r)));[\\\"u\\\",\\\"d\\\"].forEach((function(r){[\\\"l\\\",\\\"r\\\"].forEach((function(i){var a,h=r+i,d=t[h];if(d!==e){var l=Object.values(d);(a=\\\"l\\\"===i?n-Math.min.apply(Math,u([],s(l))):o-Math.max.apply(Math,u([],s(l))))&&(t[h]={},Object.keys(d).forEach((function(e){t[h][e]=d[e]+a})))}}))}))}(c,g),function(t,e){var r={};return Object.keys(t.ul).forEach((function(n){if(e)r[n]=t[e.toLowerCase()][n];else{var o=Object.values(t).map((function(t){return t[n]}));r[n]=(o[0]+o[1])/2}})),r}(c,n)}(n,e);null===(r=Object.keys(o))||void 0===r||r.forEach((function(t){n.getNode(t).data.x=o[t]}))},Ye=function(t,e){var r=e.acyclicer,o=e.ranker,i=e.rankdir,a=void 0===i?\\\"tb\\\":i,h=e.nodeOrder,d=e.keepNodeOrder,l=e.align,f=e.nodesep,g=void 0===f?50:f,p=e.edgesep,v=void 0===p?20:p,y=e.ranksep,m=void 0===y?50:y;hr(t),Wt(t,r);var w=function(t){var e=Ut(t,\\\"root\\\",{},\\\"_root\\\"),r=function(t){var e={},r=function(n,o){var i=t.getChildren(n);null==i||i.forEach((function(t){return r(t.id,o+1)})),e[n]=o};return t.getRoots().forEach((function(t){return r(t.id,1)})),e}(t),n=Math.max.apply(Math,u([],s(Object.values(r))));Math.abs(n)===1/0&&(n=1);var o=n-1,i=2*o+1;t.getAllEdges().forEach((function(t){t.data.minlen*=i}));var a=function(t){var e=0;return t.getAllEdges().forEach((function(t){e+=t.data.weight})),e}(t)+1;return t.getRoots().forEach((function(n){Ee(t,e,i,a,o,r,n.id)})),{nestingRoot:e,nodeRankFactor:i}}(t),x=w.nestingRoot,E=w.nodeRankFactor;!function(t,e){switch(e){case\\\"network-simplex\\\":xe(t);break;case\\\"tight-tree\\\":default:!function(t){!function(t){var e,r={},n=function(o){var i,a,s=t.getNode(o);return s?r[o]?s.data.rank:(r[o]=!0,null===(i=t.getRelatedEdges(o,\\\"out\\\"))||void 0===i||i.forEach((function(t){var e=n(t.target)-t.data.minlen;e&&(void 0===a||e<a)&&(a=e)})),a||(a=0),(void 0===e||a<e)&&(e=a),s.data.rank=a,a):0};t.getAllNodes().filter((function(e){return 0===t.getRelatedEdges(e.id,\\\"in\\\").length})).forEach((function(t){t&&n(t.id)})),void 0===e&&(e=0);var o={},i=function(e,r){var n,a=t.getNode(e),s=isNaN(a.data.layer)?r:a.data.layer;(void 0===a.data.rank||a.data.rank<s)&&(a.data.rank=s),o[e]||(o[e]=!0,null===(n=t.getRelatedEdges(e,\\\"out\\\"))||void 0===n||n.forEach((function(t){i(t.target,s+t.data.minlen)})))};t.getAllNodes().forEach((function(t){var r=t.data;r&&(isNaN(r.layer)?r.rank-=e:i(t.id,r.layer))}))}(t),function(t){var e,r,n=new c({tree:[]}),o=t.getAllNodes()[0],i=t.getAllNodes().length;for(n.addNode(o);ie(n,t)<i;)e=ae(n,t),r=n.hasNode(e.source)?ne(t,e):-ne(t,e),se(n,t,r)}(t)}(t);break;case\\\"longest-path\\\":we(t)}}(Ht(t),o),er(t),function(t,e){void 0===e&&(e=0);var r=t.getAllNodes(),n=r.filter((function(t){return void 0!==t.data.rank})).map((function(t){return t.data.rank})),o=Math.min.apply(Math,u([],s(n))),i=[];r.forEach((function(t){var e=(t.data.rank||0)-o;i[e]||(i[e]=[]),i[e].push(t.id)}));for(var a=0,h=0;h<i.length;h++){var d=i[h];void 0===d?h%e!=0&&(a-=1):a&&(null==d||d.forEach((function(e){var r=t.getNode(e);r&&(r.data.rank=r.data.rank||0,r.data.rank+=a)})))}}(t,E),function(t,e){e&&t.removeNode(e),t.getAllEdges().forEach((function(e){e.data.nestingEdge&&t.removeEdge(e.id)}))}(t,x),function(t){var e=t.getAllNodes().filter((function(t){return void 0!==t.data.rank})).map((function(t){return t.data.rank})),r=Math.min.apply(Math,u([],s(e)));t.getAllNodes().forEach((function(t){t.data.hasOwnProperty(\\\"rank\\\")&&r!==1/0&&(t.data.rank-=r)}))}(t),rr(t),nr(t);var N=[];!function(t,e){t.getAllEdges().forEach((function(r){return function(t,e,r){var n=e.source,o=t.getNode(n).data.rank,i=e.target,a=t.getNode(i).data.rank,s=e.data.labelRank;if(a!==o+1){var u,h,d;for(t.removeEdge(e.id),d=0,++o;o<a;++d,++o)e.data.points=[],u=Ut(t,\\\"edge\\\",h={originalEdge:e,width:0,height:0,rank:o},\\\"_d\\\"),o===s&&(h.width=e.data.width,h.height=e.data.height,h.dummy=ee,h.labelpos=e.data.labelpos),t.addEdge({id:\\\"e\\\"+Math.random(),source:n,target:u,data:{weight:e.data.weight}}),0===d&&r.push(u),n=u;t.addEdge({id:\\\"e\\\"+Math.random(),source:n,target:i,data:{weight:e.data.weight}})}}(t,r,e)}))}(t,N),function(t,e){var r=function(t){var e={},r=0,n=function(o){var i=r;t.getChildren(o).forEach((function(t){return n(t.id)})),e[o]={low:i,lim:r++}};return t.getRoots().forEach((function(t){return n(t.id)})),e}(t);e.forEach((function(e){var n,o,i=e,a=t.getNode(i),s=a.data.originalEdge;if(s)for(var u=function(t,e,r,n){var o,i,a,s,u=[],h=[],d=Math.min(e[r].low,e[n].low),l=Math.max(e[r].lim,e[n].lim);a=r;do{a=null===(o=t.getParent(a))||void 0===o?void 0:o.id,u.push(a)}while(a&&(e[a].low>d||l>e[a].lim));for(s=a,a=n;a&&a!==s;)h.push(a),a=null===(i=t.getParent(a))||void 0===i?void 0:i.id;return{lca:s,path:u.concat(h.reverse())}}(t,r,s.source,s.target),h=u.path,d=u.lca,l=0,c=h[l],f=!0;i!==s.target;){if(a=t.getNode(i),f){for(;c!==d&&(null===(n=t.getNode(c))||void 0===n?void 0:n.data.maxRank)<a.data.rank;)c=h[++l];c===d&&(f=!1)}if(!f){for(;l<h.length-1&&(null===(o=t.getNode(h[l+1]))||void 0===o?void 0:o.data.minRank)<=a.data.rank;)l++;c=h[l]}t.hasNode(c)&&t.setParent(i,c),i=t.getSuccessors(i)[0].id}}))}(t,N),function(t){var e=function(r){var n=t.getChildren(r),o=t.getNode(r);if((null==n?void 0:n.length)&&n.forEach((function(t){return e(t.id)})),o.data.hasOwnProperty(\\\"minRank\\\")){o.data.borderLeft=[],o.data.borderRight=[];for(var i=o.data.minRank,a=o.data.maxRank+1;i<a;i+=1)Ne(t,\\\"borderLeft\\\",\\\"_bl\\\",r,o,i),Ne(t,\\\"borderRight\\\",\\\"_br\\\",r,o,i)}};t.getRoots().forEach((function(t){return e(t.id)}))}(t),d&&function(t,e){for(var r=t.getAllNodes().filter((function(e){var r;return!(null===(r=t.getChildren(e.id))||void 0===r?void 0:r.length)})).map((function(t){return t.data.rank})),n=Math.max.apply(Math,u([],s(r))),o=[],i=0;i<n+1;i++)o[i]=[];null==e||e.forEach((function(e){var r=t.getNode(e);r&&!r.data.dummy&&(isNaN(r.data.rank)||(r.data.fixorder=o[r.data.rank].length,o[r.data.rank].push(e)))}))}(t,h),function(t,e){for(var r=Xt(t),n=[],o=[],i=1;i<r+1;i++)n.push(i);for(i=r-1;i>-1;i--)o.push(i);var a=Le(t,n,\\\"in\\\"),s=Le(t,o,\\\"out\\\"),u=Ae(t);Fe(t,u);for(var h,d=Number.POSITIVE_INFINITY,l=(i=0,0);l<4;++i,++l)je(i%2?a:s,i%4>=2,!1,e),u=Yt(t),(c=ze(t,u))<d&&(l=0,h=qe(u),d=c);for(u=Ae(t),Fe(t,u),i=0,l=0;l<4;++i,++l){var c;je(i%2?a:s,i%4>=2,!0,e),u=Yt(t),(c=ze(t,u))<d&&(l=0,h=qe(u),d=c)}Fe(t,h)}(t,d),dr(t),function(t,e){var r=e.toLowerCase();\\\"lr\\\"!==r&&\\\"rl\\\"!==r||be(t)}(t,a),Ke(t,{align:l,nodesep:g,edgesep:v,ranksep:m}),lr(t),ur(t),function(t,e){e.forEach((function(e){var r,n=t.getNode(e),o=n.data.originalEdge;o&&t.addEdge(o);for(var i=e;n.data.dummy;)r=t.getSuccessors(i)[0],t.removeNode(i),o.data.points.push({x:n.data.x,y:n.data.y}),n.data.dummy===ee&&(o.data.x=n.data.x,o.data.y=n.data.y,o.data.width=n.data.width,o.data.height=n.data.height),i=r.id,n=t.getNode(i)}))}(t,N),ar(t),function(t,e){var r=e.toLowerCase();\\\"bt\\\"!==r&&\\\"rl\\\"!==r||function(t){t.getAllNodes().forEach((function(t){Se(t.data)})),t.getAllEdges().forEach((function(t){var e;null===(e=t.data.points)||void 0===e||e.forEach((function(t){return Se(t)})),t.data.hasOwnProperty(\\\"y\\\")&&Se(t.data)}))}(t),\\\"lr\\\"!==r&&\\\"rl\\\"!==r||(function(t){t.getAllNodes().forEach((function(t){ke(t.data)})),t.getAllEdges().forEach((function(t){var e;null===(e=t.data.points)||void 0===e||e.forEach((function(t){return ke(t)})),t.data.hasOwnProperty(\\\"x\\\")&&ke(t.data)}))}(t),be(t))}(t,a);var b=or(t),M=b.width,S=b.height;return ir(t),sr(t),function(t){t.getAllEdges().forEach((function(e){var r=e.data;if(r.reversed){t.removeEdge(e.id);var o=r.forwardName;delete r.reversed,delete r.forwardName,t.addEdge({id:e.id,source:e.target,target:e.source,data:n(n({},r),{forwardName:o})})}}))}(t),{width:M,height:S}},Je=[\\\"width\\\",\\\"height\\\",\\\"layer\\\",\\\"fixorder\\\"],Xe={width:0,height:0},Qe=[\\\"minlen\\\",\\\"weight\\\",\\\"width\\\",\\\"height\\\",\\\"labeloffset\\\"],Ze={minlen:1,weight:1,width:0,height:0,labeloffset:10,labelpos:\\\"r\\\"},tr=[\\\"labelpos\\\"],er=function(t){t.getAllEdges().forEach((function(e){if(e.data.width&&e.data.height){var r=t.getNode(e.source),n={e,rank:(t.getNode(e.target).data.rank-r.data.rank)/2+r.data.rank};Ut(t,\\\"edge-proxy\\\",n,\\\"_ep\\\")}}))},rr=function(t){var e=0;return t.getAllNodes().forEach((function(r){var n,o;r.data.borderTop&&(r.data.minRank=null===(n=t.getNode(r.data.borderTop))||void 0===n?void 0:n.data.rank,r.data.maxRank=null===(o=t.getNode(r.data.borderBottom))||void 0===o?void 0:o.data.rank,e=Math.max(e,r.data.maxRank||-1/0))})),e},nr=function(t){t.getAllNodes().forEach((function(e){\\\"edge-proxy\\\"===e.data.dummy&&(t.getEdge(e.data.e.id).data.labelRank=e.data.rank,t.removeNode(e.id))}))},or=function(t,e){var r,n,o=0,i=0,a=e||{},s=a.marginx,u=void 0===s?0:s,h=a.marginy,d=void 0===h?0:h,l=function(t){if(t.data){var e=t.data.x,a=t.data.y,s=t.data.width,u=t.data.height;isNaN(e)||isNaN(s)||(void 0===r&&(r=e-s/2),r=Math.min(r,e-s/2),o=Math.max(o,e+s/2)),isNaN(a)||isNaN(u)||(void 0===n&&(n=a-u/2),n=Math.min(n,a-u/2),i=Math.max(i,a+u/2))}};return t.getAllNodes().forEach((function(t){l(t)})),t.getAllEdges().forEach((function(t){(null==t?void 0:t.data.hasOwnProperty(\\\"x\\\"))&&l(t)})),r-=u,n-=d,t.getAllNodes().forEach((function(t){t.data.x-=r,t.data.y-=n})),t.getAllEdges().forEach((function(t){var e;null===(e=t.data.points)||void 0===e||e.forEach((function(t){t.x-=r,t.y-=n})),t.data.hasOwnProperty(\\\"x\\\")&&(t.data.x-=r),t.data.hasOwnProperty(\\\"y\\\")&&(t.data.y-=n)})),{width:o-r+u,height:i-n+d}},ir=function(t){t.getAllEdges().forEach((function(e){var r,n,o=t.getNode(e.source),i=t.getNode(e.target);e.data.points?(r=e.data.points[0],n=e.data.points[e.data.points.length-1]):(e.data.points=[],r={x:i.data.x,y:i.data.y},n={x:o.data.x,y:o.data.y}),e.data.points.unshift(Kt(o.data,r)),e.data.points.push(Kt(i.data,n))}))},ar=function(t){t.getAllEdges().forEach((function(t){if(t.data.hasOwnProperty(\\\"x\\\"))switch(\\\"l\\\"!==t.data.labelpos&&\\\"r\\\"!==t.data.labelpos||(t.data.width-=t.data.labeloffset),t.data.labelpos){case\\\"l\\\":t.data.x-=t.data.width/2+t.data.labeloffset;break;case\\\"r\\\":t.data.x+=t.data.width/2+t.data.labeloffset}}))},sr=function(t){t.getAllEdges().forEach((function(t){var e;t.data.reversed&&(null===(e=t.data.points)||void 0===e||e.reverse())}))},ur=function(t){t.getAllNodes().forEach((function(e){var r,n,o;if(null===(r=t.getChildren(e.id))||void 0===r?void 0:r.length){var i=t.getNode(e.id),a=t.getNode(i.data.borderTop),s=t.getNode(i.data.borderBottom),u=t.getNode(i.data.borderLeft[(null===(n=i.data.borderLeft)||void 0===n?void 0:n.length)-1]),h=t.getNode(i.data.borderRight[(null===(o=i.data.borderRight)||void 0===o?void 0:o.length)-1]);i.data.width=Math.abs((null==h?void 0:h.data.x)-(null==u?void 0:u.data.x))||10,i.data.height=Math.abs((null==s?void 0:s.data.y)-(null==a?void 0:a.data.y))||10,i.data.x=((null==u?void 0:u.data.x)||0)+i.data.width/2,i.data.y=((null==a?void 0:a.data.y)||0)+i.data.height/2}})),t.getAllNodes().forEach((function(e){\\\"border\\\"===e.data.dummy&&t.removeNode(e.id)}))},hr=function(t){t.getAllEdges().forEach((function(e){if(e.source===e.target){var r=t.getNode(e.source);r.data.selfEdges||(r.data.selfEdges=[]),r.data.selfEdges.push(e),t.removeEdge(e.id)}}))},dr=function(t){var e=Yt(t);null==e||e.forEach((function(e){var r=0;null==e||e.forEach((function(e,n){var o,i=t.getNode(e);i.data.order=n+r,null===(o=i.data.selfEdges)||void 0===o||o.forEach((function(e){Ut(t,\\\"selfedge\\\",{width:e.data.width,height:e.data.height,rank:i.data.rank,order:n+ ++r,e},\\\"_se\\\")})),delete i.data.selfEdges}))}))},lr=function(t){t.getAllNodes().forEach((function(e){var r=t.getNode(e.id);if(\\\"selfedge\\\"===r.data.dummy){var n=t.getNode(r.data.e.source),o=n.data.x+n.data.width/2,i=n.data.y,a=r.data.x-o,s=n.data.height/2;t.hasEdge(r.data.e.id)?t.updateEdgeData(r.data.e.id,r.data.e.data):t.addEdge({id:r.data.e.id,source:r.data.e.source,target:r.data.e.target,data:r.data.e.data}),t.removeNode(e.id),r.data.e.data.points=[{x:o+2*a/3,y:i-s},{x:o+5*a/6,y:i-s},{y:i,x:o+a},{x:o+5*a/6,y:i+s},{x:o+2*a/3,y:i+s}],r.data.e.data.x=r.data.x,r.data.e.data.y=r.data.y}}))},cr=function(t,e){var r={};return null==e||e.forEach((function(e){void 0!==t[e]&&(r[e]=+t[e])})),r},fr=function(t){void 0===t&&(t={});var e={};return Object.keys(t).forEach((function(r){e[r.toLowerCase()]=t[r]})),e},gr={rankdir:\\\"TB\\\",nodesep:50,ranksep:50,edgeLabelSpace:!0,controlPoints:!1,radial:!1,focusNode:null},pr=function(){function t(t){void 0===t&&(t={}),this.options=t,this.id=\\\"dagre\\\",this.layoutNode=function(t){return t.data.layout},this.options=n(n({},gr),t)}return t.prototype.execute=function(t,e){return i(this,void 0,void 0,(function(){return a(this,(function(r){return[2,this.genericDagreLayout(!1,t,e)]}))}))},t.prototype.assign=function(t,e){return i(this,void 0,void 0,(function(){return a(this,(function(r){switch(r.label){case 0:return[4,this.genericDagreLayout(!0,t,e)];case 1:return r.sent(),[2]}}))}))},t.prototype.genericDagreLayout=function(t,e,r){return i(this,void 0,void 0,(function(){var o,i,s,u,h,d,l,f,g,p,v,y,m,w,E,b,M,k,_,z,R,I,D,O,P,T,C,q,L,j,F,V,B,G=this;return a(this,(function(a){return o=n(n({},this.options),r),i=o.nodeSize,s=o.align,u=o.rankdir,h=void 0===u?\\\"TB\\\":u,d=o.ranksep,l=o.nodesep,f=o.ranksepFunc,g=o.nodesepFunc,p=o.edgeLabelSpace,v=o.nodeOrder,y=o.begin,m=o.controlPoints,w=o.radial,E=new c({tree:[]}),b=S(d||50,f),M=S(l||50,g),k=M,_=b,\\\"LR\\\"!==h&&\\\"RL\\\"!==h||(k=b,_=M),z=A(i,void 0),R=e.getAllNodes(),I=e.getAllEdges(),R.filter((function(t){return t.data.layout})).forEach((function(t){var e=z(t),r=_(t),n=e+2*k(t),o=e+2*r,i=t.data.layer;x(i)?E.addNode({id:t.id,data:{width:n,height:o,layer:i}}):E.addNode({id:t.id,data:{width:n,height:o}})})),I.forEach((function(t){G.layoutNode(E.getNode(t.source))&&G.layoutNode(E.getNode(t.target))&&E.addEdge({id:t.id,source:t.source,target:t.target,data:{weight:t.data.weight||1}})})),function(t,e){var r,o,i=e.edgeLabelSpace,a=e.keepNodeOrder,s=e.prevGraph,u=e.rankdir,h=e.ranksep;!a&&s&&(o=s,(r=t).getAllNodes().forEach((function(t){var e=r.getNode(t.id),n=o.getNode(t.id);void 0!==n?(e.data.fixorder=n.data._order,delete n.data._order):delete e.data.fixorder})));var d=function(t){var e=new c({tree:[]});return t.getAllNodes().forEach((function(r){var o=fr(t.getNode(r.id).data),i=n(n({},Xe),o),a=cr(i,Je);e.hasNode(r.id)||e.addNode({id:r.id,data:n({},a)});var s=t.getParent(r.id);null==s||(e.hasNode(s.id)||e.addNode(n({},s)),e.setParent(r.id,s.id))})),t.getAllEdges().forEach((function(r){var n=fr(t.getEdge(r.id).data),o={};null==tr||tr.forEach((function(t){void 0!==n[t]&&(o[t]=n[t])})),e.addEdge({id:r.id,source:r.source,target:r.target,data:Object.assign({},Ze,cr(n,Qe),o)})})),e}(t);i&&(e.ranksep=function(t,e){var r=e.ranksep,n=void 0===r?0:r,o=e.rankdir;return t.getAllNodes().forEach((function(t){isNaN(t.data.layer)||t.data.layer||(t.data.layer=0)})),t.getAllEdges().forEach((function(t){var e;t.data.minlen*=2,\\\"c\\\"!==(null===(e=t.data.labelpos)||void 0===e?void 0:e.toLowerCase())&&(\\\"TB\\\"===o||\\\"BT\\\"===o?t.data.width+=t.data.labeloffset:t.data.height+=t.data.labeloffset)})),n/2}(d,{rankdir:u,ranksep:h}));try{Ye(d,e)}catch(t){if(\\\"Not possible to find intersection inside of the rectangle\\\"===t.message)return void console.error(\\\"The following error may be caused by improper layer setting, please make sure your manual layer setting does not violate the graph's structure:\\\\n\\\",t);throw t}!function(t,e){t.getAllNodes().forEach((function(r){var n,o=t.getNode(r.id);if(o){var i=e.getNode(r.id);o.data.x=i.data.x,o.data.y=i.data.y,o.data._order=i.data.order,o.data._rank=i.data.rank,(null===(n=e.getChildren(r.id))||void 0===n?void 0:n.length)&&(o.data.width=i.data.width,o.data.height=i.data.height)}})),t.getAllEdges().forEach((function(r){var n=t.getEdge(r.id),o=e.getEdge(r.id);n.data.points=o?o.data.points:[],o&&o.data.hasOwnProperty(\\\"x\\\")&&(n.data.x=o.data.x,n.data.y=o.data.y)}))}(t,d)}(E,{prevGraph:null,edgeLabelSpace:p,keepNodeOrder:!!v,nodeOrder:v||[],acyclicer:\\\"greedy\\\",ranker:\\\"network-simplex\\\",rankdir:h,nodesep:l,align:s}),D=[0,0],y&&(O=1/0,P=1/0,E.getAllNodes().forEach((function(t){O>t.data.x&&(O=t.data.x),P>t.data.y&&(P=t.data.y)})),E.getAllEdges().forEach((function(t){var e;null===(e=t.data.points)||void 0===e||e.forEach((function(t){O>t.x&&(O=t.x),P>t.y&&(P=t.y)}))})),D[0]=y[0]-O,D[1]=y[1]-P),T=\\\"LR\\\"===h||\\\"RL\\\"===h,w||(C=new Set,q=\\\"BT\\\"===h||\\\"RL\\\"===h?function(t,e){return e-t}:function(t,e){return t-e},E.getAllNodes().forEach((function(t){t.data.x=t.data.x+D[0],t.data.y=t.data.y+D[1],C.add(T?t.data.x:t.data.y)})),L=Array.from(C).sort(q),j=T?function(t,e){return t.x!==e.x}:function(t,e){return t.y!==e.y},F=T?function(t,e,r){var n=Math.max(e.y,r.y),o=Math.min(e.y,r.y);return t.filter((function(t){return t.y<=n&&t.y>=o}))}:function(t,e,r){var n=Math.max(e.x,r.x),o=Math.min(e.x,r.x);return t.filter((function(t){return t.x<=n&&t.x>=o}))},E.getAllEdges().forEach((function(t,e){var r;p&&m&&\\\"loop\\\"!==t.data.type&&(t.data.controlPoints=vr(null===(r=t.data.points)||void 0===r?void 0:r.map((function(t){var e=t.x,r=t.y;return{x:e+D[0],y:r+D[1]}})),E.getNode(t.source),E.getNode(t.target),L,T,j,F))}))),V=[],V=E.getAllNodes().map((function(t){return N(t)})),B=E.getAllEdges(),t&&(V.forEach((function(t){e.mergeNodeData(t.id,{x:t.data.x,y:t.data.y})})),B.forEach((function(t){e.mergeEdgeData(t.id,{controlPoints:t.data.controlPoints})}))),[2,{nodes:V,edges:B}]}))}))},t}(),vr=function(t,e,r,n,o,i,a){var s=(null==t?void 0:t.slice(1,t.length-1))||[];if(e&&r){var u=e.data,h=u.x,d=u.y,l=r.data,c=l.x,f=l.y;if(o&&(h=e.data.y,d=e.data.x,c=r.data.y,f=r.data.x),f!==d&&h!==c){var g=n.indexOf(d),p=n[g+1];if(p){var v=s[0],y=o?{x:(d+p)/2,y:(null==v?void 0:v.y)||c}:{x:(null==v?void 0:v.x)||c,y:(d+p)/2};v&&!i(v,y)||s.unshift(y)}var m=n.indexOf(f),w=Math.abs(m-g);if(1===w)(s=a(s,e.data,r.data)).length||s.push(o?{x:(d+f)/2,y:h}:{x:h,y:(d+f)/2});else if(w>1){var x=n[m-1];if(x){var E=s[s.length-1],N=o?{x:(f+x)/2,y:(null==E?void 0:E.y)||c}:{x:(null==E?void 0:E.x)||h,y:(f+x)/2};E&&!i(E,N)||s.push(N)}}}}return s};function yr(t,e,r,n,o){if(isNaN(e)||isNaN(r)||isNaN(n))return t;var i,a,s,u,h,d,l,c,f,g,p,v,y=t._root,m={data:o},w=t._x0,x=t._y0,E=t._z0,N=t._x1,b=t._y1,M=t._z1;if(!y)return t._root=m,t;for(;y.length;)if((c=e>=(a=(w+N)/2))?w=a:N=a,(f=r>=(s=(x+b)/2))?x=s:b=s,(g=n>=(u=(E+M)/2))?E=u:M=u,i=y,!(y=y[p=g<<2|f<<1|c]))return i[p]=m,t;if(h=+t._x.call(null,y.data),d=+t._y.call(null,y.data),l=+t._z.call(null,y.data),e===h&&r===d&&n===l)return m.next=y,i?i[p]=m:t._root=m,t;do{i=i?i[p]=new Array(8):t._root=new Array(8),(c=e>=(a=(w+N)/2))?w=a:N=a,(f=r>=(s=(x+b)/2))?x=s:b=s,(g=n>=(u=(E+M)/2))?E=u:M=u}while((p=g<<2|f<<1|c)==(v=(l>=u)<<2|(d>=s)<<1|h>=a));return i[v]=y,i[p]=m,t}function mr(t,e,r,n,o,i,a){this.node=t,this.x0=e,this.y0=r,this.z0=n,this.x1=o,this.y1=i,this.z1=a}function wr(t){return t[0]}function xr(t){return t[1]}function Er(t){return t[2]}function Nr(t,e,r,n){var o=new br(null==e?wr:e,null==r?xr:r,null==n?Er:n,NaN,NaN,NaN,NaN,NaN,NaN);return null==t?o:o.addAll(t)}function br(t,e,r,n,o,i,a,s,u){this._x=t,this._y=e,this._z=r,this._x0=n,this._y0=o,this._z0=i,this._x1=a,this._y1=s,this._z1=u,this._root=void 0}function Mr(t){for(var e={data:t.data},r=e;t=t.next;)r=r.next={data:t.data};return e}var Sr=Nr.prototype=br.prototype;function kr(t){var e=0,r=0,n=0,o=0,i=t.length;if(i){for(var a=0;a<i;a++)(s=t[a])&&s.weight&&(e+=s.weight,r+=s.x*s.weight,n+=s.y*s.weight,o+=s.z*s.weight);t.x=r/e,t.y=n/e,t.z=o/e,t.weight=e}else{var s=t;t.x=s.data.x,t.y=s.data.y,t.z=s.data.z,t.weight=s.data.weight}}Sr.copy=function(){var t,e,r=new br(this._x,this._y,this._z,this._x0,this._y0,this._z0,this._x1,this._y1,this._z1),n=this._root;if(!n)return r;if(!n.length)return r._root=Mr(n),r;for(t=[{source:n,target:r._root=new Array(8)}];n=t.pop();)for(var o=0;o<8;++o)(e=n.source[o])&&(e.length?t.push({source:e,target:n.target[o]=new Array(8)}):n.target[o]=Mr(e));return r},Sr.add=function(t){const e=+this._x.call(null,t),r=+this._y.call(null,t),n=+this._z.call(null,t);return yr(this.cover(e,r,n),e,r,n,t)},Sr.addAll=function(t){Array.isArray(t)||(t=Array.from(t));const e=t.length,r=new Float64Array(e),n=new Float64Array(e),o=new Float64Array(e);let i=1/0,a=1/0,s=1/0,u=-1/0,h=-1/0,d=-1/0;for(let l,c,f,g,p=0;p<e;++p)isNaN(c=+this._x.call(null,l=t[p]))||isNaN(f=+this._y.call(null,l))||isNaN(g=+this._z.call(null,l))||(r[p]=c,n[p]=f,o[p]=g,c<i&&(i=c),c>u&&(u=c),f<a&&(a=f),f>h&&(h=f),g<s&&(s=g),g>d&&(d=g));if(i>u||a>h||s>d)return this;this.cover(i,a,s).cover(u,h,d);for(let i=0;i<e;++i)yr(this,r[i],n[i],o[i],t[i]);return this},Sr.cover=function(t,e,r){if(isNaN(t=+t)||isNaN(e=+e)||isNaN(r=+r))return this;var n=this._x0,o=this._y0,i=this._z0,a=this._x1,s=this._y1,u=this._z1;if(isNaN(n))a=(n=Math.floor(t))+1,s=(o=Math.floor(e))+1,u=(i=Math.floor(r))+1;else{for(var h,d,l=a-n||1,c=this._root;n>t||t>=a||o>e||e>=s||i>r||r>=u;)switch(d=(r<i)<<2|(e<o)<<1|t<n,(h=new Array(8))[d]=c,c=h,l*=2,d){case 0:a=n+l,s=o+l,u=i+l;break;case 1:n=a-l,s=o+l,u=i+l;break;case 2:a=n+l,o=s-l,u=i+l;break;case 3:n=a-l,o=s-l,u=i+l;break;case 4:a=n+l,s=o+l,i=u-l;break;case 5:n=a-l,s=o+l,i=u-l;break;case 6:a=n+l,o=s-l,i=u-l;break;case 7:n=a-l,o=s-l,i=u-l}this._root&&this._root.length&&(this._root=c)}return this._x0=n,this._y0=o,this._z0=i,this._x1=a,this._y1=s,this._z1=u,this},Sr.data=function(){var t=[];return this.visit((function(e){if(!e.length)do{t.push(e.data)}while(e=e.next)})),t},Sr.extent=function(t){return arguments.length?this.cover(+t[0][0],+t[0][1],+t[0][2]).cover(+t[1][0],+t[1][1],+t[1][2]):isNaN(this._x0)?void 0:[[this._x0,this._y0,this._z0],[this._x1,this._y1,this._z1]]},Sr.find=function(t,e,r,n){var o,i,a,s,u,h,d,l,c,f=this._x0,g=this._y0,p=this._z0,v=this._x1,y=this._y1,m=this._z1,w=[],x=this._root;for(x&&w.push(new mr(x,f,g,p,v,y,m)),null==n?n=1/0:(f=t-n,g=e-n,p=r-n,v=t+n,y=e+n,m=r+n,n*=n);l=w.pop();)if(!(!(x=l.node)||(i=l.x0)>v||(a=l.y0)>y||(s=l.z0)>m||(u=l.x1)<f||(h=l.y1)<g||(d=l.z1)<p))if(x.length){var E=(i+u)/2,N=(a+h)/2,b=(s+d)/2;w.push(new mr(x[7],E,N,b,u,h,d),new mr(x[6],i,N,b,E,h,d),new mr(x[5],E,a,b,u,N,d),new mr(x[4],i,a,b,E,N,d),new mr(x[3],E,N,s,u,h,b),new mr(x[2],i,N,s,E,h,b),new mr(x[1],E,a,s,u,N,b),new mr(x[0],i,a,s,E,N,b)),(c=(r>=b)<<2|(e>=N)<<1|t>=E)&&(l=w[w.length-1],w[w.length-1]=w[w.length-1-c],w[w.length-1-c]=l)}else{var M=t-+this._x.call(null,x.data),S=e-+this._y.call(null,x.data),k=r-+this._z.call(null,x.data),A=M*M+S*S+k*k;if(A<n){var _=Math.sqrt(n=A);f=t-_,g=e-_,p=r-_,v=t+_,y=e+_,m=r+_,o=x.data}}return o},Sr.remove=function(t){if(isNaN(i=+this._x.call(null,t))||isNaN(a=+this._y.call(null,t))||isNaN(s=+this._z.call(null,t)))return this;var e,r,n,o,i,a,s,u,h,d,l,c,f,g,p,v=this._root,y=this._x0,m=this._y0,w=this._z0,x=this._x1,E=this._y1,N=this._z1;if(!v)return this;if(v.length)for(;;){if((l=i>=(u=(y+x)/2))?y=u:x=u,(c=a>=(h=(m+E)/2))?m=h:E=h,(f=s>=(d=(w+N)/2))?w=d:N=d,e=v,!(v=v[g=f<<2|c<<1|l]))return this;if(!v.length)break;(e[g+1&7]||e[g+2&7]||e[g+3&7]||e[g+4&7]||e[g+5&7]||e[g+6&7]||e[g+7&7])&&(r=e,p=g)}for(;v.data!==t;)if(n=v,!(v=v.next))return this;return(o=v.next)&&delete v.next,n?(o?n.next=o:delete n.next,this):e?(o?e[g]=o:delete e[g],(v=e[0]||e[1]||e[2]||e[3]||e[4]||e[5]||e[6]||e[7])&&v===(e[7]||e[6]||e[5]||e[4]||e[3]||e[2]||e[1]||e[0])&&!v.length&&(r?r[p]=v:this._root=v),this):(this._root=o,this)},Sr.removeAll=function(t){for(var e=0,r=t.length;e<r;++e)this.remove(t[e]);return this},Sr.root=function(){return this._root},Sr.size=function(){var t=0;return this.visit((function(e){if(!e.length)do{++t}while(e=e.next)})),t},Sr.visit=function(t){var e,r,n,o,i,a,s,u,h=[],d=this._root;for(d&&h.push(new mr(d,this._x0,this._y0,this._z0,this._x1,this._y1,this._z1));e=h.pop();)if(!t(d=e.node,n=e.x0,o=e.y0,i=e.z0,a=e.x1,s=e.y1,u=e.z1)&&d.length){var l=(n+a)/2,c=(o+s)/2,f=(i+u)/2;(r=d[7])&&h.push(new mr(r,l,c,f,a,s,u)),(r=d[6])&&h.push(new mr(r,n,c,f,l,s,u)),(r=d[5])&&h.push(new mr(r,l,o,f,a,c,u)),(r=d[4])&&h.push(new mr(r,n,o,f,l,c,u)),(r=d[3])&&h.push(new mr(r,l,c,i,a,s,f)),(r=d[2])&&h.push(new mr(r,n,c,i,l,s,f)),(r=d[1])&&h.push(new mr(r,l,o,i,a,c,f)),(r=d[0])&&h.push(new mr(r,n,o,i,l,c,f))}return this},Sr.visitAfter=function(t){var e,r=[],n=[];for(this._root&&r.push(new mr(this._root,this._x0,this._y0,this._z0,this._x1,this._y1,this._z1));e=r.pop();){var o=e.node;if(o.length){var i,a=e.x0,s=e.y0,u=e.z0,h=e.x1,d=e.y1,l=e.z1,c=(a+h)/2,f=(s+d)/2,g=(u+l)/2;(i=o[0])&&r.push(new mr(i,a,s,u,c,f,g)),(i=o[1])&&r.push(new mr(i,c,s,u,h,f,g)),(i=o[2])&&r.push(new mr(i,a,f,u,c,d,g)),(i=o[3])&&r.push(new mr(i,c,f,u,h,d,g)),(i=o[4])&&r.push(new mr(i,a,s,g,c,f,l)),(i=o[5])&&r.push(new mr(i,c,s,g,h,f,l)),(i=o[6])&&r.push(new mr(i,a,f,g,c,d,l)),(i=o[7])&&r.push(new mr(i,c,f,g,h,d,l))}n.push(e)}for(;e=n.pop();)t(e.node,e.x0,e.y0,e.z0,e.x1,e.y1,e.z1);return this},Sr.x=function(t){return arguments.length?(this._x=t,this):this._x},Sr.y=function(t){return arguments.length?(this._y=t,this):this._y},Sr.z=function(t){return arguments.length?(this._z=t,this):this._z};var Ar=function(t,e,r,n,o,i,a){var s=[r,n,o][a-1],u=i.x-t.x||.1,h=i.y-t.y||.1,d=i.z-t.z||.1,l=s-e,c=u*u+h*h+d*d,f=Math.sqrt(c)*c;if(l*l*.81<c){var g=t.weight/f;return i.vx+=u*g,i.vy+=h*g,i.vz+=d*g,!0}if(t.length)return!1;t.data!==i&&(g=t.data.weight/f,i.vx+=u*g,i.vy+=h*g,i.vz+=d*g)},_r={dimensions:2,maxIteration:500,gravity:10,factor:1,edgeStrength:200,nodeStrength:1e3,coulombDisScale:.005,damping:.9,maxSpeed:500,minMovement:.4,interval:.02,linkDistance:200,clusterNodeStrength:20,preventOverlap:!0,distanceThresholdMode:\\\"mean\\\"},zr=function(){function t(t){void 0===t&&(t={}),this.options=t,this.id=\\\"force\\\",this.timeInterval=0,this.judgingDistance=0,this.running=!1,this.options=n(n({},_r),t)}return t.prototype.execute=function(t,e){return i(this,void 0,void 0,(function(){return a(this,(function(r){return[2,this.genericForceLayout(!1,t,e)]}))}))},t.prototype.assign=function(t,e){return i(this,void 0,void 0,(function(){return a(this,(function(r){return this.genericForceLayout(!0,t,e),[2]}))}))},t.prototype.stop=function(){this.timeInterval&&\\\"undefined\\\"!=typeof window&&window.clearInterval(this.timeInterval),this.running=!1},t.prototype.tick=function(t){var e=this;if(void 0===t&&(t=this.options.maxIteration||1),this.lastResult)return this.lastResult;for(var r=0;(this.judgingDistance>this.lastOptions.minMovement||r<1)&&r<t;r++)this.runOneStep(this.lastCalcGraph,this.lastGraph,r,this.lastVelMap,this.lastOptions),this.updatePosition(this.lastGraph,this.lastCalcGraph,this.lastVelMap,this.lastOptions);var n={nodes:this.lastLayoutNodes,edges:this.lastLayoutEdges};return this.lastAssign&&n.nodes.forEach((function(t){return e.lastGraph.mergeNodeData(t.id,{x:t.data.x,y:t.data.y,z:3===e.options.dimensions?t.data.z:void 0})})),n},t.prototype.genericForceLayout=function(t,e,r){return i(this,void 0,void 0,(function(){var o,i,s,u,h,d,l,f,g,p,v,y,m,w,E,N,b,M,S,k,A=this;return a(this,(function(a){return o=n(n({},this.options),r),i=e.getAllNodes(),s=e.getAllEdges(),u=this.formatOptions(o,e),h=u.dimensions,d=u.width,l=u.height,f=u.nodeSize,g=u.getMass,p=u.nodeStrength,v=u.edgeStrength,y=u.linkDistance,m=i.map((function(t,e){return n(n({},t),{data:n(n({},t.data),{x:x(t.data.x)?t.data.x:Math.random()*d,y:x(t.data.y)?t.data.y:Math.random()*l,z:x(t.data.z)?t.data.z:Math.random()*Math.sqrt(d*l),size:f(t)||30,mass:g(t),nodeStrength:p(t)})})})),w=s.map((function(t){return n(n({},t),{data:n(n({},t.data),{edgeStrength:v(t),linkDistance:y(t,e.getNode(t.source),e.getNode(t.target))})})})),(null==i?void 0:i.length)?(E={},i.forEach((function(t,e){E[t.id]={x:0,y:0,z:0}})),N=new c({nodes:m,edges:w}),this.formatCentripetal(u,N),b=u.maxIteration,M=u.minMovement,S=u.onTick,this.lastLayoutNodes=m,this.lastLayoutEdges=w,this.lastAssign=t,this.lastGraph=e,this.lastCalcGraph=N,this.lastOptions=u,this.lastVelMap=E,\\\"undefined\\\"==typeof window?[2]:(k=0,[2,new Promise((function(r){A.timeInterval=window.setInterval((function(){i&&A.running||r({nodes:Pr(e,m),edges:s}),A.runOneStep(N,e,k,E,u),A.updatePosition(e,N,E,u),t&&m.forEach((function(t){return e.mergeNodeData(t.id,{x:t.data.x,y:t.data.y,z:3===h?t.data.z:void 0})})),null==S||S({nodes:Pr(e,m),edges:s}),(++k>=b||A.judgingDistance<M)&&(window.clearInterval(A.timeInterval),r({nodes:Pr(e,m),edges:s}))}),0),A.running=!0}))])):(this.lastResult={nodes:[],edges:s},[2,{nodes:[],edges:s}])}))}))},t.prototype.formatOptions=function(t,e){var r=t,n=t.width,o=t.height,i=t.getMass;if(r.width=n||\\\"undefined\\\"==typeof window?n:window.innerWidth,r.height=o||\\\"undefined\\\"==typeof window?o:window.innerHeight,t.center||(r.center=[r.width/2,r.height/2]),i||(r.getMass=function(t){var r=1;x(null==t?void 0:t.data.mass)&&(r=null==t?void 0:t.data.mass);var n=e.getDegree(t.id,\\\"both\\\");return!n||n<5?r:5*n*r}),t.preventOverlap){var a=S(0,t.nodeSpacing);t.nodeSize?g(t.nodeSize)?r.nodeSize=function(e){var r=t.nodeSize;return Math.max(r[0],r[1])+a(e)}:r.nodeSize=function(e){return t.nodeSize+a(e)}:r.nodeSize=function(t){var e=((null==t?void 0:t.data)||{}).size;return e?g(e)?Math.max(e[0],e[1])+a(t):M(e)?Math.max(e.width,e.height)+a(t):e+a(t):10+a(t)}}return r.linkDistance=t.linkDistance?S(1,t.linkDistance):function(t){return 1+r.nodeSize(e.getNode(t.source))+r.nodeSize(e.getNode(t.target))},r.nodeStrength=S(1,t.nodeStrength),r.edgeStrength=S(1,t.edgeStrength),t},t.prototype.formatCentripetal=function(t,e){var r,n=t.centripetalOptions,o=t.center,i=t.clusterNodeStrength,a=t.leafCluster,s=t.clustering,u=t.nodeClusterBy,h=e.getAllNodes(),d=n||{leaf:2,single:2,others:1,center:function(t){return{x:o[0],y:o[1]}}};\\\"function\\\"!=typeof i&&(t.clusterNodeStrength=function(t){return i});var l=[];if(a&&u&&(r=Rr(e,u),l=Array.from(new Set(null==h?void 0:h.map((function(t){return t.data[u]}))))||[],t.centripetalOptions=Object.assign(d,{single:100,leaf:function(e){var n=r[e.id]||{},o=n.siblingLeaves,i=n.sameTypeLeaves;return(null==i?void 0:i.length)===(null==o?void 0:o.length)||1===(null==l?void 0:l.length)?1:t.clusterNodeStrength(e)},others:1,center:function(t){var n,o=e.getDegree(t.id,\\\"both\\\");if(!o)return{x:100,y:100};if(1===o){var i=(r[t.id]||{}).sameTypeLeaves,a=void 0===i?[]:i;1===a.length?n=void 0:a.length>1&&(n=Or(a))}else n=void 0;return{x:null==n?void 0:n.x,y:null==n?void 0:n.y}}})),s&&u){r||(r=Rr(e,u)),l||(l=Array.from(new Set(h.map((function(t){return t.data[u]}))))),l=l.filter((function(t){return void 0!==t}));var c={};l.forEach((function(t){var r=h.filter((function(e){return e.data[u]===t})).map((function(t){return e.getNode(t.id)}));c[t]=Or(r)})),t.centripetalOptions=Object.assign(d,{single:function(e){return t.clusterNodeStrength(e)},leaf:function(e){return t.clusterNodeStrength(e)},others:function(e){return t.clusterNodeStrength(e)},center:function(t){var e=c[t.data[u]];return{x:null==e?void 0:e.x,y:null==e?void 0:e.y}}})}var f=t.centripetalOptions||{},g=f.leaf,p=f.single,v=f.others;g&&\\\"function\\\"!=typeof g&&(t.centripetalOptions.leaf=function(){return g}),p&&\\\"function\\\"!=typeof p&&(t.centripetalOptions.single=function(){return p}),v&&\\\"function\\\"!=typeof v&&(t.centripetalOptions.others=function(){return v})},t.prototype.runOneStep=function(t,e,r,n,o){var i={},a=t.getAllNodes(),s=t.getAllEdges();if(null==a?void 0:a.length){var u=o.monitor;this.calRepulsive(t,i,o),s&&this.calAttractive(t,i,o),this.calGravity(t,e,i,o),this.updateVelocity(t,i,n,o),u&&u({energy:this.calTotalEnergy(i,a),nodes:e.getAllNodes(),edges:e.getAllEdges(),iterations:r})}},t.prototype.calTotalEnergy=function(t,e){var r=this;if(!(null==e?void 0:e.length))return 0;var n=0;return e.forEach((function(e,o){var i=t[e.id].x,a=t[e.id].y,s=3===r.options.dimensions?t[e.id].z:0,u=i*i+a*a+s*s,h=e.data.mass;n+=(void 0===h?1:h)*u*.5})),n},t.prototype.calRepulsive=function(t,e,r){var n=r.dimensions,o=r.factor,i=r.coulombDisScale;!function(t,e,r,n,o){var i=e/r,a=t.getAllNodes(),s=a.map((function(t,e){var r=t.data,n=r.nodeStrength;return{x:r.x,y:r.y,z:r.z,size:r.size,index:e,vx:0,vy:0,vz:0,weight:i*n}})),u=(2===o?F(s,(function(t){return t.x}),(function(t){return t.y})):Nr(s,(function(t){return t.x}),(function(t){return t.y}),(function(t){return t.z}))).visitAfter(kr);s.forEach((function(t){!function(t,e,r){e.visit((function(e,n,o,i,a){return Ar(e,n,o,i,a,t,r)}))}(t,u,o)})),s.map((function(t,e){var r=a[e],o=r.id,i=r.data.mass,s=void 0===i?1:i;n[o]={x:t.vx/s,y:t.vy/s,z:t.vz/s}}))}(t,o,i*i,e,n)},t.prototype.calAttractive=function(t,e,r){var n=r.dimensions;t.getAllEdges().forEach((function(r,o){var i=r.source,a=r.target,s=t.getNode(i),u=t.getNode(a);if(s&&u){var h=u.data.x-s.data.x,d=u.data.y-s.data.y,l=3===n?u.data.z-s.data.z:0;h||d||(h=.01*Math.random(),d=.01*Math.random(),3!==n||l||(l=.01*Math.random()));var c=Math.sqrt(h*h+d*d+l*l),f=h/c,g=d/c,p=l/c,v=r.data||{},y=v.linkDistance,m=void 0===y?200:y,w=v.edgeStrength,x=(m-c)*(void 0===w?200:w),E=1/(s.data.mass||1),N=1/(u.data.mass||1),b=f*x,M=g*x,S=p*x;e[i].x-=b*E,e[i].y-=M*E,e[i].z-=S*E,e[a].x+=b*N,e[a].y+=M*N,e[a].z+=S*N}}))},t.prototype.calGravity=function(t,e,r,n){var o=n.getCenter,i=t.getAllNodes(),a=e.getAllNodes(),u=e.getAllEdges(),h=n.width,d=n.height,l=n.center,c=n.gravity,f=n.centripetalOptions;i&&i.forEach((function(n){var i=n.id,g=n.data,p=g.mass,v=g.x,y=g.y,m=g.z,w=e.getNode(i),E=0,N=0,b=0,M=c,S=t.getDegree(i,\\\"in\\\"),k=t.getDegree(i,\\\"out\\\"),A=t.getDegree(i,\\\"both\\\"),_=null==o?void 0:o(w,A);if(_){var z=s(_,3);E=v-z[0],N=y-z[1],M=z[2]}else E=v-l[0],N=y-l[1],b=m-l[2];if(M&&(r[i].x-=M*E/p,r[i].y-=M*N/p,r[i].z-=M*b/p),f){var R=f.leaf,I=f.single,D=f.others,O=f.center,P=(null==O?void 0:O(w,a,u,h,d))||{x:0,y:0,z:0,centerStrength:0},T=P.x,C=P.y,q=P.z,L=P.centerStrength;if(!x(T)||!x(C))return;var j=(v-T)/p,F=(y-C)/p,V=(m-q)/p;if(L&&(r[i].x-=L*j,r[i].y-=L*F,r[i].z-=L*V),0===A){var B=I(w);if(!B)return;return r[i].x-=B*j,r[i].y-=B*F,void(r[i].z-=B*V)}if(0===S||0===k){var G=R(w,a,u);if(!G)return;return r[i].x-=G*j,r[i].y-=G*F,void(r[i].z-=G*V)}var W=D(w);if(!W)return;r[i].x-=W*j,r[i].y-=W*F,r[i].z-=W*V}}))},t.prototype.updateVelocity=function(t,e,r,n){var o=n.damping,i=n.maxSpeed,a=n.interval,s=n.dimensions,u=t.getAllNodes();(null==u?void 0:u.length)&&u.forEach((function(t){var n=t.id,u=(r[n].x+e[n].x*a)*o||.01,h=(r[n].y+e[n].y*a)*o||.01,d=3===s?(r[n].z+e[n].z*a)*o||.01:0,l=Math.sqrt(u*u+h*h+d*d);if(l>i){var c=i/l;u*=c,h*=c,d*=c}r[n]={x:u,y:h,z:d}}))},t.prototype.updatePosition=function(t,e,r,n){var o=this,i=n.distanceThresholdMode,a=n.interval,s=n.dimensions,u=e.getAllNodes();if(null==u?void 0:u.length){var h=0;\\\"max\\\"===i?this.judgingDistance=-1/0:\\\"min\\\"===i&&(this.judgingDistance=1/0),u.forEach((function(n){var u=n.id,d=t.getNode(u);if(x(d.data.fx)&&x(d.data.fy))e.mergeNodeData(u,{x:d.data.fx,y:d.data.fy,z:3===s?d.data.fz:void 0});else{var l=r[u].x*a,c=r[u].y*a,f=3===s?r[u].z*a:0;e.mergeNodeData(u,{x:n.data.x+l,y:n.data.y+c,z:n.data.z+f});var g=Math.sqrt(l*l+c*c+f*f);switch(i){case\\\"max\\\":o.judgingDistance<g&&(o.judgingDistance=g);break;case\\\"min\\\":o.judgingDistance>g&&(o.judgingDistance=g);break;default:h+=g}}})),i&&\\\"mean\\\"!==i||(this.judgingDistance=h/u.length)}else this.judgingDistance=0},t}(),Rr=function(t,e){var r=t.getAllNodes();if(!(null==r?void 0:r.length))return{};var n={};return r.forEach((function(r,o){1===t.getDegree(r.id,\\\"both\\\")&&(n[r.id]=Ir(t,\\\"leaf\\\",r,e))})),n},Ir=function(t,e,r,n){var o=t.getDegree(r.id,\\\"in\\\"),i=t.getDegree(r.id,\\\"out\\\"),a=r,s=[];return 0===o?(a=t.getSuccessors(r.id)[0],s=t.getNeighbors(a.id)):0===i&&(a=t.getPredecessors(r.id)[0],s=t.getNeighbors(a.id)),s=s.filter((function(e){return 0===t.getDegree(e.id,\\\"in\\\")||0===t.getDegree(e.id,\\\"out\\\")})),{coreNode:a,siblingLeaves:s,sameTypeLeaves:Dr(t,e,n,r,s)}},Dr=function(t,e,r,n,o){var i=n.data[r]||\\\"\\\",a=(null==o?void 0:o.filter((function(t){return t.data[r]===i})))||[];return\\\"leaf\\\"===e&&(a=a.filter((function(e){return 0===t.getDegree(e.id,\\\"in\\\")||0===t.getDegree(e.id,\\\"out\\\")}))),a},Or=function(t){var e={x:0,y:0};t.forEach((function(t){var r=t.data,n=r.x,o=r.y;e.x+=n||0,e.y+=o||0}));var r=t.length||1;return{x:e.x/r,y:e.y/r}},Pr=function(t,e){return e.map((function(e){var r=e.id,o=e.data,i=t.getNode(r);return n(n({},i),{data:n(n({},i.data),{x:o.x,y:o.y,z:o.z})})}))},Tr=function(){function t(t){this.id=t.id||0,this.rx=t.rx,this.ry=t.ry,this.fx=0,this.fy=0,this.mass=t.mass,this.degree=t.degree,this.g=t.g||0}return t.prototype.distanceTo=function(t){var e=this.rx-t.rx,r=this.ry-t.ry;return Math.hypot(e,r)},t.prototype.setPos=function(t,e){this.rx=t,this.ry=e},t.prototype.resetForce=function(){this.fx=0,this.fy=0},t.prototype.addForce=function(t){var e=t.rx-this.rx,r=t.ry-this.ry,n=Math.hypot(e,r);n=n<1e-4?1e-4:n;var o=this.g*(this.degree+1)*(t.degree+1)/n;this.fx+=o*e/n,this.fy+=o*r/n},t.prototype.in=function(t){return t.contains(this.rx,this.ry)},t.prototype.add=function(e){var r=this.mass+e.mass;return new t({rx:(this.rx*this.mass+e.rx*e.mass)/r,ry:(this.ry*this.mass+e.ry*e.mass)/r,mass:r,degree:this.degree+e.degree})},t}();const Cr=Tr;const qr=function(){function t(t){this.xmid=t.xmid,this.ymid=t.ymid,this.length=t.length,this.massCenter=t.massCenter||[0,0],this.mass=t.mass||1}return t.prototype.getLength=function(){return this.length},t.prototype.contains=function(t,e){var r=this.length/2;return t<=this.xmid+r&&t>=this.xmid-r&&e<=this.ymid+r&&e>=this.ymid-r},t.prototype.NW=function(){return new t({xmid:this.xmid-this.length/4,ymid:this.ymid+this.length/4,length:this.length/2})},t.prototype.NE=function(){return new t({xmid:this.xmid+this.length/4,ymid:this.ymid+this.length/4,length:this.length/2})},t.prototype.SW=function(){return new t({xmid:this.xmid-this.length/4,ymid:this.ymid-this.length/4,length:this.length/2})},t.prototype.SE=function(){return new t({xmid:this.xmid+this.length/4,ymid:this.ymid-this.length/4,length:this.length/2})},t}(),Lr=function(){function t(t){this.body=null,this.quad=null,this.NW=null,this.NE=null,this.SW=null,this.SE=null,this.theta=.5,null!=t&&(this.quad=t)}return t.prototype.insert=function(e){null!=this.body?this._isExternal()?(this.quad&&(this.NW=new t(this.quad.NW()),this.NE=new t(this.quad.NE()),this.SW=new t(this.quad.SW()),this.SE=new t(this.quad.SE())),this._putBody(this.body),this._putBody(e),this.body=this.body.add(e)):(this.body=this.body.add(e),this._putBody(e)):this.body=e},t.prototype._putBody=function(t){this.quad&&(t.in(this.quad.NW())&&this.NW?this.NW.insert(t):t.in(this.quad.NE())&&this.NE?this.NE.insert(t):t.in(this.quad.SW())&&this.SW?this.SW.insert(t):t.in(this.quad.SE())&&this.SE&&this.SE.insert(t))},t.prototype._isExternal=function(){return null==this.NW&&null==this.NE&&null==this.SW&&null==this.SE},t.prototype.updateForce=function(t){null!=this.body&&t!==this.body&&(this._isExternal()||(this.quad?this.quad.getLength():0)/this.body.distanceTo(t)<this.theta?t.addForce(this.body):(this.NW&&this.NW.updateForce(t),this.NE&&this.NE.updateForce(t),this.SW&&this.SW.updateForce(t),this.SE&&this.SE.updateForce(t)))},t}();var jr={center:[0,0],width:300,height:300,kr:5,kg:1,mode:\\\"normal\\\",preventOverlap:!1,dissuadeHubs:!1,maxIteration:0,ks:.1,ksmax:10,tao:.1},Fr=function(){function t(t){void 0===t&&(t={}),this.options=t,this.id=\\\"forceAtlas2\\\",this.options=n(n({},jr),t)}return t.prototype.execute=function(t,e){return i(this,void 0,void 0,(function(){return a(this,(function(r){return[2,this.genericForceAtlas2Layout(!1,t,e)]}))}))},t.prototype.assign=function(t,e){return i(this,void 0,void 0,(function(){return a(this,(function(r){return this.genericForceAtlas2Layout(!0,t,e),[2]}))}))},t.prototype.genericForceAtlas2Layout=function(t,e,r){return i(this,void 0,void 0,(function(){var o,i,s,u,h,d,l,f,g,p,v,y,m,w,x,E,b,M,S,k,A,z;return a(this,(function(a){if(o=e.getAllEdges(),i=e.getAllNodes(),s=this.formatOptions(r,i.length),u=s.width,h=s.height,d=s.prune,l=s.maxIteration,f=s.nodeSize,g=s.center,!(null==i?void 0:i.length)||1===i.length)return[2,_(e,t,g)];if(p=i.map((function(t){return N(t,[u,h])})),v=o.filter((function(t){return t.source!==t.target})),y=new c({nodes:p,edges:v}),m=this.getSizes(y,e,f),this.run(y,e,l,m,t,s),d){for(w=0;w<v.length;w+=1)x=v[w],E=x.source,b=x.target,M=y.getDegree(E),S=y.getDegree(E),M<=1?(k=y.getNode(b),y.mergeNodeData(E,{x:k.data.x,y:k.data.y})):S<=1&&(A=y.getNode(E),y.mergeNodeData(b,{x:A.data.x,y:A.data.y}));z=n(n({},s),{prune:!1,barnesHut:!1}),this.run(y,e,100,m,t,z)}return[2,{nodes:p,edges:o}]}))}))},t.prototype.getSizes=function(t,e,r){for(var n=t.getAllNodes(),o={},i=0;i<n.length;i+=1){var a=n[i],h=a.id,d=a.data;if(o[h]=10,x(d.size))o[h]=d.size;else if(g(d.size))isNaN(d.size[0])||(o[h]=Math.max(d.size[0])),isNaN(d.size[1])||(o[h]=Math.max(d.size[1]));else if(M(d.size))o[h]=Math.max(d.size.width,d.size.height);else if(b(r)){var l=r(e.getNode(h));g(l)?o[h]=Math.max.apply(Math,u([],s(l))):o[h]=l}else g(r)?o[h]=Math.max.apply(Math,u([],s(r))):x(r)&&(o[h]=r)}return o},t.prototype.formatOptions=function(t,e){void 0===t&&(t={});var r=n(n({},this.options),t),o=r.center,i=r.width,a=r.height,s=r.barnesHut,u=r.prune,h=r.maxIteration,d=r.kr,l=r.kg;return r.width=i||\\\"undefined\\\"==typeof window?i:window.innerWidth,r.height=a||\\\"undefined\\\"==typeof window?a:window.innerHeight,r.center=o||[r.width/2,r.height/2],void 0===s&&e>250&&(r.barnesHut=!0),void 0===u&&e>100&&(r.prune=!0),0!==h||u?0===h&&u&&(r.maxIteration=100,e<=200&&e>100?r.maxIteration=500:e>200&&(r.maxIteration=950)):(r.maxIteration=250,e<=200&&e>100?r.maxIteration=1e3:e>200&&(r.maxIteration=1200)),d||(r.kr=50,e>100&&e<=500?r.kr=20:e>500&&(r.kr=1)),l||(r.kg=20,e>100&&e<=500?r.kg=10:e>500&&(r.kg=1)),r},t.prototype.run=function(t,e,r,n,o,i){for(var a=i.kr,s=i.barnesHut,u=i.onTick,h=t.getAllNodes(),d=0,l=r,c={},f={},g={},p=0;p<h.length;p+=1){var v=h[p],y=v.data,m=v.id;if(c[m]=[0,0],s){var w={id:p,rx:y.x,ry:y.y,mass:1,g:a,degree:t.getDegree(m)};g[m]=new Cr(w)}}for(;l>0;)d=this.oneStep(t,{iter:l,preventOverlapIters:50,krPrime:100,sg:d,forces:c,preForces:f,bodies:g,sizes:n},i),l--,null==u||u({nodes:h,edges:e.getAllEdges()});return t},t.prototype.oneStep=function(t,e,r){for(var n=e.iter,o=e.preventOverlapIters,i=e.krPrime,a=e.sg,h=e.preForces,d=e.bodies,l=e.sizes,c=e.forces,f=r.preventOverlap,g=r.barnesHut,p=t.getAllNodes(),v=0;v<p.length;v+=1){var y=p[v].id;h[y]=u([],s(c[y])),c[y]=[0,0]}return c=this.getAttrForces(t,n,o,l,c,r),c=g&&(f&&n>o||!f)?this.getOptRepGraForces(t,c,d,r):this.getRepGraForces(t,n,o,c,i,l,r),this.updatePos(t,c,h,a,r)},t.prototype.getAttrForces=function(t,e,r,n,o,i){for(var a=i.preventOverlap,s=i.dissuadeHubs,u=i.mode,h=i.prune,d=t.getAllEdges(),l=0;l<d.length;l+=1){var c=d[l],f=c.source,g=c.target,p=t.getNode(f),v=t.getNode(g),y=t.getDegree(f),m=t.getDegree(g);if(!h||!(y<=1||m<=1)){var w=[v.data.x-p.data.x,v.data.y-p.data.y],x=Math.hypot(w[0],w[1]);x=x<1e-4?1e-4:x,w[0]=w[0]/x,w[1]=w[1]/x,a&&e<r&&(x=x-n[f]-n[g]);var E=x,N=E;\\\"linlog\\\"===u&&(N=E=Math.log(1+x)),s&&(E=x/y,N=x/m),a&&e<r&&x<=0?(E=0,N=0):a&&e<r&&x>0&&(E=x,N=x),o[f][0]+=E*w[0],o[g][0]-=N*w[0],o[f][1]+=E*w[1],o[g][1]-=N*w[1]}}return o},t.prototype.getOptRepGraForces=function(t,e,r,n){for(var o=n.kg,i=n.center,a=n.prune,s=t.getAllNodes(),u=s.length,h=9e10,d=-9e10,l=9e10,c=-9e10,f=0;f<u;f+=1){var g=s[f],p=g.id,v=g.data;a&&t.getDegree(p)<=1||(r[p].setPos(v.x,v.y),v.x>=d&&(d=v.x),v.x<=h&&(h=v.x),v.y>=c&&(c=v.y),v.y<=l&&(l=v.y))}var y=Math.max(d-h,c-l),m=new qr({xmid:(d+h)/2,ymid:(c+l)/2,length:y,massCenter:i,mass:u}),w=new Lr(m);for(f=0;f<u;f+=1)p=s[f].id,a&&t.getDegree(p)<=1||r[p].in(m)&&w.insert(r[p]);for(f=0;f<u;f+=1){var x=s[f],E=(p=x.id,v=x.data,t.getDegree(p));if(!(a&&E<=1)){r[p].resetForce(),w.updateForce(r[p]),e[p][0]-=r[p].fx,e[p][1]-=r[p].fy;var N=[v.x-i[0],v.y-i[1]],b=Math.hypot(N[0],N[1]);b=b<1e-4?1e-4:b,N[0]=N[0]/b,N[1]=N[1]/b;var M=o*(E+1);e[p][0]-=M*N[0],e[p][1]-=M*N[1]}}return e},t.prototype.getRepGraForces=function(t,e,r,n,o,i,a){for(var s=a.preventOverlap,u=a.kr,h=a.kg,d=a.center,l=a.prune,c=t.getAllNodes(),f=c.length,g=0;g<f;g+=1){for(var p=c[g],v=t.getDegree(p.id),y=g+1;y<f;y+=1){var m=c[y],w=t.getDegree(m.id);if(!l||!(v<=1||w<=1)){var x=[m.data.x-p.data.x,m.data.y-p.data.y],E=Math.hypot(x[0],x[1]);E=E<1e-4?1e-4:E,x[0]=x[0]/E,x[1]=x[1]/E,s&&e<r&&(E=E-i[p.id]-i[m.id]);var N=u*(v+1)*(w+1)/E;s&&e<r&&E<0?N=o*(v+1)*(w+1):s&&e<r&&0===E?N=0:s&&e<r&&E>0&&(N=u*(v+1)*(w+1)/E),n[p.id][0]-=N*x[0],n[m.id][0]+=N*x[0],n[p.id][1]-=N*x[1],n[m.id][1]+=N*x[1]}}var b=[p.data.x-d[0],p.data.y-d[1]],M=Math.hypot(b[0],b[1]);b[0]=b[0]/M,b[1]=b[1]/M;var S=h*(v+1);n[p.id][0]-=S*b[0],n[p.id][1]-=S*b[1]}return n},t.prototype.updatePos=function(t,e,r,n,o){for(var i=o.ks,a=o.tao,s=o.prune,u=o.ksmax,h=t.getAllNodes(),d=h.length,l=[],c=[],f=0,g=0,p=n,v=0;v<d;v+=1){var y=h[v].id,m=t.getDegree(y);if(!(s&&m<=1)){var w=[e[y][0]-r[y][0],e[y][1]-r[y][1]],E=Math.hypot(w[0],w[1]),N=[e[y][0]+r[y][0],e[y][1]+r[y][1]],b=Math.hypot(N[0],N[1]);l[v]=E,c[v]=b/2,f+=(m+1)*l[v],g+=(m+1)*c[v]}}var M=p;for(p=a*g/f,0!==M&&(p=p>1.5*M?1.5*M:p),v=0;v<d;v+=1){var S=h[v],k=(y=S.id,S.data);if(m=t.getDegree(y),!(s&&m<=1||x(k.fx)&&x(k.fy))){var A=i*p/(1+p*Math.sqrt(l[v])),_=Math.hypot(e[y][0],e[y][1]),z=u/(_=_<1e-4?1e-4:_),R=(A=A>z?z:A)*e[y][0],I=A*e[y][1];t.mergeNodeData(y,{x:k.x+R,y:k.y+I})}}return p},t}(),Vr={maxIteration:1e3,gravity:10,speed:5,clustering:!1,clusterGravity:10,width:300,height:300,nodeClusterBy:\\\"cluster\\\"},Br=function(){function t(t){void 0===t&&(t={}),this.options=t,this.id=\\\"fruchterman\\\",this.timeInterval=0,this.running=!1,this.options=n(n({},Vr),t)}return t.prototype.execute=function(t,e){return i(this,void 0,void 0,(function(){return a(this,(function(r){return[2,this.genericFruchtermanLayout(!1,t,e)]}))}))},t.prototype.assign=function(t,e){return i(this,void 0,void 0,(function(){return a(this,(function(r){return this.genericFruchtermanLayout(!0,t,e),[2]}))}))},t.prototype.stop=function(){this.timeInterval&&\\\"undefined\\\"!=typeof window&&window.clearInterval(this.timeInterval),this.running=!1},t.prototype.tick=function(t){var e=this;if(void 0===t&&(t=this.options.maxIteration||1),this.lastResult)return this.lastResult;for(var r=0;r<t;r++)this.runOneStep(this.lastGraph,this.lastClusterMap,this.lastOptions);var n={nodes:this.lastLayoutNodes,edges:this.lastLayoutEdges};return this.lastAssign&&n.nodes.forEach((function(t){return e.lastGraph.mergeNodeData(t.id,{x:t.data.x,y:t.data.y,z:3===e.options.dimensions?t.data.z:void 0})})),n},t.prototype.genericFruchtermanLayout=function(t,e,r){return i(this,void 0,void 0,(function(){var o,i,s,u,h,d,l,f,g,p,v,y,m,w,x,E,b=this;return a(this,(function(a){return this.running?[2]:(o=this.formatOptions(r),i=o.dimensions,s=o.width,u=o.height,h=o.center,d=o.clustering,l=o.nodeClusterBy,f=o.maxIteration,g=o.onTick,p=e.getAllNodes(),v=e.getAllEdges(),(null==p?void 0:p.length)?1===p.length?(t&&e.mergeNodeData(p[0].id,{x:h[0],y:h[1],z:3===i?h[2]:void 0}),y={nodes:[n(n({},p[0]),{data:n(n({},p[0].data),{x:h[0],y:h[1],z:3===i?h[2]:void 0})})],edges:v},this.lastResult=y,[2,y]):(m=p.map((function(t){return N(t,[s,u])})),w=new c({nodes:m,edges:v}),x={},d&&m.forEach((function(t){var e=t.data[l];x[e]||(x[e]={name:e,cx:0,cy:0,count:0})})),this.lastLayoutNodes=m,this.lastLayoutEdges=v,this.lastAssign=t,this.lastGraph=w,this.lastOptions=o,this.lastClusterMap=x,\\\"undefined\\\"==typeof window?[2]:(E=0,[2,new Promise((function(r){b.timeInterval=window.setInterval((function(){b.running?(b.runOneStep(w,x,o),t&&m.forEach((function(t){var r=t.id,n=t.data;return e.mergeNodeData(r,{x:n.x,y:n.y,z:3===i?n.z:void 0})})),null==g||g({nodes:m,edges:v}),++E>=f&&(window.clearInterval(b.timeInterval),r({nodes:m,edges:v}))):r({nodes:m,edges:v})}),0),b.running=!0}))])):(y={nodes:[],edges:v},this.lastResult=y,[2,y]))}))}))},t.prototype.formatOptions=function(t){void 0===t&&(t={});var e=n(n({},this.options),t),r=e.clustering,o=e.nodeClusterBy,i=e.center,a=e.width,s=e.height;return e.width=a||\\\"undefined\\\"==typeof window?a:window.innerWidth,e.height=s||\\\"undefined\\\"==typeof window?s:window.innerHeight,e.center=i||[e.width/2,e.height/2],e.clustering=r&&!!o,e},t.prototype.runOneStep=function(t,e,r){var n=r.dimensions,o=r.height,i=r.width,a=r.gravity,s=r.center,u=r.speed,h=r.clustering,d=r.nodeClusterBy,l=r.clusterGravity,c=o*i,f=Math.sqrt(c)/10,g=t.getAllNodes(),p=c/(g.length+1),v=Math.sqrt(p),y={};if(this.applyCalculate(t,y,v,p),h){for(var m in e)e[m].cx=0,e[m].cy=0,e[m].count=0;for(var m in g.forEach((function(t){var r=t.data,n=e[r[d]];x(r.x)&&(n.cx+=r.x),x(r.y)&&(n.cy+=r.y),n.count++})),e)e[m].cx/=e[m].count,e[m].cy/=e[m].count;var w=l||a;g.forEach((function(t,r){var n=t.id,o=t.data;if(x(o.x)&&x(o.y)){var i=e[o[d]],a=Math.sqrt((o.x-i.cx)*(o.x-i.cx)+(o.y-i.cy)*(o.y-i.cy)),s=v*w;y[n].x-=s*(o.x-i.cx)/a,y[n].y-=s*(o.y-i.cy)/a}}))}g.forEach((function(t,e){var r=t.id,o=t.data;if(x(o.x)&&x(o.y)){var i=.01*v*a;y[r].x-=i*(o.x-s[0]),y[r].y-=i*(o.y-s[1]),3===n&&(y[r].z-=i*(o.z-s[2]))}})),g.forEach((function(e,r){var o=e.id,i=e.data;if(x(i.fx)&&x(i.fy))return i.x=i.fx,i.y=i.fy,void(3===n&&(i.z=i.fz));if(x(i.x)&&x(i.y)){var a=Math.sqrt(y[o].x*y[o].x+y[o].y*y[o].y+(3===n?y[o].z*y[o].z:0));if(a>0){var s=Math.min(f*(u/800),a);t.mergeNodeData(o,{x:i.x+y[o].x/a*s,y:i.y+y[o].y/a*s,z:3===n?i.z+y[o].z/a*s:void 0})}}}))},t.prototype.applyCalculate=function(t,e,r,n){this.calRepulsive(t,e,n),this.calAttractive(t,e,r)},t.prototype.calRepulsive=function(t,e,r){var n=this,o=t.getAllNodes();o.forEach((function(t,i){var a=t.data,s=t.id;e[s]={x:0,y:0,z:0},o.forEach((function(t,o){var u=t.data,h=t.id;if(!(i<=o)&&x(a.x)&&x(u.x)&&x(a.y)&&x(u.y)){var d=a.x-u.x,l=a.y-u.y,c=3===n.options.dimensions?a.z-u.z:0,f=d*d+l*l+c*c;0===f&&(f=1,d=.01,l=.01,c=.01);var g=r/f,p=d*g,v=l*g,y=c*g;e[s].x+=p,e[s].y+=v,e[h].x-=p,e[h].y-=v,3===n.options.dimensions&&(e[s].z+=y,e[h].z-=y)}}))}))},t.prototype.calAttractive=function(t,e,r){var n=this;t.getAllEdges().forEach((function(o){var i=o.source,a=o.target;if(i&&a&&i!==a){var s=t.getNode(i).data,u=t.getNode(a).data;if(x(u.x)&&x(s.x)&&x(u.y)&&x(s.y)){var h=u.x-s.x,d=u.y-s.y,l=3===n.options.dimensions?u.z-s.z:0,c=Math.sqrt(h*h+d*d+l*l)/r,f=h*c,g=d*c,p=l*c;e[i].x+=f,e[i].y+=g,e[a].x-=f,e[a].y-=g,3===n.options.dimensions&&(e[i].z+=p,e[a].z-=p)}}}))},t}(),Gr={begin:[0,0],preventOverlap:!0,preventOverlapPadding:10,condense:!1,rows:void 0,cols:void 0,position:void 0,sortBy:\\\"degree\\\",nodeSize:30,width:300,height:300},Wr=function(){function t(t){void 0===t&&(t={}),this.options=t,this.id=\\\"grid\\\",this.options=n(n({},Gr),t)}return t.prototype.execute=function(t,e){return i(this,void 0,void 0,(function(){return a(this,(function(r){return[2,this.genericGridLayout(!1,t,e)]}))}))},t.prototype.assign=function(t,e){return i(this,void 0,void 0,(function(){return a(this,(function(r){return this.genericGridLayout(!0,t,e),[2]}))}))},t.prototype.genericGridLayout=function(t,e,r){return i(this,void 0,void 0,(function(){var o,i,s,u,h,d,l,c,f,p,v,y,m,w,E,b,M,A,z,R,I,D,P,T,C,q,L,j,F,V,B,G,W,$,U,H,K;return a(this,(function(a){if(o=n(n({},this.options),r),i=o.begin,s=void 0===i?[0,0]:i,u=o.condense,h=o.preventOverlapPadding,d=o.preventOverlap,l=o.rows,c=o.cols,f=o.nodeSpacing,p=o.nodeSize,v=o.width,y=o.height,m=o.position,w=o.sortBy,E=e.getAllNodes(),b=e.getAllEdges(),!(M=null==E?void 0:E.length)||1===M)return[2,_(e,t,s)];if(A=E.map((function(t){return N(t)})),\\\"id\\\"===w||O(w)&&void 0!==A[0].data[w]||(w=\\\"degree\\\"),\\\"degree\\\"===w?A.sort((function(t,r){return e.getDegree(r.id,\\\"both\\\")-e.getDegree(t.id,\\\"both\\\")})):\\\"id\\\"===w?A.sort((function(t,e){return x(e.id)&&x(t.id)?e.id-t.id:(\\\"\\\"+t.id).localeCompare(\\\"\\\"+e.id)})):A.sort((function(t,e){return e.data[w]-t.data[w]})),z=v||\\\"undefined\\\"==typeof window?v:window.innerWidth,R=y||\\\"undefined\\\"==typeof window?y:window.innerHeight,I=M,D={rows:l,cols:c},null!=l&&null!=c?(D.rows=l,D.cols=c):null!=l&&null==c?(D.rows=l,D.cols=Math.ceil(I/D.rows)):null==l&&null!=c?(D.cols=c,D.rows=Math.ceil(I/D.cols)):(P=Math.sqrt(I*R/z),D.rows=Math.round(P),D.cols=Math.round(z/R*P)),D.rows=Math.max(D.rows,1),D.cols=Math.max(D.cols,1),D.cols*D.rows>I)T=$r(D),C=Ur(D),(T-1)*C>=I?$r(D,T-1):(C-1)*T>=I&&Ur(D,C-1);else for(;D.cols*D.rows<I;)T=$r(D),((C=Ur(D))+1)*T>=I?Ur(D,C+1):$r(D,T+1);for(q=u?0:z/D.cols,L=u?0:R/D.rows,(d||f)&&(j=S(10,f),F=k(30,p,!1),A.forEach((function(t){t.data.x&&t.data.y||(t.data.x=0,t.data.y=0);var r,n,o=e.getNode(t.id),i=F(o)||30;g(i)?(r=i[0],n=i[1]):(r=i,n=i);var a=void 0!==j?j(t):h,s=r+a,u=n+a;q=Math.max(q,s),L=Math.max(L,u)}))),V={},B={row:0,col:0},G={},W=0;W<A.length;W++){if($=A[W],U=void 0,m&&(U=m(e.getNode($.id))),U&&(void 0!==U.row||void 0!==U.col)){if(void 0===(H={row:U.row,col:U.col}).col)for(H.col=0;Hr(V,H);)H.col++;else if(void 0===H.row)for(H.row=0;Hr(V,H);)H.row++;G[$.id]=H,Kr(V,H)}Jr($,s,q,L,G,D,B,V)}return K={nodes:A,edges:b},t&&A.forEach((function(t){e.mergeNodeData(t.id,{x:t.data.x,y:t.data.y})})),[2,K]}))}))},t}(),$r=function(t,e){var r,n=t.rows||5,o=t.cols||5;return null==e?r=Math.min(n,o):Math.min(n,o)===t.rows?t.rows=e:t.cols=e,r},Ur=function(t,e){var r,n=t.rows||5,o=t.cols||5;return null==e?r=Math.max(n,o):Math.max(n,o)===t.rows?t.rows=e:t.cols=e,r},Hr=function(t,e){return t[\\\"c-\\\"+e.row+\\\"-\\\"+e.col]||!1},Kr=function(t,e){return t[\\\"c-\\\"+e.row+\\\"-\\\"+e.col]=!0},Yr=function(t,e){var r=t.cols||5;e.col++,e.col>=r&&(e.col=0,e.row++)},Jr=function(t,e,r,n,o,i,a,s){var u,h,d=o[t.id];if(d)u=d.col*r+r/2+e[0],h=d.row*n+n/2+e[1];else{for(;Hr(s,a);)Yr(i,a);u=a.col*r+r/2+e[0],h=a.row*n+n/2+e[1],Kr(s,a),Yr(i,a)}t.data.x=u,t.data.y=h};const Xr=Object.prototype.toString;function Qr(t){const e=Xr.call(t);return e.endsWith(\\\"Array]\\\")&&!e.includes(\\\"Big\\\")}function Zr(t){var e,r=arguments.length>1&&void 0!==arguments[1]?arguments[1]:{};if(!Qr(t))throw new TypeError(\\\"input must be an array\\\");if(0===t.length)throw new TypeError(\\\"input must not be empty\\\");if(void 0!==r.output){if(!Qr(r.output))throw new TypeError(\\\"output option must be an array if specified\\\");e=r.output}else e=new Array(t.length);var n=function(t){var e=arguments.length>1&&void 0!==arguments[1]?arguments[1]:{};if(!Qr(t))throw new TypeError(\\\"input must be an array\\\");if(0===t.length)throw new TypeError(\\\"input must not be empty\\\");var r=e.fromIndex,n=void 0===r?0:r,o=e.toIndex,i=void 0===o?t.length:o;if(n<0||n>=t.length||!Number.isInteger(n))throw new Error(\\\"fromIndex must be a positive integer smaller than length\\\");if(i<=n||i>t.length||!Number.isInteger(i))throw new Error(\\\"toIndex must be an integer greater than fromIndex and at most equal to length\\\");for(var a=t[n],s=n+1;s<i;s++)t[s]<a&&(a=t[s]);return a}(t),o=function(t){var e=arguments.length>1&&void 0!==arguments[1]?arguments[1]:{};if(!Qr(t))throw new TypeError(\\\"input must be an array\\\");if(0===t.length)throw new TypeError(\\\"input must not be empty\\\");var r=e.fromIndex,n=void 0===r?0:r,o=e.toIndex,i=void 0===o?t.length:o;if(n<0||n>=t.length||!Number.isInteger(n))throw new Error(\\\"fromIndex must be a positive integer smaller than length\\\");if(i<=n||i>t.length||!Number.isInteger(i))throw new Error(\\\"toIndex must be an integer greater than fromIndex and at most equal to length\\\");for(var a=t[n],s=n+1;s<i;s++)t[s]>a&&(a=t[s]);return a}(t);if(n===o)throw new RangeError(\\\"minimum and maximum input values are equal. Cannot rescale a constant array\\\");var i=r.min,a=void 0===i?r.autoMinMax?n:0:i,s=r.max,u=void 0===s?r.autoMinMax?o:1:s;if(a>=u)throw new RangeError(\\\"min option must be smaller than max option\\\");for(var h=(u-a)/(o-n),d=0;d<t.length;d++)e[d]=(t[d]-n)*h+a;return e}const tn=\\\" \\\".repeat(2),en=\\\" \\\".repeat(4);function rn(t,e={}){const{maxRows:r=15,maxColumns:n=10,maxNumSize:o=8,padMinus:i=\\\"auto\\\"}=e;return`${t.constructor.name} {\\\\n${tn}[\\\\n${en}${function(t,e,r,n,o){const{rows:i,columns:a}=t,s=Math.min(i,e),u=Math.min(a,r),h=[];if(\\\"auto\\\"===o){o=!1;t:for(let e=0;e<s;e++)for(let r=0;r<u;r++)if(t.get(e,r)<0){o=!0;break t}}for(let e=0;e<s;e++){let r=[];for(let i=0;i<u;i++)r.push(nn(t.get(e,i),n,o));h.push(`${r.join(\\\" \\\")}`)}return u!==a&&(h[h.length-1]+=` ... ${a-r} more columns`),s!==i&&h.push(`... ${i-e} more rows`),h.join(`\\\\n${en}`)}(t,r,n,o,i)}\\\\n${tn}]\\\\n${tn}rows: ${t.rows}\\\\n${tn}columns: ${t.columns}\\\\n}`}function nn(t,e,r){return(t>=0&&r?` ${on(t,e-1)}`:on(t,e)).padEnd(e)}function on(t,e){let r=t.toString();if(r.length<=e)return r;let n=t.toFixed(e);if(n.length>e&&(n=t.toFixed(Math.max(0,e-(n.length-e)))),n.length<=e&&!n.startsWith(\\\"0.000\\\")&&!n.startsWith(\\\"-0.000\\\"))return n;let o=t.toExponential(e);return o.length>e&&(o=t.toExponential(Math.max(0,e-(o.length-e)))),o.slice(0)}function an(t,e,r){let n=r?t.rows:t.rows-1;if(e<0||e>n)throw new RangeError(\\\"Row index out of range\\\")}function sn(t,e,r){let n=r?t.columns:t.columns-1;if(e<0||e>n)throw new RangeError(\\\"Column index out of range\\\")}function un(t,e){if(e.to1DArray&&(e=e.to1DArray()),e.length!==t.columns)throw new RangeError(\\\"vector size must be the same as the number of columns\\\");return e}function hn(t,e){if(e.to1DArray&&(e=e.to1DArray()),e.length!==t.rows)throw new RangeError(\\\"vector size must be the same as the number of rows\\\");return e}function dn(t,e,r,n,o){if(5!==arguments.length)throw new RangeError(\\\"expected 4 arguments\\\");if(cn(\\\"startRow\\\",e),cn(\\\"endRow\\\",r),cn(\\\"startColumn\\\",n),cn(\\\"endColumn\\\",o),e>r||n>o||e<0||e>=t.rows||r<0||r>=t.rows||n<0||n>=t.columns||o<0||o>=t.columns)throw new RangeError(\\\"Submatrix indices are out of range\\\")}function ln(t,e=0){let r=[];for(let n=0;n<t;n++)r.push(e);return r}function cn(t,e){if(\\\"number\\\"!=typeof e)throw new TypeError(`${t} must be a number`)}function fn(t){if(t.isEmpty())throw new Error(\\\"Empty matrix has no elements to index\\\")}class gn{static from1DArray(t,e,r){if(t*e!==r.length)throw new RangeError(\\\"data length does not match given dimensions\\\");let n=new vn(t,e);for(let o=0;o<t;o++)for(let t=0;t<e;t++)n.set(o,t,r[o*e+t]);return n}static rowVector(t){let e=new vn(1,t.length);for(let r=0;r<t.length;r++)e.set(0,r,t[r]);return e}static columnVector(t){let e=new vn(t.length,1);for(let r=0;r<t.length;r++)e.set(r,0,t[r]);return e}static zeros(t,e){return new vn(t,e)}static ones(t,e){return new vn(t,e).fill(1)}static rand(t,e,r={}){if(\\\"object\\\"!=typeof r)throw new TypeError(\\\"options must be an object\\\");const{random:n=Math.random}=r;let o=new vn(t,e);for(let r=0;r<t;r++)for(let t=0;t<e;t++)o.set(r,t,n());return o}static randInt(t,e,r={}){if(\\\"object\\\"!=typeof r)throw new TypeError(\\\"options must be an object\\\");const{min:n=0,max:o=1e3,random:i=Math.random}=r;if(!Number.isInteger(n))throw new TypeError(\\\"min must be an integer\\\");if(!Number.isInteger(o))throw new TypeError(\\\"max must be an integer\\\");if(n>=o)throw new RangeError(\\\"min must be smaller than max\\\");let a=o-n,s=new vn(t,e);for(let r=0;r<t;r++)for(let t=0;t<e;t++){let e=n+Math.round(i()*a);s.set(r,t,e)}return s}static eye(t,e,r){void 0===e&&(e=t),void 0===r&&(r=1);let n=Math.min(t,e),o=this.zeros(t,e);for(let t=0;t<n;t++)o.set(t,t,r);return o}static diag(t,e,r){let n=t.length;void 0===e&&(e=n),void 0===r&&(r=e);let o=Math.min(n,e,r),i=this.zeros(e,r);for(let e=0;e<o;e++)i.set(e,e,t[e]);return i}static min(t,e){t=this.checkMatrix(t),e=this.checkMatrix(e);let r=t.rows,n=t.columns,o=new vn(r,n);for(let i=0;i<r;i++)for(let r=0;r<n;r++)o.set(i,r,Math.min(t.get(i,r),e.get(i,r)));return o}static max(t,e){t=this.checkMatrix(t),e=this.checkMatrix(e);let r=t.rows,n=t.columns,o=new this(r,n);for(let i=0;i<r;i++)for(let r=0;r<n;r++)o.set(i,r,Math.max(t.get(i,r),e.get(i,r)));return o}static checkMatrix(t){return gn.isMatrix(t)?t:new vn(t)}static isMatrix(t){return null!=t&&\\\"Matrix\\\"===t.klass}get size(){return this.rows*this.columns}apply(t){if(\\\"function\\\"!=typeof t)throw new TypeError(\\\"callback must be a function\\\");for(let e=0;e<this.rows;e++)for(let r=0;r<this.columns;r++)t.call(this,e,r);return this}to1DArray(){let t=[];for(let e=0;e<this.rows;e++)for(let r=0;r<this.columns;r++)t.push(this.get(e,r));return t}to2DArray(){let t=[];for(let e=0;e<this.rows;e++){t.push([]);for(let r=0;r<this.columns;r++)t[e].push(this.get(e,r))}return t}toJSON(){return this.to2DArray()}isRowVector(){return 1===this.rows}isColumnVector(){return 1===this.columns}isVector(){return 1===this.rows||1===this.columns}isSquare(){return this.rows===this.columns}isEmpty(){return 0===this.rows||0===this.columns}isSymmetric(){if(this.isSquare()){for(let t=0;t<this.rows;t++)for(let e=0;e<=t;e++)if(this.get(t,e)!==this.get(e,t))return!1;return!0}return!1}isEchelonForm(){let t=0,e=0,r=-1,n=!0,o=!1;for(;t<this.rows&&n;){for(e=0,o=!1;e<this.columns&&!1===o;)0===this.get(t,e)?e++:1===this.get(t,e)&&e>r?(o=!0,r=e):(n=!1,o=!0);t++}return n}isReducedEchelonForm(){let t=0,e=0,r=-1,n=!0,o=!1;for(;t<this.rows&&n;){for(e=0,o=!1;e<this.columns&&!1===o;)0===this.get(t,e)?e++:1===this.get(t,e)&&e>r?(o=!0,r=e):(n=!1,o=!0);for(let r=e+1;r<this.rows;r++)0!==this.get(t,r)&&(n=!1);t++}return n}echelonForm(){let t=this.clone(),e=0,r=0;for(;e<t.rows&&r<t.columns;){let n=e;for(let o=e;o<t.rows;o++)t.get(o,r)>t.get(n,r)&&(n=o);if(0===t.get(n,r))r++;else{t.swapRows(e,n);let o=t.get(e,r);for(let n=r;n<t.columns;n++)t.set(e,n,t.get(e,n)/o);for(let n=e+1;n<t.rows;n++){let o=t.get(n,r)/t.get(e,r);t.set(n,r,0);for(let i=r+1;i<t.columns;i++)t.set(n,i,t.get(n,i)-t.get(e,i)*o)}e++,r++}}return t}reducedEchelonForm(){let t=this.echelonForm(),e=t.columns,r=t.rows,n=r-1;for(;n>=0;)if(0===t.maxRow(n))n--;else{let o=0,i=!1;for(;o<r&&!1===i;)1===t.get(n,o)?i=!0:o++;for(let r=0;r<n;r++){let i=t.get(r,o);for(let a=o;a<e;a++){let e=t.get(r,a)-i*t.get(n,a);t.set(r,a,e)}}n--}return t}set(){throw new Error(\\\"set method is unimplemented\\\")}get(){throw new Error(\\\"get method is unimplemented\\\")}repeat(t={}){if(\\\"object\\\"!=typeof t)throw new TypeError(\\\"options must be an object\\\");const{rows:e=1,columns:r=1}=t;if(!Number.isInteger(e)||e<=0)throw new TypeError(\\\"rows must be a positive integer\\\");if(!Number.isInteger(r)||r<=0)throw new TypeError(\\\"columns must be a positive integer\\\");let n=new vn(this.rows*e,this.columns*r);for(let t=0;t<e;t++)for(let e=0;e<r;e++)n.setSubMatrix(this,this.rows*t,this.columns*e);return n}fill(t){for(let e=0;e<this.rows;e++)for(let r=0;r<this.columns;r++)this.set(e,r,t);return this}neg(){return this.mulS(-1)}getRow(t){an(this,t);let e=[];for(let r=0;r<this.columns;r++)e.push(this.get(t,r));return e}getRowVector(t){return vn.rowVector(this.getRow(t))}setRow(t,e){an(this,t),e=un(this,e);for(let r=0;r<this.columns;r++)this.set(t,r,e[r]);return this}swapRows(t,e){an(this,t),an(this,e);for(let r=0;r<this.columns;r++){let n=this.get(t,r);this.set(t,r,this.get(e,r)),this.set(e,r,n)}return this}getColumn(t){sn(this,t);let e=[];for(let r=0;r<this.rows;r++)e.push(this.get(r,t));return e}getColumnVector(t){return vn.columnVector(this.getColumn(t))}setColumn(t,e){sn(this,t),e=hn(this,e);for(let r=0;r<this.rows;r++)this.set(r,t,e[r]);return this}swapColumns(t,e){sn(this,t),sn(this,e);for(let r=0;r<this.rows;r++){let n=this.get(r,t);this.set(r,t,this.get(r,e)),this.set(r,e,n)}return this}addRowVector(t){t=un(this,t);for(let e=0;e<this.rows;e++)for(let r=0;r<this.columns;r++)this.set(e,r,this.get(e,r)+t[r]);return this}subRowVector(t){t=un(this,t);for(let e=0;e<this.rows;e++)for(let r=0;r<this.columns;r++)this.set(e,r,this.get(e,r)-t[r]);return this}mulRowVector(t){t=un(this,t);for(let e=0;e<this.rows;e++)for(let r=0;r<this.columns;r++)this.set(e,r,this.get(e,r)*t[r]);return this}divRowVector(t){t=un(this,t);for(let e=0;e<this.rows;e++)for(let r=0;r<this.columns;r++)this.set(e,r,this.get(e,r)/t[r]);return this}addColumnVector(t){t=hn(this,t);for(let e=0;e<this.rows;e++)for(let r=0;r<this.columns;r++)this.set(e,r,this.get(e,r)+t[e]);return this}subColumnVector(t){t=hn(this,t);for(let e=0;e<this.rows;e++)for(let r=0;r<this.columns;r++)this.set(e,r,this.get(e,r)-t[e]);return this}mulColumnVector(t){t=hn(this,t);for(let e=0;e<this.rows;e++)for(let r=0;r<this.columns;r++)this.set(e,r,this.get(e,r)*t[e]);return this}divColumnVector(t){t=hn(this,t);for(let e=0;e<this.rows;e++)for(let r=0;r<this.columns;r++)this.set(e,r,this.get(e,r)/t[e]);return this}mulRow(t,e){an(this,t);for(let r=0;r<this.columns;r++)this.set(t,r,this.get(t,r)*e);return this}mulColumn(t,e){sn(this,t);for(let r=0;r<this.rows;r++)this.set(r,t,this.get(r,t)*e);return this}max(t){if(this.isEmpty())return NaN;switch(t){case\\\"row\\\":{const t=new Array(this.rows).fill(Number.NEGATIVE_INFINITY);for(let e=0;e<this.rows;e++)for(let r=0;r<this.columns;r++)this.get(e,r)>t[e]&&(t[e]=this.get(e,r));return t}case\\\"column\\\":{const t=new Array(this.columns).fill(Number.NEGATIVE_INFINITY);for(let e=0;e<this.rows;e++)for(let r=0;r<this.columns;r++)this.get(e,r)>t[r]&&(t[r]=this.get(e,r));return t}case void 0:{let t=this.get(0,0);for(let e=0;e<this.rows;e++)for(let r=0;r<this.columns;r++)this.get(e,r)>t&&(t=this.get(e,r));return t}default:throw new Error(`invalid option: ${t}`)}}maxIndex(){fn(this);let t=this.get(0,0),e=[0,0];for(let r=0;r<this.rows;r++)for(let n=0;n<this.columns;n++)this.get(r,n)>t&&(t=this.get(r,n),e[0]=r,e[1]=n);return e}min(t){if(this.isEmpty())return NaN;switch(t){case\\\"row\\\":{const t=new Array(this.rows).fill(Number.POSITIVE_INFINITY);for(let e=0;e<this.rows;e++)for(let r=0;r<this.columns;r++)this.get(e,r)<t[e]&&(t[e]=this.get(e,r));return t}case\\\"column\\\":{const t=new Array(this.columns).fill(Number.POSITIVE_INFINITY);for(let e=0;e<this.rows;e++)for(let r=0;r<this.columns;r++)this.get(e,r)<t[r]&&(t[r]=this.get(e,r));return t}case void 0:{let t=this.get(0,0);for(let e=0;e<this.rows;e++)for(let r=0;r<this.columns;r++)this.get(e,r)<t&&(t=this.get(e,r));return t}default:throw new Error(`invalid option: ${t}`)}}minIndex(){fn(this);let t=this.get(0,0),e=[0,0];for(let r=0;r<this.rows;r++)for(let n=0;n<this.columns;n++)this.get(r,n)<t&&(t=this.get(r,n),e[0]=r,e[1]=n);return e}maxRow(t){if(an(this,t),this.isEmpty())return NaN;let e=this.get(t,0);for(let r=1;r<this.columns;r++)this.get(t,r)>e&&(e=this.get(t,r));return e}maxRowIndex(t){an(this,t),fn(this);let e=this.get(t,0),r=[t,0];for(let n=1;n<this.columns;n++)this.get(t,n)>e&&(e=this.get(t,n),r[1]=n);return r}minRow(t){if(an(this,t),this.isEmpty())return NaN;let e=this.get(t,0);for(let r=1;r<this.columns;r++)this.get(t,r)<e&&(e=this.get(t,r));return e}minRowIndex(t){an(this,t),fn(this);let e=this.get(t,0),r=[t,0];for(let n=1;n<this.columns;n++)this.get(t,n)<e&&(e=this.get(t,n),r[1]=n);return r}maxColumn(t){if(sn(this,t),this.isEmpty())return NaN;let e=this.get(0,t);for(let r=1;r<this.rows;r++)this.get(r,t)>e&&(e=this.get(r,t));return e}maxColumnIndex(t){sn(this,t),fn(this);let e=this.get(0,t),r=[0,t];for(let n=1;n<this.rows;n++)this.get(n,t)>e&&(e=this.get(n,t),r[0]=n);return r}minColumn(t){if(sn(this,t),this.isEmpty())return NaN;let e=this.get(0,t);for(let r=1;r<this.rows;r++)this.get(r,t)<e&&(e=this.get(r,t));return e}minColumnIndex(t){sn(this,t),fn(this);let e=this.get(0,t),r=[0,t];for(let n=1;n<this.rows;n++)this.get(n,t)<e&&(e=this.get(n,t),r[0]=n);return r}diag(){let t=Math.min(this.rows,this.columns),e=[];for(let r=0;r<t;r++)e.push(this.get(r,r));return e}norm(t=\\\"frobenius\\\"){let e=0;if(\\\"max\\\"===t)return this.max();if(\\\"frobenius\\\"===t){for(let t=0;t<this.rows;t++)for(let r=0;r<this.columns;r++)e+=this.get(t,r)*this.get(t,r);return Math.sqrt(e)}throw new RangeError(`unknown norm type: ${t}`)}cumulativeSum(){let t=0;for(let e=0;e<this.rows;e++)for(let r=0;r<this.columns;r++)t+=this.get(e,r),this.set(e,r,t);return this}dot(t){gn.isMatrix(t)&&(t=t.to1DArray());let e=this.to1DArray();if(e.length!==t.length)throw new RangeError(\\\"vectors do not have the same size\\\");let r=0;for(let n=0;n<e.length;n++)r+=e[n]*t[n];return r}mmul(t){t=vn.checkMatrix(t);let e=this.rows,r=this.columns,n=t.columns,o=new vn(e,n),i=new Float64Array(r);for(let a=0;a<n;a++){for(let e=0;e<r;e++)i[e]=t.get(e,a);for(let t=0;t<e;t++){let e=0;for(let n=0;n<r;n++)e+=this.get(t,n)*i[n];o.set(t,a,e)}}return o}strassen2x2(t){t=vn.checkMatrix(t);let e=new vn(2,2);const r=this.get(0,0),n=t.get(0,0),o=this.get(0,1),i=t.get(0,1),a=this.get(1,0),s=t.get(1,0),u=this.get(1,1),h=t.get(1,1),d=(r+u)*(n+h),l=(a+u)*n,c=r*(i-h),f=u*(s-n),g=(r+o)*h,p=d+f-g+(o-u)*(s+h),v=c+g,y=l+f,m=d-l+c+(a-r)*(n+i);return e.set(0,0,p),e.set(0,1,v),e.set(1,0,y),e.set(1,1,m),e}strassen3x3(t){t=vn.checkMatrix(t);let e=new vn(3,3);const r=this.get(0,0),n=this.get(0,1),o=this.get(0,2),i=this.get(1,0),a=this.get(1,1),s=this.get(1,2),u=this.get(2,0),h=this.get(2,1),d=this.get(2,2),l=t.get(0,0),c=t.get(0,1),f=t.get(0,2),g=t.get(1,0),p=t.get(1,1),v=t.get(1,2),y=t.get(2,0),m=t.get(2,1),w=t.get(2,2),x=(r-i)*(-c+p),E=(-r+i+a)*(l-c+p),N=(i+a)*(-l+c),b=r*l,M=(-r+u+h)*(l-f+v),S=(-r+u)*(f-v),k=(u+h)*(-l+f),A=(-o+h+d)*(p+y-m),_=(o-d)*(p-m),z=o*y,R=(h+d)*(-y+m),I=(-o+a+s)*(v+y-w),D=(o-s)*(v-w),O=(a+s)*(-y+w),P=b+z+n*g,T=(r+n+o-i-a-h-d)*p+E+N+b+A+z+R,C=b+M+k+(r+n+o-a-s-u-h)*v+z+I+O,q=x+a*(-l+c+g-p-v-y+w)+E+b+z+I+D,L=x+E+N+b+s*m,j=z+I+D+O+i*f,F=b+M+S+h*(-l+f+g-p-v-y+m)+A+_+z,V=A+_+z+R+u*c,B=b+M+S+k+d*w;return e.set(0,0,P),e.set(0,1,T),e.set(0,2,C),e.set(1,0,q),e.set(1,1,L),e.set(1,2,j),e.set(2,0,F),e.set(2,1,V),e.set(2,2,B),e}mmulStrassen(t){t=vn.checkMatrix(t);let e=this.clone(),r=e.rows,n=e.columns,o=t.rows,i=t.columns;function a(t,e,r){let n=t.rows,o=t.columns;if(n===e&&o===r)return t;{let n=gn.zeros(e,r);return n=n.setSubMatrix(t,0,0),n}}n!==o&&console.warn(`Multiplying ${r} x ${n} and ${o} x ${i} matrix: dimensions do not match.`);let s=Math.max(r,o),u=Math.max(n,i);return e=a(e,s,u),function t(e,r,n,o){if(n<=512||o<=512)return e.mmul(r);n%2==1&&o%2==1?(e=a(e,n+1,o+1),r=a(r,n+1,o+1)):n%2==1?(e=a(e,n+1,o),r=a(r,n+1,o)):o%2==1&&(e=a(e,n,o+1),r=a(r,n,o+1));let i=parseInt(e.rows/2,10),s=parseInt(e.columns/2,10),u=e.subMatrix(0,i-1,0,s-1),h=r.subMatrix(0,i-1,0,s-1),d=e.subMatrix(0,i-1,s,e.columns-1),l=r.subMatrix(0,i-1,s,r.columns-1),c=e.subMatrix(i,e.rows-1,0,s-1),f=r.subMatrix(i,r.rows-1,0,s-1),g=e.subMatrix(i,e.rows-1,s,e.columns-1),p=r.subMatrix(i,r.rows-1,s,r.columns-1),v=t(gn.add(u,g),gn.add(h,p),i,s),y=t(gn.add(c,g),h,i,s),m=t(u,gn.sub(l,p),i,s),w=t(g,gn.sub(f,h),i,s),x=t(gn.add(u,d),p,i,s),E=t(gn.sub(c,u),gn.add(h,l),i,s),N=t(gn.sub(d,g),gn.add(f,p),i,s),b=gn.add(v,w);b.sub(x),b.add(N);let M=gn.add(m,x),S=gn.add(y,w),k=gn.sub(v,y);k.add(m),k.add(E);let A=gn.zeros(2*b.rows,2*b.columns);return A=A.setSubMatrix(b,0,0),A=A.setSubMatrix(M,b.rows,0),A=A.setSubMatrix(S,0,b.columns),A=A.setSubMatrix(k,b.rows,b.columns),A.subMatrix(0,n-1,0,o-1)}(e,t=a(t,s,u),s,u)}scaleRows(t={}){if(\\\"object\\\"!=typeof t)throw new TypeError(\\\"options must be an object\\\");const{min:e=0,max:r=1}=t;if(!Number.isFinite(e))throw new TypeError(\\\"min must be a number\\\");if(!Number.isFinite(r))throw new TypeError(\\\"max must be a number\\\");if(e>=r)throw new RangeError(\\\"min must be smaller than max\\\");let n=new vn(this.rows,this.columns);for(let t=0;t<this.rows;t++){const o=this.getRow(t);o.length>0&&Zr(o,{min:e,max:r,output:o}),n.setRow(t,o)}return n}scaleColumns(t={}){if(\\\"object\\\"!=typeof t)throw new TypeError(\\\"options must be an object\\\");const{min:e=0,max:r=1}=t;if(!Number.isFinite(e))throw new TypeError(\\\"min must be a number\\\");if(!Number.isFinite(r))throw new TypeError(\\\"max must be a number\\\");if(e>=r)throw new RangeError(\\\"min must be smaller than max\\\");let n=new vn(this.rows,this.columns);for(let t=0;t<this.columns;t++){const o=this.getColumn(t);o.length&&Zr(o,{min:e,max:r,output:o}),n.setColumn(t,o)}return n}flipRows(){const t=Math.ceil(this.columns/2);for(let e=0;e<this.rows;e++)for(let r=0;r<t;r++){let t=this.get(e,r),n=this.get(e,this.columns-1-r);this.set(e,r,n),this.set(e,this.columns-1-r,t)}return this}flipColumns(){const t=Math.ceil(this.rows/2);for(let e=0;e<this.columns;e++)for(let r=0;r<t;r++){let t=this.get(r,e),n=this.get(this.rows-1-r,e);this.set(r,e,n),this.set(this.rows-1-r,e,t)}return this}kroneckerProduct(t){t=vn.checkMatrix(t);let e=this.rows,r=this.columns,n=t.rows,o=t.columns,i=new vn(e*n,r*o);for(let a=0;a<e;a++)for(let e=0;e<r;e++)for(let r=0;r<n;r++)for(let s=0;s<o;s++)i.set(n*a+r,o*e+s,this.get(a,e)*t.get(r,s));return i}kroneckerSum(t){if(t=vn.checkMatrix(t),!this.isSquare()||!t.isSquare())throw new Error(\\\"Kronecker Sum needs two Square Matrices\\\");let e=this.rows,r=t.rows,n=this.kroneckerProduct(vn.eye(r,r)),o=vn.eye(e,e).kroneckerProduct(t);return n.add(o)}transpose(){let t=new vn(this.columns,this.rows);for(let e=0;e<this.rows;e++)for(let r=0;r<this.columns;r++)t.set(r,e,this.get(e,r));return t}sortRows(t=pn){for(let e=0;e<this.rows;e++)this.setRow(e,this.getRow(e).sort(t));return this}sortColumns(t=pn){for(let e=0;e<this.columns;e++)this.setColumn(e,this.getColumn(e).sort(t));return this}subMatrix(t,e,r,n){dn(this,t,e,r,n);let o=new vn(e-t+1,n-r+1);for(let i=t;i<=e;i++)for(let e=r;e<=n;e++)o.set(i-t,e-r,this.get(i,e));return o}subMatrixRow(t,e,r){if(void 0===e&&(e=0),void 0===r&&(r=this.columns-1),e>r||e<0||e>=this.columns||r<0||r>=this.columns)throw new RangeError(\\\"Argument out of range\\\");let n=new vn(t.length,r-e+1);for(let o=0;o<t.length;o++)for(let i=e;i<=r;i++){if(t[o]<0||t[o]>=this.rows)throw new RangeError(`Row index out of range: ${t[o]}`);n.set(o,i-e,this.get(t[o],i))}return n}subMatrixColumn(t,e,r){if(void 0===e&&(e=0),void 0===r&&(r=this.rows-1),e>r||e<0||e>=this.rows||r<0||r>=this.rows)throw new RangeError(\\\"Argument out of range\\\");let n=new vn(r-e+1,t.length);for(let o=0;o<t.length;o++)for(let i=e;i<=r;i++){if(t[o]<0||t[o]>=this.columns)throw new RangeError(`Column index out of range: ${t[o]}`);n.set(i-e,o,this.get(i,t[o]))}return n}setSubMatrix(t,e,r){if((t=vn.checkMatrix(t)).isEmpty())return this;dn(this,e,e+t.rows-1,r,r+t.columns-1);for(let n=0;n<t.rows;n++)for(let o=0;o<t.columns;o++)this.set(e+n,r+o,t.get(n,o));return this}selection(t,e){!function(t,e){if(!Qr(e))throw new TypeError(\\\"row indices must be an array\\\");for(let r=0;r<e.length;r++)if(e[r]<0||e[r]>=t.rows)throw new RangeError(\\\"row indices are out of range\\\")}(this,t),function(t,e){if(!Qr(e))throw new TypeError(\\\"column indices must be an array\\\");for(let r=0;r<e.length;r++)if(e[r]<0||e[r]>=t.columns)throw new RangeError(\\\"column indices are out of range\\\")}(this,e);let r=new vn(t.length,e.length);for(let n=0;n<t.length;n++){let o=t[n];for(let t=0;t<e.length;t++){let i=e[t];r.set(n,t,this.get(o,i))}}return r}trace(){let t=Math.min(this.rows,this.columns),e=0;for(let r=0;r<t;r++)e+=this.get(r,r);return e}clone(){let t=new vn(this.rows,this.columns);for(let e=0;e<this.rows;e++)for(let r=0;r<this.columns;r++)t.set(e,r,this.get(e,r));return t}sum(t){switch(t){case\\\"row\\\":return function(t){let e=ln(t.rows);for(let r=0;r<t.rows;++r)for(let n=0;n<t.columns;++n)e[r]+=t.get(r,n);return e}(this);case\\\"column\\\":return function(t){let e=ln(t.columns);for(let r=0;r<t.rows;++r)for(let n=0;n<t.columns;++n)e[n]+=t.get(r,n);return e}(this);case void 0:return function(t){let e=0;for(let r=0;r<t.rows;r++)for(let n=0;n<t.columns;n++)e+=t.get(r,n);return e}(this);default:throw new Error(`invalid option: ${t}`)}}product(t){switch(t){case\\\"row\\\":return function(t){let e=ln(t.rows,1);for(let r=0;r<t.rows;++r)for(let n=0;n<t.columns;++n)e[r]*=t.get(r,n);return e}(this);case\\\"column\\\":return function(t){let e=ln(t.columns,1);for(let r=0;r<t.rows;++r)for(let n=0;n<t.columns;++n)e[n]*=t.get(r,n);return e}(this);case void 0:return function(t){let e=1;for(let r=0;r<t.rows;r++)for(let n=0;n<t.columns;n++)e*=t.get(r,n);return e}(this);default:throw new Error(`invalid option: ${t}`)}}mean(t){const e=this.sum(t);switch(t){case\\\"row\\\":for(let t=0;t<this.rows;t++)e[t]/=this.columns;return e;case\\\"column\\\":for(let t=0;t<this.columns;t++)e[t]/=this.rows;return e;case void 0:return e/this.size;default:throw new Error(`invalid option: ${t}`)}}variance(t,e={}){if(\\\"object\\\"==typeof t&&(e=t,t=void 0),\\\"object\\\"!=typeof e)throw new TypeError(\\\"options must be an object\\\");const{unbiased:r=!0,mean:n=this.mean(t)}=e;if(\\\"boolean\\\"!=typeof r)throw new TypeError(\\\"unbiased must be a boolean\\\");switch(t){case\\\"row\\\":if(!Qr(n))throw new TypeError(\\\"mean must be an array\\\");return function(t,e,r){const n=t.rows,o=t.columns,i=[];for(let a=0;a<n;a++){let n=0,s=0,u=0;for(let e=0;e<o;e++)u=t.get(a,e)-r[a],n+=u,s+=u*u;e?i.push((s-n*n/o)/(o-1)):i.push((s-n*n/o)/o)}return i}(this,r,n);case\\\"column\\\":if(!Qr(n))throw new TypeError(\\\"mean must be an array\\\");return function(t,e,r){const n=t.rows,o=t.columns,i=[];for(let a=0;a<o;a++){let o=0,s=0,u=0;for(let e=0;e<n;e++)u=t.get(e,a)-r[a],o+=u,s+=u*u;e?i.push((s-o*o/n)/(n-1)):i.push((s-o*o/n)/n)}return i}(this,r,n);case void 0:if(\\\"number\\\"!=typeof n)throw new TypeError(\\\"mean must be a number\\\");return function(t,e,r){const n=t.rows,o=t.columns,i=n*o;let a=0,s=0,u=0;for(let e=0;e<n;e++)for(let n=0;n<o;n++)u=t.get(e,n)-r,a+=u,s+=u*u;return e?(s-a*a/i)/(i-1):(s-a*a/i)/i}(this,r,n);default:throw new Error(`invalid option: ${t}`)}}standardDeviation(t,e){\\\"object\\\"==typeof t&&(e=t,t=void 0);const r=this.variance(t,e);if(void 0===t)return Math.sqrt(r);for(let t=0;t<r.length;t++)r[t]=Math.sqrt(r[t]);return r}center(t,e={}){if(\\\"object\\\"==typeof t&&(e=t,t=void 0),\\\"object\\\"!=typeof e)throw new TypeError(\\\"options must be an object\\\");const{center:r=this.mean(t)}=e;switch(t){case\\\"row\\\":if(!Qr(r))throw new TypeError(\\\"center must be an array\\\");return function(t,e){for(let r=0;r<t.rows;r++)for(let n=0;n<t.columns;n++)t.set(r,n,t.get(r,n)-e[r])}(this,r),this;case\\\"column\\\":if(!Qr(r))throw new TypeError(\\\"center must be an array\\\");return function(t,e){for(let r=0;r<t.rows;r++)for(let n=0;n<t.columns;n++)t.set(r,n,t.get(r,n)-e[n])}(this,r),this;case void 0:if(\\\"number\\\"!=typeof r)throw new TypeError(\\\"center must be a number\\\");return function(t,e){for(let r=0;r<t.rows;r++)for(let n=0;n<t.columns;n++)t.set(r,n,t.get(r,n)-e)}(this,r),this;default:throw new Error(`invalid option: ${t}`)}}scale(t,e={}){if(\\\"object\\\"==typeof t&&(e=t,t=void 0),\\\"object\\\"!=typeof e)throw new TypeError(\\\"options must be an object\\\");let r=e.scale;switch(t){case\\\"row\\\":if(void 0===r)r=function(t){const e=[];for(let r=0;r<t.rows;r++){let n=0;for(let e=0;e<t.columns;e++)n+=Math.pow(t.get(r,e),2)/(t.columns-1);e.push(Math.sqrt(n))}return e}(this);else if(!Qr(r))throw new TypeError(\\\"scale must be an array\\\");return function(t,e){for(let r=0;r<t.rows;r++)for(let n=0;n<t.columns;n++)t.set(r,n,t.get(r,n)/e[r])}(this,r),this;case\\\"column\\\":if(void 0===r)r=function(t){const e=[];for(let r=0;r<t.columns;r++){let n=0;for(let e=0;e<t.rows;e++)n+=Math.pow(t.get(e,r),2)/(t.rows-1);e.push(Math.sqrt(n))}return e}(this);else if(!Qr(r))throw new TypeError(\\\"scale must be an array\\\");return function(t,e){for(let r=0;r<t.rows;r++)for(let n=0;n<t.columns;n++)t.set(r,n,t.get(r,n)/e[n])}(this,r),this;case void 0:if(void 0===r)r=function(t){const e=t.size-1;let r=0;for(let n=0;n<t.columns;n++)for(let o=0;o<t.rows;o++)r+=Math.pow(t.get(o,n),2)/e;return Math.sqrt(r)}(this);else if(\\\"number\\\"!=typeof r)throw new TypeError(\\\"scale must be a number\\\");return function(t,e){for(let r=0;r<t.rows;r++)for(let n=0;n<t.columns;n++)t.set(r,n,t.get(r,n)/e)}(this,r),this;default:throw new Error(`invalid option: ${t}`)}}toString(t){return rn(this,t)}}function pn(t,e){return t-e}gn.prototype.klass=\\\"Matrix\\\",\\\"undefined\\\"!=typeof Symbol&&(gn.prototype[Symbol.for(\\\"nodejs.util.inspect.custom\\\")]=function(){return rn(this)}),gn.random=gn.rand,gn.randomInt=gn.randInt,gn.diagonal=gn.diag,gn.prototype.diagonal=gn.prototype.diag,gn.identity=gn.eye,gn.prototype.negate=gn.prototype.neg,gn.prototype.tensorProduct=gn.prototype.kroneckerProduct;class vn extends gn{constructor(t,e){if(super(),vn.isMatrix(t))return t.clone();if(Number.isInteger(t)&&t>=0){if(this.data=[],!(Number.isInteger(e)&&e>=0))throw new TypeError(\\\"nColumns must be a positive integer\\\");for(let r=0;r<t;r++)this.data.push(new Float64Array(e))}else{if(!Qr(t))throw new TypeError(\\\"First argument must be a positive number or an array\\\");{const r=t;if(\\\"number\\\"!=typeof(e=(t=r.length)?r[0].length:0))throw new TypeError(\\\"Data must be a 2D array with at least one element\\\");this.data=[];for(let n=0;n<t;n++){if(r[n].length!==e)throw new RangeError(\\\"Inconsistent array dimensions\\\");if(!r[n].every((t=>\\\"number\\\"==typeof t)))throw new TypeError(\\\"Input data contains non-numeric values\\\");this.data.push(Float64Array.from(r[n]))}}}this.rows=t,this.columns=e}set(t,e,r){return this.data[t][e]=r,this}get(t,e){return this.data[t][e]}removeRow(t){return an(this,t),this.data.splice(t,1),this.rows-=1,this}addRow(t,e){return void 0===e&&(e=t,t=this.rows),an(this,t,!0),e=Float64Array.from(un(this,e)),this.data.splice(t,0,e),this.rows+=1,this}removeColumn(t){sn(this,t);for(let e=0;e<this.rows;e++){const r=new Float64Array(this.columns-1);for(let n=0;n<t;n++)r[n]=this.data[e][n];for(let n=t+1;n<this.columns;n++)r[n-1]=this.data[e][n];this.data[e]=r}return this.columns-=1,this}addColumn(t,e){void 0===e&&(e=t,t=this.columns),sn(this,t,!0),e=hn(this,e);for(let r=0;r<this.rows;r++){const n=new Float64Array(this.columns+1);let o=0;for(;o<t;o++)n[o]=this.data[r][o];for(n[o++]=e[r];o<this.columns+1;o++)n[o]=this.data[r][o-1];this.data[r]=n}return this.columns+=1,this}}!function(t,e){t.prototype.add=function(t){return\\\"number\\\"==typeof t?this.addS(t):this.addM(t)},t.prototype.addS=function(t){for(let e=0;e<this.rows;e++)for(let r=0;r<this.columns;r++)this.set(e,r,this.get(e,r)+t);return this},t.prototype.addM=function(t){if(t=e.checkMatrix(t),this.rows!==t.rows||this.columns!==t.columns)throw new RangeError(\\\"Matrices dimensions must be equal\\\");for(let e=0;e<this.rows;e++)for(let r=0;r<this.columns;r++)this.set(e,r,this.get(e,r)+t.get(e,r));return this},t.add=function(t,r){return new e(t).add(r)},t.prototype.sub=function(t){return\\\"number\\\"==typeof t?this.subS(t):this.subM(t)},t.prototype.subS=function(t){for(let e=0;e<this.rows;e++)for(let r=0;r<this.columns;r++)this.set(e,r,this.get(e,r)-t);return this},t.prototype.subM=function(t){if(t=e.checkMatrix(t),this.rows!==t.rows||this.columns!==t.columns)throw new RangeError(\\\"Matrices dimensions must be equal\\\");for(let e=0;e<this.rows;e++)for(let r=0;r<this.columns;r++)this.set(e,r,this.get(e,r)-t.get(e,r));return this},t.sub=function(t,r){return new e(t).sub(r)},t.prototype.subtract=t.prototype.sub,t.prototype.subtractS=t.prototype.subS,t.prototype.subtractM=t.prototype.subM,t.subtract=t.sub,t.prototype.mul=function(t){return\\\"number\\\"==typeof t?this.mulS(t):this.mulM(t)},t.prototype.mulS=function(t){for(let e=0;e<this.rows;e++)for(let r=0;r<this.columns;r++)this.set(e,r,this.get(e,r)*t);return this},t.prototype.mulM=function(t){if(t=e.checkMatrix(t),this.rows!==t.rows||this.columns!==t.columns)throw new RangeError(\\\"Matrices dimensions must be equal\\\");for(let e=0;e<this.rows;e++)for(let r=0;r<this.columns;r++)this.set(e,r,this.get(e,r)*t.get(e,r));return this},t.mul=function(t,r){return new e(t).mul(r)},t.prototype.multiply=t.prototype.mul,t.prototype.multiplyS=t.prototype.mulS,t.prototype.multiplyM=t.prototype.mulM,t.multiply=t.mul,t.prototype.div=function(t){return\\\"number\\\"==typeof t?this.divS(t):this.divM(t)},t.prototype.divS=function(t){for(let e=0;e<this.rows;e++)for(let r=0;r<this.columns;r++)this.set(e,r,this.get(e,r)/t);return this},t.prototype.divM=function(t){if(t=e.checkMatrix(t),this.rows!==t.rows||this.columns!==t.columns)throw new RangeError(\\\"Matrices dimensions must be equal\\\");for(let e=0;e<this.rows;e++)for(let r=0;r<this.columns;r++)this.set(e,r,this.get(e,r)/t.get(e,r));return this},t.div=function(t,r){return new e(t).div(r)},t.prototype.divide=t.prototype.div,t.prototype.divideS=t.prototype.divS,t.prototype.divideM=t.prototype.divM,t.divide=t.div,t.prototype.mod=function(t){return\\\"number\\\"==typeof t?this.modS(t):this.modM(t)},t.prototype.modS=function(t){for(let e=0;e<this.rows;e++)for(let r=0;r<this.columns;r++)this.set(e,r,this.get(e,r)%t);return this},t.prototype.modM=function(t){if(t=e.checkMatrix(t),this.rows!==t.rows||this.columns!==t.columns)throw new RangeError(\\\"Matrices dimensions must be equal\\\");for(let e=0;e<this.rows;e++)for(let r=0;r<this.columns;r++)this.set(e,r,this.get(e,r)%t.get(e,r));return this},t.mod=function(t,r){return new e(t).mod(r)},t.prototype.modulus=t.prototype.mod,t.prototype.modulusS=t.prototype.modS,t.prototype.modulusM=t.prototype.modM,t.modulus=t.mod,t.prototype.and=function(t){return\\\"number\\\"==typeof t?this.andS(t):this.andM(t)},t.prototype.andS=function(t){for(let e=0;e<this.rows;e++)for(let r=0;r<this.columns;r++)this.set(e,r,this.get(e,r)&t);return this},t.prototype.andM=function(t){if(t=e.checkMatrix(t),this.rows!==t.rows||this.columns!==t.columns)throw new RangeError(\\\"Matrices dimensions must be equal\\\");for(let e=0;e<this.rows;e++)for(let r=0;r<this.columns;r++)this.set(e,r,this.get(e,r)&t.get(e,r));return this},t.and=function(t,r){return new e(t).and(r)},t.prototype.or=function(t){return\\\"number\\\"==typeof t?this.orS(t):this.orM(t)},t.prototype.orS=function(t){for(let e=0;e<this.rows;e++)for(let r=0;r<this.columns;r++)this.set(e,r,this.get(e,r)|t);return this},t.prototype.orM=function(t){if(t=e.checkMatrix(t),this.rows!==t.rows||this.columns!==t.columns)throw new RangeError(\\\"Matrices dimensions must be equal\\\");for(let e=0;e<this.rows;e++)for(let r=0;r<this.columns;r++)this.set(e,r,this.get(e,r)|t.get(e,r));return this},t.or=function(t,r){return new e(t).or(r)},t.prototype.xor=function(t){return\\\"number\\\"==typeof t?this.xorS(t):this.xorM(t)},t.prototype.xorS=function(t){for(let e=0;e<this.rows;e++)for(let r=0;r<this.columns;r++)this.set(e,r,this.get(e,r)^t);return this},t.prototype.xorM=function(t){if(t=e.checkMatrix(t),this.rows!==t.rows||this.columns!==t.columns)throw new RangeError(\\\"Matrices dimensions must be equal\\\");for(let e=0;e<this.rows;e++)for(let r=0;r<this.columns;r++)this.set(e,r,this.get(e,r)^t.get(e,r));return this},t.xor=function(t,r){return new e(t).xor(r)},t.prototype.leftShift=function(t){return\\\"number\\\"==typeof t?this.leftShiftS(t):this.leftShiftM(t)},t.prototype.leftShiftS=function(t){for(let e=0;e<this.rows;e++)for(let r=0;r<this.columns;r++)this.set(e,r,this.get(e,r)<<t);return this},t.prototype.leftShiftM=function(t){if(t=e.checkMatrix(t),this.rows!==t.rows||this.columns!==t.columns)throw new RangeError(\\\"Matrices dimensions must be equal\\\");for(let e=0;e<this.rows;e++)for(let r=0;r<this.columns;r++)this.set(e,r,this.get(e,r)<<t.get(e,r));return this},t.leftShift=function(t,r){return new e(t).leftShift(r)},t.prototype.signPropagatingRightShift=function(t){return\\\"number\\\"==typeof t?this.signPropagatingRightShiftS(t):this.signPropagatingRightShiftM(t)},t.prototype.signPropagatingRightShiftS=function(t){for(let e=0;e<this.rows;e++)for(let r=0;r<this.columns;r++)this.set(e,r,this.get(e,r)>>t);return this},t.prototype.signPropagatingRightShiftM=function(t){if(t=e.checkMatrix(t),this.rows!==t.rows||this.columns!==t.columns)throw new RangeError(\\\"Matrices dimensions must be equal\\\");for(let e=0;e<this.rows;e++)for(let r=0;r<this.columns;r++)this.set(e,r,this.get(e,r)>>t.get(e,r));return this},t.signPropagatingRightShift=function(t,r){return new e(t).signPropagatingRightShift(r)},t.prototype.rightShift=function(t){return\\\"number\\\"==typeof t?this.rightShiftS(t):this.rightShiftM(t)},t.prototype.rightShiftS=function(t){for(let e=0;e<this.rows;e++)for(let r=0;r<this.columns;r++)this.set(e,r,this.get(e,r)>>>t);return this},t.prototype.rightShiftM=function(t){if(t=e.checkMatrix(t),this.rows!==t.rows||this.columns!==t.columns)throw new RangeError(\\\"Matrices dimensions must be equal\\\");for(let e=0;e<this.rows;e++)for(let r=0;r<this.columns;r++)this.set(e,r,this.get(e,r)>>>t.get(e,r));return this},t.rightShift=function(t,r){return new e(t).rightShift(r)},t.prototype.zeroFillRightShift=t.prototype.rightShift,t.prototype.zeroFillRightShiftS=t.prototype.rightShiftS,t.prototype.zeroFillRightShiftM=t.prototype.rightShiftM,t.zeroFillRightShift=t.rightShift,t.prototype.not=function(){for(let t=0;t<this.rows;t++)for(let e=0;e<this.columns;e++)this.set(t,e,~this.get(t,e));return this},t.not=function(t){return new e(t).not()},t.prototype.abs=function(){for(let t=0;t<this.rows;t++)for(let e=0;e<this.columns;e++)this.set(t,e,Math.abs(this.get(t,e)));return this},t.abs=function(t){return new e(t).abs()},t.prototype.acos=function(){for(let t=0;t<this.rows;t++)for(let e=0;e<this.columns;e++)this.set(t,e,Math.acos(this.get(t,e)));return this},t.acos=function(t){return new e(t).acos()},t.prototype.acosh=function(){for(let t=0;t<this.rows;t++)for(let e=0;e<this.columns;e++)this.set(t,e,Math.acosh(this.get(t,e)));return this},t.acosh=function(t){return new e(t).acosh()},t.prototype.asin=function(){for(let t=0;t<this.rows;t++)for(let e=0;e<this.columns;e++)this.set(t,e,Math.asin(this.get(t,e)));return this},t.asin=function(t){return new e(t).asin()},t.prototype.asinh=function(){for(let t=0;t<this.rows;t++)for(let e=0;e<this.columns;e++)this.set(t,e,Math.asinh(this.get(t,e)));return this},t.asinh=function(t){return new e(t).asinh()},t.prototype.atan=function(){for(let t=0;t<this.rows;t++)for(let e=0;e<this.columns;e++)this.set(t,e,Math.atan(this.get(t,e)));return this},t.atan=function(t){return new e(t).atan()},t.prototype.atanh=function(){for(let t=0;t<this.rows;t++)for(let e=0;e<this.columns;e++)this.set(t,e,Math.atanh(this.get(t,e)));return this},t.atanh=function(t){return new e(t).atanh()},t.prototype.cbrt=function(){for(let t=0;t<this.rows;t++)for(let e=0;e<this.columns;e++)this.set(t,e,Math.cbrt(this.get(t,e)));return this},t.cbrt=function(t){return new e(t).cbrt()},t.prototype.ceil=function(){for(let t=0;t<this.rows;t++)for(let e=0;e<this.columns;e++)this.set(t,e,Math.ceil(this.get(t,e)));return this},t.ceil=function(t){return new e(t).ceil()},t.prototype.clz32=function(){for(let t=0;t<this.rows;t++)for(let e=0;e<this.columns;e++)this.set(t,e,Math.clz32(this.get(t,e)));return this},t.clz32=function(t){return new e(t).clz32()},t.prototype.cos=function(){for(let t=0;t<this.rows;t++)for(let e=0;e<this.columns;e++)this.set(t,e,Math.cos(this.get(t,e)));return this},t.cos=function(t){return new e(t).cos()},t.prototype.cosh=function(){for(let t=0;t<this.rows;t++)for(let e=0;e<this.columns;e++)this.set(t,e,Math.cosh(this.get(t,e)));return this},t.cosh=function(t){return new e(t).cosh()},t.prototype.exp=function(){for(let t=0;t<this.rows;t++)for(let e=0;e<this.columns;e++)this.set(t,e,Math.exp(this.get(t,e)));return this},t.exp=function(t){return new e(t).exp()},t.prototype.expm1=function(){for(let t=0;t<this.rows;t++)for(let e=0;e<this.columns;e++)this.set(t,e,Math.expm1(this.get(t,e)));return this},t.expm1=function(t){return new e(t).expm1()},t.prototype.floor=function(){for(let t=0;t<this.rows;t++)for(let e=0;e<this.columns;e++)this.set(t,e,Math.floor(this.get(t,e)));return this},t.floor=function(t){return new e(t).floor()},t.prototype.fround=function(){for(let t=0;t<this.rows;t++)for(let e=0;e<this.columns;e++)this.set(t,e,Math.fround(this.get(t,e)));return this},t.fround=function(t){return new e(t).fround()},t.prototype.log=function(){for(let t=0;t<this.rows;t++)for(let e=0;e<this.columns;e++)this.set(t,e,Math.log(this.get(t,e)));return this},t.log=function(t){return new e(t).log()},t.prototype.log1p=function(){for(let t=0;t<this.rows;t++)for(let e=0;e<this.columns;e++)this.set(t,e,Math.log1p(this.get(t,e)));return this},t.log1p=function(t){return new e(t).log1p()},t.prototype.log10=function(){for(let t=0;t<this.rows;t++)for(let e=0;e<this.columns;e++)this.set(t,e,Math.log10(this.get(t,e)));return this},t.log10=function(t){return new e(t).log10()},t.prototype.log2=function(){for(let t=0;t<this.rows;t++)for(let e=0;e<this.columns;e++)this.set(t,e,Math.log2(this.get(t,e)));return this},t.log2=function(t){return new e(t).log2()},t.prototype.round=function(){for(let t=0;t<this.rows;t++)for(let e=0;e<this.columns;e++)this.set(t,e,Math.round(this.get(t,e)));return this},t.round=function(t){return new e(t).round()},t.prototype.sign=function(){for(let t=0;t<this.rows;t++)for(let e=0;e<this.columns;e++)this.set(t,e,Math.sign(this.get(t,e)));return this},t.sign=function(t){return new e(t).sign()},t.prototype.sin=function(){for(let t=0;t<this.rows;t++)for(let e=0;e<this.columns;e++)this.set(t,e,Math.sin(this.get(t,e)));return this},t.sin=function(t){return new e(t).sin()},t.prototype.sinh=function(){for(let t=0;t<this.rows;t++)for(let e=0;e<this.columns;e++)this.set(t,e,Math.sinh(this.get(t,e)));return this},t.sinh=function(t){return new e(t).sinh()},t.prototype.sqrt=function(){for(let t=0;t<this.rows;t++)for(let e=0;e<this.columns;e++)this.set(t,e,Math.sqrt(this.get(t,e)));return this},t.sqrt=function(t){return new e(t).sqrt()},t.prototype.tan=function(){for(let t=0;t<this.rows;t++)for(let e=0;e<this.columns;e++)this.set(t,e,Math.tan(this.get(t,e)));return this},t.tan=function(t){return new e(t).tan()},t.prototype.tanh=function(){for(let t=0;t<this.rows;t++)for(let e=0;e<this.columns;e++)this.set(t,e,Math.tanh(this.get(t,e)));return this},t.tanh=function(t){return new e(t).tanh()},t.prototype.trunc=function(){for(let t=0;t<this.rows;t++)for(let e=0;e<this.columns;e++)this.set(t,e,Math.trunc(this.get(t,e)));return this},t.trunc=function(t){return new e(t).trunc()},t.pow=function(t,r){return new e(t).pow(r)},t.prototype.pow=function(t){return\\\"number\\\"==typeof t?this.powS(t):this.powM(t)},t.prototype.powS=function(t){for(let e=0;e<this.rows;e++)for(let r=0;r<this.columns;r++)this.set(e,r,Math.pow(this.get(e,r),t));return this},t.prototype.powM=function(t){if(t=e.checkMatrix(t),this.rows!==t.rows||this.columns!==t.columns)throw new RangeError(\\\"Matrices dimensions must be equal\\\");for(let e=0;e<this.rows;e++)for(let r=0;r<this.columns;r++)this.set(e,r,Math.pow(this.get(e,r),t.get(e,r)));return this}}(gn,vn);class yn extends gn{constructor(t){super(),this.data=t,this.rows=t.length,this.columns=t[0].length}set(t,e,r){return this.data[t][e]=r,this}get(t,e){return this.data[t][e]}}function mn(t,e){let r=0;return Math.abs(t)>Math.abs(e)?(r=e/t,Math.abs(t)*Math.sqrt(1+r*r)):0!==e?(r=t/e,Math.abs(e)*Math.sqrt(1+r*r)):0}class wn{constructor(t,e={}){if((t=yn.checkMatrix(t)).isEmpty())throw new Error(\\\"Matrix must be non-empty\\\");let r=t.rows,n=t.columns;const{computeLeftSingularVectors:o=!0,computeRightSingularVectors:i=!0,autoTranspose:a=!1}=e;let s,u=Boolean(o),h=Boolean(i),d=!1;if(r<n)if(a){s=t.transpose(),r=s.rows,n=s.columns,d=!0;let e=u;u=h,h=e}else s=t.clone(),console.warn(\\\"Computing SVD on a matrix with more columns than rows. Consider enabling autoTranspose\\\");else s=t.clone();let l=Math.min(r,n),c=Math.min(r+1,n),f=new Float64Array(c),g=new vn(r,l),p=new vn(n,n),v=new Float64Array(n),y=new Float64Array(r),m=new Float64Array(c);for(let t=0;t<c;t++)m[t]=t;let w=Math.min(r-1,n),x=Math.max(0,Math.min(n-2,r)),E=Math.max(w,x);for(let t=0;t<E;t++){if(t<w){f[t]=0;for(let e=t;e<r;e++)f[t]=mn(f[t],s.get(e,t));if(0!==f[t]){s.get(t,t)<0&&(f[t]=-f[t]);for(let e=t;e<r;e++)s.set(e,t,s.get(e,t)/f[t]);s.set(t,t,s.get(t,t)+1)}f[t]=-f[t]}for(let e=t+1;e<n;e++){if(t<w&&0!==f[t]){let n=0;for(let o=t;o<r;o++)n+=s.get(o,t)*s.get(o,e);n=-n/s.get(t,t);for(let o=t;o<r;o++)s.set(o,e,s.get(o,e)+n*s.get(o,t))}v[e]=s.get(t,e)}if(u&&t<w)for(let e=t;e<r;e++)g.set(e,t,s.get(e,t));if(t<x){v[t]=0;for(let e=t+1;e<n;e++)v[t]=mn(v[t],v[e]);if(0!==v[t]){v[t+1]<0&&(v[t]=0-v[t]);for(let e=t+1;e<n;e++)v[e]/=v[t];v[t+1]+=1}if(v[t]=-v[t],t+1<r&&0!==v[t]){for(let e=t+1;e<r;e++)y[e]=0;for(let e=t+1;e<r;e++)for(let r=t+1;r<n;r++)y[e]+=v[r]*s.get(e,r);for(let e=t+1;e<n;e++){let n=-v[e]/v[t+1];for(let o=t+1;o<r;o++)s.set(o,e,s.get(o,e)+n*y[o])}}if(h)for(let e=t+1;e<n;e++)p.set(e,t,v[e])}}let N=Math.min(n,r+1);if(w<n&&(f[w]=s.get(w,w)),r<N&&(f[N-1]=0),x+1<N&&(v[x]=s.get(x,N-1)),v[N-1]=0,u){for(let t=w;t<l;t++){for(let e=0;e<r;e++)g.set(e,t,0);g.set(t,t,1)}for(let t=w-1;t>=0;t--)if(0!==f[t]){for(let e=t+1;e<l;e++){let n=0;for(let o=t;o<r;o++)n+=g.get(o,t)*g.get(o,e);n=-n/g.get(t,t);for(let o=t;o<r;o++)g.set(o,e,g.get(o,e)+n*g.get(o,t))}for(let e=t;e<r;e++)g.set(e,t,-g.get(e,t));g.set(t,t,1+g.get(t,t));for(let e=0;e<t-1;e++)g.set(e,t,0)}else{for(let e=0;e<r;e++)g.set(e,t,0);g.set(t,t,1)}}if(h)for(let t=n-1;t>=0;t--){if(t<x&&0!==v[t])for(let e=t+1;e<n;e++){let r=0;for(let o=t+1;o<n;o++)r+=p.get(o,t)*p.get(o,e);r=-r/p.get(t+1,t);for(let o=t+1;o<n;o++)p.set(o,e,p.get(o,e)+r*p.get(o,t))}for(let e=0;e<n;e++)p.set(e,t,0);p.set(t,t,1)}let b=N-1,M=0,S=Number.EPSILON;for(;N>0;){let t,e;for(t=N-2;t>=-1&&-1!==t;t--){const e=Number.MIN_VALUE+S*Math.abs(f[t]+Math.abs(f[t+1]));if(Math.abs(v[t])<=e||Number.isNaN(v[t])){v[t]=0;break}}if(t===N-2)e=4;else{let r;for(r=N-1;r>=t&&r!==t;r--){let e=(r!==N?Math.abs(v[r]):0)+(r!==t+1?Math.abs(v[r-1]):0);if(Math.abs(f[r])<=S*e){f[r]=0;break}}r===t?e=3:r===N-1?e=1:(e=2,t=r)}switch(t++,e){case 1:{let e=v[N-2];v[N-2]=0;for(let r=N-2;r>=t;r--){let o=mn(f[r],e),i=f[r]/o,a=e/o;if(f[r]=o,r!==t&&(e=-a*v[r-1],v[r-1]=i*v[r-1]),h)for(let t=0;t<n;t++)o=i*p.get(t,r)+a*p.get(t,N-1),p.set(t,N-1,-a*p.get(t,r)+i*p.get(t,N-1)),p.set(t,r,o)}break}case 2:{let e=v[t-1];v[t-1]=0;for(let n=t;n<N;n++){let o=mn(f[n],e),i=f[n]/o,a=e/o;if(f[n]=o,e=-a*v[n],v[n]=i*v[n],u)for(let e=0;e<r;e++)o=i*g.get(e,n)+a*g.get(e,t-1),g.set(e,t-1,-a*g.get(e,n)+i*g.get(e,t-1)),g.set(e,n,o)}break}case 3:{const e=Math.max(Math.abs(f[N-1]),Math.abs(f[N-2]),Math.abs(v[N-2]),Math.abs(f[t]),Math.abs(v[t])),o=f[N-1]/e,i=f[N-2]/e,a=v[N-2]/e,s=f[t]/e,d=v[t]/e,l=((i+o)*(i-o)+a*a)/2,c=o*a*(o*a);let y=0;0===l&&0===c||(y=l<0?0-Math.sqrt(l*l+c):Math.sqrt(l*l+c),y=c/(l+y));let m=(s+o)*(s-o)+y,w=s*d;for(let e=t;e<N-1;e++){let o=mn(m,w);0===o&&(o=Number.MIN_VALUE);let i=m/o,a=w/o;if(e!==t&&(v[e-1]=o),m=i*f[e]+a*v[e],v[e]=i*v[e]-a*f[e],w=a*f[e+1],f[e+1]=i*f[e+1],h)for(let t=0;t<n;t++)o=i*p.get(t,e)+a*p.get(t,e+1),p.set(t,e+1,-a*p.get(t,e)+i*p.get(t,e+1)),p.set(t,e,o);if(o=mn(m,w),0===o&&(o=Number.MIN_VALUE),i=m/o,a=w/o,f[e]=o,m=i*v[e]+a*f[e+1],f[e+1]=-a*v[e]+i*f[e+1],w=a*v[e+1],v[e+1]=i*v[e+1],u&&e<r-1)for(let t=0;t<r;t++)o=i*g.get(t,e)+a*g.get(t,e+1),g.set(t,e+1,-a*g.get(t,e)+i*g.get(t,e+1)),g.set(t,e,o)}v[N-2]=m,M+=1;break}case 4:if(f[t]<=0&&(f[t]=f[t]<0?-f[t]:0,h))for(let e=0;e<=b;e++)p.set(e,t,-p.get(e,t));for(;t<b&&!(f[t]>=f[t+1]);){let e=f[t];if(f[t]=f[t+1],f[t+1]=e,h&&t<n-1)for(let r=0;r<n;r++)e=p.get(r,t+1),p.set(r,t+1,p.get(r,t)),p.set(r,t,e);if(u&&t<r-1)for(let n=0;n<r;n++)e=g.get(n,t+1),g.set(n,t+1,g.get(n,t)),g.set(n,t,e);t++}M=0,N--}}if(d){let t=p;p=g,g=t}this.m=r,this.n=n,this.s=f,this.U=g,this.V=p}solve(t){let e=t,r=this.threshold,n=this.s.length,o=vn.zeros(n,n);for(let t=0;t<n;t++)Math.abs(this.s[t])<=r?o.set(t,t,0):o.set(t,t,1/this.s[t]);let i=this.U,a=this.rightSingularVectors,s=a.mmul(o),u=a.rows,h=i.rows,d=vn.zeros(u,h);for(let t=0;t<u;t++)for(let e=0;e<h;e++){let r=0;for(let o=0;o<n;o++)r+=s.get(t,o)*i.get(e,o);d.set(t,e,r)}return d.mmul(e)}solveForDiagonal(t){return this.solve(vn.diag(t))}inverse(){let t=this.V,e=this.threshold,r=t.rows,n=t.columns,o=new vn(r,this.s.length);for(let i=0;i<r;i++)for(let r=0;r<n;r++)Math.abs(this.s[r])>e&&o.set(i,r,t.get(i,r)/this.s[r]);let i=this.U,a=i.rows,s=i.columns,u=new vn(r,a);for(let t=0;t<r;t++)for(let e=0;e<a;e++){let r=0;for(let n=0;n<s;n++)r+=o.get(t,n)*i.get(e,n);u.set(t,e,r)}return u}get condition(){return this.s[0]/this.s[Math.min(this.m,this.n)-1]}get norm2(){return this.s[0]}get rank(){let t=Math.max(this.m,this.n)*this.s[0]*Number.EPSILON,e=0,r=this.s;for(let n=0,o=r.length;n<o;n++)r[n]>t&&e++;return e}get diagonal(){return Array.from(this.s)}get threshold(){return Number.EPSILON/2*Math.max(this.m,this.n)*this.s[0]}get leftSingularVectors(){return this.U}get rightSingularVectors(){return this.V}get diagonalMatrix(){return vn.diag(this.s)}}var xn,En={center:[0,0],linkDistance:50},Nn=function(){function t(t){void 0===t&&(t={}),this.options=t,this.id=\\\"mds\\\",this.options=n(n({},En),t)}return t.prototype.execute=function(t,e){return i(this,void 0,void 0,(function(){return a(this,(function(r){return[2,this.genericMDSLayout(!1,t,e)]}))}))},t.prototype.assign=function(t,e){return i(this,void 0,void 0,(function(){return a(this,(function(r){return this.genericMDSLayout(!0,t,e),[2]}))}))},t.prototype.genericMDSLayout=function(t,e,r){return i(this,void 0,void 0,(function(){var o,i,s,u,h,d,l,c,f,g,y;return a(this,(function(a){return o=n(n({},this.options),r),i=o.center,s=void 0===i?[0,0]:i,u=o.linkDistance,h=void 0===u?50:u,d=e.getAllNodes(),l=e.getAllEdges(),(null==d?void 0:d.length)&&1!==d.length?(c=v({nodes:d,edges:l},!1),f=p(c),bn(f),m=h,w=[],f.forEach((function(t){var e=[];t.forEach((function(t){e.push(t*m)})),w.push(e)})),g=Mn(w),y=[],g.forEach((function(t,e){var r=N(d[e]);r.data.x=t[0]+s[0],r.data.y=t[1]+s[1],y.push(r)})),t&&y.forEach((function(t){return e.mergeNodeData(t.id,{x:t.data.x,y:t.data.y})})),[2,{nodes:y,edges:l}]):[2,_(e,t,s)];var m,w}))}))},t}(),bn=function(t){var e=-999999;t.forEach((function(t){t.forEach((function(t){t!==1/0&&e<t&&(e=t)}))})),t.forEach((function(r,n){r.forEach((function(r,o){r===1/0&&(t[n][o]=e)}))}))},Mn=function(t){var e=vn.mul(vn.pow(t,2),-.5),r=e.mean(\\\"row\\\"),n=e.mean(\\\"column\\\"),o=e.mean();e.add(o).subRowVector(r).subColumnVector(n);var i=new wn(e),a=vn.sqrt(i.diagonalMatrix).diagonal();return i.leftSingularVectors.toJSON().map((function(t){return vn.mul([t],[a]).toJSON()[0].splice(0,2)}))},Sn={iterations:10,height:10,width:10,speed:100,gravity:10,k:5},kn=function(t,e,r,n,o,i){e.forEach((function(a,s){r[s]={x:0,y:0},e.forEach((function(e,u){if(s!==u&&o[s]===o[u]){var h=a.x-e.x,d=a.y-e.y,l=Math.sqrt(h*h+d*d);if(0===l){l=1;var c=s>u?1:-1;h=.01*c,d=.01*c}if(l<i(t[s])/2+i(t[u])/2){var f=n*n/l;r[s].x+=h/l*f,r[s].y+=d/l*f}}}))}))},An=function(t,e,r,n,o,i,a,s){var u=i||a/10;return n&&e.forEach((function(e,r){var n=t[r].x-t[o].x,i=t[r].y-t[o].y,a=Math.sqrt(n*n+i*i),s=i/a,u=-n/a,h=Math.sqrt(e.x*e.x+e.y*e.y),d=Math.acos((s*e.x+u*e.y)/h);d>Math.PI/2&&(d-=Math.PI/2,s*=-1,u*=-1);var l=Math.cos(d)*h;e.x=s*l,e.y=u*l})),t.forEach((function(i,a){if(a!==o){var h=Math.sqrt(e[a].x*e[a].x+e[a].y*e[a].y);if(h>0&&a!==o){var d=Math.min(u*(r/800),h);if(i.x+=e[a].x/h*d,i.y+=e[a].y/h*d,n){var l=i.x-t[o].x,c=i.y-t[o].y,f=Math.sqrt(l*l+c*c);l=l/f*s[a],c=c/f*s[a],i.x=t[o].x+l,i.y=t[o].y+c}}}})),t},_n={maxIteration:1e3,focusNode:null,unitRadius:null,linkDistance:50,preventOverlap:!1,strictRadial:!0,maxPreventOverlapIteration:200,sortStrength:10},zn=function(){function t(t){void 0===t&&(t={}),this.options=t,this.id=\\\"radial\\\",this.options=n(n({},_n),t)}return t.prototype.execute=function(t,e){return i(this,void 0,void 0,(function(){return a(this,(function(r){return[2,this.genericRadialLayout(!1,t,e)]}))}))},t.prototype.assign=function(t,e){return i(this,void 0,void 0,(function(){return a(this,(function(r){return this.genericRadialLayout(!0,t,e),[2]}))}))},t.prototype.genericRadialLayout=function(t,e,r){return i(this,void 0,void 0,(function(){var o,i,h,d,l,c,f,g,y,m,w,x,E,b,M,S,k,z,R,I,D,P,T,C,q,L,j,F,V,B,G,W,$,U,H,K,Y,J,X,Q,Z,tt,et;return a(this,(function(a){if(o=n(n({},this.options),r),i=o.width,h=o.height,d=o.center,l=o.focusNode,c=o.unitRadius,f=o.nodeSize,g=o.nodeSpacing,y=o.strictRadial,m=o.preventOverlap,w=o.maxPreventOverlapIteration,x=o.sortBy,E=o.linkDistance,b=void 0===E?50:E,M=o.sortStrength,S=void 0===M?10:M,k=o.maxIteration,z=void 0===k?1e3:k,R=e.getAllNodes(),I=e.getAllEdges(),D=i||\\\"undefined\\\"==typeof window?i:window.innerWidth,P=h||\\\"undefined\\\"==typeof window?h:window.innerHeight,T=d||[D/2,P/2],!(null==R?void 0:R.length)||1===R.length)return[2,_(e,t,T)];if(C=R[0],O(l)){for(q=0;q<R.length;q++)if(R[q].id===l){C=R[q];break}}else C=l||R[0];return L=Dn(R,C.id),j=v({nodes:R,edges:I},!1),F=p(j),V=Pn(F,L),On(F,L,V+1),B=F[L],G=D-T[0]>T[0]?T[0]:D-T[0],W=P-T[1]>T[1]?T[1]:P-T[1],0===G&&(G=D/2),0===W&&(W=P/2),$=Math.min(G,W),U=Math.max.apply(Math,u([],s(B))),H=[],K=c||$/U,B.forEach((function(t,e){H[e]=t*K})),Y=Rn(R,F,b,H,K,x,S),J=In(Y),X=function(t,e,r){try{var n=vn.mul(vn.pow(e,2),-.5),o=n.mean(\\\"row\\\"),i=n.mean(\\\"column\\\"),a=n.mean();n.add(a).subRowVector(o).subColumnVector(i);var s=new wn(n),u=vn.sqrt(s.diagonalMatrix).diagonal();return s.leftSingularVectors.toJSON().map((function(e){return vn.mul([e],[u]).toJSON()[0].splice(0,t)}))}catch(t){for(var h=[],d=0;d<e.length;d++){var l=Math.random()*r,c=Math.random()*r;h.push([l,c])}return h}}(b,Y,b),Q=X.map((function(t){var e=s(t,2),r=e[0],n=e[1];return{x:(isNaN(r)?Math.random()*b:r)-X[L][0],y:(isNaN(n)?Math.random()*b:n)-X[L][1]}})),this.run(z,Q,J,Y,H,L),m&&(Z=A(f,g),tt={nodes:R,nodeSizeFunc:Z,positions:Q,radii:H,height:P,width:D,strictRadial:Boolean(y),focusIdx:L,iterations:w||200,k:Q.length/4.5},Q=function(t,e){for(var r=n(n({},Sn),e),o=r.positions,i=r.iterations,a=r.width,s=r.k,u=r.speed,h=void 0===u?100:u,d=r.strictRadial,l=r.focusIdx,c=r.radii,f=void 0===c?[]:c,g=r.nodeSizeFunc,p=t.getAllNodes(),v=[],y=a/10,m=0;m<i;m++)o.forEach((function(t,e){v[e]={x:0,y:0}})),kn(p,o,v,s,f,g),An(o,v,h,d,l,y,a,f);return o}(e,tt)),et=[],Q.forEach((function(t,e){var r=N(R[e]);r.data.x=t.x+T[0],r.data.y=t.y+T[1],et.push(r)})),t&&et.forEach((function(t){return e.mergeNodeData(t.id,{x:t.data.x,y:t.data.y})})),[2,{nodes:et,edges:I}]}))}))},t.prototype.run=function(t,e,r,n,o,i){for(var a=0;a<=t;a++){var s=a/t;this.oneIteration(s,e,o,n,r,i)}},t.prototype.oneIteration=function(t,e,r,n,o,i){var a=1-t;e.forEach((function(s,u){var h=y(s,{x:0,y:0}),d=0===h?0:1/h;if(u!==i){var l=0,c=0,f=0;e.forEach((function(t,e){if(u!==e){var r=y(s,t),i=0===r?0:1/r,a=n[e][u];f+=o[u][e],l+=o[u][e]*(t.x+a*(s.x-t.x)*i),c+=o[u][e]*(t.y+a*(s.y-t.y)*i)}}));var g=0===r[u]?0:1/r[u];f*=a,f+=t*g*g,l*=a,l+=t*g*s.x*d,s.x=l/f,c*=a,c+=t*g*s.y*d,s.y=c/f}}))},t}(),Rn=function(t,e,r,n,o,i,a){if(!t)return[];var s=[];if(e){var u={};e.forEach((function(e,h){var d=[];e.forEach((function(e,s){var l,c;if(h===s)d.push(0);else if(n[h]===n[s])if(\\\"data\\\"===i)d.push(e*(Math.abs(h-s)*a)/(n[h]/o));else if(i){var f=void 0,g=void 0;if(u[t[h].id])f=u[t[h].id];else{var p=(\\\"id\\\"===i?t[h].id:null===(l=t[h].data)||void 0===l?void 0:l[i])||0;f=O(p)?p.charCodeAt(0):p,u[t[h].id]=f}u[t[s].id]?g=u[t[s].id]:(p=(\\\"id\\\"===i?t[s].id:null===(c=t[s].data)||void 0===c?void 0:c[i])||0,g=O(p)?p.charCodeAt(0):p,u[t[s].id]=g),d.push(e*(Math.abs(f-g)*a)/(n[h]/o))}else d.push(e*r/(n[h]/o));else{var v=(r+o)/2;d.push(e*v)}})),s.push(d)}))}return s},In=function(t){for(var e=t.length,r=t[0].length,n=[],o=0;o<e;o++){for(var i=[],a=0;a<r;a++)0!==t[o][a]?i.push(1/(t[o][a]*t[o][a])):i.push(0);n.push(i)}return n},Dn=function(t,e){var r=-1;return t.forEach((function(t,n){t.id===e&&(r=n)})),Math.max(r,0)},On=function(t,e,r){for(var n=t.length,o=0;o<n;o++)if(t[e][o]===1/0){t[e][o]=r,t[o][e]=r;for(var i=0;i<n;i++)t[o][i]!==1/0&&t[e][i]===1/0&&(t[e][i]=r+t[o][i],t[i][e]=r+t[o][i])}for(o=0;o<n;o++)if(o!==e)for(i=0;i<n;i++)if(t[o][i]===1/0){var a=Math.abs(t[e][o]-t[e][i]);a=0===a?1:a,t[o][i]=a}},Pn=function(t,e){for(var r=0,n=0;n<t[e].length;n++)t[e][n]!==1/0&&(r=t[e][n]>r?t[e][n]:r);return r},Tn={center:[0,0],width:300,height:300},Cn=function(){function t(t){void 0===t&&(t={}),this.options=t,this.id=\\\"random\\\",this.options=n(n({},Tn),t)}return t.prototype.execute=function(t,e){return i(this,void 0,void 0,(function(){return a(this,(function(r){return[2,this.genericRandomLayout(!1,t,e)]}))}))},t.prototype.assign=function(t,e){return i(this,void 0,void 0,(function(){return a(this,(function(r){return this.genericRandomLayout(!0,t,e),[2]}))}))},t.prototype.genericRandomLayout=function(t,e,r){return i(this,void 0,void 0,(function(){var o,i,s,u,h,d,l,c,f;return a(this,(function(a){return o=n(n({},this.options),r),i=o.center,s=o.width,u=o.height,h=e.getAllNodes(),d=s||\\\"undefined\\\"==typeof window?s:window.innerWidth,l=u||\\\"undefined\\\"==typeof window?u:window.innerHeight,c=i||[d/2,l/2],f=[],h&&h.forEach((function(t){f.push({id:t.id,data:{x:.9*(Math.random()-.5)*d+c[0],y:.9*(Math.random()-.5)*l+c[1]}})})),t&&f.forEach((function(t){return e.mergeNodeData(t.id,{x:t.data.x,y:t.data.y})})),[2,{nodes:f,edges:e.getAllEdges()}]}))}))},t}(),qn={circular:R,concentric:T,mds:Nn,random:Cn,grid:Wr,radial:zn,force:zr,d3force:Tt,fruchterman:Br,forceAtlas2:Fr,dagre:pr};function Ln(){var t;(null===(t=xn)||void 0===t?void 0:t.stop)&&xn.stop()}function jn(t,e){return i(this,void 0,void 0,(function(){var r,n,o,i,s,u,h,d,l;return a(this,(function(a){switch(a.label){case 0:if(r=t.layout,n=r.id,o=r.options,i=r.iterations,s=t.nodes,u=t.edges,h=new c({nodes:s,edges:u}),!(d=qn[n]))throw new Error(\\\"Unknown layout id: \\\"+n);return[4,(xn=new d(o)).execute(h)];case 1:return l=a.sent(),!!(f=xn).tick&&!!f.stop&&(xn.stop(),l=xn.tick(i)),[2,[l,e]]}var f}))}))}addEventListener(\\\"message\\\",(function(t){var r,n=t.data,o=n.type,i=n.method,a=n.id,s=n.params;\\\"RPC\\\"===o&&i&&((r=e[i])?Promise.resolve().then((function(){return r.apply(e,s)})):Promise.reject(\\\"No such method\\\")).then((function(t){postMessage({type:\\\"RPC\\\",id:a,result:t})})).catch((function(t){var e={message:t};t.stack&&(e.message=t.message,e.stack=t.stack,e.name=t.name),postMessage({type:\\\"RPC\\\",id:a,error:e})}))})),postMessage({type:\\\"RPC\\\",method:\\\"ready\\\"});\\n//# sourceMappingURL=5e37927bd3e57252658c.worker.js.map\"])));\n\t\t\t\t\taddMethods(w, methods)\n\t\t\t\t\t\n\t\t\t\t\treturn w\n\t\t\t\t}\n\t\t\t","function addMethods(worker, methods) {\n var c = 0;\n var callbacks = {};\n worker.addEventListener('message', function (e) {\n var d = e.data;\n if (d.type !== 'RPC') return;\n\n if (d.id) {\n var f = callbacks[d.id];\n\n if (f) {\n delete callbacks[d.id];\n\n if (d.error) {\n f[1](Object.assign(Error(d.error.message), d.error));\n } else {\n f[0](d.result);\n }\n }\n } else {\n var evt = document.createEvent('Event');\n evt.initEvent(d.method, false, false);\n evt.data = d.params;\n worker.dispatchEvent(evt);\n }\n });\n methods.forEach(function (method) {\n worker[method] = function () {\n var _arguments = arguments;\n return new Promise(function (a, b) {\n var id = ++c;\n callbacks[id] = [a, b];\n worker.postMessage({\n type: 'RPC',\n id: id,\n method: method,\n params: [].slice.call(_arguments)\n });\n });\n };\n });\n}\n\nmodule.exports = addMethods;\n//# sourceMappingURL=rpc-wrapper.js.map\n","// The module cache\nvar __webpack_module_cache__ = {};\n\n// The require function\nfunction __webpack_require__(moduleId) {\n\t// Check if module is in cache\n\tvar cachedModule = __webpack_module_cache__[moduleId];\n\tif (cachedModule !== undefined) {\n\t\treturn cachedModule.exports;\n\t}\n\t// Create a new module (and put it into the cache)\n\tvar module = __webpack_module_cache__[moduleId] = {\n\t\t// no module.id needed\n\t\t// no module.loaded needed\n\t\texports: {}\n\t};\n\n\t// Execute the module function\n\t__webpack_modules__[moduleId](module, module.exports, __webpack_require__);\n\n\t// Return the exports of the module\n\treturn module.exports;\n}\n\n","// getDefaultExport function for compatibility with non-harmony modules\n__webpack_require__.n = (module) => {\n\tvar getter = module && module.__esModule ?\n\t\t() => (module['default']) :\n\t\t() => (module);\n\t__webpack_require__.d(getter, { a: getter });\n\treturn getter;\n};","// define getter functions for harmony exports\n__webpack_require__.d = (exports, definition) => {\n\tfor(var key in definition) {\n\t\tif(__webpack_require__.o(definition, key) && !__webpack_require__.o(exports, key)) {\n\t\t\tObject.defineProperty(exports, key, { enumerable: true, get: definition[key] });\n\t\t}\n\t}\n};","__webpack_require__.o = (obj, prop) => (Object.prototype.hasOwnProperty.call(obj, prop))","/******************************************************************************\r\nCopyright (c) Microsoft Corporation.\r\n\r\nPermission to use, copy, modify, and/or distribute this software for any\r\npurpose with or without fee is hereby granted.\r\n\r\nTHE SOFTWARE IS PROVIDED \"AS IS\" AND THE AUTHOR DISCLAIMS ALL WARRANTIES WITH\r\nREGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY\r\nAND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT,\r\nINDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM\r\nLOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR\r\nOTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR\r\nPERFORMANCE OF THIS SOFTWARE.\r\n***************************************************************************** */\r\n/* global Reflect, Promise */\r\n\r\nvar extendStatics = function(d, b) {\r\n extendStatics = Object.setPrototypeOf ||\r\n ({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) ||\r\n function (d, b) { for (var p in b) if (Object.prototype.hasOwnProperty.call(b, p)) d[p] = b[p]; };\r\n return extendStatics(d, b);\r\n};\r\n\r\nexport function __extends(d, b) {\r\n if (typeof b !== \"function\" && b !== null)\r\n throw new TypeError(\"Class extends value \" + String(b) + \" is not a constructor or null\");\r\n extendStatics(d, b);\r\n function __() { this.constructor = d; }\r\n d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());\r\n}\r\n\r\nexport var __assign = function() {\r\n __assign = Object.assign || function __assign(t) {\r\n for (var s, i = 1, n = arguments.length; i < n; i++) {\r\n s = arguments[i];\r\n for (var p in s) if (Object.prototype.hasOwnProperty.call(s, p)) t[p] = s[p];\r\n }\r\n return t;\r\n }\r\n return __assign.apply(this, arguments);\r\n}\r\n\r\nexport function __rest(s, e) {\r\n var t = {};\r\n for (var p in s) if (Object.prototype.hasOwnProperty.call(s, p) && e.indexOf(p) < 0)\r\n t[p] = s[p];\r\n if (s != null && typeof Object.getOwnPropertySymbols === \"function\")\r\n for (var i = 0, p = Object.getOwnPropertySymbols(s); i < p.length; i++) {\r\n if (e.indexOf(p[i]) < 0 && Object.prototype.propertyIsEnumerable.call(s, p[i]))\r\n t[p[i]] = s[p[i]];\r\n }\r\n return t;\r\n}\r\n\r\nexport function __decorate(decorators, target, key, desc) {\r\n var c = arguments.length, r = c < 3 ? target : desc === null ? desc = Object.getOwnPropertyDescriptor(target, key) : desc, d;\r\n if (typeof Reflect === \"object\" && typeof Reflect.decorate === \"function\") r = Reflect.decorate(decorators, target, key, desc);\r\n else for (var i = decorators.length - 1; i >= 0; i--) if (d = decorators[i]) r = (c < 3 ? d(r) : c > 3 ? d(target, key, r) : d(target, key)) || r;\r\n return c > 3 && r && Object.defineProperty(target, key, r), r;\r\n}\r\n\r\nexport function __param(paramIndex, decorator) {\r\n return function (target, key) { decorator(target, key, paramIndex); }\r\n}\r\n\r\nexport function __esDecorate(ctor, descriptorIn, decorators, contextIn, initializers, extraInitializers) {\r\n function accept(f) { if (f !== void 0 && typeof f !== \"function\") throw new TypeError(\"Function expected\"); return f; }\r\n var kind = contextIn.kind, key = kind === \"getter\" ? \"get\" : kind === \"setter\" ? \"set\" : \"value\";\r\n var target = !descriptorIn && ctor ? contextIn[\"static\"] ? ctor : ctor.prototype : null;\r\n var descriptor = descriptorIn || (target ? Object.getOwnPropertyDescriptor(target, contextIn.name) : {});\r\n var _, done = false;\r\n for (var i = decorators.length - 1; i >= 0; i--) {\r\n var context = {};\r\n for (var p in contextIn) context[p] = p === \"access\" ? {} : contextIn[p];\r\n for (var p in contextIn.access) context.access[p] = contextIn.access[p];\r\n context.addInitializer = function (f) { if (done) throw new TypeError(\"Cannot add initializers after decoration has completed\"); extraInitializers.push(accept(f || null)); };\r\n var result = (0, decorators[i])(kind === \"accessor\" ? { get: descriptor.get, set: descriptor.set } : descriptor[key], context);\r\n if (kind === \"accessor\") {\r\n if (result === void 0) continue;\r\n if (result === null || typeof result !== \"object\") throw new TypeError(\"Object expected\");\r\n if (_ = accept(result.get)) descriptor.get = _;\r\n if (_ = accept(result.set)) descriptor.set = _;\r\n if (_ = accept(result.init)) initializers.push(_);\r\n }\r\n else if (_ = accept(result)) {\r\n if (kind === \"field\") initializers.push(_);\r\n else descriptor[key] = _;\r\n }\r\n }\r\n if (target) Object.defineProperty(target, contextIn.name, descriptor);\r\n done = true;\r\n};\r\n\r\nexport function __runInitializers(thisArg, initializers, value) {\r\n var useValue = arguments.length > 2;\r\n for (var i = 0; i < initializers.length; i++) {\r\n value = useValue ? initializers[i].call(thisArg, value) : initializers[i].call(thisArg);\r\n }\r\n return useValue ? value : void 0;\r\n};\r\n\r\nexport function __propKey(x) {\r\n return typeof x === \"symbol\" ? x : \"\".concat(x);\r\n};\r\n\r\nexport function __setFunctionName(f, name, prefix) {\r\n if (typeof name === \"symbol\") name = name.description ? \"[\".concat(name.description, \"]\") : \"\";\r\n return Object.defineProperty(f, \"name\", { configurable: true, value: prefix ? \"\".concat(prefix, \" \", name) : name });\r\n};\r\n\r\nexport function __metadata(metadataKey, metadataValue) {\r\n if (typeof Reflect === \"object\" && typeof Reflect.metadata === \"function\") return Reflect.metadata(metadataKey, metadataValue);\r\n}\r\n\r\nexport function __awaiter(thisArg, _arguments, P, generator) {\r\n function adopt(value) { return value instanceof P ? value : new P(function (resolve) { resolve(value); }); }\r\n return new (P || (P = Promise))(function (resolve, reject) {\r\n function fulfilled(value) { try { step(generator.next(value)); } catch (e) { reject(e); } }\r\n function rejected(value) { try { step(generator[\"throw\"](value)); } catch (e) { reject(e); } }\r\n function step(result) { result.done ? resolve(result.value) : adopt(result.value).then(fulfilled, rejected); }\r\n step((generator = generator.apply(thisArg, _arguments || [])).next());\r\n });\r\n}\r\n\r\nexport function __generator(thisArg, body) {\r\n var _ = { label: 0, sent: function() { if (t[0] & 1) throw t[1]; return t[1]; }, trys: [], ops: [] }, f, y, t, g;\r\n return g = { next: verb(0), \"throw\": verb(1), \"return\": verb(2) }, typeof Symbol === \"function\" && (g[Symbol.iterator] = function() { return this; }), g;\r\n function verb(n) { return function (v) { return step([n, v]); }; }\r\n function step(op) {\r\n if (f) throw new TypeError(\"Generator is already executing.\");\r\n while (g && (g = 0, op[0] && (_ = 0)), _) try {\r\n if (f = 1, y && (t = op[0] & 2 ? y[\"return\"] : op[0] ? y[\"throw\"] || ((t = y[\"return\"]) && t.call(y), 0) : y.next) && !(t = t.call(y, op[1])).done) return t;\r\n if (y = 0, t) op = [op[0] & 2, t.value];\r\n switch (op[0]) {\r\n case 0: case 1: t = op; break;\r\n case 4: _.label++; return { value: op[1], done: false };\r\n case 5: _.label++; y = op[1]; op = [0]; continue;\r\n case 7: op = _.ops.pop(); _.trys.pop(); continue;\r\n default:\r\n if (!(t = _.trys, t = t.length > 0 && t[t.length - 1]) && (op[0] === 6 || op[0] === 2)) { _ = 0; continue; }\r\n if (op[0] === 3 && (!t || (op[1] > t[0] && op[1] < t[3]))) { _.label = op[1]; break; }\r\n if (op[0] === 6 && _.label < t[1]) { _.label = t[1]; t = op; break; }\r\n if (t && _.label < t[2]) { _.label = t[2]; _.ops.push(op); break; }\r\n if (t[2]) _.ops.pop();\r\n _.trys.pop(); continue;\r\n }\r\n op = body.call(thisArg, _);\r\n } catch (e) { op = [6, e]; y = 0; } finally { f = t = 0; }\r\n if (op[0] & 5) throw op[1]; return { value: op[0] ? op[1] : void 0, done: true };\r\n }\r\n}\r\n\r\nexport var __createBinding = Object.create ? (function(o, m, k, k2) {\r\n if (k2 === undefined) k2 = k;\r\n var desc = Object.getOwnPropertyDescriptor(m, k);\r\n if (!desc || (\"get\" in desc ? !m.__esModule : desc.writable || desc.configurable)) {\r\n desc = { enumerable: true, get: function() { return m[k]; } };\r\n }\r\n Object.defineProperty(o, k2, desc);\r\n}) : (function(o, m, k, k2) {\r\n if (k2 === undefined) k2 = k;\r\n o[k2] = m[k];\r\n});\r\n\r\nexport function __exportStar(m, o) {\r\n for (var p in m) if (p !== \"default\" && !Object.prototype.hasOwnProperty.call(o, p)) __createBinding(o, m, p);\r\n}\r\n\r\nexport function __values(o) {\r\n var s = typeof Symbol === \"function\" && Symbol.iterator, m = s && o[s], i = 0;\r\n if (m) return m.call(o);\r\n if (o && typeof o.length === \"number\") return {\r\n next: function () {\r\n if (o && i >= o.length) o = void 0;\r\n return { value: o && o[i++], done: !o };\r\n }\r\n };\r\n throw new TypeError(s ? \"Object is not iterable.\" : \"Symbol.iterator is not defined.\");\r\n}\r\n\r\nexport function __read(o, n) {\r\n var m = typeof Symbol === \"function\" && o[Symbol.iterator];\r\n if (!m) return o;\r\n var i = m.call(o), r, ar = [], e;\r\n try {\r\n while ((n === void 0 || n-- > 0) && !(r = i.next()).done) ar.push(r.value);\r\n }\r\n catch (error) { e = { error: error }; }\r\n finally {\r\n try {\r\n if (r && !r.done && (m = i[\"return\"])) m.call(i);\r\n }\r\n finally { if (e) throw e.error; }\r\n }\r\n return ar;\r\n}\r\n\r\n/** @deprecated */\r\nexport function __spread() {\r\n for (var ar = [], i = 0; i < arguments.length; i++)\r\n ar = ar.concat(__read(arguments[i]));\r\n return ar;\r\n}\r\n\r\n/** @deprecated */\r\nexport function __spreadArrays() {\r\n for (var s = 0, i = 0, il = arguments.length; i < il; i++) s += arguments[i].length;\r\n for (var r = Array(s), k = 0, i = 0; i < il; i++)\r\n for (var a = arguments[i], j = 0, jl = a.length; j < jl; j++, k++)\r\n r[k] = a[j];\r\n return r;\r\n}\r\n\r\nexport function __spreadArray(to, from, pack) {\r\n if (pack || arguments.length === 2) for (var i = 0, l = from.length, ar; i < l; i++) {\r\n if (ar || !(i in from)) {\r\n if (!ar) ar = Array.prototype.slice.call(from, 0, i);\r\n ar[i] = from[i];\r\n }\r\n }\r\n return to.concat(ar || Array.prototype.slice.call(from));\r\n}\r\n\r\nexport function __await(v) {\r\n return this instanceof __await ? (this.v = v, this) : new __await(v);\r\n}\r\n\r\nexport function __asyncGenerator(thisArg, _arguments, generator) {\r\n if (!Symbol.asyncIterator) throw new TypeError(\"Symbol.asyncIterator is not defined.\");\r\n var g = generator.apply(thisArg, _arguments || []), i, q = [];\r\n return i = {}, verb(\"next\"), verb(\"throw\"), verb(\"return\"), i[Symbol.asyncIterator] = function () { return this; }, i;\r\n function verb(n) { if (g[n]) i[n] = function (v) { return new Promise(function (a, b) { q.push([n, v, a, b]) > 1 || resume(n, v); }); }; }\r\n function resume(n, v) { try { step(g[n](v)); } catch (e) { settle(q[0][3], e); } }\r\n function step(r) { r.value instanceof __await ? Promise.resolve(r.value.v).then(fulfill, reject) : settle(q[0][2], r); }\r\n function fulfill(value) { resume(\"next\", value); }\r\n function reject(value) { resume(\"throw\", value); }\r\n function settle(f, v) { if (f(v), q.shift(), q.length) resume(q[0][0], q[0][1]); }\r\n}\r\n\r\nexport function __asyncDelegator(o) {\r\n var i, p;\r\n return i = {}, verb(\"next\"), verb(\"throw\", function (e) { throw e; }), verb(\"return\"), i[Symbol.iterator] = function () { return this; }, i;\r\n function verb(n, f) { i[n] = o[n] ? function (v) { return (p = !p) ? { value: __await(o[n](v)), done: false } : f ? f(v) : v; } : f; }\r\n}\r\n\r\nexport function __asyncValues(o) {\r\n if (!Symbol.asyncIterator) throw new TypeError(\"Symbol.asyncIterator is not defined.\");\r\n var m = o[Symbol.asyncIterator], i;\r\n return m ? m.call(o) : (o = typeof __values === \"function\" ? __values(o) : o[Symbol.iterator](), i = {}, verb(\"next\"), verb(\"throw\"), verb(\"return\"), i[Symbol.asyncIterator] = function () { return this; }, i);\r\n function verb(n) { i[n] = o[n] && function (v) { return new Promise(function (resolve, reject) { v = o[n](v), settle(resolve, reject, v.done, v.value); }); }; }\r\n function settle(resolve, reject, d, v) { Promise.resolve(v).then(function(v) { resolve({ value: v, done: d }); }, reject); }\r\n}\r\n\r\nexport function __makeTemplateObject(cooked, raw) {\r\n if (Object.defineProperty) { Object.defineProperty(cooked, \"raw\", { value: raw }); } else { cooked.raw = raw; }\r\n return cooked;\r\n};\r\n\r\nvar __setModuleDefault = Object.create ? (function(o, v) {\r\n Object.defineProperty(o, \"default\", { enumerable: true, value: v });\r\n}) : function(o, v) {\r\n o[\"default\"] = v;\r\n};\r\n\r\nexport function __importStar(mod) {\r\n if (mod && mod.__esModule) return mod;\r\n var result = {};\r\n if (mod != null) for (var k in mod) if (k !== \"default\" && Object.prototype.hasOwnProperty.call(mod, k)) __createBinding(result, mod, k);\r\n __setModuleDefault(result, mod);\r\n return result;\r\n}\r\n\r\nexport function __importDefault(mod) {\r\n return (mod && mod.__esModule) ? mod : { default: mod };\r\n}\r\n\r\nexport function __classPrivateFieldGet(receiver, state, kind, f) {\r\n if (kind === \"a\" && !f) throw new TypeError(\"Private accessor was defined without a getter\");\r\n if (typeof state === \"function\" ? receiver !== state || !f : !state.has(receiver)) throw new TypeError(\"Cannot read private member from an object whose class did not declare it\");\r\n return kind === \"m\" ? f : kind === \"a\" ? f.call(receiver) : f ? f.value : state.get(receiver);\r\n}\r\n\r\nexport function __classPrivateFieldSet(receiver, state, value, kind, f) {\r\n if (kind === \"m\") throw new TypeError(\"Private method is not writable\");\r\n if (kind === \"a\" && !f) throw new TypeError(\"Private accessor was defined without a setter\");\r\n if (typeof state === \"function\" ? receiver !== state || !f : !state.has(receiver)) throw new TypeError(\"Cannot write private member to an object whose class did not declare it\");\r\n return (kind === \"a\" ? f.call(receiver, value) : f ? f.value = value : state.set(receiver, value)), value;\r\n}\r\n\r\nexport function __classPrivateFieldIn(state, receiver) {\r\n if (receiver === null || (typeof receiver !== \"object\" && typeof receiver !== \"function\")) throw new TypeError(\"Cannot use 'in' operator on non-object\");\r\n return typeof state === \"function\" ? receiver === state : state.has(receiver);\r\n}\r\n","const cacheStringFunction = <T extends (str: string) => string>(fn: T): T => {\n const cache: Record<string, string> = Object.create(null);\n return ((str: string) => {\n const hit = cache[str];\n return hit || (cache[str] = fn(str));\n }) as any;\n};\n\nconst camelizeRE = /-(\\w)/g;\nexport const camelize = cacheStringFunction((str: string): string => {\n return str.replace(camelizeRE, (_, c) => (c ? c.toUpperCase() : \"\"));\n});\n\n// export const capitalize = cacheStringFunction(\n// (str: string) => str.charAt(0).toUpperCase() + str.slice(1),\n// )\n","export const isArray = Array.isArray;\n","export const toNumber = (val: any): any => {\n const n = parseFloat(val);\n return isNaN(n) ? val : n;\n};\n","var toString = {}.toString;\nvar isType = function (value, type) { return toString.call(value) === '[object ' + type + ']'; };\nexport default isType;\n//# sourceMappingURL=is-type.js.map","/**\n * 判断是否数字\n * @return {Boolean} 是否数字\n */\nimport isType from './is-type';\nvar isNumber = function (value) {\n return isType(value, 'Number');\n};\nexport default isNumber;\n//# sourceMappingURL=is-number.js.map","import { isNumber } from \"@antv/util\";\nimport type { Matrix, Edge, Node, OutNode, Degree, Point } from \"../types\";\nimport { isArray } from \"./array\";\n\nexport const floydWarshall = (adjMatrix: Matrix[]): Matrix[] => {\n // initialize\n const dist: Matrix[] = [];\n const size = adjMatrix.length;\n for (let i = 0; i < size; i += 1) {\n dist[i] = [];\n for (let j = 0; j < size; j += 1) {\n if (i === j) {\n dist[i][j] = 0;\n } else if (adjMatrix[i][j] === 0 || !adjMatrix[i][j]) {\n dist[i][j] = Infinity;\n } else {\n dist[i][j] = adjMatrix[i][j];\n }\n }\n }\n // floyd\n for (let k = 0; k < size; k += 1) {\n for (let i = 0; i < size; i += 1) {\n for (let j = 0; j < size; j += 1) {\n if (dist[i][j] > dist[i][k] + dist[k][j]) {\n dist[i][j] = dist[i][k] + dist[k][j];\n }\n }\n }\n }\n return dist;\n};\n\nexport const getAdjMatrix = (\n data: { nodes: Node[]; edges: Edge[] },\n directed: boolean\n): Matrix[] => {\n const { nodes, edges } = data;\n const matrix: Matrix[] = [];\n // map node with index in data.nodes\n const nodeMap: {\n [key: string]: number;\n } = {};\n\n if (!nodes) {\n throw new Error(\"invalid nodes data!\");\n }\n if (nodes) {\n nodes.forEach((node, i) => {\n nodeMap[node.id] = i;\n const row: number[] = [];\n matrix.push(row);\n });\n }\n\n edges?.forEach((e) => {\n const { source, target } = e;\n const sIndex = nodeMap[source as string];\n const tIndex = nodeMap[target as string];\n if (sIndex === undefined || tIndex === undefined) return;\n matrix[sIndex][tIndex] = 1;\n if (!directed) {\n matrix[tIndex][sIndex] = 1;\n }\n });\n return matrix;\n};\n\n/**\n * scale matrix\n * @param matrix [ [], [], [] ]\n * @param ratio\n */\nexport const scaleMatrix = (matrix: Matrix[], ratio: number) => {\n const result: Matrix[] = [];\n matrix.forEach((row) => {\n const newRow: number[] = [];\n row.forEach((v) => {\n newRow.push(v * ratio);\n });\n result.push(newRow);\n });\n return result;\n};\n\n/**\n * depth first traverse, from leaves to root, children in inverse order\n * if the fn returns false, terminate the traverse\n */\nconst traverseUp = <T extends { children?: T[] }>(\n data: T,\n fn: (param: T) => boolean\n) => {\n if (data && data.children) {\n for (let i = data.children.length - 1; i >= 0; i--) {\n if (!traverseUp(data.children[i], fn)) return;\n }\n }\n\n if (!fn(data)) {\n return false;\n }\n return true;\n};\n\n/**\n * depth first traverse, from leaves to root, children in inverse order\n * if the fn returns false, terminate the traverse\n */\nexport const traverseTreeUp = <T extends { children?: T[] }>(\n data: T,\n fn: (param: T) => boolean\n) => {\n if (typeof fn !== \"function\") {\n return;\n }\n traverseUp(data, fn);\n};\n\n/**\n * calculate the bounding box for the nodes according to their x, y, and size\n * @param nodes nodes in the layout\n * @returns\n */\nexport const getLayoutBBox = (nodes: OutNode[]) => {\n let minX = Infinity;\n let minY = Infinity;\n let maxX = -Infinity;\n let maxY = -Infinity;\n nodes.forEach((node) => {\n let size = node.data.size;\n if (isArray(size)) {\n if (size.length === 1) size = [size[0], size[0]];\n } else if (isNumber(size)) {\n size = [size, size];\n } else if (size === undefined || isNaN(size as any)) {\n size = [30, 30];\n }\n\n const halfSize = [size[0] / 2, size[1] / 2];\n const left = node.data.x - halfSize[0];\n const right = node.data.x + halfSize[0];\n const top = node.data.y - halfSize[1];\n const bottom = node.data.y + halfSize[1];\n\n if (minX > left) minX = left;\n if (minY > top) minY = top;\n if (maxX < right) maxX = right;\n if (maxY < bottom) maxY = bottom;\n });\n return { minX, minY, maxX, maxY };\n};\n\n/**\n * 获取节点集合的平均位置信息\n * @param nodes 节点集合\n * @returns 平局内置\n */\nexport const getAvgNodePosition = (nodes: OutNode[]) => {\n const totalNodes = { x: 0, y: 0 };\n nodes.forEach((node) => {\n totalNodes.x += node.data.x || 0;\n totalNodes.y += node.data.y || 0;\n });\n // 获取均值向量\n const length = nodes.length || 1;\n return {\n x: totalNodes.x / length,\n y: totalNodes.y / length,\n };\n};\n\n// 找出指定节点关联的边的起点或终点\nconst getCoreNode = (type: \"source\" | \"target\", node: Node, edges: Edge[]) => {\n if (type === \"source\") {\n return (edges?.find((edge) => edge.target === node.id)?.source ||\n {}) as Node;\n }\n return (edges?.find((edge) => edge.source === node.id)?.target || {}) as Node;\n};\n\n// 找出指定节点为起点或终点的所有一度叶子节点\nconst getRelativeNodeIds = (\n type: \"source\" | \"target\" | \"both\",\n coreNode: Node,\n edges: Edge[]\n) => {\n let relativeNodes: (string | number)[] = [];\n switch (type) {\n case \"source\":\n relativeNodes = edges\n ?.filter((edge) => edge.source === coreNode.id)\n .map((edge) => edge.target);\n break;\n case \"target\":\n relativeNodes = edges\n ?.filter((edge) => edge.target === coreNode.id)\n .map((edge) => edge.source);\n break;\n case \"both\":\n relativeNodes = edges\n ?.filter((edge) => edge.source === coreNode.id)\n .map((edge) => edge.target)\n .concat(\n edges\n ?.filter((edge) => edge.target === coreNode.id)\n .map((edge) => edge.source)\n );\n break;\n default:\n break;\n }\n // 去重\n const set = new Set(relativeNodes);\n return Array.from(set);\n};\n// 找出同类型的节点\nconst getSameTypeNodes = (\n type: \"leaf\" | \"all\",\n nodeClusterBy: string,\n node: Node,\n relativeNodes: Node[],\n degreesMap: { [id: string]: Degree }\n) => {\n const typeName = node[nodeClusterBy as keyof Node] || \"\";\n let sameTypeNodes =\n relativeNodes?.filter(\n (item) => item[nodeClusterBy as keyof Node] === typeName\n ) || [];\n if (type === \"leaf\") {\n sameTypeNodes = sameTypeNodes.filter(\n (node) => degreesMap[node.id]?.in === 0 || degreesMap[node.id]?.out === 0\n );\n }\n return sameTypeNodes;\n};\n\n// 找出与指定节点关联的边的起点或终点出发的所有一度叶子节点\nexport const getCoreNodeAndRelativeLeafNodes = (\n type: \"leaf\" | \"all\",\n node: Node,\n edges: Edge[],\n nodeClusterBy: string,\n degreesMap: { [id: string]: Degree },\n nodeMap: { [id: string]: Node }\n) => {\n const { in: inDegree, out: outDegree } = degreesMap[node.id];\n let coreNode: Node = node;\n let relativeLeafNodes: Node[] = [];\n if (inDegree === 0) {\n // 如果为没有出边的叶子节点，则找出与它关联的边的起点出发的所有一度节点\n coreNode = getCoreNode(\"source\", node, edges);\n relativeLeafNodes = getRelativeNodeIds(\"both\", coreNode, edges).map(\n (nodeId) => nodeMap[nodeId]\n );\n } else if (outDegree === 0) {\n // 如果为没有入边边的叶子节点，则找出与它关联的边的起点出发的所有一度节点\n coreNode = getCoreNode(\"target\", node, edges);\n relativeLeafNodes = getRelativeNodeIds(\"both\", coreNode, edges).map(\n (nodeId) => nodeMap[nodeId]\n );\n }\n relativeLeafNodes = relativeLeafNodes.filter(\n (node) =>\n degreesMap[node.id] &&\n (degreesMap[node.id].in === 0 || degreesMap[node.id].out === 0)\n );\n const sameTypeLeafNodes = getSameTypeNodes(\n type,\n nodeClusterBy,\n node,\n relativeLeafNodes,\n degreesMap\n );\n return { coreNode, relativeLeafNodes, sameTypeLeafNodes };\n};\n\n/**\n * calculate the euclidean distance form p1 to p2\n * @param p1\n * @param p2\n * @returns\n */\nexport const getEuclideanDistance = (p1: Point, p2: Point) =>\n Math.sqrt((p1.x - p2.x) * (p1.x - p2.x) + (p1.y - p2.y) * (p1.y - p2.y));\n","import { isNumber } from \"@antv/util\";\nimport { Node, Edge } from \"../types\";\n\nexport const clone = <T>(target: T): T => {\n if (target === null) {\n return target;\n }\n if (target instanceof Date) {\n return new Date(target.getTime()) as any;\n }\n if (target instanceof Array) {\n const cp = [] as any[];\n (target as any[]).forEach((v) => {\n cp.push(v);\n });\n return cp.map((n: any) => clone<any>(n)) as any;\n }\n if (typeof target === \"object\") {\n const cp = {} as { [key: string]: any };\n Object.keys(target).forEach((k) => {\n cp[k] = clone<any>((target as any)[k]);\n });\n return cp as T;\n }\n return target;\n};\n\n/**\n * Clone node or edge data and format it\n * @param target node/edge to be cloned\n * @param initRange whether init the x and y in data with the range, which means [xRange, yRange]\n * @returns cloned node/edge\n */\nexport const cloneFormatData = <T extends Node | Edge>(\n target: T,\n initRange?: [number, number]\n): T => {\n const cloned = clone(target);\n cloned.data = cloned.data || {};\n if (initRange) {\n if (!isNumber(cloned.data.x)) cloned.data.x = Math.random() * initRange[0];\n if (!isNumber(cloned.data.y)) cloned.data.y = Math.random() * initRange[1];\n }\n return cloned;\n};\n","/**\n * @see https://github.com/you-dont-need/You-Dont-Need-Lodash-Underscore#_isfunction\n */\nexport default (function (value) {\n return typeof value === 'function';\n});\n//# sourceMappingURL=is-function.js.map","export default (function (value) {\n /**\n * isObject({}) => true\n * isObject([1, 2, 3]) => true\n * isObject(Function) => true\n * isObject(null) => false\n */\n var type = typeof value;\n return (value !== null && type === 'object') || type === 'function';\n});\n//# sourceMappingURL=is-object.js.map","import { isFunction, isNumber, isObject } from \"@antv/util\";\nimport { Node } from \"../types\";\nimport { isArray } from \".\";\n\n/**\n * Format value with multiple types into a function returns number.\n * @param defaultValue default value when value is invalid\n * @param value value to be formatted\n * @returns formatted result, a function returns number\n */\nexport function formatNumberFn<T = unknown>(\n defaultValue: number,\n value: number | ((d?: T) => number) | undefined\n): (d?: T | undefined) => number {\n let resultFunc;\n if (isFunction(value)) {\n resultFunc = value;\n } else if (isNumber(value)) {\n // value is number\n resultFunc = () => value;\n } else {\n // value is not number and function\n resultFunc = () => defaultValue;\n }\n return resultFunc;\n}\n\n/**\n * Format size config with multiple types into a function returns number\n * @param defaultValue default value when value is invalid\n * @param value value to be formatted\n * @param resultIsNumber whether returns number\n * @returns formatted result, a function returns number\n */\nexport function formatSizeFn<T extends Node>(\n defaultValue: number,\n value?:\n | number\n | number[]\n | { width: number; height: number }\n | ((d?: T) => number)\n | undefined,\n resultIsNumber: boolean = true\n): (d: T) => number | number[] {\n if (!value && value !== 0) {\n return (d) => {\n const { size } = d.data || {};\n if (size) {\n if (isArray(size)) {\n return size[0] > size[1] ? size[0] : size[1];\n }\n if (isObject<{ width: number; height: number }>(size)) {\n return size.width > size.height ? size.width : size.height;\n }\n return size;\n }\n return defaultValue;\n };\n }\n if (isFunction(value)) {\n return value;\n }\n if (isNumber(value)) {\n return () => value;\n }\n if (isArray(value)) {\n return () => {\n if (resultIsNumber) {\n const max = Math.max(...value);\n return isNaN(max) ? defaultValue : max;\n }\n return value;\n };\n }\n if (isObject(value)) {\n return () => {\n if (resultIsNumber) {\n const max = Math.max(value.width, value.height);\n return isNaN(max) ? defaultValue : max;\n }\n return [value.width, value.height];\n };\n }\n return () => defaultValue;\n}\n\n/**\n * format the props nodeSize and nodeSpacing to a function\n * @param nodeSize\n * @param nodeSpacing\n * @returns\n */\nexport const formatNodeSize = (\n nodeSize: number | number[] | undefined,\n nodeSpacing: number | Function | undefined\n): ((nodeData: Node) => number) => {\n let nodeSizeFunc;\n let nodeSpacingFunc: Function;\n if (isNumber(nodeSpacing)) {\n nodeSpacingFunc = () => nodeSpacing;\n } else if (isFunction(nodeSpacing)) {\n nodeSpacingFunc = nodeSpacing;\n } else {\n nodeSpacingFunc = () => 0;\n }\n\n if (!nodeSize) {\n nodeSizeFunc = (d: Node) => {\n if (d.data?.bboxSize) {\n return (\n Math.max(d.data.bboxSize[0], d.data.bboxSize[1]) + nodeSpacingFunc(d)\n );\n }\n if (d.data?.size) {\n if (isArray(d.data.size)) {\n return Math.max(d.data.size[0], d.data.size[1]) + nodeSpacingFunc(d);\n }\n const dataSize = d.data.size;\n if (isObject<{ width: number; height: number }>(dataSize)) {\n const res =\n dataSize.width > dataSize.height ? dataSize.width : dataSize.height;\n return res + nodeSpacingFunc(d);\n }\n return dataSize + nodeSpacingFunc(d);\n }\n return 10 + nodeSpacingFunc(d);\n };\n } else if (isArray(nodeSize)) {\n nodeSizeFunc = (d: Node) => {\n const res = nodeSize[0] > nodeSize[1] ? nodeSize[0] : nodeSize[1];\n return res + nodeSpacingFunc(d);\n };\n } else {\n nodeSizeFunc = (d: Node) => nodeSize + nodeSpacingFunc(d);\n }\n return nodeSizeFunc;\n};\n","import { PointTuple, Graph } from \"../types\";\n\n/**\n * Assign or only return the result for the graph who has no nodes or only one node.\n * @param graph original graph\n * @param assign whether assign result to original graph\n * @param center the layout center\n * @returns\n */\nexport const handleSingleNodeGraph = (\n graph: Graph,\n assign: boolean,\n center: PointTuple\n) => {\n const nodes = graph.getAllNodes();\n const edges = graph.getAllEdges();\n if (!nodes?.length) {\n const result = { nodes: [] as any[], edges };\n return result;\n }\n if (nodes.length === 1) {\n if (assign) {\n graph.mergeNodeData(nodes[0].id, {\n x: center[0],\n y: center[1],\n });\n }\n const result = {\n nodes: [\n {\n ...nodes[0],\n data: {\n ...nodes[0].data,\n x: center[0],\n y: center[1],\n },\n },\n ],\n edges,\n };\n return result;\n }\n};\n","import type {\n Graph,\n CircularLayoutOptions,\n Layout,\n LayoutMapping,\n PointTuple,\n OutNode,\n Node,\n Edge,\n} from \"./types\";\nimport { formatSizeFn, formatNumberFn, cloneFormatData } from \"./util\";\nimport { handleSingleNodeGraph } from \"./util/common\";\n\nconst DEFAULTS_LAYOUT_OPTIONS: Partial<CircularLayoutOptions> = {\n radius: null,\n startRadius: null,\n endRadius: null,\n startAngle: 0,\n endAngle: 2 * Math.PI,\n clockwise: true,\n divisions: 1,\n ordering: null,\n angleRatio: 1,\n};\n\n/**\n * Layout arranging the nodes in a circle.\n *\n * @example\n * // Assign layout options when initialization.\n * const layout = new CircularLayout({ radius: 10 });\n * const positions = await layout.execute(graph); // { nodes: [], edges: [] }\n *\n * // Or use different options later.\n * const layout = new CircularLayout({ radius: 10 });\n * const positions = await layout.execute(graph, { radius: 20 }); // { nodes: [], edges: [] }\n *\n * // If you want to assign the positions directly to the nodes, use assign method.\n * await layout.assign(graph, { radius: 20 });\n */\nexport class CircularLayout implements Layout<CircularLayoutOptions> {\n id = \"circular\";\n\n constructor(\n public options: CircularLayoutOptions = {} as CircularLayoutOptions\n ) {\n this.options = {\n ...DEFAULTS_LAYOUT_OPTIONS,\n ...options,\n };\n }\n\n /**\n * Return the positions of nodes and edges(if needed).\n */\n async execute(graph: Graph, options?: CircularLayoutOptions) {\n return this.genericCircularLayout(false, graph, options);\n }\n\n /**\n * To directly assign the positions to the nodes.\n */\n async assign(graph: Graph, options?: CircularLayoutOptions) {\n await this.genericCircularLayout(true, graph, options);\n }\n\n private async genericCircularLayout(\n assign: false,\n graph: Graph,\n options?: CircularLayoutOptions\n ): Promise<LayoutMapping>;\n private async genericCircularLayout(\n assign: true,\n graph: Graph,\n options?: CircularLayoutOptions\n ): Promise<void>;\n private async genericCircularLayout(\n assign: boolean,\n graph: Graph,\n options?: CircularLayoutOptions\n ): Promise<LayoutMapping | void> {\n const mergedOptions = { ...this.options, ...options };\n const {\n width,\n height,\n center,\n divisions,\n startAngle = 0,\n endAngle = 2 * Math.PI,\n angleRatio,\n ordering,\n clockwise,\n nodeSpacing: paramNodeSpacing,\n nodeSize: paramNodeSize,\n } = mergedOptions;\n\n const nodes: Node[] = graph.getAllNodes();\n const edges: Edge[] = graph.getAllEdges();\n\n // Calculate center according to `window` if not provided.\n const [calculatedWidth, calculatedHeight, calculatedCenter] =\n calculateCenter(width, height, center);\n const n = nodes?.length;\n if (!n || n === 1) {\n return handleSingleNodeGraph(graph, assign, calculatedCenter);\n }\n\n const angleStep = (endAngle - startAngle) / n;\n\n let { radius, startRadius, endRadius } = mergedOptions;\n if (paramNodeSpacing) {\n const nodeSpacing: Function = formatNumberFn(10, paramNodeSpacing);\n const nodeSize: Function = formatSizeFn(10, paramNodeSize);\n let maxNodeSize = -Infinity;\n nodes.forEach((node) => {\n const nSize = nodeSize(node);\n if (maxNodeSize < nSize) maxNodeSize = nSize;\n });\n let perimeter = 0;\n nodes.forEach((node, i) => {\n if (i === 0) perimeter += maxNodeSize || 10;\n else perimeter += (nodeSpacing(node) || 0) + (maxNodeSize || 10);\n });\n radius = perimeter / (2 * Math.PI);\n } else if (!radius && !startRadius && !endRadius) {\n radius = Math.min(calculatedHeight, calculatedWidth) / 2;\n } else if (!startRadius && endRadius) {\n startRadius = endRadius;\n } else if (startRadius && !endRadius) {\n endRadius = startRadius;\n }\n const astep = angleStep * angleRatio!;\n\n // calculated nodes as temporary result\n let layoutNodes: OutNode[] = [];\n if (ordering === \"topology\") {\n // layout according to the topology\n layoutNodes = topologyOrdering(graph, nodes);\n } else if (ordering === \"topology-directed\") {\n // layout according to the topology\n layoutNodes = topologyOrdering(graph, nodes, true);\n } else if (ordering === \"degree\") {\n // layout according to the descent order of degrees\n layoutNodes = degreeOrdering(graph, nodes);\n } else {\n // layout according to the original order in the data.nodes\n layoutNodes = nodes.map((node) => cloneFormatData(node) as OutNode);\n }\n\n const divN = Math.ceil(n / divisions!); // node number in each division\n for (let i = 0; i < n; ++i) {\n let r = radius;\n if (!r && startRadius !== null && endRadius !== null) {\n r = startRadius! + (i * (endRadius! - startRadius!)) / (n - 1);\n }\n if (!r) {\n r = 10 + (i * 100) / (n - 1);\n }\n let angle =\n startAngle +\n (i % divN) * astep +\n ((2 * Math.PI) / divisions!) * Math.floor(i / divN);\n if (!clockwise) {\n angle =\n endAngle -\n (i % divN) * astep -\n ((2 * Math.PI) / divisions!) * Math.floor(i / divN);\n }\n layoutNodes[i].data.x = calculatedCenter[0] + Math.cos(angle) * r;\n layoutNodes[i].data.y = calculatedCenter[1] + Math.sin(angle) * r;\n }\n\n if (assign) {\n layoutNodes.forEach((node) => {\n graph.mergeNodeData(node.id, {\n x: node.data.x,\n y: node.data.y,\n });\n });\n }\n\n const result = {\n nodes: layoutNodes,\n edges,\n };\n\n return result;\n }\n}\n\n/**\n * order the nodes acoording to the graph topology\n * @param graph\n * @param nodes\n * @param directed\n * @returns\n */\nconst topologyOrdering = (\n graph: Graph,\n nodes: Node[],\n directed: boolean = false\n) => {\n const orderedCNodes: OutNode[] = [cloneFormatData(nodes[0]) as OutNode];\n const pickFlags: { [id: string]: boolean } = {};\n const n = nodes.length;\n pickFlags[nodes[0].id] = true;\n // write children into cnodes\n let k = 0;\n nodes.forEach((node, i) => {\n if (i !== 0) {\n if (\n (i === n - 1 ||\n graph.getDegree(node.id, \"both\") !==\n graph.getDegree(nodes[i + 1].id, \"both\") ||\n graph.areNeighbors(orderedCNodes[k].id, node.id)) &&\n !pickFlags[node.id]\n ) {\n orderedCNodes.push(cloneFormatData(node) as OutNode);\n pickFlags[node.id] = true;\n k++;\n } else {\n const children = directed\n ? graph.getSuccessors(orderedCNodes[k].id)\n : graph.getNeighbors(orderedCNodes[k].id);\n let foundChild = false;\n for (let j = 0; j < children.length; j++) {\n const child = children[j];\n if (\n graph.getDegree(child.id) === graph.getDegree(node.id) &&\n !pickFlags[child.id]\n ) {\n orderedCNodes.push(cloneFormatData(child) as OutNode);\n pickFlags[child.id] = true;\n foundChild = true;\n break;\n }\n }\n let ii = 0;\n while (!foundChild) {\n if (!pickFlags[nodes[ii].id]) {\n orderedCNodes.push(cloneFormatData(nodes[ii]) as OutNode);\n pickFlags[nodes[ii].id] = true;\n foundChild = true;\n }\n ii++;\n if (ii === n) {\n break;\n }\n }\n }\n }\n });\n return orderedCNodes;\n};\n\n/**\n * order the nodes according to their degree\n * @param graph\n * @param nodes\n * @returns\n */\nfunction degreeOrdering(graph: Graph, nodes: Node[]): OutNode[] {\n const orderedNodes: OutNode[] = [];\n nodes.forEach((node, i) => {\n orderedNodes.push(cloneFormatData(node) as OutNode);\n });\n orderedNodes.sort(\n (nodeA: Node, nodeB: Node) =>\n graph.getDegree(nodeA.id, \"both\") - graph.getDegree(nodeB.id, \"both\")\n );\n return orderedNodes;\n}\n\n/**\n * format the invalide width and height, and get the center position\n * @param width\n * @param height\n * @param center\n * @returns\n */\nconst calculateCenter = (\n width: number | undefined,\n height: number | undefined,\n center: PointTuple | undefined\n): [number, number, PointTuple] => {\n let calculatedWidth = width;\n let calculatedHeight = height;\n let calculatedCenter = center;\n if (!calculatedWidth && typeof window !== \"undefined\") {\n calculatedWidth = window.innerWidth;\n }\n if (!calculatedHeight && typeof window !== \"undefined\") {\n calculatedHeight = window.innerHeight;\n }\n if (!calculatedCenter) {\n calculatedCenter = [calculatedWidth! / 2, calculatedHeight! / 2];\n }\n return [calculatedWidth!, calculatedHeight!, calculatedCenter];\n};\n","import EventEmitter from \"eventemitter3\";\nimport { Graph, Node, Edge } from \"@antv/graphlib\";\nimport type { Layout, LayoutSupervisor } from \"./types\";\n// @ts-ignore\n// Inline the worker as a Blob. @see https://github.com/developit/workerize-loader#inline\nimport worker from \"workerize-loader?inline!./worker\";\n// import { setupTransferableMethodsOnMain } from \"@naoak/workerize-transferable\";\n\n/**\n * The payload transferred from main thread to the worker.\n */\nexport interface Payload {\n layout: {\n id: string;\n options: any;\n iterations: number;\n };\n nodes: Node<any>[];\n edges: Edge<any>[];\n}\n\ninterface SupervisorOptions {\n /**\n * Iterations run in algorithm such as d3force, will be passed in `tick()` later.\n */\n iterations: number;\n}\n\n/**\n * @example\n * const graph = new Graph();\n * const layout = new CircularLayout();\n *\n * const supervisor = new Supervisor(graph, layout, { iterations: 1000 });\n * const positions = await supervisor.execute();\n * supervisor.stop();\n * supervisor.kill();\n */\nexport class Supervisor extends EventEmitter implements LayoutSupervisor {\n /**\n * Internal worker.\n */\n private worker: any;\n\n /**\n * Flag of running state.\n */\n private running: boolean;\n\n constructor(\n private graph: Graph<any, any>,\n private layout: Layout<any>,\n private options?: Partial<SupervisorOptions>\n ) {\n super();\n\n this.spawnWorker();\n }\n\n spawnWorker() {\n if (this.worker) {\n this.worker.terminate();\n }\n\n /**\n * Worker function\n */\n // this.worker = this.createWorker(workerFunctionString);\n // this.worker.addEventListener('message', this.handleWorkerMessage);\n\n // Use workerize-loader to create WebWorker.\n // @see https://github.com/developit/workerize-loader\n this.worker = worker();\n\n if (this.running) {\n this.running = false;\n this.execute();\n }\n }\n\n async execute() {\n if (this.running) return this;\n\n this.running = true;\n\n // Payload should include nodes & edges(if needed).\n const { onTick, ...rest } = this.layout.options;\n const payload = {\n layout: {\n id: this.layout.id,\n options: rest,\n iterations: this.options?.iterations,\n },\n nodes: this.graph.getAllNodes(),\n edges: this.graph.getAllEdges(),\n };\n\n /**\n * TODO: Convert graph object to linear memory(e.g. csr, adjacency matrix), then transfer the ownership to worker.\n * @example\n * const arraybufferWithNodesEdges = graphToByteArrays(this.graph); // Float32Array\n */\n const arraybufferWithNodesEdges = new Float32Array([0]);\n\n // TODO: Support transferables.\n // @see https://www.npmjs.com/package/@naoak/workerize-transferable\n // setupTransferableMethodsOnMain(this.worker, {\n // calculateLayout: {\n // // pick a transferable object from the method parameters\n // pickTransferablesFromParams: (params) => [params[1].buffer],\n // },\n // });\n\n const [positions] = await this.worker.calculateLayout(payload, [\n arraybufferWithNodesEdges,\n ]);\n\n return positions;\n }\n\n stop() {\n this.running = false;\n\n // trigger `layout.stop()` if needed\n this.worker.stopLayout();\n\n return this;\n }\n\n kill() {\n if (this.worker) {\n this.worker.terminate();\n }\n\n // TODO: unbind listeners on graph.\n\n // TODO: release attached memory\n }\n\n isRunning() {\n return this.running;\n }\n}\n","import isType from './is-type';\nexport default (function (str) {\n return isType(str, 'String');\n});\n//# sourceMappingURL=is-string.js.map","import { isFunction, isNumber, isObject, isString } from \"@antv/util\";\nimport type {\n Graph,\n Node,\n LayoutMapping,\n OutNode,\n PointTuple,\n ConcentricLayoutOptions,\n Layout,\n IndexMap,\n} from \"./types\";\nimport { cloneFormatData, isArray } from \"./util\";\nimport { handleSingleNodeGraph } from \"./util/common\";\n\nconst DEFAULTS_LAYOUT_OPTIONS: Partial<ConcentricLayoutOptions> = {\n nodeSize: 30,\n nodeSpacing: 10,\n preventOverlap: false,\n sweep: undefined,\n equidistant: false,\n startAngle: (3 / 2) * Math.PI,\n clockwise: true,\n maxLevelDiff: undefined,\n sortBy: \"degree\",\n};\n\n/**\n * Layout arranging the nodes in concentrics\n *\n * @example\n * // Assign layout options when initialization.\n * const layout = new ConcentricLayout({ nodeSpacing: 10 });\n * const positions = await layout.execute(graph); // { nodes: [], edges: [] }\n *\n * // Or use different options later.\n * const layout = new ConcentricLayout({ nodeSpacing: 10});\n * const positions = await layout.execute(graph, { nodeSpacing: 10 }); // { nodes: [], edges: [] }\n *\n * // If you want to assign the positions directly to the nodes, use assign method.\n * await layout.assign(graph, { nodeSpacing: 10 });\n */\nexport class ConcentricLayout implements Layout<ConcentricLayoutOptions> {\n id = \"concentric\";\n\n constructor(\n public options: ConcentricLayoutOptions = {} as ConcentricLayoutOptions\n ) {\n this.options = {\n ...DEFAULTS_LAYOUT_OPTIONS,\n ...options,\n };\n }\n\n /**\n * Return the positions of nodes and edges(if needed).\n */\n async execute(graph: Graph, options?: ConcentricLayoutOptions) {\n return this.genericConcentricLayout(false, graph, options);\n }\n /**\n * To directly assign the positions to the nodes.\n */\n async assign(graph: Graph, options?: ConcentricLayoutOptions) {\n this.genericConcentricLayout(true, graph, options);\n }\n\n private async genericConcentricLayout(\n assign: false,\n graph: Graph,\n options?: ConcentricLayoutOptions\n ): Promise<LayoutMapping>;\n private async genericConcentricLayout(\n assign: true,\n graph: Graph,\n options?: ConcentricLayoutOptions\n ): Promise<void>;\n private async genericConcentricLayout(\n assign: boolean,\n graph: Graph,\n options?: ConcentricLayoutOptions\n ): Promise<LayoutMapping | void> {\n const mergedOptions = { ...this.options, ...options };\n const {\n center: propsCenter,\n width: propsWidth,\n height: propsHeight,\n sortBy: propsSortBy,\n maxLevelDiff: propsMaxLevelDiff,\n sweep: propsSweep,\n clockwise,\n equidistant,\n preventOverlap,\n startAngle = (3 / 2) * Math.PI,\n nodeSize,\n nodeSpacing,\n } = mergedOptions;\n\n const nodes = graph.getAllNodes();\n const edges = graph.getAllEdges();\n\n const width =\n !propsWidth && typeof window !== \"undefined\"\n ? window.innerWidth\n : (propsWidth as number);\n const height =\n !propsHeight && typeof window !== \"undefined\"\n ? window.innerHeight\n : (propsHeight as number);\n const center = (\n !propsCenter ? [width / 2, height / 2] : propsCenter\n ) as PointTuple;\n\n if (!nodes?.length || nodes.length === 1) {\n return handleSingleNodeGraph(graph, assign, center);\n }\n\n const layoutNodes: OutNode[] = [];\n let maxNodeSize: number;\n let maxNodeSpacing: number = 0;\n if (isArray(nodeSize)) {\n maxNodeSize = Math.max(nodeSize[0], nodeSize[1]);\n } else {\n maxNodeSize = nodeSize as number;\n }\n if (isArray(nodeSpacing)) {\n maxNodeSpacing = Math.max(nodeSpacing[0], nodeSpacing[1]);\n } else if (isNumber(nodeSpacing)) {\n maxNodeSpacing = nodeSpacing;\n }\n nodes.forEach((node) => {\n const cnode = cloneFormatData(node) as OutNode;\n layoutNodes.push(cnode);\n let nodeSize: number = maxNodeSize;\n const { data } = cnode;\n if (isArray(data.size)) {\n nodeSize = Math.max(data.size[0], data.size[1]);\n } else if (isNumber(data.size)) {\n nodeSize = data.size;\n } else if (isObject(data.size)) {\n nodeSize = Math.max(\n (data.size as any).width,\n (data.size as any).height\n );\n }\n maxNodeSize = Math.max(maxNodeSize, nodeSize);\n\n if (isFunction(nodeSpacing)) {\n maxNodeSpacing = Math.max(nodeSpacing(node), maxNodeSpacing);\n }\n });\n\n // layout\n const nodeIdxMap: IndexMap = {};\n layoutNodes.forEach((node, i) => {\n nodeIdxMap[node.id] = i;\n });\n\n // get the node degrees\n let sortBy = propsSortBy!;\n if (\n !isString(sortBy) ||\n (layoutNodes[0] as any).data[sortBy] === undefined\n ) {\n sortBy = \"degree\";\n }\n if (sortBy === \"degree\") {\n layoutNodes.sort(\n (n1: Node, n2: Node) =>\n graph.getDegree(n2.id, \"both\") - graph.getDegree(n1.id, \"both\")\n );\n } else {\n // sort nodes by value\n layoutNodes.sort(\n (n1: Node, n2: Node) =>\n (n2 as any).data[sortBy] - (n1 as any).data[sortBy]\n );\n }\n\n const maxValueNode = layoutNodes[0];\n const maxLevelDiff =\n (propsMaxLevelDiff ||\n (sortBy === \"degree\"\n ? graph.getDegree(maxValueNode.id, \"both\")\n : (maxValueNode as any).data[sortBy])) / 4;\n\n // put the values into levels\n const levels: {\n nodes: OutNode[];\n r?: number;\n dTheta?: number;\n }[] = [{ nodes: [] }];\n let currentLevel = levels[0];\n layoutNodes.forEach((node) => {\n if (currentLevel.nodes.length > 0) {\n const diff =\n sortBy === \"degree\"\n ? Math.abs(\n graph.getDegree(currentLevel.nodes[0].id, \"both\") -\n graph.getDegree(node.id, \"both\")\n )\n : Math.abs(\n (currentLevel.nodes[0].data[sortBy] as number) -\n (node as any).data[sortBy]\n );\n\n if (maxLevelDiff && diff >= maxLevelDiff) {\n currentLevel = { nodes: [] };\n levels.push(currentLevel);\n }\n }\n currentLevel.nodes.push(node);\n });\n\n // create positions for levels\n let minDist = maxNodeSize + maxNodeSpacing; // min dist between nodes\n if (!preventOverlap) {\n // then strictly constrain to bb\n const firstLvlHasMulti = levels.length > 0 && levels[0].nodes.length > 1;\n const maxR = Math.min(width, height) / 2 - minDist;\n const rStep = maxR / (levels.length + (firstLvlHasMulti ? 1 : 0));\n\n minDist = Math.min(minDist, rStep);\n }\n\n // find the metrics for each level\n let r = 0;\n levels.forEach((level) => {\n const sweep =\n propsSweep === undefined\n ? 2 * Math.PI - (2 * Math.PI) / level.nodes.length\n : propsSweep;\n level.dTheta = sweep / Math.max(1, level.nodes.length - 1);\n\n // calculate the radius\n if (level.nodes.length > 1 && preventOverlap) {\n // but only if more than one node (can't overlap)\n const dcos = Math.cos(level.dTheta) - Math.cos(0);\n const dsin = Math.sin(level.dTheta) - Math.sin(0);\n const rMin = Math.sqrt(\n (minDist * minDist) / (dcos * dcos + dsin * dsin)\n ); // s.t. no nodes overlapping\n\n r = Math.max(rMin, r);\n }\n level.r = r;\n r += minDist;\n });\n\n if (equidistant) {\n let rDeltaMax = 0;\n let rr = 0;\n for (let i = 0; i < levels.length; i++) {\n const level = levels[i];\n const rDelta = (level.r || 0) - rr;\n rDeltaMax = Math.max(rDeltaMax, rDelta);\n }\n rr = 0;\n levels.forEach((level, i) => {\n if (i === 0) {\n rr = level.r || 0;\n }\n level.r = rr;\n rr += rDeltaMax;\n });\n }\n\n // calculate the node positions\n levels.forEach((level) => {\n const dTheta = level.dTheta || 0;\n const rr = level.r || 0;\n level.nodes.forEach((node: OutNode, j: number) => {\n const theta = startAngle + (clockwise ? 1 : -1) * dTheta * j;\n node.data.x = center[0] + rr * Math.cos(theta);\n node.data.y = center[1] + rr * Math.sin(theta);\n });\n });\n\n if (assign) {\n layoutNodes.forEach((node) =>\n graph.mergeNodeData(node.id, {\n x: node.data.x,\n y: node.data.y,\n })\n );\n }\n\n const result = {\n nodes: layoutNodes,\n edges,\n };\n\n return result;\n }\n}\n","export default function(d) {\n const x = +this._x.call(null, d),\n y = +this._y.call(null, d);\n return add(this.cover(x, y), x, y, d);\n}\n\nfunction add(tree, x, y, d) {\n if (isNaN(x) || isNaN(y)) return tree; // ignore invalid points\n\n var parent,\n node = tree._root,\n leaf = {data: d},\n x0 = tree._x0,\n y0 = tree._y0,\n x1 = tree._x1,\n y1 = tree._y1,\n xm,\n ym,\n xp,\n yp,\n right,\n bottom,\n i,\n j;\n\n // If the tree is empty, initialize the root as a leaf.\n if (!node) return tree._root = leaf, tree;\n\n // Find the existing leaf for the new point, or add it.\n while (node.length) {\n if (right = x >= (xm = (x0 + x1) / 2)) x0 = xm; else x1 = xm;\n if (bottom = y >= (ym = (y0 + y1) / 2)) y0 = ym; else y1 = ym;\n if (parent = node, !(node = node[i = bottom << 1 | right])) return parent[i] = leaf, tree;\n }\n\n // Is the new point is exactly coincident with the existing point?\n xp = +tree._x.call(null, node.data);\n yp = +tree._y.call(null, node.data);\n if (x === xp && y === yp) return leaf.next = node, parent ? parent[i] = leaf : tree._root = leaf, tree;\n\n // Otherwise, split the leaf node until the old and new point are separated.\n do {\n parent = parent ? parent[i] = new Array(4) : tree._root = new Array(4);\n if (right = x >= (xm = (x0 + x1) / 2)) x0 = xm; else x1 = xm;\n if (bottom = y >= (ym = (y0 + y1) / 2)) y0 = ym; else y1 = ym;\n } while ((i = bottom << 1 | right) === (j = (yp >= ym) << 1 | (xp >= xm)));\n return parent[j] = node, parent[i] = leaf, tree;\n}\n\nexport function addAll(data) {\n var d, i, n = data.length,\n x,\n y,\n xz = new Array(n),\n yz = new Array(n),\n x0 = Infinity,\n y0 = Infinity,\n x1 = -Infinity,\n y1 = -Infinity;\n\n // Compute the points and their extent.\n for (i = 0; i < n; ++i) {\n if (isNaN(x = +this._x.call(null, d = data[i])) || isNaN(y = +this._y.call(null, d))) continue;\n xz[i] = x;\n yz[i] = y;\n if (x < x0) x0 = x;\n if (x > x1) x1 = x;\n if (y < y0) y0 = y;\n if (y > y1) y1 = y;\n }\n\n // If there were no (valid) points, abort.\n if (x0 > x1 || y0 > y1) return this;\n\n // Expand the tree to cover the new points.\n this.cover(x0, y0).cover(x1, y1);\n\n // Add the new points.\n for (i = 0; i < n; ++i) {\n add(this, xz[i], yz[i], data[i]);\n }\n\n return this;\n}\n","export default function(node, x0, y0, x1, y1) {\n this.node = node;\n this.x0 = x0;\n this.y0 = y0;\n this.x1 = x1;\n this.y1 = y1;\n}\n","export function defaultX(d) {\n return d[0];\n}\n\nexport default function(_) {\n return arguments.length ? (this._x = _, this) : this._x;\n}\n","export function defaultY(d) {\n return d[1];\n}\n\nexport default function(_) {\n return arguments.length ? (this._y = _, this) : this._y;\n}\n","import tree_add, {addAll as tree_addAll} from \"./add.js\";\nimport tree_cover from \"./cover.js\";\nimport tree_data from \"./data.js\";\nimport tree_extent from \"./extent.js\";\nimport tree_find from \"./find.js\";\nimport tree_remove, {removeAll as tree_removeAll} from \"./remove.js\";\nimport tree_root from \"./root.js\";\nimport tree_size from \"./size.js\";\nimport tree_visit from \"./visit.js\";\nimport tree_visitAfter from \"./visitAfter.js\";\nimport tree_x, {defaultX} from \"./x.js\";\nimport tree_y, {defaultY} from \"./y.js\";\n\nexport default function quadtree(nodes, x, y) {\n var tree = new Quadtree(x == null ? defaultX : x, y == null ? defaultY : y, NaN, NaN, NaN, NaN);\n return nodes == null ? tree : tree.addAll(nodes);\n}\n\nfunction Quadtree(x, y, x0, y0, x1, y1) {\n this._x = x;\n this._y = y;\n this._x0 = x0;\n this._y0 = y0;\n this._x1 = x1;\n this._y1 = y1;\n this._root = undefined;\n}\n\nfunction leaf_copy(leaf) {\n var copy = {data: leaf.data}, next = copy;\n while (leaf = leaf.next) next = next.next = {data: leaf.data};\n return copy;\n}\n\nvar treeProto = quadtree.prototype = Quadtree.prototype;\n\ntreeProto.copy = function() {\n var copy = new Quadtree(this._x, this._y, this._x0, this._y0, this._x1, this._y1),\n node = this._root,\n nodes,\n child;\n\n if (!node) return copy;\n\n if (!node.length) return copy._root = leaf_copy(node), copy;\n\n nodes = [{source: node, target: copy._root = new Array(4)}];\n while (node = nodes.pop()) {\n for (var i = 0; i < 4; ++i) {\n if (child = node.source[i]) {\n if (child.length) nodes.push({source: child, target: node.target[i] = new Array(4)});\n else node.target[i] = leaf_copy(child);\n }\n }\n }\n\n return copy;\n};\n\ntreeProto.add = tree_add;\ntreeProto.addAll = tree_addAll;\ntreeProto.cover = tree_cover;\ntreeProto.data = tree_data;\ntreeProto.extent = tree_extent;\ntreeProto.find = tree_find;\ntreeProto.remove = tree_remove;\ntreeProto.removeAll = tree_removeAll;\ntreeProto.root = tree_root;\ntreeProto.size = tree_size;\ntreeProto.visit = tree_visit;\ntreeProto.visitAfter = tree_visitAfter;\ntreeProto.x = tree_x;\ntreeProto.y = tree_y;\n","export default function(x) {\n return function() {\n return x;\n };\n}\n","export default function(random) {\n return (random() - 0.5) * 1e-6;\n}\n","export default function(x, y) {\n if (isNaN(x = +x) || isNaN(y = +y)) return this; // ignore invalid points\n\n var x0 = this._x0,\n y0 = this._y0,\n x1 = this._x1,\n y1 = this._y1;\n\n // If the quadtree has no extent, initialize them.\n // Integer extent are necessary so that if we later double the extent,\n // the existing quadrant boundaries don’t change due to floating point error!\n if (isNaN(x0)) {\n x1 = (x0 = Math.floor(x)) + 1;\n y1 = (y0 = Math.floor(y)) + 1;\n }\n\n // Otherwise, double repeatedly to cover.\n else {\n var z = x1 - x0 || 1,\n node = this._root,\n parent,\n i;\n\n while (x0 > x || x >= x1 || y0 > y || y >= y1) {\n i = (y < y0) << 1 | (x < x0);\n parent = new Array(4), parent[i] = node, node = parent, z *= 2;\n switch (i) {\n case 0: x1 = x0 + z, y1 = y0 + z; break;\n case 1: x0 = x1 - z, y1 = y0 + z; break;\n case 2: x1 = x0 + z, y0 = y1 - z; break;\n case 3: x0 = x1 - z, y0 = y1 - z; break;\n }\n }\n\n if (this._root && this._root.length) this._root = node;\n }\n\n this._x0 = x0;\n this._y0 = y0;\n this._x1 = x1;\n this._y1 = y1;\n return this;\n}\n","export default function() {\n var data = [];\n this.visit(function(node) {\n if (!node.length) do data.push(node.data); while (node = node.next)\n });\n return data;\n}\n","export default function(_) {\n return arguments.length\n ? this.cover(+_[0][0], +_[0][1]).cover(+_[1][0], +_[1][1])\n : isNaN(this._x0) ? undefined : [[this._x0, this._y0], [this._x1, this._y1]];\n}\n","import Quad from \"./quad.js\";\n\nexport default function(x, y, radius) {\n var data,\n x0 = this._x0,\n y0 = this._y0,\n x1,\n y1,\n x2,\n y2,\n x3 = this._x1,\n y3 = this._y1,\n quads = [],\n node = this._root,\n q,\n i;\n\n if (node) quads.push(new Quad(node, x0, y0, x3, y3));\n if (radius == null) radius = Infinity;\n else {\n x0 = x - radius, y0 = y - radius;\n x3 = x + radius, y3 = y + radius;\n radius *= radius;\n }\n\n while (q = quads.pop()) {\n\n // Stop searching if this quadrant can’t contain a closer node.\n if (!(node = q.node)\n || (x1 = q.x0) > x3\n || (y1 = q.y0) > y3\n || (x2 = q.x1) < x0\n || (y2 = q.y1) < y0) continue;\n\n // Bisect the current quadrant.\n if (node.length) {\n var xm = (x1 + x2) / 2,\n ym = (y1 + y2) / 2;\n\n quads.push(\n new Quad(node[3], xm, ym, x2, y2),\n new Quad(node[2], x1, ym, xm, y2),\n new Quad(node[1], xm, y1, x2, ym),\n new Quad(node[0], x1, y1, xm, ym)\n );\n\n // Visit the closest quadrant first.\n if (i = (y >= ym) << 1 | (x >= xm)) {\n q = quads[quads.length - 1];\n quads[quads.length - 1] = quads[quads.length - 1 - i];\n quads[quads.length - 1 - i] = q;\n }\n }\n\n // Visit this point. (Visiting coincident points isn’t necessary!)\n else {\n var dx = x - +this._x.call(null, node.data),\n dy = y - +this._y.call(null, node.data),\n d2 = dx * dx + dy * dy;\n if (d2 < radius) {\n var d = Math.sqrt(radius = d2);\n x0 = x - d, y0 = y - d;\n x3 = x + d, y3 = y + d;\n data = node.data;\n }\n }\n }\n\n return data;\n}\n","export default function(d) {\n if (isNaN(x = +this._x.call(null, d)) || isNaN(y = +this._y.call(null, d))) return this; // ignore invalid points\n\n var parent,\n node = this._root,\n retainer,\n previous,\n next,\n x0 = this._x0,\n y0 = this._y0,\n x1 = this._x1,\n y1 = this._y1,\n x,\n y,\n xm,\n ym,\n right,\n bottom,\n i,\n j;\n\n // If the tree is empty, initialize the root as a leaf.\n if (!node) return this;\n\n // Find the leaf node for the point.\n // While descending, also retain the deepest parent with a non-removed sibling.\n if (node.length) while (true) {\n if (right = x >= (xm = (x0 + x1) / 2)) x0 = xm; else x1 = xm;\n if (bottom = y >= (ym = (y0 + y1) / 2)) y0 = ym; else y1 = ym;\n if (!(parent = node, node = node[i = bottom << 1 | right])) return this;\n if (!node.length) break;\n if (parent[(i + 1) & 3] || parent[(i + 2) & 3] || parent[(i + 3) & 3]) retainer = parent, j = i;\n }\n\n // Find the point to remove.\n while (node.data !== d) if (!(previous = node, node = node.next)) return this;\n if (next = node.next) delete node.next;\n\n // If there are multiple coincident points, remove just the point.\n if (previous) return (next ? previous.next = next : delete previous.next), this;\n\n // If this is the root point, remove it.\n if (!parent) return this._root = next, this;\n\n // Remove this leaf.\n next ? parent[i] = next : delete parent[i];\n\n // If the parent now contains exactly one leaf, collapse superfluous parents.\n if ((node = parent[0] || parent[1] || parent[2] || parent[3])\n && node === (parent[3] || parent[2] || parent[1] || parent[0])\n && !node.length) {\n if (retainer) retainer[j] = node;\n else this._root = node;\n }\n\n return this;\n}\n\nexport function removeAll(data) {\n for (var i = 0, n = data.length; i < n; ++i) this.remove(data[i]);\n return this;\n}\n","export default function() {\n return this._root;\n}\n","export default function() {\n var size = 0;\n this.visit(function(node) {\n if (!node.length) do ++size; while (node = node.next)\n });\n return size;\n}\n","import Quad from \"./quad.js\";\n\nexport default function(callback) {\n var quads = [], q, node = this._root, child, x0, y0, x1, y1;\n if (node) quads.push(new Quad(node, this._x0, this._y0, this._x1, this._y1));\n while (q = quads.pop()) {\n if (!callback(node = q.node, x0 = q.x0, y0 = q.y0, x1 = q.x1, y1 = q.y1) && node.length) {\n var xm = (x0 + x1) / 2, ym = (y0 + y1) / 2;\n if (child = node[3]) quads.push(new Quad(child, xm, ym, x1, y1));\n if (child = node[2]) quads.push(new Quad(child, x0, ym, xm, y1));\n if (child = node[1]) quads.push(new Quad(child, xm, y0, x1, ym));\n if (child = node[0]) quads.push(new Quad(child, x0, y0, xm, ym));\n }\n }\n return this;\n}\n","import Quad from \"./quad.js\";\n\nexport default function(callback) {\n var quads = [], next = [], q;\n if (this._root) quads.push(new Quad(this._root, this._x0, this._y0, this._x1, this._y1));\n while (q = quads.pop()) {\n var node = q.node;\n if (node.length) {\n var child, x0 = q.x0, y0 = q.y0, x1 = q.x1, y1 = q.y1, xm = (x0 + x1) / 2, ym = (y0 + y1) / 2;\n if (child = node[0]) quads.push(new Quad(child, x0, y0, xm, ym));\n if (child = node[1]) quads.push(new Quad(child, xm, y0, x1, ym));\n if (child = node[2]) quads.push(new Quad(child, x0, ym, xm, y1));\n if (child = node[3]) quads.push(new Quad(child, xm, ym, x1, y1));\n }\n next.push(q);\n }\n while (q = next.pop()) {\n callback(q.node, q.x0, q.y0, q.x1, q.y1);\n }\n return this;\n}\n","var noop = {value: () => {}};\n\nfunction dispatch() {\n for (var i = 0, n = arguments.length, _ = {}, t; i < n; ++i) {\n if (!(t = arguments[i] + \"\") || (t in _) || /[\\s.]/.test(t)) throw new Error(\"illegal type: \" + t);\n _[t] = [];\n }\n return new Dispatch(_);\n}\n\nfunction Dispatch(_) {\n this._ = _;\n}\n\nfunction parseTypenames(typenames, types) {\n return typenames.trim().split(/^|\\s+/).map(function(t) {\n var name = \"\", i = t.indexOf(\".\");\n if (i >= 0) name = t.slice(i + 1), t = t.slice(0, i);\n if (t && !types.hasOwnProperty(t)) throw new Error(\"unknown type: \" + t);\n return {type: t, name: name};\n });\n}\n\nDispatch.prototype = dispatch.prototype = {\n constructor: Dispatch,\n on: function(typename, callback) {\n var _ = this._,\n T = parseTypenames(typename + \"\", _),\n t,\n i = -1,\n n = T.length;\n\n // If no callback was specified, return the callback of the given type and name.\n if (arguments.length < 2) {\n while (++i < n) if ((t = (typename = T[i]).type) && (t = get(_[t], typename.name))) return t;\n return;\n }\n\n // If a type was specified, set the callback for the given type and name.\n // Otherwise, if a null callback was specified, remove callbacks of the given name.\n if (callback != null && typeof callback !== \"function\") throw new Error(\"invalid callback: \" + callback);\n while (++i < n) {\n if (t = (typename = T[i]).type) _[t] = set(_[t], typename.name, callback);\n else if (callback == null) for (t in _) _[t] = set(_[t], typename.name, null);\n }\n\n return this;\n },\n copy: function() {\n var copy = {}, _ = this._;\n for (var t in _) copy[t] = _[t].slice();\n return new Dispatch(copy);\n },\n call: function(type, that) {\n if ((n = arguments.length - 2) > 0) for (var args = new Array(n), i = 0, n, t; i < n; ++i) args[i] = arguments[i + 2];\n if (!this._.hasOwnProperty(type)) throw new Error(\"unknown type: \" + type);\n for (t = this._[type], i = 0, n = t.length; i < n; ++i) t[i].value.apply(that, args);\n },\n apply: function(type, that, args) {\n if (!this._.hasOwnProperty(type)) throw new Error(\"unknown type: \" + type);\n for (var t = this._[type], i = 0, n = t.length; i < n; ++i) t[i].value.apply(that, args);\n }\n};\n\nfunction get(type, name) {\n for (var i = 0, n = type.length, c; i < n; ++i) {\n if ((c = type[i]).name === name) {\n return c.value;\n }\n }\n}\n\nfunction set(type, name, callback) {\n for (var i = 0, n = type.length; i < n; ++i) {\n if (type[i].name === name) {\n type[i] = noop, type = type.slice(0, i).concat(type.slice(i + 1));\n break;\n }\n }\n if (callback != null) type.push({name: name, value: callback});\n return type;\n}\n\nexport default dispatch;\n","var frame = 0, // is an animation frame pending?\n timeout = 0, // is a timeout pending?\n interval = 0, // are any timers active?\n pokeDelay = 1000, // how frequently we check for clock skew\n taskHead,\n taskTail,\n clockLast = 0,\n clockNow = 0,\n clockSkew = 0,\n clock = typeof performance === \"object\" && performance.now ? performance : Date,\n setFrame = typeof window === \"object\" && window.requestAnimationFrame ? window.requestAnimationFrame.bind(window) : function(f) { setTimeout(f, 17); };\n\nexport function now() {\n return clockNow || (setFrame(clearNow), clockNow = clock.now() + clockSkew);\n}\n\nfunction clearNow() {\n clockNow = 0;\n}\n\nexport function Timer() {\n this._call =\n this._time =\n this._next = null;\n}\n\nTimer.prototype = timer.prototype = {\n constructor: Timer,\n restart: function(callback, delay, time) {\n if (typeof callback !== \"function\") throw new TypeError(\"callback is not a function\");\n time = (time == null ? now() : +time) + (delay == null ? 0 : +delay);\n if (!this._next && taskTail !== this) {\n if (taskTail) taskTail._next = this;\n else taskHead = this;\n taskTail = this;\n }\n this._call = callback;\n this._time = time;\n sleep();\n },\n stop: function() {\n if (this._call) {\n this._call = null;\n this._time = Infinity;\n sleep();\n }\n }\n};\n\nexport function timer(callback, delay, time) {\n var t = new Timer;\n t.restart(callback, delay, time);\n return t;\n}\n\nexport function timerFlush() {\n now(); // Get the current time, if not already set.\n ++frame; // Pretend we’ve set an alarm, if we haven’t already.\n var t = taskHead, e;\n while (t) {\n if ((e = clockNow - t._time) >= 0) t._call.call(undefined, e);\n t = t._next;\n }\n --frame;\n}\n\nfunction wake() {\n clockNow = (clockLast = clock.now()) + clockSkew;\n frame = timeout = 0;\n try {\n timerFlush();\n } finally {\n frame = 0;\n nap();\n clockNow = 0;\n }\n}\n\nfunction poke() {\n var now = clock.now(), delay = now - clockLast;\n if (delay > pokeDelay) clockSkew -= delay, clockLast = now;\n}\n\nfunction nap() {\n var t0, t1 = taskHead, t2, time = Infinity;\n while (t1) {\n if (t1._call) {\n if (time > t1._time) time = t1._time;\n t0 = t1, t1 = t1._next;\n } else {\n t2 = t1._next, t1._next = null;\n t1 = t0 ? t0._next = t2 : taskHead = t2;\n }\n }\n taskTail = t0;\n sleep(time);\n}\n\nfunction sleep(time) {\n if (frame) return; // Soonest alarm already set, or will be.\n if (timeout) timeout = clearTimeout(timeout);\n var delay = time - clockNow; // Strictly less than if we recomputed clockNow.\n if (delay > 24) {\n if (time < Infinity) timeout = setTimeout(wake, time - clock.now() - clockSkew);\n if (interval) interval = clearInterval(interval);\n } else {\n if (!interval) clockLast = clock.now(), interval = setInterval(poke, pokeDelay);\n frame = 1, setFrame(wake);\n }\n}\n","// https://en.wikipedia.org/wiki/Linear_congruential_generator#Parameters_in_common_use\nconst a = 1664525;\nconst c = 1013904223;\nconst m = 4294967296; // 2^32\n\nexport default function() {\n let s = 1;\n return () => (s = (a * s + c) % m) / m;\n}\n","import {dispatch} from \"d3-dispatch\";\nimport {timer} from \"d3-timer\";\nimport lcg from \"./lcg.js\";\n\nexport function x(d) {\n return d.x;\n}\n\nexport function y(d) {\n return d.y;\n}\n\nvar initialRadius = 10,\n initialAngle = Math.PI * (3 - Math.sqrt(5));\n\nexport default function(nodes) {\n var simulation,\n alpha = 1,\n alphaMin = 0.001,\n alphaDecay = 1 - Math.pow(alphaMin, 1 / 300),\n alphaTarget = 0,\n velocityDecay = 0.6,\n forces = new Map(),\n stepper = timer(step),\n event = dispatch(\"tick\", \"end\"),\n random = lcg();\n\n if (nodes == null) nodes = [];\n\n function step() {\n tick();\n event.call(\"tick\", simulation);\n if (alpha < alphaMin) {\n stepper.stop();\n event.call(\"end\", simulation);\n }\n }\n\n function tick(iterations) {\n var i, n = nodes.length, node;\n\n if (iterations === undefined) iterations = 1;\n\n for (var k = 0; k < iterations; ++k) {\n alpha += (alphaTarget - alpha) * alphaDecay;\n\n forces.forEach(function(force) {\n force(alpha);\n });\n\n for (i = 0; i < n; ++i) {\n node = nodes[i];\n if (node.fx == null) node.x += node.vx *= velocityDecay;\n else node.x = node.fx, node.vx = 0;\n if (node.fy == null) node.y += node.vy *= velocityDecay;\n else node.y = node.fy, node.vy = 0;\n }\n }\n\n return simulation;\n }\n\n function initializeNodes() {\n for (var i = 0, n = nodes.length, node; i < n; ++i) {\n node = nodes[i], node.index = i;\n if (node.fx != null) node.x = node.fx;\n if (node.fy != null) node.y = node.fy;\n if (isNaN(node.x) || isNaN(node.y)) {\n var radius = initialRadius * Math.sqrt(0.5 + i), angle = i * initialAngle;\n node.x = radius * Math.cos(angle);\n node.y = radius * Math.sin(angle);\n }\n if (isNaN(node.vx) || isNaN(node.vy)) {\n node.vx = node.vy = 0;\n }\n }\n }\n\n function initializeForce(force) {\n if (force.initialize) force.initialize(nodes, random);\n return force;\n }\n\n initializeNodes();\n\n return simulation = {\n tick: tick,\n\n restart: function() {\n return stepper.restart(step), simulation;\n },\n\n stop: function() {\n return stepper.stop(), simulation;\n },\n\n nodes: function(_) {\n return arguments.length ? (nodes = _, initializeNodes(), forces.forEach(initializeForce), simulation) : nodes;\n },\n\n alpha: function(_) {\n return arguments.length ? (alpha = +_, simulation) : alpha;\n },\n\n alphaMin: function(_) {\n return arguments.length ? (alphaMin = +_, simulation) : alphaMin;\n },\n\n alphaDecay: function(_) {\n return arguments.length ? (alphaDecay = +_, simulation) : +alphaDecay;\n },\n\n alphaTarget: function(_) {\n return arguments.length ? (alphaTarget = +_, simulation) : alphaTarget;\n },\n\n velocityDecay: function(_) {\n return arguments.length ? (velocityDecay = 1 - _, simulation) : 1 - velocityDecay;\n },\n\n randomSource: function(_) {\n return arguments.length ? (random = _, forces.forEach(initializeForce), simulation) : random;\n },\n\n force: function(name, _) {\n return arguments.length > 1 ? ((_ == null ? forces.delete(name) : forces.set(name, initializeForce(_))), simulation) : forces.get(name);\n },\n\n find: function(x, y, radius) {\n var i = 0,\n n = nodes.length,\n dx,\n dy,\n d2,\n node,\n closest;\n\n if (radius == null) radius = Infinity;\n else radius *= radius;\n\n for (i = 0; i < n; ++i) {\n node = nodes[i];\n dx = x - node.x;\n dy = y - node.y;\n d2 = dx * dx + dy * dy;\n if (d2 < radius) closest = node, radius = d2;\n }\n\n return closest;\n },\n\n on: function(name, _) {\n return arguments.length > 1 ? (event.on(name, _), simulation) : event.on(name);\n }\n };\n}\n","import {quadtree} from \"d3-quadtree\";\nimport constant from \"./constant.js\";\nimport jiggle from \"./jiggle.js\";\nimport {x, y} from \"./simulation.js\";\n\nexport default function() {\n var nodes,\n node,\n random,\n alpha,\n strength = constant(-30),\n strengths,\n distanceMin2 = 1,\n distanceMax2 = Infinity,\n theta2 = 0.81;\n\n function force(_) {\n var i, n = nodes.length, tree = quadtree(nodes, x, y).visitAfter(accumulate);\n for (alpha = _, i = 0; i < n; ++i) node = nodes[i], tree.visit(apply);\n }\n\n function initialize() {\n if (!nodes) return;\n var i, n = nodes.length, node;\n strengths = new Array(n);\n for (i = 0; i < n; ++i) node = nodes[i], strengths[node.index] = +strength(node, i, nodes);\n }\n\n function accumulate(quad) {\n var strength = 0, q, c, weight = 0, x, y, i;\n\n // For internal nodes, accumulate forces from child quadrants.\n if (quad.length) {\n for (x = y = i = 0; i < 4; ++i) {\n if ((q = quad[i]) && (c = Math.abs(q.value))) {\n strength += q.value, weight += c, x += c * q.x, y += c * q.y;\n }\n }\n quad.x = x / weight;\n quad.y = y / weight;\n }\n\n // For leaf nodes, accumulate forces from coincident quadrants.\n else {\n q = quad;\n q.x = q.data.x;\n q.y = q.data.y;\n do strength += strengths[q.data.index];\n while (q = q.next);\n }\n\n quad.value = strength;\n }\n\n function apply(quad, x1, _, x2) {\n if (!quad.value) return true;\n\n var x = quad.x - node.x,\n y = quad.y - node.y,\n w = x2 - x1,\n l = x * x + y * y;\n\n // Apply the Barnes-Hut approximation if possible.\n // Limit forces for very close nodes; randomize direction if coincident.\n if (w * w / theta2 < l) {\n if (l < distanceMax2) {\n if (x === 0) x = jiggle(random), l += x * x;\n if (y === 0) y = jiggle(random), l += y * y;\n if (l < distanceMin2) l = Math.sqrt(distanceMin2 * l);\n node.vx += x * quad.value * alpha / l;\n node.vy += y * quad.value * alpha / l;\n }\n return true;\n }\n\n // Otherwise, process points directly.\n else if (quad.length || l >= distanceMax2) return;\n\n // Limit forces for very close nodes; randomize direction if coincident.\n if (quad.data !== node || quad.next) {\n if (x === 0) x = jiggle(random), l += x * x;\n if (y === 0) y = jiggle(random), l += y * y;\n if (l < distanceMin2) l = Math.sqrt(distanceMin2 * l);\n }\n\n do if (quad.data !== node) {\n w = strengths[quad.data.index] * alpha / l;\n node.vx += x * w;\n node.vy += y * w;\n } while (quad = quad.next);\n }\n\n force.initialize = function(_nodes, _random) {\n nodes = _nodes;\n random = _random;\n initialize();\n };\n\n force.strength = function(_) {\n return arguments.length ? (strength = typeof _ === \"function\" ? _ : constant(+_), initialize(), force) : strength;\n };\n\n force.distanceMin = function(_) {\n return arguments.length ? (distanceMin2 = _ * _, force) : Math.sqrt(distanceMin2);\n };\n\n force.distanceMax = function(_) {\n return arguments.length ? (distanceMax2 = _ * _, force) : Math.sqrt(distanceMax2);\n };\n\n force.theta = function(_) {\n return arguments.length ? (theta2 = _ * _, force) : Math.sqrt(theta2);\n };\n\n return force;\n}\n","import constant from \"./constant.js\";\nimport jiggle from \"./jiggle.js\";\n\nfunction index(d) {\n return d.index;\n}\n\nfunction find(nodeById, nodeId) {\n var node = nodeById.get(nodeId);\n if (!node) throw new Error(\"node not found: \" + nodeId);\n return node;\n}\n\nexport default function(links) {\n var id = index,\n strength = defaultStrength,\n strengths,\n distance = constant(30),\n distances,\n nodes,\n count,\n bias,\n random,\n iterations = 1;\n\n if (links == null) links = [];\n\n function defaultStrength(link) {\n return 1 / Math.min(count[link.source.index], count[link.target.index]);\n }\n\n function force(alpha) {\n for (var k = 0, n = links.length; k < iterations; ++k) {\n for (var i = 0, link, source, target, x, y, l, b; i < n; ++i) {\n link = links[i], source = link.source, target = link.target;\n x = target.x + target.vx - source.x - source.vx || jiggle(random);\n y = target.y + target.vy - source.y - source.vy || jiggle(random);\n l = Math.sqrt(x * x + y * y);\n l = (l - distances[i]) / l * alpha * strengths[i];\n x *= l, y *= l;\n target.vx -= x * (b = bias[i]);\n target.vy -= y * b;\n source.vx += x * (b = 1 - b);\n source.vy += y * b;\n }\n }\n }\n\n function initialize() {\n if (!nodes) return;\n\n var i,\n n = nodes.length,\n m = links.length,\n nodeById = new Map(nodes.map((d, i) => [id(d, i, nodes), d])),\n link;\n\n for (i = 0, count = new Array(n); i < m; ++i) {\n link = links[i], link.index = i;\n if (typeof link.source !== \"object\") link.source = find(nodeById, link.source);\n if (typeof link.target !== \"object\") link.target = find(nodeById, link.target);\n count[link.source.index] = (count[link.source.index] || 0) + 1;\n count[link.target.index] = (count[link.target.index] || 0) + 1;\n }\n\n for (i = 0, bias = new Array(m); i < m; ++i) {\n link = links[i], bias[i] = count[link.source.index] / (count[link.source.index] + count[link.target.index]);\n }\n\n strengths = new Array(m), initializeStrength();\n distances = new Array(m), initializeDistance();\n }\n\n function initializeStrength() {\n if (!nodes) return;\n\n for (var i = 0, n = links.length; i < n; ++i) {\n strengths[i] = +strength(links[i], i, links);\n }\n }\n\n function initializeDistance() {\n if (!nodes) return;\n\n for (var i = 0, n = links.length; i < n; ++i) {\n distances[i] = +distance(links[i], i, links);\n }\n }\n\n force.initialize = function(_nodes, _random) {\n nodes = _nodes;\n random = _random;\n initialize();\n };\n\n force.links = function(_) {\n return arguments.length ? (links = _, initialize(), force) : links;\n };\n\n force.id = function(_) {\n return arguments.length ? (id = _, force) : id;\n };\n\n force.iterations = function(_) {\n return arguments.length ? (iterations = +_, force) : iterations;\n };\n\n force.strength = function(_) {\n return arguments.length ? (strength = typeof _ === \"function\" ? _ : constant(+_), initializeStrength(), force) : strength;\n };\n\n force.distance = function(_) {\n return arguments.length ? (distance = typeof _ === \"function\" ? _ : constant(+_), initializeDistance(), force) : distance;\n };\n\n return force;\n}\n","import {quadtree} from \"d3-quadtree\";\nimport constant from \"./constant.js\";\nimport jiggle from \"./jiggle.js\";\n\nfunction x(d) {\n return d.x + d.vx;\n}\n\nfunction y(d) {\n return d.y + d.vy;\n}\n\nexport default function(radius) {\n var nodes,\n radii,\n random,\n strength = 1,\n iterations = 1;\n\n if (typeof radius !== \"function\") radius = constant(radius == null ? 1 : +radius);\n\n function force() {\n var i, n = nodes.length,\n tree,\n node,\n xi,\n yi,\n ri,\n ri2;\n\n for (var k = 0; k < iterations; ++k) {\n tree = quadtree(nodes, x, y).visitAfter(prepare);\n for (i = 0; i < n; ++i) {\n node = nodes[i];\n ri = radii[node.index], ri2 = ri * ri;\n xi = node.x + node.vx;\n yi = node.y + node.vy;\n tree.visit(apply);\n }\n }\n\n function apply(quad, x0, y0, x1, y1) {\n var data = quad.data, rj = quad.r, r = ri + rj;\n if (data) {\n if (data.index > node.index) {\n var x = xi - data.x - data.vx,\n y = yi - data.y - data.vy,\n l = x * x + y * y;\n if (l < r * r) {\n if (x === 0) x = jiggle(random), l += x * x;\n if (y === 0) y = jiggle(random), l += y * y;\n l = (r - (l = Math.sqrt(l))) / l * strength;\n node.vx += (x *= l) * (r = (rj *= rj) / (ri2 + rj));\n node.vy += (y *= l) * r;\n data.vx -= x * (r = 1 - r);\n data.vy -= y * r;\n }\n }\n return;\n }\n return x0 > xi + r || x1 < xi - r || y0 > yi + r || y1 < yi - r;\n }\n }\n\n function prepare(quad) {\n if (quad.data) return quad.r = radii[quad.data.index];\n for (var i = quad.r = 0; i < 4; ++i) {\n if (quad[i] && quad[i].r > quad.r) {\n quad.r = quad[i].r;\n }\n }\n }\n\n function initialize() {\n if (!nodes) return;\n var i, n = nodes.length, node;\n radii = new Array(n);\n for (i = 0; i < n; ++i) node = nodes[i], radii[node.index] = +radius(node, i, nodes);\n }\n\n force.initialize = function(_nodes, _random) {\n nodes = _nodes;\n random = _random;\n initialize();\n };\n\n force.iterations = function(_) {\n return arguments.length ? (iterations = +_, force) : iterations;\n };\n\n force.strength = function(_) {\n return arguments.length ? (strength = +_, force) : strength;\n };\n\n force.radius = function(_) {\n return arguments.length ? (radius = typeof _ === \"function\" ? _ : constant(+_), initialize(), force) : radius;\n };\n\n return force;\n}\n","import constant from \"./constant.js\";\n\nexport default function(x) {\n var strength = constant(0.1),\n nodes,\n strengths,\n xz;\n\n if (typeof x !== \"function\") x = constant(x == null ? 0 : +x);\n\n function force(alpha) {\n for (var i = 0, n = nodes.length, node; i < n; ++i) {\n node = nodes[i], node.vx += (xz[i] - node.x) * strengths[i] * alpha;\n }\n }\n\n function initialize() {\n if (!nodes) return;\n var i, n = nodes.length;\n strengths = new Array(n);\n xz = new Array(n);\n for (i = 0; i < n; ++i) {\n strengths[i] = isNaN(xz[i] = +x(nodes[i], i, nodes)) ? 0 : +strength(nodes[i], i, nodes);\n }\n }\n\n force.initialize = function(_) {\n nodes = _;\n initialize();\n };\n\n force.strength = function(_) {\n return arguments.length ? (strength = typeof _ === \"function\" ? _ : constant(+_), initialize(), force) : strength;\n };\n\n force.x = function(_) {\n return arguments.length ? (x = typeof _ === \"function\" ? _ : constant(+_), initialize(), force) : x;\n };\n\n return force;\n}\n","import constant from \"./constant.js\";\n\nexport default function(y) {\n var strength = constant(0.1),\n nodes,\n strengths,\n yz;\n\n if (typeof y !== \"function\") y = constant(y == null ? 0 : +y);\n\n function force(alpha) {\n for (var i = 0, n = nodes.length, node; i < n; ++i) {\n node = nodes[i], node.vy += (yz[i] - node.y) * strengths[i] * alpha;\n }\n }\n\n function initialize() {\n if (!nodes) return;\n var i, n = nodes.length;\n strengths = new Array(n);\n yz = new Array(n);\n for (i = 0; i < n; ++i) {\n strengths[i] = isNaN(yz[i] = +y(nodes[i], i, nodes)) ? 0 : +strength(nodes[i], i, nodes);\n }\n }\n\n force.initialize = function(_) {\n nodes = _;\n initialize();\n };\n\n force.strength = function(_) {\n return arguments.length ? (strength = typeof _ === \"function\" ? _ : constant(+_), initialize(), force) : strength;\n };\n\n force.y = function(_) {\n return arguments.length ? (y = typeof _ === \"function\" ? _ : constant(+_), initialize(), force) : y;\n };\n\n return force;\n}\n","import * as d3Force from \"d3-force\";\n\ninterface INode {\n id: string;\n x: number;\n y: number;\n vx: number;\n vy: number;\n cluster: any;\n}\n\n// https://github.com/john-guerra/forceInABox/blob/master/src/forceInABox.js\nexport default function forceInBox() {\n function constant(_: any): () => any {\n return () => _;\n }\n\n let groupBy = (d: INode) => {\n return d.cluster;\n };\n let forceNodeSize: (() => number) | ((d: any) => number) = constant(1);\n let forceCharge: (() => number) | ((d: any) => number) = constant(-1);\n let forceLinkDistance: (() => number) | ((d: any) => number) = constant(100);\n let forceLinkStrength: (() => number) | ((d: any) => number) = constant(0.1);\n let offset = [0, 0];\n\n let nodes: INode[] = [];\n let nodesMap: any = {};\n let links: any[] = [];\n let centerX = 100;\n let centerY = 100;\n let foci: any = {\n none: {\n x: 0,\n y: 0,\n },\n };\n let templateNodes: INode[] = [];\n let templateForce: any;\n let template = \"force\";\n let enableGrouping = true;\n let strength = 0.1;\n\n function force(alpha: number) {\n if (!enableGrouping) {\n return force;\n }\n templateForce.tick();\n getFocisFromTemplate();\n\n for (let i = 0, n = nodes.length, node, k = alpha * strength; i < n; ++i) {\n node = nodes[i];\n node.vx += (foci[groupBy(node)].x - node.x) * k;\n node.vy += (foci[groupBy(node)].y - node.y) * k;\n }\n }\n\n function initialize() {\n if (!nodes) return;\n initializeWithForce();\n }\n\n function initializeWithForce() {\n if (!nodes || !nodes.length) {\n return;\n }\n\n if (groupBy(nodes[0]) === undefined) {\n throw Error(\n \"Couldnt find the grouping attribute for the nodes. Make sure to set it up with forceInBox.groupBy('clusterAttr') before calling .links()\"\n );\n }\n\n // checkLinksAsObjects();\n\n const net = getGroupsGraph();\n templateForce = d3Force\n .forceSimulation(net.nodes)\n .force(\"x\", d3Force.forceX(centerX).strength(0.1))\n .force(\"y\", d3Force.forceY(centerY).strength(0.1))\n .force(\"collide\", d3Force.forceCollide((d: any) => d.r).iterations(4))\n .force(\"charge\", d3Force.forceManyBody().strength(forceCharge))\n .force(\n \"links\",\n d3Force\n .forceLink(net.nodes.length ? net.links : [])\n .distance(forceLinkDistance)\n .strength(forceLinkStrength)\n );\n\n templateNodes = templateForce.nodes();\n\n getFocisFromTemplate();\n }\n\n function getGroupsGraph() {\n const gnodes: any = [];\n const glinks: any = [];\n const dNodes: any = {};\n let clustersList: string[] = [];\n let clustersCounts: any = {};\n let clustersLinks: any = [];\n\n clustersCounts = computeClustersNodeCounts(nodes);\n clustersLinks = computeClustersLinkCounts(links);\n\n clustersList = Object.keys(clustersCounts);\n\n clustersList.forEach((key, index) => {\n const val = clustersCounts[key];\n // Uses approx meta-node size\n gnodes.push({\n id: key,\n size: val.count,\n r: Math.sqrt(val.sumforceNodeSize / Math.PI),\n });\n dNodes[key] = index;\n });\n\n clustersLinks.forEach((link: any) => {\n const sourceTerminal = link.source;\n const targetTerminal = link.target;\n const source = dNodes[sourceTerminal];\n const target = dNodes[targetTerminal];\n if (source !== undefined && target !== undefined) {\n glinks.push({\n source,\n target,\n count: link.count,\n });\n }\n });\n\n return {\n nodes: gnodes,\n links: glinks,\n };\n }\n\n function computeClustersNodeCounts(nodes: any) {\n const clustersCounts: any = {};\n\n nodes.forEach((d: any) => {\n const key = groupBy(d);\n if (!clustersCounts[key]) {\n clustersCounts[key] = {\n count: 0,\n sumforceNodeSize: 0,\n };\n }\n });\n nodes.forEach((d: any) => {\n const key = groupBy(d);\n const nodeSize = forceNodeSize(d);\n const tmpCount = clustersCounts[key];\n tmpCount.count = tmpCount.count + 1;\n tmpCount.sumforceNodeSize =\n tmpCount.sumforceNodeSize + Math.PI * (nodeSize * nodeSize) * 1.3;\n clustersCounts[key] = tmpCount;\n });\n\n return clustersCounts;\n }\n\n function computeClustersLinkCounts(links: any) {\n const dClusterLinks: any = {};\n const clusterLinks: any = [];\n links.forEach((l: any) => {\n const key = getLinkKey(l);\n let count = 0;\n if (dClusterLinks[key] !== undefined) {\n count = dClusterLinks[key];\n }\n count += 1;\n dClusterLinks[key] = count;\n });\n\n // @ts-ignore\n const entries = Object.entries(dClusterLinks);\n\n entries.forEach(([key, count]: any) => {\n const source = key.split(\"~\")[0];\n const target = key.split(\"~\")[1];\n if (source !== undefined && target !== undefined) {\n clusterLinks.push({\n source,\n target,\n count,\n });\n }\n });\n\n return clusterLinks;\n }\n\n function getFocisFromTemplate() {\n foci = {\n none: {\n x: 0,\n y: 0,\n },\n };\n templateNodes.forEach((d) => {\n foci[d.id] = {\n x: d.x - offset[0],\n y: d.y - offset[1],\n };\n });\n return foci;\n }\n\n function getLinkKey(link: any) {\n const source = link.source;\n const target = link.target;\n const sourceID = groupBy(nodesMap[source]);\n const targetID = groupBy(nodesMap[target]);\n\n return sourceID <= targetID\n ? `${sourceID}~${targetID}`\n : `${targetID}~${sourceID}`;\n }\n\n function genNodesMap(nodes: any) {\n nodesMap = {};\n nodes.forEach((node: any) => {\n nodesMap[node.id] = node;\n });\n }\n\n function setTemplate(x: any) {\n if (!arguments.length) return template;\n template = x;\n initialize();\n return force;\n }\n\n function setGroupBy(x: any) {\n if (!arguments.length) return groupBy;\n if (typeof x === \"string\") {\n groupBy = (d: any) => {\n return d[x];\n };\n return force;\n }\n groupBy = x;\n return force;\n }\n\n function setEnableGrouping(x: any) {\n if (!arguments.length) return enableGrouping;\n enableGrouping = x;\n return force;\n }\n\n function setStrength(x: any) {\n if (!arguments.length) return strength;\n strength = x;\n return force;\n }\n\n function setCenterX(_: any) {\n if (arguments.length) {\n centerX = _;\n return force;\n }\n\n return centerX;\n }\n\n function setCenterY(_: any) {\n if (arguments.length) {\n centerY = _;\n return force;\n }\n\n return centerY;\n }\n\n function setNodes(_: any) {\n if (arguments.length) {\n genNodesMap(_ || []);\n nodes = _ || [];\n return force;\n }\n return nodes;\n }\n\n function setLinks(_: any) {\n if (arguments.length) {\n links = _ || [];\n initialize();\n return force;\n }\n return links;\n }\n\n function setForceNodeSize(_: any) {\n if (arguments.length) {\n if (typeof _ === \"function\") {\n forceNodeSize = _;\n } else {\n forceNodeSize = constant(+_);\n }\n initialize();\n return force;\n }\n\n return forceNodeSize;\n }\n\n function setForceCharge(_: any) {\n if (arguments.length) {\n if (typeof _ === \"function\") {\n forceCharge = _;\n } else {\n forceCharge = constant(+_);\n }\n initialize();\n return force;\n }\n\n return forceCharge;\n }\n\n function setForceLinkDistance(_: any) {\n if (arguments.length) {\n if (typeof _ === \"function\") {\n forceLinkDistance = _;\n } else {\n forceLinkDistance = constant(+_);\n }\n initialize();\n return force;\n }\n\n return forceLinkDistance;\n }\n\n function setForceLinkStrength(_: any) {\n if (arguments.length) {\n if (typeof _ === \"function\") {\n forceLinkStrength = _;\n } else {\n forceLinkStrength = constant(+_);\n }\n initialize();\n return force;\n }\n\n return forceLinkStrength;\n }\n\n function setOffset(_: any) {\n if (arguments.length) {\n offset = _;\n return force;\n }\n\n return offset;\n }\n\n force.initialize = (_: any) => {\n nodes = _;\n initialize();\n };\n\n force.template = setTemplate;\n\n force.groupBy = setGroupBy;\n\n force.enableGrouping = setEnableGrouping;\n\n force.strength = setStrength;\n\n force.centerX = setCenterX;\n\n force.centerY = setCenterY;\n\n force.nodes = setNodes;\n\n force.links = setLinks;\n\n force.forceNodeSize = setForceNodeSize;\n\n // Legacy support\n force.nodeSize = force.forceNodeSize;\n\n force.forceCharge = setForceCharge;\n\n force.forceLinkDistance = setForceLinkDistance;\n\n force.forceLinkStrength = setForceLinkStrength;\n\n force.offset = setOffset;\n\n force.getFocis = getFocisFromTemplate;\n\n return force;\n}\n","import * as d3Force from \"d3-force\";\nimport { isFunction, isNumber, isObject } from \"@antv/util\";\nimport {\n Graph,\n Node,\n LayoutMapping,\n OutNode,\n D3ForceLayoutOptions,\n Edge,\n LayoutWithIterations,\n} from \"../types\";\nimport { cloneFormatData, isArray } from \"../util\";\nimport forceInBox from \"./forceInBox\";\n\n/**\n * D3 writes x and y as the first level properties\n */\ninterface CalcNode extends Node {\n x: number;\n y: number;\n}\n\nconst DEFAULTS_LAYOUT_OPTIONS: Partial<D3ForceLayoutOptions> = {\n center: [0, 0],\n preventOverlap: false,\n nodeSize: undefined,\n nodeSpacing: undefined,\n linkDistance: 50,\n forceSimulation: null,\n alphaDecay: 0.028,\n alphaMin: 0.001,\n alpha: 0.3,\n collideStrength: 1,\n clustering: false,\n clusterNodeStrength: -1,\n clusterEdgeStrength: 0.1,\n clusterEdgeDistance: 100,\n clusterFociStrength: 0.8,\n clusterNodeSize: 10,\n};\n\n/**\n * Layout the nodes' positions with d3's basic classic force\n *\n * @example\n * // Assign layout options when initialization.\n * const layout = new D3ForceLayout({ center: [100, 100] });\n * const positions = await layout.execute(graph); // { nodes: [], edges: [] }\n *\n * // Or use different options later.\n * const layout = new D3ForceLayout({ center: [100, 100] });\n * const positions = await layout.execute(graph, { center: [100, 100] }); // { nodes: [], edges: [] }\n *\n * // If you want to assign the positions directly to the nodes, use assign method.\n * await layout.assign(graph, { center: [100, 100] });\n */\nexport class D3ForceLayout\n implements LayoutWithIterations<D3ForceLayoutOptions>\n{\n id = \"d3force\";\n\n private forceSimulation: d3Force.Simulation<any, any>;\n\n private lastLayoutNodes: CalcNode[];\n private lastLayoutEdges: Edge[];\n private lastAssign: boolean;\n private lastGraph: Graph;\n\n constructor(\n public options: D3ForceLayoutOptions = {} as D3ForceLayoutOptions\n ) {\n this.options = {\n ...DEFAULTS_LAYOUT_OPTIONS,\n ...options,\n };\n }\n\n /**\n * Return the positions of nodes and edges(if needed).\n */\n async execute(graph: Graph, options?: D3ForceLayoutOptions) {\n return this.genericForceLayout(false, graph, options);\n }\n /**\n * To directly assign the positions to the nodes.\n */\n async assign(graph: Graph, options?: D3ForceLayoutOptions) {\n this.genericForceLayout(true, graph, options);\n }\n\n /**\n * Stop simulation immediately.\n */\n stop() {\n this.forceSimulation?.stop();\n }\n\n /**\n * Manually steps the simulation by the specified number of iterations.\n * @see https://github.com/d3/d3-force#simulation_tick\n */\n tick(iterations = 1) {\n this.forceSimulation.tick(iterations);\n\n const result = {\n nodes: formatOutNodes(this.lastLayoutNodes),\n edges: formatOutEdges(this.lastLayoutEdges),\n };\n\n if (this.lastAssign) {\n result.nodes.forEach((node) =>\n this.lastGraph.mergeNodeData(node.id, {\n x: node.data.x,\n y: node.data.y,\n })\n );\n }\n\n return result;\n }\n\n private async genericForceLayout(\n assign: false,\n graph: Graph,\n options?: D3ForceLayoutOptions\n ): Promise<LayoutMapping>;\n private async genericForceLayout(\n assign: true,\n graph: Graph,\n options?: D3ForceLayoutOptions\n ): Promise<void>;\n private async genericForceLayout(\n assign: boolean,\n graph: Graph,\n options?: D3ForceLayoutOptions\n ): Promise<LayoutMapping | void> {\n const mergedOptions = { ...this.options, ...options };\n\n const nodes = graph.getAllNodes();\n const edges = graph.getAllEdges();\n const layoutNodes: CalcNode[] = nodes.map(\n (node) =>\n ({\n ...cloneFormatData(node),\n x: node.data?.x,\n y: node.data?.y,\n } as CalcNode)\n );\n const layoutEdges: Edge[] = edges.map((edge) => cloneFormatData(edge));\n\n // Use them later in `tick`.\n this.lastLayoutNodes = layoutNodes;\n this.lastLayoutEdges = layoutEdges;\n this.lastAssign = assign;\n this.lastGraph = graph;\n\n const {\n alphaMin,\n alphaDecay,\n alpha,\n nodeStrength,\n edgeStrength,\n linkDistance,\n clustering,\n clusterFociStrength,\n clusterEdgeDistance,\n clusterEdgeStrength,\n clusterNodeStrength,\n clusterNodeSize,\n collideStrength = 1,\n center = [0, 0],\n preventOverlap,\n nodeSize,\n nodeSpacing,\n onTick,\n } = mergedOptions;\n let { forceSimulation } = mergedOptions;\n\n return new Promise((resolve) => {\n if (!forceSimulation) {\n try {\n // 定义节点的力\n const nodeForce = d3Force.forceManyBody();\n if (nodeStrength) {\n nodeForce.strength(nodeStrength as any);\n }\n forceSimulation = d3Force.forceSimulation().nodes(layoutNodes as any);\n\n if (clustering) {\n const clusterForce = forceInBox() as any;\n clusterForce\n .centerX(center[0])\n .centerY(center[1])\n .template(\"force\")\n .strength(clusterFociStrength);\n if (layoutEdges) {\n clusterForce.links(layoutEdges);\n }\n if (layoutNodes) {\n clusterForce.nodes(layoutNodes);\n }\n clusterForce\n .forceLinkDistance(clusterEdgeDistance)\n .forceLinkStrength(clusterEdgeStrength)\n .forceCharge(clusterNodeStrength)\n .forceNodeSize(clusterNodeSize);\n\n forceSimulation.force(\"group\", clusterForce);\n }\n forceSimulation\n .force(\"center\", d3Force.forceCenter(center[0], center[1]))\n .force(\"charge\", nodeForce)\n .alpha(alpha)\n .alphaDecay(alphaDecay)\n .alphaMin(alphaMin);\n\n if (preventOverlap) {\n this.overlapProcess(forceSimulation, {\n nodeSize,\n nodeSpacing,\n collideStrength,\n });\n }\n // 如果有边，定义边的力\n if (layoutEdges) {\n // d3 的 forceLayout 会重新生成边的数据模型，为了避免污染源数据\n const edgeForce = d3Force\n .forceLink()\n .id((d: any) => d.id)\n .links(layoutEdges);\n if (edgeStrength) {\n edgeForce.strength(edgeStrength as any);\n }\n if (linkDistance) {\n edgeForce.distance(linkDistance as any);\n }\n forceSimulation.force(\"link\", edgeForce);\n }\n\n forceSimulation\n .on(\"tick\", () => {\n const outNodes = formatOutNodes(layoutNodes);\n onTick?.({\n nodes: outNodes,\n edges: formatOutEdges(layoutEdges),\n });\n\n if (assign) {\n outNodes.forEach((node) =>\n graph.mergeNodeData(node.id, {\n x: node.data.x,\n y: node.data.y,\n })\n );\n }\n })\n .on(\"end\", () => {\n const outNodes = formatOutNodes(layoutNodes);\n\n if (assign) {\n outNodes.forEach((node) =>\n graph.mergeNodeData(node.id, {\n x: node.data.x,\n y: node.data.y,\n })\n );\n }\n\n resolve({\n nodes: outNodes,\n edges: formatOutEdges(layoutEdges),\n });\n });\n } catch (e) {\n console.warn(e);\n }\n } else {\n // forceSimulation is defined\n if (clustering) {\n const clusterForce = forceInBox() as any;\n clusterForce.nodes(layoutNodes);\n clusterForce.links(layoutEdges);\n }\n forceSimulation.nodes(layoutNodes);\n if (layoutEdges) {\n // d3 的 forceLayout 会重新生成边的数据模型，为了避免污染源数据\n const edgeForce = d3Force\n .forceLink()\n .id((d: any) => d.id)\n .links(layoutEdges);\n if (edgeStrength) {\n edgeForce.strength(edgeStrength as any);\n }\n if (linkDistance) {\n edgeForce.distance(linkDistance as any);\n }\n forceSimulation.force(\"link\", edgeForce);\n }\n if (preventOverlap) {\n this.overlapProcess(forceSimulation, {\n nodeSize,\n nodeSpacing,\n collideStrength,\n });\n }\n forceSimulation.alpha(alpha).restart();\n\n // since d3 writes x and y as node's first level properties, format them into data\n const outNodes = formatOutNodes(layoutNodes);\n const outEdges = formatOutEdges(layoutEdges);\n\n if (assign) {\n outNodes.forEach((node) =>\n graph.mergeNodeData(node.id, {\n x: node.data.x,\n y: node.data.y,\n })\n );\n }\n\n resolve({\n nodes: outNodes,\n edges: outEdges,\n });\n }\n\n this.forceSimulation = forceSimulation;\n });\n }\n\n /**\n * Prevent overlappings.\n * @param {object} simulation force simulation of d3\n */\n public overlapProcess(\n simulation: d3Force.Simulation<any, any>,\n options: {\n nodeSize: number | number[] | ((d?: Node) => number) | undefined;\n nodeSpacing: number | number[] | ((d?: Node) => number) | undefined;\n collideStrength: number;\n }\n ) {\n const { nodeSize, nodeSpacing, collideStrength } = options;\n let nodeSizeFunc: (d: any) => number;\n let nodeSpacingFunc: any;\n\n if (isNumber(nodeSpacing)) {\n nodeSpacingFunc = () => nodeSpacing;\n } else if (isFunction(nodeSpacing)) {\n nodeSpacingFunc = nodeSpacing;\n } else {\n nodeSpacingFunc = () => 0;\n }\n\n if (!nodeSize) {\n nodeSizeFunc = (d) => {\n if (d.size) {\n if (isArray(d.size)) {\n const res = d.size[0] > d.size[1] ? d.size[0] : d.size[1];\n return res / 2 + nodeSpacingFunc(d);\n }\n if (isObject(d.size)) {\n const res =\n d.size.width > d.size.height ? d.size.width : d.size.height;\n return res / 2 + nodeSpacingFunc(d);\n }\n return d.size / 2 + nodeSpacingFunc(d);\n }\n return 10 + nodeSpacingFunc(d);\n };\n } else if (isFunction(nodeSize)) {\n nodeSizeFunc = (d) => {\n const size = nodeSize(d);\n return size + nodeSpacingFunc(d);\n };\n } else if (isArray(nodeSize)) {\n const larger = nodeSize[0] > nodeSize[1] ? nodeSize[0] : nodeSize[1];\n const radius = larger / 2;\n nodeSizeFunc = (d) => radius + nodeSpacingFunc(d);\n } else if (isNumber(nodeSize)) {\n const radius = (nodeSize as number) / 2;\n nodeSizeFunc = (d) => radius + nodeSpacingFunc(d);\n } else {\n nodeSizeFunc = () => 10;\n }\n\n // forceCollide's parameter is a radius\n simulation.force(\n \"collisionForce\",\n d3Force.forceCollide(nodeSizeFunc).strength(collideStrength)\n );\n }\n}\n\n/**\n * Format the calculation nodes into output nodes.\n * Since d3 reads properties in plain node data object which is not compact to the OutNode\n * @param layoutNodes\n * @returns\n */\nconst formatOutNodes = (layoutNodes: CalcNode[]): OutNode[] =>\n layoutNodes.map((node) => {\n const { x, y, ...others } = node;\n return {\n ...others,\n data: {\n ...others.data,\n x,\n y,\n },\n };\n });\n\n/**\n * d3 will modify `source` and `target` on edge object.\n */\nconst formatOutEdges = (edges: any[]): Edge[] =>\n edges.map((edge) => {\n const { source, target, ...rest } = edge;\n return {\n ...rest,\n source: source.id,\n target: target.id,\n };\n });\n","export default function(x, y) {\n var nodes, strength = 1;\n\n if (x == null) x = 0;\n if (y == null) y = 0;\n\n function force() {\n var i,\n n = nodes.length,\n node,\n sx = 0,\n sy = 0;\n\n for (i = 0; i < n; ++i) {\n node = nodes[i], sx += node.x, sy += node.y;\n }\n\n for (sx = (sx / n - x) * strength, sy = (sy / n - y) * strength, i = 0; i < n; ++i) {\n node = nodes[i], node.x -= sx, node.y -= sy;\n }\n }\n\n force.initialize = function(_) {\n nodes = _;\n };\n\n force.x = function(_) {\n return arguments.length ? (x = +_, force) : x;\n };\n\n force.y = function(_) {\n return arguments.length ? (y = +_, force) : y;\n };\n\n force.strength = function(_) {\n return arguments.length ? (strength = +_, force) : strength;\n };\n\n return force;\n}\n","var WILDCARD = '*';\n/* event-emitter */\nvar EventEmitter = /** @class */ (function () {\n function EventEmitter() {\n this._events = {};\n }\n /**\n * 监听一个事件\n * @param evt\n * @param callback\n * @param once\n */\n EventEmitter.prototype.on = function (evt, callback, once) {\n if (!this._events[evt]) {\n this._events[evt] = [];\n }\n this._events[evt].push({\n callback: callback,\n once: !!once,\n });\n return this;\n };\n /**\n * 监听一个事件一次\n * @param evt\n * @param callback\n */\n EventEmitter.prototype.once = function (evt, callback) {\n return this.on(evt, callback, true);\n };\n /**\n * 触发一个事件\n * @param evt\n * @param args\n */\n EventEmitter.prototype.emit = function (evt) {\n var _this = this;\n var args = [];\n for (var _i = 1; _i < arguments.length; _i++) {\n args[_i - 1] = arguments[_i];\n }\n var events = this._events[evt] || [];\n var wildcardEvents = this._events[WILDCARD] || [];\n // 实际的处理 emit 方法\n var doEmit = function (es) {\n var length = es.length;\n for (var i = 0; i < length; i++) {\n if (!es[i]) {\n continue;\n }\n var _a = es[i], callback = _a.callback, once = _a.once;\n if (once) {\n es.splice(i, 1);\n if (es.length === 0) {\n delete _this._events[evt];\n }\n length--;\n i--;\n }\n callback.apply(_this, args);\n }\n };\n doEmit(events);\n doEmit(wildcardEvents);\n };\n /**\n * 取消监听一个事件，或者一个channel\n * @param evt\n * @param callback\n */\n EventEmitter.prototype.off = function (evt, callback) {\n if (!evt) {\n // evt 为空全部清除\n this._events = {};\n }\n else {\n if (!callback) {\n // evt 存在，callback 为空，清除事件所有方法\n delete this._events[evt];\n }\n else {\n // evt 存在，callback 存在，清除匹配的\n var events = this._events[evt] || [];\n var length_1 = events.length;\n for (var i = 0; i < length_1; i++) {\n if (events[i].callback === callback) {\n events.splice(i, 1);\n length_1--;\n i--;\n }\n }\n if (events.length === 0) {\n delete this._events[evt];\n }\n }\n }\n return this;\n };\n /* 当前所有的事件 */\n EventEmitter.prototype.getEvents = function () {\n return this._events;\n };\n return EventEmitter;\n}());\nexport default EventEmitter;\n//# sourceMappingURL=index.js.map","export function doBFS(queue, visited, fn, navigator) {\n while (queue.length) {\n const node = queue.shift();\n const abort = fn(node);\n if (abort) {\n return true;\n }\n visited.add(node.id);\n navigator(node.id).forEach((n) => {\n if (!visited.has(n.id)) {\n visited.add(n.id);\n queue.push(n);\n }\n });\n }\n return false;\n}\nexport function doDFS(node, visited, fn, navigator) {\n const abort = fn(node);\n if (abort) {\n return true;\n }\n visited.add(node.id);\n for (const n of navigator(node.id)) {\n if (!visited.has(n.id)) {\n if (doDFS(n, visited, fn, navigator)) {\n return true;\n }\n }\n }\n return false;\n}\n//# sourceMappingURL=traverse.js.map","import EventEmitter from '@antv/event-emitter';\nimport { doBFS, doDFS } from './utils/traverse';\nexport class Graph extends EventEmitter {\n nodeMap = new Map();\n edgeMap = new Map();\n inEdgesMap = new Map();\n outEdgesMap = new Map();\n bothEdgesMap = new Map();\n treeIndices = new Map();\n changes = [];\n batchCount = 0;\n /**\n * This function is called with a {@link GraphChangedEvent} each time a graph change happened.\n *\n * `event.changes` contains all the graph changes in order since last `onChanged`.\n */\n onChanged = () => {\n // Do nothing.\n };\n /**\n * Create a new Graph instance.\n * @param options - The options to initialize a graph. See {@link GraphOptions}.\n *\n * ```ts\n * const graph = new Graph({\n * // Optional, initial nodes.\n * nodes: [\n * // Each node has a unique ID.\n * { id: 'A', foo: 1 },\n * { id: 'B', foo: 1 },\n * ],\n * // Optional, initial edges.\n * edges: [\n * { id: 'C', source: 'B', target: 'B', weight: 1 },\n * ],\n * // Optional, called with a GraphChangedEvent.\n * onChanged: (event) => {\n * console.log(event);\n * }\n * });\n * ```\n */\n constructor(options) {\n super();\n if (!options)\n return;\n if (options.nodes)\n this.addNodes(options.nodes);\n if (options.edges)\n this.addEdges(options.edges);\n if (options.tree)\n this.addTree(options.tree);\n if (options.onChanged)\n this.onChanged = options.onChanged;\n }\n /**\n * Batch several graph changes into one.\n *\n * Make several changes, but dispatch only one ChangedEvent at the end of batch:\n * ```ts\n * graph.batch(() => {\n * graph.addNodes([]);\n * graph.addEdges([]);\n * });\n * ```\n *\n * Batches can be nested. Only the outermost batch will dispatch a ChangedEvent:\n * ```ts\n * graph.batch(() => {\n * graph.addNodes([]);\n * graph.batch(() => {\n * graph.addEdges([]);\n * });\n * });\n * ```\n */\n batch = (fn) => {\n this.batchCount += 1;\n fn();\n this.batchCount -= 1;\n if (!this.batchCount) {\n this.commit();\n }\n };\n /**\n * Reset changes and dispatch a ChangedEvent.\n */\n commit() {\n const changes = this.changes;\n this.changes = [];\n const event = {\n graph: this,\n changes,\n };\n this.emit('changed', event);\n this.onChanged(event);\n }\n /**\n * Reduce the number of ordered graph changes by dropping or merging unnecessary changes.\n *\n * For example, if we update a node and remove it in a batch:\n *\n * ```ts\n * graph.batch(() => {\n * graph.updateNodeData('A', 'foo', 2);\n * graph.removeNode('A');\n * });\n * ```\n *\n * We get 2 atomic graph changes like\n *\n * ```ts\n * [\n * { type: 'NodeDataUpdated', id: 'A', propertyName: 'foo', oldValue: 1, newValue: 2 },\n * { type: 'NodeRemoved', value: { id: 'A', data: { foo: 2 } },\n * ]\n * ```\n *\n * Since node 'A' has been removed, we actually have no need to handle with NodeDataUpdated change.\n *\n * `reduceChanges()` here helps us remove such changes.\n */\n reduceChanges(changes) {\n let mergedChanges = [];\n changes.forEach((change) => {\n switch (change.type) {\n case 'NodeRemoved': {\n // NodeAdded: A added.\n // NodeDataUpdated: A changed.\n // TreeStructureChanged: A's parent changed.\n // NodeRemoved: A removed. 👈🏻 Since A was removed, above three changes may be ignored.\n let isNewlyAdded = false;\n mergedChanges = mergedChanges.filter((pastChange) => {\n if (pastChange.type === 'NodeAdded') {\n const sameId = pastChange.value.id === change.value.id;\n if (sameId) {\n isNewlyAdded = true;\n }\n return !sameId;\n }\n else if (pastChange.type === 'NodeDataUpdated') {\n return pastChange.id !== change.value.id;\n }\n else if (pastChange.type === 'TreeStructureChanged') {\n return pastChange.nodeId !== change.value.id;\n }\n return true;\n });\n if (!isNewlyAdded) {\n mergedChanges.push(change);\n }\n break;\n }\n case 'EdgeRemoved': {\n // EdgeAdded: A added.\n // EdgeDataUpdated: A changed.\n // EdgeDataUpdated: A's source/target changed.\n // EdgeRemoved: A removed. 👈🏻 Since A was removed, above three changes may be ignored.\n let isNewlyAdded = false;\n mergedChanges = mergedChanges.filter((pastChange) => {\n if (pastChange.type === 'EdgeAdded') {\n const sameId = pastChange.value.id === change.value.id;\n if (sameId) {\n isNewlyAdded = true;\n }\n return !sameId;\n }\n else if (pastChange.type === 'EdgeDataUpdated' ||\n pastChange.type === 'EdgeUpdated') {\n return pastChange.id !== change.value.id;\n }\n return true;\n });\n if (!isNewlyAdded) {\n mergedChanges.push(change);\n }\n break;\n }\n case 'NodeDataUpdated':\n case 'EdgeDataUpdated':\n case 'EdgeUpdated': {\n // NodeDataUpdated: { id: A, propertyName: 'foo', oldValue: 1, newValue: 2 }.\n // NodeDataUpdated: { id: A, propertyName: 'foo', oldValue: 2, newValue: 3 }.\n // 👆 Could be merged as { id: A, propertyName: 'foo', oldValue: 1, newValue: 3 }.\n const existingChange = mergedChanges.find((pastChange) => {\n return (pastChange.type === change.type &&\n pastChange.id === change.id &&\n pastChange.propertyName === change.propertyName);\n });\n if (existingChange) {\n existingChange.newValue = change.newValue;\n }\n else {\n mergedChanges.push(change);\n }\n break;\n }\n case 'TreeStructureDetached': {\n // TreeStructureAttached\n // TreeStructureChanged\n // TreeStructureDetached 👈🏻 Since the tree struct was detached, above 2 changes may be ignored.\n mergedChanges = mergedChanges.filter((pastChange) => {\n if (pastChange.type === 'TreeStructureAttached') {\n return pastChange.treeKey !== change.treeKey;\n }\n else if (pastChange.type === 'TreeStructureChanged') {\n return pastChange.treeKey !== change.treeKey;\n }\n return true;\n });\n mergedChanges.push(change);\n break;\n }\n case 'TreeStructureChanged': {\n const existingChange = mergedChanges.find((pastChange) => {\n return (pastChange.type === 'TreeStructureChanged' &&\n pastChange.treeKey === change.treeKey &&\n pastChange.nodeId === change.nodeId);\n });\n if (existingChange) {\n existingChange.newParentId =\n change.newParentId;\n }\n else {\n mergedChanges.push(change);\n }\n break;\n }\n default:\n mergedChanges.push(change);\n break;\n }\n });\n return mergedChanges;\n }\n // ================= Node =================\n checkNodeExistence(id) {\n this.getNode(id);\n }\n /**\n * Check if a node exists in the graph.\n * @group NodeMethods\n */\n hasNode(id) {\n return this.nodeMap.has(id);\n }\n /**\n * Tell if two nodes are neighbors.\n * @group NodeMethods\n */\n areNeighbors(firstNodeId, secondNodeId) {\n return this.getNeighbors(secondNodeId).some((neighbor) => neighbor.id === firstNodeId);\n }\n /**\n * Get the node data with given ID.\n * @group NodeMethods\n */\n getNode(id) {\n const node = this.nodeMap.get(id);\n if (!node) {\n throw new Error('Node not found for id: ' + id);\n }\n return node;\n }\n /**\n * Given a node ID, find all edges of the node.\n * @param id - ID of the node\n * @param direction - Edge direction, defaults to 'both'.\n * @group NodeMethods\n */\n getRelatedEdges(id, direction) {\n this.checkNodeExistence(id);\n if (direction === 'in') {\n const inEdges = this.inEdgesMap.get(id);\n return Array.from(inEdges);\n }\n else if (direction === 'out') {\n const outEdges = this.outEdgesMap.get(id);\n return Array.from(outEdges);\n }\n else {\n const bothEdges = this.bothEdgesMap.get(id);\n return Array.from(bothEdges);\n }\n }\n /**\n * Get the degree of the given node.\n * @group NodeMethods\n */\n getDegree(id, direction) {\n return this.getRelatedEdges(id, direction).length;\n }\n /**\n * Get all successors of the given node.\n */\n getSuccessors(id) {\n const outEdges = this.getRelatedEdges(id, 'out');\n const targets = outEdges.map((edge) => this.getNode(edge.target));\n return Array.from(new Set(targets));\n }\n /**\n * Get all predecessors of the given node.\n */\n getPredecessors(id) {\n const inEdges = this.getRelatedEdges(id, 'in');\n const sources = inEdges.map((edge) => this.getNode(edge.source));\n return Array.from(new Set(sources));\n }\n /**\n * Given a node ID, find its neighbors.\n * @param id - ID of the node\n * @group NodeMethods\n */\n getNeighbors(id) {\n const predecessors = this.getPredecessors(id);\n const successors = this.getSuccessors(id);\n return Array.from(new Set([...predecessors, ...successors]));\n }\n doAddNode(node) {\n if (this.hasNode(node.id)) {\n throw new Error('Node already exists: ' + node.id);\n }\n this.nodeMap.set(node.id, node);\n this.inEdgesMap.set(node.id, new Set());\n this.outEdgesMap.set(node.id, new Set());\n this.bothEdgesMap.set(node.id, new Set());\n this.treeIndices.forEach((tree) => {\n tree.childrenMap.set(node.id, new Set());\n });\n this.changes.push({ type: 'NodeAdded', value: node });\n }\n /**\n * Add all nodes of the given array, or iterable, into the graph.\n * @group NodeMethods\n */\n addNodes(nodes) {\n this.batch(() => {\n for (const node of nodes) {\n this.doAddNode(node);\n }\n });\n }\n /**\n * Add a single node into the graph.\n * @group NodeMethods\n */\n addNode(node) {\n this.addNodes([node]);\n }\n doRemoveNode(id) {\n const node = this.getNode(id);\n const bothEdges = this.bothEdgesMap.get(id);\n bothEdges?.forEach((edge) => this.doRemoveEdge(edge.id));\n this.nodeMap.delete(id);\n this.treeIndices.forEach((tree) => {\n tree.childrenMap.get(id)?.forEach((child) => {\n tree.parentMap.delete(child.id);\n });\n tree.parentMap.delete(id);\n tree.childrenMap.delete(id);\n });\n this.changes.push({ type: 'NodeRemoved', value: node });\n }\n /**\n * Remove nodes and their attached edges from the graph.\n * @group NodeMethods\n */\n removeNodes(idList) {\n this.batch(() => {\n idList.forEach((id) => this.doRemoveNode(id));\n });\n }\n /**\n * Remove a single node and its attached edges from the graph.\n * @group NodeMethods\n */\n removeNode(id) {\n this.removeNodes([id]);\n }\n updateNodeDataProperty(id, propertyName, value) {\n const node = this.getNode(id);\n this.batch(() => {\n const oldValue = node.data[propertyName];\n const newValue = value;\n node.data[propertyName] = newValue;\n this.changes.push({\n type: 'NodeDataUpdated',\n id,\n propertyName,\n oldValue,\n newValue,\n });\n });\n }\n /**\n * Like Object.assign, merge all properties of `path` to the node data.\n * @param id Node ID.\n * @param patch A data object to merge.\n */\n mergeNodeData(id, patch) {\n this.batch(() => {\n Object.entries(patch).forEach(([propertyName, value]) => {\n this.updateNodeDataProperty(id, propertyName, value);\n });\n });\n }\n updateNodeData(...args) {\n const id = args[0];\n const node = this.getNode(id);\n if (typeof args[1] === 'string') {\n // id, propertyName, value\n this.updateNodeDataProperty(id, args[1], args[2]);\n return;\n }\n let data;\n if (typeof args[1] === 'function') {\n // id, update\n const update = args[1];\n data = update(node.data);\n }\n else if (typeof args[1] === 'object') {\n // id, data\n data = args[1];\n }\n this.batch(() => {\n const oldValue = node.data;\n const newValue = data;\n node.data = data;\n this.changes.push({\n type: 'NodeDataUpdated',\n id,\n oldValue,\n newValue,\n });\n });\n }\n // ================= Edge =================\n checkEdgeExistence(id) {\n if (!this.hasEdge(id)) {\n throw new Error('Edge not found for id: ' + id);\n }\n }\n /**\n * Check if an edge exists in the graph.\n * @group NodeMethods\n */\n hasEdge(id) {\n return this.edgeMap.has(id);\n }\n /**\n * Get the edge data with given ID.\n * @group EdgeMethods\n */\n getEdge(id) {\n this.checkEdgeExistence(id);\n return this.edgeMap.get(id);\n }\n /**\n * Get the edge, the source node, and the target node by an edge ID.\n * @group EdgeMethods\n */\n getEdgeDetail(id) {\n const edge = this.getEdge(id);\n return {\n edge,\n source: this.getNode(edge.source),\n target: this.getNode(edge.target),\n };\n }\n doAddEdge(edge) {\n if (this.hasEdge(edge.id)) {\n throw new Error('Edge already exists: ' + edge.id);\n }\n this.checkNodeExistence(edge.source);\n this.checkNodeExistence(edge.target);\n this.edgeMap.set(edge.id, edge);\n const inEdges = this.inEdgesMap.get(edge.target);\n const outEdges = this.outEdgesMap.get(edge.source);\n const bothEdgesOfSource = this.bothEdgesMap.get(edge.source);\n const bothEdgesOfTarget = this.bothEdgesMap.get(edge.target);\n inEdges.add(edge);\n outEdges.add(edge);\n bothEdgesOfSource.add(edge);\n bothEdgesOfTarget.add(edge);\n this.changes.push({ type: 'EdgeAdded', value: edge });\n }\n /**\n * Add all edges of the given iterable(an array, a set, etc.) into the graph.\n * @group EdgeMethods\n */\n addEdges(edges) {\n this.batch(() => {\n for (const edge of edges) {\n this.doAddEdge(edge);\n }\n });\n }\n /**\n * Add a single edge pointing from `source` to `target` into the graph.\n *\n * ```ts\n * graph.addNode({ id: 'NodeA' });\n * graph.addNode({ id: 'NodeB' });\n * graph.addEdge({ id: 'EdgeA', source: 'NodeA', target: 'NodeB' });\n * ```\n *\n * If `source` or `target` were not found in the current graph, it throws an Error.\n * @group EdgeMethods\n */\n addEdge(edge) {\n this.addEdges([edge]);\n }\n doRemoveEdge(id) {\n const edge = this.getEdge(id);\n const outEdges = this.outEdgesMap.get(edge.source);\n const inEdges = this.inEdgesMap.get(edge.target);\n const bothEdgesOfSource = this.bothEdgesMap.get(edge.source);\n const bothEdgesOfTarget = this.bothEdgesMap.get(edge.target);\n outEdges.delete(edge);\n inEdges.delete(edge);\n bothEdgesOfSource.delete(edge);\n bothEdgesOfTarget.delete(edge);\n this.edgeMap.delete(id);\n this.changes.push({ type: 'EdgeRemoved', value: edge });\n }\n /**\n * Remove edges whose id was included in the given id list.\n * @group EdgeMethods\n */\n removeEdges(idList) {\n this.batch(() => {\n idList.forEach((id) => this.doRemoveEdge(id));\n });\n }\n /**\n * Remove a single edge of the given id.\n * @group EdgeMethods\n */\n removeEdge(id) {\n this.removeEdges([id]);\n }\n /**\n * Change the source of an edge. The source must be found in current graph.\n * @group EdgeMethods\n */\n updateEdgeSource(id, source) {\n const edge = this.getEdge(id);\n this.checkNodeExistence(source);\n const oldSource = edge.source;\n const newSource = source;\n this.outEdgesMap.get(oldSource).delete(edge);\n this.bothEdgesMap.get(oldSource).delete(edge);\n this.outEdgesMap.get(newSource).add(edge);\n this.bothEdgesMap.get(newSource).add(edge);\n edge.source = source;\n this.batch(() => {\n this.changes.push({\n type: 'EdgeUpdated',\n id,\n propertyName: 'source',\n oldValue: oldSource,\n newValue: newSource,\n });\n });\n }\n /**\n * Change the target of an edge. The target must be found in current graph.\n * @group EdgeMethods\n */\n updateEdgeTarget(id, target) {\n const edge = this.getEdge(id);\n this.checkNodeExistence(target);\n const oldTarget = edge.target;\n const newTarget = target;\n this.inEdgesMap.get(oldTarget).delete(edge);\n this.bothEdgesMap.get(oldTarget).delete(edge);\n this.inEdgesMap.get(newTarget).add(edge);\n this.bothEdgesMap.get(newTarget).add(edge);\n edge.target = target;\n this.batch(() => {\n this.changes.push({\n type: 'EdgeUpdated',\n id,\n propertyName: 'target',\n oldValue: oldTarget,\n newValue: newTarget,\n });\n });\n }\n updateEdgeDataProperty(id, propertyName, value) {\n const edge = this.getEdge(id);\n this.batch(() => {\n const oldValue = edge.data[propertyName];\n const newValue = value;\n edge.data[propertyName] = newValue;\n this.changes.push({\n type: 'EdgeDataUpdated',\n id,\n propertyName,\n oldValue,\n newValue,\n });\n });\n }\n updateEdgeData(...args) {\n const id = args[0];\n const edge = this.getEdge(id);\n if (typeof args[1] === 'string') {\n // id, propertyName, value\n this.updateEdgeDataProperty(id, args[1], args[2]);\n return;\n }\n let data;\n if (typeof args[1] === 'function') {\n // id, update\n const update = args[1];\n data = update(edge.data);\n }\n else if (typeof args[1] === 'object') {\n // id, data\n data = args[1];\n }\n this.batch(() => {\n const oldValue = edge.data;\n const newValue = data;\n edge.data = data;\n this.changes.push({\n type: 'EdgeDataUpdated',\n id,\n oldValue,\n newValue,\n });\n });\n }\n /**\n * @group EdgeMethods\n */\n mergeEdgeData(id, patch) {\n this.batch(() => {\n Object.entries(patch).forEach(([propertyName, value]) => {\n this.updateEdgeDataProperty(id, propertyName, value);\n });\n });\n }\n // ================= Tree =================\n checkTreeExistence(treeKey) {\n if (!this.hasTreeStructure(treeKey)) {\n throw new Error('Tree structure not found for treeKey: ' + treeKey);\n }\n }\n hasTreeStructure(treeKey) {\n return this.treeIndices.has(treeKey);\n }\n /**\n * Attach a new tree structure representing the hierarchy of all nodes in the graph.\n * @param treeKey A unique key of the tree structure. You can attach multiple tree structures with different keys.\n *\n * ```ts\n * const graph = new Graph({\n * nodes: [{ id: 1 }, { id: 2 }, { id: 3 }],\n * });\n * graph.attachTreeStructure('Inheritance');\n * graph.setParent(2, 1, 'Inheritance');\n * graph.setParent(3, 1, 'Inheritance');\n * graph.getRoots('Inheritance'); // [1]\n * graph.getChildren(1, 'Inheritance'); // [2,3]\n * ```\n * @group TreeMethods\n */\n attachTreeStructure(treeKey) {\n if (this.treeIndices.has(treeKey)) {\n // Already attached.\n return;\n }\n this.treeIndices.set(treeKey, {\n parentMap: new Map(),\n childrenMap: new Map(),\n });\n this.batch(() => {\n this.changes.push({\n type: 'TreeStructureAttached',\n treeKey,\n });\n });\n }\n /**\n * Detach the tree structure of the given tree key from the graph.\n *\n * ```ts\n * graph.detachTreeStructure('Inheritance');\n * graph.getRoots('Inheritance'); // Error!\n * ```\n * @group TreeMethods\n */\n detachTreeStructure(treeKey) {\n this.checkTreeExistence(treeKey);\n this.treeIndices.delete(treeKey);\n this.batch(() => {\n this.changes.push({\n type: 'TreeStructureDetached',\n treeKey,\n });\n });\n }\n /**\n * Traverse the given tree data, add each node into the graph, then attach the tree structure.\n *\n * ```ts\n * graph.addTree({\n * id: 1,\n * children: [\n * { id: 2 },\n * { id: 3 },\n * ],\n * }, 'Inheritance');\n * graph.getRoots('Inheritance'); // [1]\n * graph.getChildren(1, 'Inheritance'); // [2, 3]\n * graph.getAllNodes(); // [1, 2, 3]\n * graph.getAllEdges(); // []\n * ```\n * @group TreeMethods\n */\n addTree(tree, treeKey) {\n this.batch(() => {\n this.attachTreeStructure(treeKey);\n // Add Nodes\n const nodes = [];\n const stack = Array.isArray(tree) ? tree : [tree];\n while (stack.length) {\n const node = stack.shift();\n nodes.push(node);\n if (node.children) {\n stack.push(...node.children);\n }\n }\n this.addNodes(nodes);\n // Set parent for each child node.\n nodes.forEach((parent) => {\n parent.children?.forEach((child) => {\n this.setParent(child.id, parent.id, treeKey);\n });\n });\n });\n }\n /**\n * Get the root nodes of an attached tree structure.\n *\n * Consider a graph with the following tree structure attached:\n * ```\n * Tree structure:\n * O 3\n * / \\ |\n * 1 2 4\n * ```\n * `graph.getRoots()` takes all nodes without a parent, therefore [0, 3] was returned.\n *\n * Newly added nodes are also unparented. So they are counted as roots.\n * ```ts\n * graph.addNode({ id: 5 });\n * graph.getRoots(); // [0, 3, 5]\n * ```\n *\n * Here is how the tree structure looks like:\n * ```\n * Tree structure:\n * O 3 5\n * / \\ |\n * 1 2 4\n * ```\n *\n * By setting a parent, a root node no more be a root.\n * ```ts\n * graph.setParent(5, 2);\n * graph.getRoots(); // [0, 3]\n * ```\n *\n * The tree structure now becomes:\n * ```\n * Tree structure:\n * O 3\n * / \\ |\n * 1 2 4\n * |\n * 5\n * ```\n *\n * Removing a node forces its children to be unparented, or roots.\n * ```ts\n * graph.removeNode(0);\n * graph.getRoots(); // [1, 2, 3]\n * ```\n *\n * You might draw the the structure as follow:\n * ```\n * Tree structure:\n * 1 2 3\n * | |\n * 5 4\n * ```\n * @group TreeMethods\n */\n getRoots(treeKey) {\n this.checkTreeExistence(treeKey);\n return this.getAllNodes().filter((node) => !this.getParent(node.id, treeKey));\n }\n /**\n * Given a node ID and an optional tree key, get the children of the node in the specified tree structure.\n * @group TreeMethods\n */\n getChildren(id, treeKey) {\n this.checkNodeExistence(id);\n this.checkTreeExistence(treeKey);\n const tree = this.treeIndices.get(treeKey);\n const children = tree.childrenMap.get(id);\n return Array.from(children || []);\n }\n /**\n * Given a node ID and an optional tree key, get the parent of the node in the specified tree structure.\n * If the given node is one of the tree roots, this returns null.\n * @group TreeMethods\n */\n getParent(id, treeKey) {\n this.checkNodeExistence(id);\n this.checkTreeExistence(treeKey);\n const tree = this.treeIndices.get(treeKey);\n return tree.parentMap.get(id) || null;\n }\n /**\n * Returns an array of all the ancestor nodes, staring from the parent to the root.\n */\n getAncestors(id, treeKey) {\n const ancestors = [];\n let current = this.getNode(id);\n let parent;\n while (parent = this.getParent(current.id, treeKey)) {\n ancestors.push(parent);\n current = parent;\n }\n return ancestors;\n }\n /**\n * Set node parent. If this operation causes a circle, it fails with an error.\n * @param id - ID of the child node.\n * @param parent - ID of the parent node.\n * @param treeKey - Which tree structure the relation is applied to.\n * @group TreeMethods\n */\n setParent(id, parent, treeKey) {\n this.checkTreeExistence(treeKey);\n const tree = this.treeIndices.get(treeKey);\n const node = this.getNode(id);\n const oldParent = tree.parentMap.get(id);\n const newParent = this.getNode(parent);\n // Set parent\n tree.parentMap.set(id, newParent);\n // Set children\n if (oldParent) {\n tree.childrenMap.get(oldParent.id)?.delete(node);\n }\n let children = tree.childrenMap.get(newParent.id);\n if (!children) {\n children = new Set();\n tree.childrenMap.set(newParent.id, children);\n }\n children.add(node);\n this.batch(() => {\n this.changes.push({\n type: 'TreeStructureChanged',\n treeKey,\n nodeId: id,\n oldParentId: oldParent?.id,\n newParentId: newParent.id,\n });\n });\n }\n dfsTree(id, fn, treeKey) {\n const navigator = (nodeId) => this.getChildren(nodeId, treeKey);\n return doDFS(this.getNode(id), new Set(), fn, navigator);\n }\n bfsTree(id, fn, treeKey) {\n const navigator = (nodeId) => this.getChildren(nodeId, treeKey);\n return doBFS([this.getNode(id)], new Set(), fn, navigator);\n }\n // ================= Graph =================\n /**\n * Get all nodes in the graph as an array.\n */\n getAllNodes() {\n return Array.from(this.nodeMap.values());\n }\n /**\n * Get all edges in the graph as an array.\n */\n getAllEdges() {\n return Array.from(this.edgeMap.values());\n }\n bfs(id, fn, direction = 'out') {\n const navigator = {\n in: this.getPredecessors.bind(this),\n out: this.getSuccessors.bind(this),\n both: this.getNeighbors.bind(this),\n }[direction];\n return doBFS([this.getNode(id)], new Set(), fn, navigator);\n }\n dfs(id, fn, direction = 'out') {\n const navigator = {\n in: this.getPredecessors.bind(this),\n out: this.getSuccessors.bind(this),\n both: this.getNeighbors.bind(this),\n }[direction];\n return doDFS(this.getNode(id), new Set(), fn, navigator);\n }\n clone() {\n // Make a shallow copy of nodes and edges.\n const newNodes = this.getAllNodes().map((oldNode) => {\n return { ...oldNode, data: { ...oldNode.data } };\n });\n const newEdges = this.getAllEdges().map((oldEdge) => {\n return { ...oldEdge, data: { ...oldEdge.data } };\n });\n // Create a new graph with shallow copied nodes and edges.\n const newGraph = new Graph({\n nodes: newNodes,\n edges: newEdges,\n });\n // Add tree indices.\n this.treeIndices.forEach(({ parentMap: oldParentMap, childrenMap: oldChildrenMap }, treeKey) => {\n const parentMap = new Map();\n oldParentMap.forEach((parent, key) => {\n parentMap.set(key, newGraph.getNode(parent.id));\n });\n const childrenMap = new Map();\n oldChildrenMap.forEach((children, key) => {\n childrenMap.set(key, new Set(Array.from(children).map((n) => newGraph.getNode(n.id))));\n });\n newGraph.treeIndices.set(treeKey, {\n parentMap: parentMap,\n childrenMap: childrenMap,\n });\n });\n return newGraph;\n }\n toJSON() {\n return JSON.stringify({\n nodes: this.getAllNodes(),\n edges: this.getAllEdges(),\n // FIXME: And tree structures?\n });\n }\n}\n//# sourceMappingURL=graph.js.map","const filterOutLinks = (k: string, v: string) => {\n if (k !== \"next\" && k !== \"prev\") {\n return v;\n }\n};\n\ntype LinkedNode<T> = {\n prev?: LinkedNode<T>;\n next?: LinkedNode<T>;\n} & T;\n\nconst unlink = <T>(entry: LinkedNode<T>) => {\n entry.prev!.next = entry.next;\n entry.next!.prev = entry.prev;\n delete entry.next;\n delete entry.prev;\n};\n\nexport default class List<T> {\n // a shortcut that next is head and prev is tail\n public shortcut: LinkedNode<T>;\n\n constructor() {\n const shortcut: LinkedNode<any> = {};\n shortcut.prev = shortcut;\n shortcut.next = shortcut.prev;\n this.shortcut = shortcut;\n }\n\n public dequeue() {\n const shortcut = this.shortcut;\n const entry = shortcut.prev;\n if (entry && entry !== shortcut) {\n unlink(entry);\n return entry;\n }\n }\n\n public enqueue(entry: LinkedNode<T>) {\n const shortcut = this.shortcut;\n if (entry.prev && entry.next) {\n unlink(entry);\n }\n entry.next = shortcut.next;\n shortcut.next!.prev = entry;\n shortcut.next = entry;\n entry.prev = shortcut;\n }\n\n public toString() {\n const strs = [];\n const sentinel = this.shortcut;\n let curr = sentinel.prev;\n while (curr !== sentinel) {\n strs.push(JSON.stringify(curr, filterOutLinks));\n curr = curr?.prev;\n }\n return `[${strs.join(\", \")}]`;\n }\n}\n","/*\n * A greedy heuristic for finding a feedback arc set for a graph. A feedback\n * arc set is a set of edges that can be removed to make a graph acyclic.\n * The algorithm comes from: P. Eades, X. Lin, and W. F. Smyth, \"A fast and\n * effective heuristic for the feedback arc set problem.\" This implementation\n * adjusts that from the paper to allow for weighted edges.\n *\n * @see https://github.com/dagrejs/dagre/blob/master/lib/greedy-fas.js\n */\n\nimport { Edge, Graph, ID } from \"@antv/graphlib\";\nimport { EdgeData, Graph as IGraph, NodeData } from \"../types\";\nimport RawList from \"./data/list\";\n\ntype StateNode = {\n v: ID;\n w?: ID;\n in: number;\n out: number;\n prev?: StateNode;\n next?: StateNode;\n};\nclass List extends RawList<StateNode> {}\n\nconst DEFAULT_WEIGHT_FN = () => 1;\n\nexport const greedyFAS = (\n g: IGraph,\n weightFn?: (e: Edge<EdgeData>) => number\n) => {\n if (g.getAllNodes().length <= 1) return [];\n const state = buildState(g, weightFn || DEFAULT_WEIGHT_FN);\n const results = doGreedyFAS(state.graph, state.buckets, state.zeroIdx);\n\n return results\n .map((e) =>\n g.getRelatedEdges(e.v, \"out\").filter(({ target }) => target === e.w)\n )\n ?.flat();\n};\n\nconst doGreedyFAS = (g: IGraph, buckets: List[], zeroIdx: number) => {\n let results: StateNode[] = [];\n const sources = buckets[buckets.length - 1];\n const sinks = buckets[0];\n\n let entry;\n while (g.getAllNodes().length) {\n while ((entry = sinks.dequeue())) {\n removeNode(g, buckets, zeroIdx, entry);\n }\n while ((entry = sources.dequeue())) {\n removeNode(g, buckets, zeroIdx, entry);\n }\n if (g.getAllNodes().length) {\n for (let i = buckets.length - 2; i > 0; --i) {\n entry = buckets[i].dequeue();\n if (entry) {\n results = results.concat(\n removeNode(g, buckets, zeroIdx, entry, true)!\n );\n break;\n }\n }\n }\n }\n\n return results;\n};\n\nconst removeNode = (\n g: IGraph,\n buckets: List[],\n zeroIdx: number,\n entry: StateNode,\n collectPredecessors?: boolean\n) => {\n const results: StateNode[] = [];\n\n if (g.hasNode(entry.v)) {\n g.getRelatedEdges(entry.v, \"in\")?.forEach((edge) => {\n const weight = edge.data.weight!;\n const uEntry = g.getNode(edge.source)!;\n\n if (collectPredecessors) {\n // this result not really care about in or out\n results.push({ v: edge.source, w: edge.target, in: 0, out: 0 });\n }\n if (uEntry.data.out === undefined) uEntry.data.out = 0;\n // @ts-ignore\n uEntry.data.out -= weight;\n assignBucket(buckets, zeroIdx, {\n v: uEntry.id,\n ...uEntry.data,\n } as StateNode);\n });\n\n g.getRelatedEdges(entry.v, \"out\")?.forEach((edge) => {\n const weight = edge.data.weight!;\n const w = edge.target;\n const wEntry = g.getNode(w)!;\n if (wEntry.data.in === undefined) wEntry.data.in = 0;\n // @ts-ignore\n wEntry.data.in -= weight;\n assignBucket(buckets, zeroIdx, {\n v: wEntry.id,\n ...wEntry.data,\n } as StateNode);\n });\n\n g.removeNode(entry.v);\n }\n\n return collectPredecessors ? results : undefined;\n};\n\nconst buildState = (g: IGraph, weightFn?: (e: Edge<EdgeData>) => number) => {\n const fasGraph = new Graph<NodeData, EdgeData>();\n let maxIn = 0;\n let maxOut = 0;\n\n g.getAllNodes().forEach((v) => {\n fasGraph.addNode({\n id: v.id,\n data: { v: v.id, in: 0, out: 0 },\n });\n });\n\n // Aggregate weights on nodes, but also sum the weights across multi-edges\n // into a single edge for the fasGraph.\n g.getAllEdges().forEach((e) => {\n const edge = fasGraph\n .getRelatedEdges(e.source, \"out\")\n .find((edge) => edge.target === e.target);\n const weight = weightFn?.(e) || 1;\n if (!edge) {\n fasGraph.addEdge({\n id: e.id,\n source: e.source,\n target: e.target,\n data: {\n weight,\n },\n });\n } else {\n fasGraph.updateEdgeData(edge?.id!, {\n ...edge.data,\n weight: edge.data.weight! + weight,\n });\n }\n // @ts-ignore\n maxOut = Math.max(maxOut, (fasGraph.getNode(e.source)!.data.out += weight));\n // @ts-ignore\n maxIn = Math.max(maxIn, (fasGraph.getNode(e.target)!.data.in += weight));\n });\n\n const buckets: List[] = [];\n const rangeMax = maxOut + maxIn + 3;\n for (let i = 0; i < rangeMax; i++) {\n buckets.push(new List());\n }\n const zeroIdx = maxIn + 1;\n\n fasGraph.getAllNodes().forEach((v) => {\n assignBucket(buckets, zeroIdx, {\n v: v.id,\n ...fasGraph.getNode(v.id).data,\n } as StateNode);\n });\n\n return { buckets, zeroIdx, graph: fasGraph };\n};\n\nconst assignBucket = (buckets: List[], zeroIdx: number, entry: StateNode) => {\n if (!entry.out) {\n buckets[0].enqueue(entry);\n } else if (!entry[\"in\"]) {\n buckets[buckets.length - 1].enqueue(entry);\n } else {\n buckets[entry.out - entry[\"in\"] + zeroIdx].enqueue(entry);\n }\n};\n","import { ID, Edge } from \"@antv/graphlib\";\nimport { Graph, EdgeData } from \"../types\";\nimport { greedyFAS } from \"./greedy-fas\";\n\nconst run = (g: Graph, acyclicer: string) => {\n const weightFn = (g: Graph) => {\n return (e: Edge<EdgeData>) => e.data.weight || 1;\n };\n const fas = acyclicer === \"greedy\" ? greedyFAS(g, weightFn(g)) : dfsFAS(g);\n fas?.forEach((e: Edge<EdgeData>) => {\n const label = e.data;\n g.removeEdge(e.id);\n label.forwardName = e.data.name;\n label.reversed = true;\n g.addEdge({\n id: e.id,\n source: e.target,\n target: e.source,\n data: {\n ...label,\n },\n });\n });\n};\n\nconst dfsFAS = (g: Graph) => {\n const fas: Edge<EdgeData>[] = [];\n const stack: Record<ID, boolean> = {};\n const visited: Record<ID, boolean> = {};\n\n const dfs = (v: ID) => {\n if (visited[v]) {\n return;\n }\n visited[v] = true;\n stack[v] = true;\n g.getRelatedEdges(v, \"out\").forEach((e) => {\n if (stack[e.target]) {\n fas.push(e);\n } else {\n dfs(e.target);\n }\n });\n delete stack[v];\n };\n\n g.getAllNodes().forEach((n) => dfs(n.id));\n return fas;\n};\n\nconst undo = (g: Graph) => {\n g.getAllEdges().forEach((e) => {\n const label = e.data;\n if (label.reversed) {\n g.removeEdge(e.id);\n\n const forwardName = label.forwardName;\n delete label.reversed;\n delete label.forwardName;\n g.addEdge({\n id: e.id,\n source: e.target,\n target: e.source,\n data: { ...label, forwardName },\n });\n }\n });\n};\n\nexport { run, undo };\n","import { ID, Graph, Node } from \"@antv/graphlib\";\nimport { isNumber } from \"@antv/util\";\nimport { EdgeData, Graph as IGraph, NodeData } from \"../types\";\n\nconst safeSort = (valueA?: number, valueB?: number) => {\n return Number(valueA) - Number(valueB);\n};\n\n/*\n * Adds a dummy node to the graph and return v.\n */\nexport const addDummyNode = (\n g: IGraph,\n type: string,\n data: NodeData,\n name: string\n): ID => {\n let v: ID;\n do {\n v = `${name}${Math.random()}`;\n } while (g.hasNode(v));\n\n data.dummy = type;\n g.addNode({\n id: v,\n data,\n });\n\n return v;\n};\n\n/*\n * Returns a new graph with only simple edges. Handles aggregation of data\n * associated with multi-edges.\n */\nexport const simplify = (g: IGraph) => {\n const simplified = new Graph<NodeData, EdgeData>();\n g.getAllNodes().forEach((v) => {\n simplified.addNode({ ...v });\n });\n g.getAllEdges().forEach((e) => {\n const edge = simplified\n .getRelatedEdges(e.source, \"out\")\n .find((edge) => edge.target === e.target);\n if (!edge) {\n simplified.addEdge({\n id: e.id,\n source: e.source,\n target: e.target,\n data: {\n weight: e.data.weight! || 0,\n minlen: e.data.minlen! || 1,\n },\n });\n } else {\n simplified.updateEdgeData(edge?.id!, {\n ...edge.data,\n weight: edge.data.weight! + e.data.weight! || 0,\n minlen: Math.max(edge.data.minlen!, e.data.minlen! || 1),\n });\n }\n });\n return simplified;\n};\n\nexport const asNonCompoundGraph = (g: IGraph): IGraph => {\n const simplified = new Graph();\n\n g.getAllNodes().forEach((node) => {\n if (!g.getChildren(node.id).length) {\n simplified.addNode({ ...node });\n }\n });\n\n g.getAllEdges().forEach((edge) => {\n simplified.addEdge(edge);\n });\n\n return simplified;\n};\n\nexport const zipObject = <T = any>(keys: ID[], values: T[]) => {\n return keys?.reduce((obj, key, i) => {\n obj[key] = values[i];\n return obj;\n }, {} as Record<ID, T>);\n};\n\nexport const successorWeights = (g: IGraph) => {\n const weightsMap: Record<ID, Record<string, number>> = {};\n\n g.getAllNodes().forEach((node) => {\n const sucs: Record<ID, number> = {};\n g.getRelatedEdges(node.id, \"out\").forEach((e) => {\n sucs[e.target] = (sucs[e.target] || 0) + (e.data.weight || 0);\n });\n weightsMap[node.id] = sucs;\n });\n\n return weightsMap;\n};\n\nexport const predecessorWeights = (g: IGraph) => {\n const nodes = g.getAllNodes();\n\n const weightMap = nodes.map((v) => {\n const preds: Record<ID, number> = {};\n g.getRelatedEdges(v.id, \"in\").forEach((e) => {\n preds[e.source] = (preds[e.source] || 0) + e.data.weight!;\n });\n return preds;\n });\n return zipObject(\n nodes.map((n) => n.id),\n weightMap\n );\n};\n\n/*\n * Finds where a line starting at point ({x, y}) would intersect a rectangle\n * ({x, y, width, height}) if it were pointing at the rectangle's center.\n */\nexport const intersectRect = (\n rect: { x?: number; y?: number; width?: number; height?: number },\n point: { x?: number; y?: number }\n) => {\n const x = Number(rect.x);\n const y = Number(rect.y);\n\n // Rectangle intersection algorithm from:\n // http://math.stackexchange.com/questions/108113/find-edge-between-two-boxes\n const dx = Number(point.x) - x;\n const dy = Number(point.y) - y;\n let w = Number(rect.width) / 2;\n let h = Number(rect.height) / 2;\n\n if (!dx && !dy) {\n // completely overlapped directly, then return points its self\n return { x: 0, y: 0 };\n }\n\n let sx;\n let sy;\n\n if (Math.abs(dy) * w > Math.abs(dx) * h) {\n // Intersection is top or bottom of rect.\n if (dy < 0) {\n h = -h;\n }\n sx = (h * dx) / dy;\n sy = h;\n } else {\n // Intersection is left or right of rect.\n if (dx < 0) {\n w = -w;\n }\n sx = w;\n sy = (w * dy) / dx;\n }\n\n return { x: x + sx, y: y + sy };\n};\n\n/*\n * Given a DAG with each node assigned \"rank\" and \"order\" properties, this\n * const will produce a matrix with the ids of each node.\n */\nexport const buildLayerMatrix = (g: IGraph) => {\n const layeringNodes: ID[][] = [];\n const rankMax = maxRank(g) + 1;\n for (let i = 0; i < rankMax; i++) {\n layeringNodes.push([]);\n }\n\n // const layering = _.map(_.range(maxRank(g) + 1), function() { return []; });\n g.getAllNodes().forEach((node) => {\n const rank = node.data.rank!;\n if (rank !== undefined && layeringNodes[rank]) {\n layeringNodes[rank].push(node.id);\n }\n });\n\n for (let i = 0; i < rankMax; i++) {\n layeringNodes[i] = layeringNodes[i].sort((va: ID, vb: ID) =>\n safeSort(g.getNode(va).data.order!, g.getNode(vb).data.order!)\n );\n }\n\n return layeringNodes;\n};\n\n/*\n * Adjusts the ranks for all nodes in the graph such that all nodes v have\n * rank(v) >= 0 and at least one node w has rank(w) = 0.\n */\nexport const normalizeRanks = (g: IGraph) => {\n const nodeRanks = g\n .getAllNodes()\n .filter((v) => v.data.rank !== undefined)\n .map((v) => v.data.rank!);\n const min = Math.min(...nodeRanks);\n g.getAllNodes().forEach((v) => {\n if (v.data.hasOwnProperty(\"rank\") && min !== Infinity) {\n v.data.rank! -= min;\n }\n });\n};\n\nexport const removeEmptyRanks = (g: IGraph, nodeRankFactor: number = 0) => {\n // Ranks may not start at 0, so we need to offset them\n const nodes = g.getAllNodes();\n const nodeRanks = nodes\n .filter((v) => v.data.rank !== undefined)\n .map((v) => v.data.rank!);\n\n const offset = Math.min(...nodeRanks);\n const layers: ID[][] = [];\n\n nodes.forEach((v) => {\n const rank = (v.data.rank! || 0) - offset;\n\n if (!layers[rank]) {\n layers[rank] = [];\n }\n layers[rank].push(v.id);\n });\n\n let delta = 0;\n for (let i = 0; i < layers.length; i++) {\n const vs = layers[i];\n if (vs === undefined) {\n if (i % nodeRankFactor !== 0) {\n delta -= 1;\n }\n } else if (delta) {\n vs?.forEach((v: ID) => {\n const node = g.getNode(v);\n if (node) {\n node.data.rank = node.data.rank || 0;\n node.data.rank! += delta;\n }\n });\n }\n }\n};\n\nexport const addBorderNode = (\n g: IGraph,\n prefix: string,\n rank?: number,\n order?: number\n) => {\n const node: NodeData = {\n width: 0,\n height: 0,\n };\n if (isNumber(rank) && isNumber(order)) {\n node.rank = rank;\n node.order = order;\n }\n return addDummyNode(g, \"border\", node, prefix);\n};\n\nexport const maxRank = (g: IGraph) => {\n let maxRank: number;\n g.getAllNodes().forEach((v) => {\n const rank = v.data.rank!;\n if (rank !== undefined) {\n if (maxRank === undefined || rank > maxRank) {\n maxRank = rank;\n }\n }\n });\n\n if (!maxRank!) {\n maxRank = 0;\n }\n return maxRank;\n};\n\n/*\n * Partition a collection into two groups: `lhs` and `rhs`. If the supplied\n * const returns true for an entry it goes into `lhs`. Otherwise it goes\n * into `rhs.\n */\nexport const partition = <T = any>(\n collection: T[],\n fn: (val: T) => boolean\n) => {\n const result = { lhs: [] as T[], rhs: [] as T[] };\n collection?.forEach((value) => {\n if (fn(value)) {\n result.lhs.push(value);\n } else {\n result.rhs.push(value);\n }\n });\n return result;\n};\n\nexport const minBy = <T = any>(array: T[], func: (param: T) => number) => {\n return array.reduce((a, b) => {\n const valA = func(a);\n const valB = func(b);\n return valA > valB ? b : a;\n });\n};\n\nconst doDFS = (\n graph: IGraph,\n node: Node<NodeData>,\n postorder: boolean,\n visited: ID[],\n navigator: (n: ID) => Node<NodeData>[],\n result: ID[]\n) => {\n if (!visited.includes(node.id)) {\n visited.push(node.id);\n if (!postorder) {\n result.push(node.id);\n }\n navigator(node.id).forEach((n) =>\n doDFS(graph, n, postorder, visited, navigator, result)\n );\n if (postorder) {\n result.push(node.id);\n }\n }\n};\n\n/**\n * @description DFS traversal.\n * @description.zh-CN DFS 遍历。\n */\nexport const dfs = (\n graph: IGraph,\n node: Node<NodeData> | Node<NodeData>[],\n order: \"pre\" | \"post\",\n isDirected: boolean\n) => {\n const nodes = Array.isArray(node) ? node : [node];\n const navigator = (n: ID) =>\n (isDirected ? graph.getSuccessors(n) : graph.getNeighbors(n))!;\n const results: ID[] = [];\n const visited: ID[] = [];\n nodes.forEach((node) => {\n if (!graph.hasNode(node.id)) {\n throw new Error(`Graph does not have node: ${node}`);\n } else {\n doDFS(graph, node, order === \"post\", visited, navigator, results);\n }\n });\n\n return results;\n};\n","import { Edge, ID } from \"@antv/graphlib\";\nimport { EdgeData, Graph as IGraph } from \"../types\";\nimport { addDummyNode } from \"./util\";\n\n/*\n * Breaks any long edges in the graph into short segments that span 1 layer\n * each. This operation is undoable with the denormalize function.\n *\n * Pre-conditions:\n *\n * 1. The input graph is a DAG.\n * 2. Each node in the graph has a \"rank\" property.\n *\n * Post-condition:\n *\n * 1. All edges in the graph have a length of 1.\n * 2. Dummy nodes are added where edges have been split into segments.\n * 3. The graph is augmented with a \"dummyChains\" attribute which contains\n * the first dummy in each chain of dummy nodes produced.\n */\n\nconst DUMMY_NODE_EDGE = \"edge\";\nconst DUMMY_NODE_EDGE_LABEL = \"edge-label\";\n\nconst run = (g: IGraph, dummyChains: ID[]) => {\n g.getAllEdges().forEach((edge) => normalizeEdge(g, edge, dummyChains));\n};\n\nconst normalizeEdge = (g: IGraph, e: Edge<EdgeData>, dummyChains: ID[]) => {\n let v = e.source;\n let vRank = g.getNode(v)!.data.rank!;\n const w = e.target;\n const wRank = g.getNode(w)!.data.rank!;\n const labelRank = e.data.labelRank;\n\n if (wRank === vRank + 1) return;\n\n g.removeEdge(e.id);\n\n let dummy: ID;\n let nodeData: {\n width: number;\n height: number;\n originalEdge: Edge<EdgeData>;\n rank: number;\n dummy?: string;\n labelpos?: string;\n };\n let i;\n for (i = 0, ++vRank; vRank < wRank; ++i, ++vRank) {\n e.data.points = [];\n nodeData = {\n originalEdge: e,\n width: 0,\n height: 0,\n rank: vRank,\n };\n\n dummy = addDummyNode(g, DUMMY_NODE_EDGE, nodeData, \"_d\");\n\n if (vRank === labelRank) {\n nodeData.width = e.data.width!;\n nodeData.height = e.data.height!;\n nodeData.dummy = DUMMY_NODE_EDGE_LABEL;\n nodeData.labelpos = e.data.labelpos as string;\n }\n\n g.addEdge({\n id: `e${Math.random()}`,\n source: v,\n target: dummy,\n data: { weight: e.data.weight },\n });\n if (i === 0) {\n dummyChains.push(dummy);\n }\n v = dummy;\n }\n\n g.addEdge({\n id: `e${Math.random()}`,\n source: v,\n target: w,\n data: { weight: e.data.weight },\n });\n};\n\nconst undo = (g: IGraph, dummyChains: ID[]) => {\n dummyChains.forEach((v) => {\n let node = g.getNode(v)!;\n const { data } = node;\n const originalEdge = data.originalEdge as Edge<EdgeData>;\n\n let w;\n // Restore original edge.\n if (originalEdge) {\n g.addEdge(originalEdge);\n }\n\n let currentV = v;\n while (node.data.dummy) {\n w = g.getSuccessors(currentV)![0];\n g.removeNode(currentV);\n originalEdge.data.points!.push({\n x: node.data.x!,\n y: node.data.y!,\n });\n if (node.data.dummy === DUMMY_NODE_EDGE_LABEL) {\n originalEdge.data.x = node.data.x;\n originalEdge.data.y = node.data.y;\n originalEdge.data.width = node.data.width;\n originalEdge.data.height = node.data.height;\n }\n currentV = w.id;\n node = g.getNode(currentV)!;\n }\n });\n};\n\nexport { run, undo };\n","import { Edge, ID } from \"@antv/graphlib\";\nimport { EdgeData, Graph } from \"../../types\";\n\n/*\n * Initializes ranks for the input graph using the longest path algorithm. This\n * algorithm scales well and is fast in practice, it yields rather poor\n * solutions. Nodes are pushed to the lowest layer possible, leaving the bottom\n * ranks wide and leaving edges longer than necessary. However, due to its\n * speed, this algorithm is good for getting an initial ranking that can be fed\n * into other algorithms.\n *\n * This algorithm does not normalize layers because it will be used by other\n * algorithms in most cases. If using this algorithm directly, be sure to\n * run normalize at the end.\n *\n * Pre-conditions:\n *\n * 1. Input graph is a DAG.\n * 2. Input graph node labels can be assigned properties.\n *\n * Post-conditions:\n *\n * 1. Each node will be assign an (unnormalized) \"rank\" property.\n */\nconst longestPath = (g: Graph) => {\n const visited: Record<ID, boolean> = {};\n\n const dfs = (v: ID) => {\n const label = g.getNode(v)!;\n if (!label) return 0;\n if (visited[v]) {\n return label.data.rank!;\n }\n visited[v] = true;\n\n let rank: number;\n\n g.getRelatedEdges(v, \"out\")?.forEach((e) => {\n const wRank = dfs(e.target);\n const minLen = e.data.minlen!;\n const r = wRank - minLen;\n if (r) {\n if (rank === undefined || r < rank) {\n rank = r;\n }\n }\n });\n\n if (!rank!) {\n rank = 0;\n }\n\n label.data.rank = rank;\n return rank;\n };\n\n g.getAllNodes()\n .filter((n) => g.getRelatedEdges(n.id, \"in\").length === 0)\n .forEach((source) => dfs(source.id));\n};\n\nconst longestPathWithLayer = (g: Graph) => {\n // 用longest path，找出最深的点\n const visited: Record<ID, boolean> = {};\n let minRank: number;\n\n const dfs = (v: ID) => {\n const label = g.getNode(v)!;\n if (!label) return 0;\n if (visited[v]) {\n return label.data.rank!;\n }\n visited[v] = true;\n\n let rank: number;\n\n g.getRelatedEdges(v, \"out\")?.forEach((e) => {\n const wRank = dfs(e.target);\n const minLen = e.data.minlen!;\n const r = wRank - minLen;\n if (r) {\n if (rank === undefined || r < rank) {\n rank = r;\n }\n }\n });\n\n if (!rank!) {\n rank = 0;\n }\n\n if (minRank === undefined || rank < minRank) {\n minRank = rank;\n }\n\n label.data.rank = rank;\n return rank;\n };\n\n g.getAllNodes()\n .filter((n) => g.getRelatedEdges(n.id, \"in\").length === 0)\n .forEach((source) => {\n if (source) dfs(source.id);\n });\n\n if (minRank! === undefined) {\n minRank = 0;\n }\n\n // minRank += 1; // NOTE: 最小的层级是dummy root，+1\n\n // forward一遍，赋值层级\n const forwardVisited: Record<string, boolean> = {};\n const dfsForward = (v: ID, nextRank: number) => {\n const label = g.getNode(v)!;\n\n const currRank = !isNaN(label.data.layer!) ? label.data.layer! : nextRank;\n\n // 没有指定，取最大值\n if (label.data.rank === undefined || label.data.rank! < currRank) {\n label.data.rank = currRank;\n }\n\n if (forwardVisited[v]) return;\n forwardVisited[v] = true;\n\n // DFS遍历子节点\n g.getRelatedEdges(v, \"out\")?.forEach((e) => {\n dfsForward(e.target, currRank + e.data.minlen!);\n });\n };\n\n // 指定层级的，更新下游\n g.getAllNodes().forEach((n) => {\n const label = n.data;\n if (!label) return;\n if (!isNaN(label.layer!)) {\n dfsForward(n.id, label.layer!); // 默认的dummy root所在层的rank是-1\n } else {\n label.rank! -= minRank;\n }\n });\n};\n\n/*\n * Returns the amount of slack for the given edge. The slack is defined as the\n * difference between the length of the edge and its minimum length.\n */\nconst slack = (g: Graph, e: Edge<EdgeData>) => {\n return (\n g.getNode(e.target).data.rank! -\n g.getNode(e.source).data.rank! -\n e.data.minlen!\n );\n};\n\nexport { longestPath, longestPathWithLayer, slack };\n","import { slack } from \"./util\";\nimport { minBy } from \"../util\";\nimport { Edge, Graph, ID } from \"@antv/graphlib\";\nimport { EdgeData, Graph as IGraph } from \"../../types\";\n\n/*\n * Constructs a spanning tree with tight edges and adjusted the input node's\n * ranks to achieve this. A tight edge is one that is has a length that matches\n * its \"minlen\" attribute.\n *\n * The basic structure for this function is derived from Gansner, et al., \"A\n * Technique for Drawing Directed Graphs.\"\n *\n * Pre-conditions:\n *\n * 1. Graph must be a DAG.\n * 2. Graph must be connected.\n * 3. Graph must have at least one node.\n * 5. Graph nodes must have been previously assigned a \"rank\" property that\n * respects the \"minlen\" property of incident edges.\n * 6. Graph edges must have a \"minlen\" property.\n *\n * Post-conditions:\n *\n * - Graph nodes will have their rank adjusted to ensure that all edges are\n * tight.\n *\n * Returns a tree (undirected graph) that is constructed using only \"tight\"\n * edges.\n */\nconst feasibleTree = (g: IGraph) => {\n const t = new Graph({\n tree: [],\n });\n\n // Choose arbitrary node from which to start our tree\n const start = g.getAllNodes()[0];\n const size = g.getAllNodes().length;\n t.addNode(start);\n\n let edge: Edge<EdgeData>;\n let delta: number;\n while (tightTree(t, g) < size) {\n edge = findMinSlackEdge(t, g);\n delta = t.hasNode(edge.source) ? slack(g, edge) : -slack(g, edge);\n shiftRanks(t, g, delta);\n }\n\n return t;\n};\n\n/*\n * Finds a maximal tree of tight edges and returns the number of nodes in the\n * tree.\n */\nconst tightTree = (t: IGraph, g: IGraph) => {\n const dfs = (v: ID) => {\n g.getRelatedEdges(v, \"both\").forEach((e) => {\n const edgeV = e.source;\n const w = v === edgeV ? e.target : edgeV;\n if (!t.hasNode(w) && !slack(g, e)) {\n t.addNode({\n id: w,\n data: {},\n });\n t.addEdge({\n id: e.id,\n source: v,\n target: w,\n data: {},\n });\n dfs(w);\n }\n });\n };\n\n t.getAllNodes().forEach((n) => dfs(n.id));\n return t.getAllNodes().length;\n};\n\n/*\n * Constructs a spanning tree with tight edges and adjusted the input node's\n * ranks to achieve this. A tight edge is one that is has a length that matches\n * its \"minlen\" attribute.\n *\n * The basic structure for this function is derived from Gansner, et al., \"A\n * Technique for Drawing Directed Graphs.\"\n *\n * Pre-conditions:\n *\n * 1. Graph must be a DAG.\n * 2. Graph must be connected.\n * 3. Graph must have at least one node.\n * 5. Graph nodes must have been previously assigned a \"rank\" property that\n * respects the \"minlen\" property of incident edges.\n * 6. Graph edges must have a \"minlen\" property.\n *\n * Post-conditions:\n *\n * - Graph nodes will have their rank adjusted to ensure that all edges are\n * tight.\n *\n * Returns a tree (undirected graph) that is constructed using only \"tight\"\n * edges.\n */\nconst feasibleTreeWithLayer = (g: IGraph) => {\n const t = new Graph({ tree: [] });\n\n // Choose arbitrary node from which to start our tree\n const start = g.getAllNodes()[0];\n const size = g.getAllNodes().length;\n t.addNode(start);\n\n let edge: Edge<EdgeData>;\n let delta: number;\n while (tightTreeWithLayer(t, g)! < size) {\n edge = findMinSlackEdge(t, g);\n delta = t.hasNode(edge.source) ? slack(g, edge) : -slack(g, edge);\n shiftRanks(t, g, delta);\n }\n\n return t;\n};\n\n/*\n * Finds a maximal tree of tight edges and returns the number of nodes in the\n * tree.\n */\nconst tightTreeWithLayer = (t: IGraph, g: IGraph) => {\n const dfs = (v: ID) => {\n g.getRelatedEdges(v, \"both\")?.forEach((e) => {\n const edgeV = e.source;\n const w = v === edgeV ? e.target : edgeV;\n // 对于指定layer的，直接加入tight-tree，不参与调整\n if (\n !t.hasNode(w) &&\n (g.getNode(w)!.data.layer !== undefined || !slack(g, e))\n ) {\n t.addNode({\n id: w,\n data: {},\n });\n t.addEdge({\n id: e.id,\n source: v,\n target: w,\n data: {},\n });\n dfs(w);\n }\n });\n };\n\n t.getAllNodes().forEach((n) => dfs(n.id));\n return t.getAllNodes().length;\n};\n\n/*\n * Finds the edge with the smallest slack that is incident on tree and returns\n * it.\n */\nconst findMinSlackEdge = (t: IGraph, g: IGraph) => {\n return minBy(g.getAllEdges(), (e) => {\n if (t.hasNode(e.source) !== t.hasNode(e.target)) {\n return slack(g, e);\n }\n return Infinity;\n });\n};\n\nconst shiftRanks = (t: IGraph, g: IGraph, delta: number) => {\n t.getAllNodes().forEach((tn) => {\n const v = g.getNode(tn.id);\n if (!v.data.rank) v.data.rank = 0;\n v.data.rank! += delta;\n });\n};\n\nexport { feasibleTree, feasibleTreeWithLayer };\n","import { Edge, ID, Node } from \"@antv/graphlib\";\nimport { EdgeData, Graph as IGraph, NodeData } from \"../../types\";\nimport { feasibleTree } from \"./feasible-tree\";\nimport { slack, longestPath as initRank } from \"./util\";\nimport { dfs, minBy, simplify } from \"../util\";\n\n/*\n * The network simplex algorithm assigns ranks to each node in the input graph\n * and iteratively improves the ranking to reduce the length of edges.\n *\n * Preconditions:\n *\n * 1. The input graph must be a DAG.\n * 2. All nodes in the graph must have an object value.\n * 3. All edges in the graph must have \"minlen\" and \"weight\" attributes.\n *\n * Postconditions:\n *\n * 1. All nodes in the graph will have an assigned \"rank\" attribute that has\n * been optimized by the network simplex algorithm. Ranks start at 0.\n *\n *\n * A rough sketch of the algorithm is as follows:\n *\n * 1. Assign initial ranks to each node. We use the longest path algorithm,\n * which assigns ranks to the lowest position possible. In general this\n * leads to very wide bottom ranks and unnecessarily long edges.\n * 2. Construct a feasible tight tree. A tight tree is one such that all\n * edges in the tree have no slack (difference between length of edge\n * and minlen for the edge). This by itself greatly improves the assigned\n * rankings by shorting edges.\n * 3. Iteratively find edges that have negative cut values. Generally a\n * negative cut value indicates that the edge could be removed and a new\n * tree edge could be added to produce a more compact graph.\n *\n * Much of the algorithms here are derived from Gansner, et al., \"A Technique\n * for Drawing Directed Graphs.\" The structure of the file roughly follows the\n * structure of the overall algorithm.\n */\nexport const networkSimplex = (og: IGraph) => {\n const g = simplify(og);\n initRank(g);\n const t = feasibleTree(g);\n initLowLimValues(t);\n initCutValues(t, g);\n\n let e: Edge<EdgeData> | undefined;\n let f: Edge<EdgeData>;\n while ((e = leaveEdge(t))) {\n f = enterEdge(t, g, e);\n exchangeEdges(t, g, e, f);\n }\n};\n\n/*\n * Initializes cut values for all edges in the tree.\n */\nexport const initCutValues = (t: IGraph, g: IGraph) => {\n let vs = dfs(t, t.getAllNodes(), \"post\", false);\n vs = vs.slice(0, vs?.length - 1);\n vs.forEach((v: ID) => {\n assignCutValue(t, g, v);\n });\n};\n\nconst assignCutValue = (t: IGraph, g: IGraph, child: ID) => {\n const childLab = t.getNode(child)!;\n const parent = childLab.data.parent! as ID;\n\n // FIXME: use undirected edge?\n const edge = t\n .getRelatedEdges(child, \"both\")\n .find((e) => e.target === parent || e.source === parent)!;\n edge.data.cutvalue = calcCutValue(t, g, child);\n};\n\n/*\n * Given the tight tree, its graph, and a child in the graph calculate and\n * return the cut value for the edge between the child and its parent.\n */\nexport const calcCutValue = (t: IGraph, g: IGraph, child: ID) => {\n const childLab = t.getNode(child)!;\n const parent = childLab.data.parent as ID;\n // True if the child is on the tail end of the edge in the directed graph\n let childIsTail = true;\n // The graph's view of the tree edge we're inspecting\n\n let graphEdge = g\n .getRelatedEdges(child, \"out\")\n .find((e) => e.target === parent)!;\n // The accumulated cut value for the edge between this node and its parent\n let cutValue = 0;\n\n if (!graphEdge) {\n childIsTail = false;\n graphEdge = g\n .getRelatedEdges(parent, \"out\")\n .find((e) => e.target === child)!;\n }\n\n cutValue = graphEdge.data.weight!;\n\n g.getRelatedEdges(child, \"both\").forEach((e) => {\n const isOutEdge = e.source === child;\n const other = isOutEdge ? e.target : e.source;\n\n if (other !== parent) {\n const pointsToHead = isOutEdge === childIsTail;\n const otherWeight = e.data.weight!;\n\n cutValue += pointsToHead ? otherWeight : -otherWeight;\n if (isTreeEdge(t, child, other)) {\n // FIXME: use undirected edge?\n const otherCutValue = t\n .getRelatedEdges(child, \"both\")\n .find((e) => e.source === other || e.target === other)!.data\n .cutvalue!;\n cutValue += pointsToHead ? -otherCutValue : otherCutValue;\n }\n }\n });\n\n return cutValue;\n};\n\nexport const initLowLimValues = (\n tree: IGraph,\n root: ID = tree.getAllNodes()[0].id\n) => {\n dfsAssignLowLim(tree, {}, 1, root);\n};\n\nconst dfsAssignLowLim = (\n tree: IGraph,\n visited: Record<ID, boolean>,\n nextLim: number,\n v: ID,\n parent?: ID\n) => {\n const low = nextLim;\n let useNextLim = nextLim;\n const label = tree.getNode(v)!;\n\n visited[v] = true;\n tree.getNeighbors(v)?.forEach((w) => {\n if (!visited[w.id]) {\n useNextLim = dfsAssignLowLim(tree, visited, useNextLim, w.id, v);\n }\n });\n\n label.data.low = low;\n label.data.lim = useNextLim++;\n if (parent) {\n label.data.parent = parent;\n } else {\n // TODO should be able to remove this when we incrementally update low lim\n delete label.data.parent;\n }\n\n return useNextLim;\n};\n\nexport const leaveEdge = (tree: IGraph) => {\n return tree.getAllEdges().find((e) => {\n return e.data.cutvalue! < 0;\n });\n};\n\nexport const enterEdge = (t: IGraph, g: IGraph, edge: Edge<EdgeData>) => {\n let v = edge.source;\n let w = edge.target;\n\n // For the rest of this function we assume that v is the tail and w is the\n // head, so if we don't have this edge in the graph we should flip it to\n // match the correct orientation.\n if (!g.getRelatedEdges(v, \"out\").find((e) => e.target === w)) {\n v = edge.target;\n w = edge.source;\n }\n\n const vLabel = t.getNode(v)!;\n const wLabel = t.getNode(w)!;\n let tailLabel = vLabel;\n let flip = false;\n\n // If the root is in the tail of the edge then we need to flip the logic that\n // checks for the head and tail nodes in the candidates function below.\n if (vLabel.data.lim! > wLabel.data.lim!) {\n tailLabel = wLabel;\n flip = true;\n }\n\n const candidates = g.getAllEdges().filter((edge) => {\n return (\n flip === isDescendant(t.getNode(edge.source), tailLabel) &&\n flip !== isDescendant(t.getNode(edge.target), tailLabel)\n );\n });\n\n return minBy(candidates, (edge) => {\n return slack(g, edge);\n });\n};\n\n/**\n *\n * @param t\n * @param g\n * @param e edge to remove\n * @param f edge to add\n */\nexport const exchangeEdges = (\n t: IGraph,\n g: IGraph,\n e: Edge<EdgeData>,\n f: Edge<EdgeData>\n) => {\n // FIXME: use undirected edge?\n const existed = t\n .getRelatedEdges(e.source, \"both\")\n .find((edge) => edge.source === e.target || edge.target === e.target);\n if (existed) {\n t.removeEdge(existed.id);\n }\n\n t.addEdge({\n id: `e${Math.random()}`,\n source: f.source,\n target: f.target,\n data: {},\n });\n\n initLowLimValues(t);\n initCutValues(t, g);\n updateRanks(t, g);\n};\n\nconst updateRanks = (t: IGraph, g: IGraph) => {\n const root = t.getAllNodes().find((v) => {\n return !v.data.parent;\n })!;\n\n let vs = dfs(t, root, \"pre\", false);\n vs = vs.slice(1);\n vs.forEach((v: ID) => {\n const parent = t.getNode(v).data.parent as ID;\n let edge = g.getRelatedEdges(v, \"out\").find((e) => e.target === parent);\n // let edge = g.edgeFromArgs(v, parent);\n let flipped = false;\n\n if (!edge && g.hasNode(parent)) {\n // edge = g.edgeFromArgs(parent, v)!;\n edge = g.getRelatedEdges(parent, \"out\").find((e) => e.target === v);\n flipped = true;\n }\n\n g.getNode(v).data.rank =\n ((g.hasNode(parent) && g.getNode(parent).data.rank!) || 0) +\n (flipped ? edge?.data.minlen! : -edge?.data.minlen!);\n });\n};\n\n/*\n * Returns true if the edge is in the tree.\n */\nconst isTreeEdge = (tree: IGraph, u: ID, v: ID) => {\n // FIXME: use undirected edge?\n return tree\n .getRelatedEdges(u, \"both\")\n .find((e) => e.source === v || e.target === v);\n};\n\n/*\n * Returns true if the specified node is descendant of the root node per the\n * assigned low and lim attributes in the tree.\n */\nconst isDescendant = (vLabel: Node<NodeData>, rootLabel: Node<NodeData>) => {\n return (\n rootLabel.data.low! <= vLabel.data.lim! &&\n vLabel.data.lim! <= rootLabel.data.lim!\n );\n};\n","import { Graph as IGraph } from \"../../types\";\nimport { longestPath, longestPathWithLayer } from \"./util\";\nimport { feasibleTreeWithLayer as feasibleTree } from \"./feasible-tree\";\nimport { networkSimplex } from \"./network-simplex\";\n\n/*\n * Assigns a rank to each node in the input graph that respects the \"minlen\"\n * constraint specified on edges between nodes.\n *\n * This basic structure is derived from Gansner, et al., \"A Technique for\n * Drawing Directed Graphs.\"\n *\n * Pre-conditions:\n *\n * 1. Graph must be a connected DAG\n * 2. Graph nodes must be objects\n * 3. Graph edges must have \"weight\" and \"minlen\" attributes\n *\n * Post-conditions:\n *\n * 1. Graph nodes will have a \"rank\" attribute based on the results of the\n * algorithm. Ranks can start at any index (including negative), we'll\n * fix them up later.\n */\nexport const rank = (\n g: IGraph,\n ranker: \"network-simplex\" | \"tight-tree\" | \"longest-path\"\n) => {\n switch (ranker) {\n case \"network-simplex\":\n networkSimplexRanker(g);\n break;\n case \"tight-tree\":\n tightTreeRanker(g);\n break;\n case \"longest-path\":\n longestPathRanker(g);\n break;\n // default: networkSimplexRanker(g);\n default:\n tightTreeRanker(g);\n }\n};\n\n// A fast and simple ranker, but results are far from optimal.\nconst longestPathRanker = longestPath;\n\nconst tightTreeRanker = (g: IGraph) => {\n longestPathWithLayer(g);\n feasibleTree(g);\n};\n\nconst networkSimplexRanker = (g: IGraph) => {\n networkSimplex(g);\n};\n","import { ID } from \"@antv/graphlib\";\nimport { Graph as IGraph } from \"../types\";\nimport { addBorderNode, addDummyNode } from \"./util\";\n\n/*\n * A nesting graph creates dummy nodes for the tops and bottoms of subgraphs,\n * adds appropriate edges to ensure that all cluster nodes are placed between\n * these boundries, and ensures that the graph is connected.\n *\n * In addition we ensure, through the use of the minlen property, that nodes\n * and subgraph border nodes to not end up on the same rank.\n *\n * Preconditions:\n *\n * 1. Input graph is a DAG\n * 2. Nodes in the input graph has a minlen attribute\n *\n * Postconditions:\n *\n * 1. Input graph is connected.\n * 2. Dummy nodes are added for the tops and bottoms of subgraphs.\n * 3. The minlen attribute for nodes is adjusted to ensure nodes do not\n * get placed on the same rank as subgraph border nodes.\n *\n * The nesting graph idea comes from Sander, \"Layout of Compound Directed\n * Graphs.\"\n */\nconst run = (g: IGraph) => {\n const root = addDummyNode(g, \"root\", {}, \"_root\");\n const depths = treeDepths(g);\n let maxDepth = Math.max(...Object.values(depths));\n\n if (Math.abs(maxDepth) === Infinity) {\n maxDepth = 1;\n }\n\n const height = maxDepth - 1; // Note: depths is an Object not an array\n const nodeSep = 2 * height + 1;\n\n // g.graph().nestingRoot = root;\n\n // Multiply minlen by nodeSep to align nodes on non-border ranks.\n g.getAllEdges().forEach((e) => {\n e.data.minlen! *= nodeSep;\n });\n\n // Calculate a weight that is sufficient to keep subgraphs vertically compact\n const weight = sumWeights(g) + 1;\n\n // Create border nodes and link them up\n // g.children()?.forEach((child) => {\n // dfs(g, root, nodeSep, weight, height, depths, child);\n // });\n g.getRoots().forEach((child) => {\n dfs(g, root, nodeSep, weight, height, depths, child.id);\n });\n\n // Save the multiplier for node layers for later removal of empty border\n // layers.\n // g.graph().nodeRankFactor = nodeSep;\n\n return {\n nestingRoot: root,\n nodeRankFactor: nodeSep,\n };\n};\n\nconst dfs = (\n g: IGraph,\n root: ID,\n nodeSep: number,\n weight: number,\n height: number,\n depths: Record<string, number>,\n v: ID\n) => {\n const children = g.getChildren(v);\n if (!children?.length) {\n if (v !== root) {\n // g.setEdge(root, v, { weight: 0, minlen: nodeSep });\n g.addEdge({\n id: `e${Math.random()}`,\n source: root,\n target: v,\n data: { weight: 0, minlen: nodeSep },\n });\n }\n return;\n }\n\n const top = addBorderNode(g, \"_bt\");\n const bottom = addBorderNode(g, \"_bb\");\n const label = g.getNode(v)!;\n\n g.setParent(top, v);\n label.data.borderTop = top;\n g.setParent(bottom, v);\n label.data.borderBottom = bottom;\n\n children?.forEach((childNode) => {\n dfs(g, root, nodeSep, weight, height, depths, childNode.id);\n\n const childTop = childNode.data.borderTop\n ? (childNode.data.borderTop as ID)\n : childNode.id;\n const childBottom = childNode.data.borderBottom\n ? (childNode.data.borderBottom as ID)\n : childNode.id;\n const thisWeight = childNode.data.borderTop ? weight : 2 * weight;\n const minlen = childTop !== childBottom ? 1 : height - depths[v] + 1;\n\n g.addEdge({\n id: `e${Math.random()}`,\n source: top,\n target: childTop,\n data: {\n minlen,\n weight: thisWeight,\n nestingEdge: true,\n },\n });\n\n g.addEdge({\n id: `e${Math.random()}`,\n source: childBottom,\n target: bottom,\n data: {\n minlen,\n weight: thisWeight,\n nestingEdge: true,\n },\n });\n });\n\n if (!g.getParent(v)) {\n g.addEdge({\n id: `e${Math.random()}`,\n source: root,\n target: top,\n data: {\n weight: 0,\n minlen: height + depths[v],\n },\n });\n }\n};\n\nconst treeDepths = (g: IGraph) => {\n const depths: Record<ID, number> = {};\n const dfs = (v: ID, depth: number) => {\n const children = g.getChildren(v);\n children?.forEach((child) => dfs(child.id, depth + 1));\n depths[v] = depth;\n };\n // g.children()?.forEach((v) => dfs(v, 1));\n\n g.getRoots().forEach((v) => dfs(v.id, 1));\n return depths;\n};\n\nconst sumWeights = (g: IGraph) => {\n let result = 0;\n g.getAllEdges().forEach((e) => {\n result += e.data.weight!;\n });\n return result;\n};\n\nconst cleanup = (g: IGraph, nestingRoot?: ID) => {\n // const graphLabel = g.graph();\n // graphLabel.nestingRoot && g.removeNode(graphLabel.nestingRoot);\n // delete graphLabel.nestingRoot;\n if (nestingRoot) {\n g.removeNode(nestingRoot);\n }\n\n g.getAllEdges().forEach((e) => {\n if (e.data.nestingEdge) {\n g.removeEdge(e.id);\n }\n });\n};\n\nexport { run, cleanup };\n","import { ID, Node } from \"@antv/graphlib\";\nimport { Graph, NodeData } from \"../types\";\nimport { addDummyNode } from \"./util\";\n\nexport const addBorderSegments = (g: Graph) => {\n const dfs = (v: ID) => {\n const children = g.getChildren(v);\n const node = g.getNode(v)!;\n if (children?.length) {\n children.forEach((child) => dfs(child.id));\n }\n\n if (node.data.hasOwnProperty(\"minRank\")) {\n node.data.borderLeft = [];\n node.data.borderRight = [];\n for (\n let rank = node.data.minRank!, maxRank = node.data.maxRank! + 1;\n rank < maxRank;\n rank += 1\n ) {\n addBorderNode(g, \"borderLeft\", \"_bl\", v, node, rank);\n addBorderNode(g, \"borderRight\", \"_br\", v, node, rank);\n }\n }\n };\n\n g.getRoots().forEach((child) => dfs(child.id));\n};\n\nconst addBorderNode = (\n g: Graph,\n prop: string,\n prefix: string,\n sg: ID,\n sgNode: Node<NodeData>,\n rank: number\n) => {\n const label: NodeData = { rank, borderType: prop, width: 0, height: 0 };\n // @ts-ignore\n const prev = sgNode.data[prop][rank - 1];\n const curr = addDummyNode(g, \"border\", label, prefix);\n // @ts-ignore\n sgNode.data[prop][rank] = curr;\n g.setParent(curr, sg);\n if (prev) {\n g.addEdge({\n id: `e${Math.random()}`,\n source: prev,\n target: curr,\n data: { weight: 1 },\n });\n }\n};\n","import { Node } from \"@antv/graphlib\";\nimport { DagreRankdir, Graph, NodeData } from \"../types\";\n\nconst adjust = (g: Graph, rankdir: DagreRankdir) => {\n const rd = rankdir.toLowerCase();\n if (rd === \"lr\" || rd === \"rl\") {\n swapWidthHeight(g);\n }\n};\n\nconst undo = (g: Graph, rankdir: DagreRankdir) => {\n const rd = rankdir.toLowerCase();\n if (rd === \"bt\" || rd === \"rl\") {\n reverseY(g);\n }\n\n if (rd === \"lr\" || rd === \"rl\") {\n swapXY(g);\n swapWidthHeight(g);\n }\n};\n\nconst swapWidthHeight = (g: Graph) => {\n g.getAllNodes().forEach((v) => {\n swapWidthHeightOne(v);\n });\n g.getAllEdges().forEach((e) => {\n swapWidthHeightOne(e);\n });\n};\n\nconst swapWidthHeightOne = (node: Node<NodeData>) => {\n const w = node.data.width;\n node.data.width = node.data.height;\n node.data.height = w;\n};\n\nconst reverseY = (g: Graph) => {\n g.getAllNodes().forEach((v) => {\n reverseYOne(v.data);\n });\n\n g.getAllEdges().forEach((edge) => {\n edge.data.points?.forEach((point) => reverseYOne(point));\n if (edge.data.hasOwnProperty(\"y\")) {\n reverseYOne(edge.data);\n }\n });\n};\n\nconst reverseYOne = (node: { x?: number; y?: number }) => {\n if (node?.y) {\n node.y = -node.y;\n }\n};\n\nconst swapXY = (g: Graph) => {\n g.getAllNodes().forEach((v) => {\n swapXYOne(v.data);\n });\n\n g.getAllEdges().forEach((edge) => {\n edge.data.points?.forEach((point) => swapXYOne(point));\n if (edge.data.hasOwnProperty(\"x\")) {\n swapXYOne(edge.data);\n }\n });\n};\n\nconst swapXYOne = (node: { x?: number; y?: number }) => {\n const x = node.x;\n node.x = node.y;\n node.y = x;\n};\n\nexport { adjust, undo };\n","import { ID } from \"@antv/graphlib\";\nimport { Graph } from \"../../types\";\n\n/*\n * Assigns an initial order value for each node by performing a DFS search\n * starting from nodes in the first rank. Nodes are assigned an order in their\n * rank as they are first visited.\n *\n * This approach comes from Gansner, et al., \"A Technique for Drawing Directed\n * Graphs.\"\n *\n * Returns a layering matrix with an array per layer and each layer sorted by\n * the order of its nodes.\n */\nexport const initOrder = (g: Graph) => {\n const visited: Record<string, boolean> = {};\n // const simpleNodes = g.getAllNodes().filter((v) => {\n // return !g.getChildren(v.id)?.length;\n // });\n const simpleNodes = g.getAllNodes();\n const nodeRanks = simpleNodes.map((v) => v.data.rank! ?? -Infinity);\n\n const maxRank = Math.max(...nodeRanks);\n const layers: ID[][] = [];\n for (let i = 0; i < maxRank + 1; i++) {\n layers.push([]);\n }\n\n const orderedVs = simpleNodes.sort(\n (a, b) => g.getNode(a.id).data.rank! - g.getNode(b.id).data.rank!\n );\n // const orderedVs = _.sortBy(simpleNodes, function(v) { return g.node(v)!.rank; });\n\n // 有fixOrder的，直接排序好放进去\n const beforeSort = orderedVs.filter((n) => {\n return g.getNode(n.id).data.fixorder !== undefined;\n });\n const fixOrderNodes = beforeSort.sort(\n (a, b) => g.getNode(a.id).data.fixorder! - g.getNode(b.id).data.fixorder!\n );\n fixOrderNodes?.forEach((n) => {\n if (!isNaN(g.getNode(n.id).data.rank!)) {\n layers[g.getNode(n.id).data.rank!].push(n.id);\n }\n visited[n.id] = true;\n });\n\n orderedVs?.forEach((n) =>\n g.dfsTree(n.id, (node) => {\n if (visited.hasOwnProperty(node.id)) return true;\n visited[node.id] = true;\n if (!isNaN(node.data.rank!)) {\n layers[node.data.rank!].push(node.id);\n }\n })\n );\n\n return layers;\n};\n","/*\n * A function that takes a layering (an array of layers, each with an array of\n * ordererd nodes) and a graph and returns a weighted crossing count.\n *\n * Pre-conditions:\n *\n * 1. Input graph must be simple (not a multigraph), directed, and include\n * only simple edges.\n * 2. Edges in the input graph must have assigned weights.\n *\n * Post-conditions:\n *\n * 1. The graph and layering matrix are left unchanged.\n *\n * This algorithm is derived from Barth, et al., \"Bilayer Cross Counting.\"\n */\n\nimport { ID } from \"@antv/graphlib\";\nimport { Graph } from \"../../types\";\nimport { zipObject } from \"../util\";\n\nconst twoLayerCrossCount = (g: Graph, northLayer: ID[], southLayer: ID[]) => {\n // Sort all of the edges between the north and south layers by their position\n // in the north layer and then the south. Map these edges to the position of\n // their head in the south layer.\n const southPos = zipObject(\n southLayer,\n southLayer.map((v, i) => i)\n );\n const unflat = northLayer.map((v) => {\n const unsort = g.getRelatedEdges(v, \"out\").map((e) => {\n return { pos: southPos[e.target] || 0, weight: e.data.weight };\n });\n return unsort?.sort((a, b) => a.pos - b.pos);\n });\n const southEntries = unflat.flat().filter((entry) => entry !== undefined);\n\n // Build the accumulator tree\n let firstIndex = 1;\n while (firstIndex < southLayer.length) firstIndex <<= 1;\n const treeSize = 2 * firstIndex - 1;\n firstIndex -= 1;\n const tree = Array(treeSize).fill(0, 0, treeSize);\n\n // Calculate the weighted crossings\n let cc = 0;\n southEntries?.forEach((entry) => {\n if (entry) {\n let index = entry.pos + firstIndex;\n tree[index] += entry.weight;\n let weightSum = 0;\n while (index > 0) {\n if (index % 2) {\n weightSum += tree[index + 1];\n }\n index = (index - 1) >> 1;\n tree[index] += entry.weight;\n }\n cc += entry.weight! * weightSum;\n }\n });\n\n return cc;\n};\n\nexport const crossCount = (g: Graph, layering: ID[][]) => {\n let cc = 0;\n for (let i = 1; i < layering?.length; i += 1) {\n cc += twoLayerCrossCount(g, layering[i - 1], layering[i]);\n }\n return cc;\n};\n","/*\n * Given a list of entries of the form {v, barycenter, weight} and a\n * constraint graph this function will resolve any conflicts between the\n * constraint graph and the barycenters for the entries. If the barycenters for\n * an entry would violate a constraint in the constraint graph then we coalesce\n * the nodes in the conflict into a new node that respects the contraint and\n * aggregates barycenter and weight information.\n *\n * This implementation is based on the description in Forster, \"A Fast and\n * Simple Hueristic for Constrained Two-Level Crossing Reduction,\" thought it\n * differs in some specific details.\n *\n * Pre-conditions:\n *\n * 1. Each entry has the form {v, barycenter, weight}, or if the node has\n * no barycenter, then {v}.\n *\n * Returns:\n *\n * A new list of entries of the form {vs, i, barycenter, weight}. The list\n * `vs` may either be a singleton or it may be an aggregation of nodes\n * ordered such that they do not violate constraints from the constraint\n * graph. The property `i` is the lowest original index of any of the\n * elements in `vs`.\n */\n\nimport { ID } from \"@antv/graphlib\";\nimport { Graph } from \"../../types\";\n\nexport type ConflictEntry = {\n i: number;\n indegree?: number;\n in?: ConflictEntry[];\n out?: ConflictEntry[];\n vs: ID[];\n barycenter?: number;\n weight?: number;\n merged?: boolean;\n fixorder?: number;\n order?: number;\n};\n\nconst resolveConflicts = (\n entries: {\n v: ID;\n barycenter?: number;\n weight?: number;\n }[],\n cg: Graph\n) => {\n const mappedEntries: Record<string, ConflictEntry> = {};\n entries?.forEach((entry, i: number) => {\n mappedEntries[entry.v] = {\n i,\n indegree: 0,\n in: [],\n out: [],\n vs: [entry.v],\n };\n const tmp = mappedEntries[entry.v];\n if (entry.barycenter !== undefined) {\n tmp.barycenter = entry.barycenter;\n tmp.weight = entry.weight;\n }\n });\n\n cg.getAllEdges()?.forEach((e) => {\n const entryV = mappedEntries[e.source];\n const entryW = mappedEntries[e.target];\n if (entryV !== undefined && entryW !== undefined) {\n entryW.indegree!++;\n entryV.out!.push(mappedEntries[e.target]);\n }\n });\n\n const sourceSet = Object.values(mappedEntries).filter?.(\n (entry: ConflictEntry) => !entry.indegree\n );\n\n return doResolveConflicts(sourceSet);\n};\n\nconst doResolveConflicts = (sourceSet: ConflictEntry[]) => {\n const entries = [];\n\n const handleIn = (vEntry: ConflictEntry) => {\n return (uEntry: ConflictEntry) => {\n if (uEntry.merged) return;\n if (\n uEntry.barycenter === undefined ||\n vEntry.barycenter === undefined ||\n uEntry.barycenter >= vEntry.barycenter\n ) {\n mergeEntries(vEntry, uEntry);\n }\n };\n };\n\n const handleOut = (vEntry: ConflictEntry) => {\n return (wEntry: ConflictEntry) => {\n wEntry[\"in\"]!.push(vEntry);\n if (--wEntry.indegree! === 0) {\n sourceSet.push(wEntry);\n }\n };\n };\n\n while (sourceSet?.length) {\n const entry = sourceSet.pop()!;\n entries.push(entry);\n entry[\"in\"]!.reverse()?.forEach((e: ConflictEntry) => handleIn(entry)(e));\n entry.out?.forEach((e: ConflictEntry) => handleOut(entry)(e));\n }\n\n const filtered = entries.filter((entry) => !entry.merged);\n const keys: (\"vs\" | \"i\" | \"barycenter\" | \"weight\")[] = [\n \"vs\",\n \"i\",\n \"barycenter\",\n \"weight\",\n ];\n return filtered.map((entry) => {\n const picked: Record<string, any> = {};\n keys?.forEach((key) => {\n if (entry[key] === undefined) return;\n picked[key] = entry[key];\n });\n return picked as ConflictEntry;\n });\n};\n\nconst mergeEntries = (target: ConflictEntry, source: ConflictEntry) => {\n let sum = 0;\n let weight = 0;\n\n if (target.weight) {\n sum += target.barycenter! * target.weight;\n weight += target.weight;\n }\n\n if (source.weight) {\n sum += source.barycenter! * source.weight;\n weight += source.weight;\n }\n\n target.vs = source.vs?.concat(target.vs);\n target.barycenter = sum / weight;\n target.weight = weight;\n target.i = Math.min(source.i, target.i);\n source.merged = true;\n};\n\nexport default resolveConflicts;\n","import { ID } from \"@antv/graphlib\";\nimport { partition } from \"../util\";\nimport { ConflictEntry } from \"./resolve-conflicts\";\n\nexport const sort = (\n entries: ConflictEntry[],\n biasRight?: boolean,\n usePrev?: boolean,\n keepNodeOrder?: boolean\n) => {\n const parts = partition(entries, (entry) => {\n const hasFixOrder =\n entry.hasOwnProperty(\"fixorder\") && !isNaN(entry.fixorder!);\n if (keepNodeOrder) {\n return !hasFixOrder && entry.hasOwnProperty(\"barycenter\");\n }\n // NOTE: 有fixorder的也可以排\n return hasFixOrder || entry.hasOwnProperty(\"barycenter\");\n });\n const sortable = parts.lhs;\n const unsortable = parts.rhs.sort((a, b) => -a.i - -b.i);\n const vs: ID[][] = [];\n let sum = 0;\n let weight = 0;\n let vsIndex = 0;\n\n sortable?.sort(compareWithBias(!!biasRight, !!usePrev));\n\n vsIndex = consumeUnsortable(vs, unsortable, vsIndex);\n\n sortable?.forEach((entry) => {\n vsIndex += entry.vs?.length;\n vs.push(entry.vs);\n sum += entry.barycenter! * entry.weight!;\n weight += entry.weight!;\n vsIndex = consumeUnsortable(vs, unsortable, vsIndex);\n });\n\n const result: { vs: ID[]; barycenter?: number; weight?: number } = {\n vs: vs.flat(),\n };\n if (weight) {\n result.barycenter = sum / weight;\n result.weight = weight;\n }\n return result;\n};\n\nconst consumeUnsortable = (\n vs: ID[][],\n unsortable: ConflictEntry[],\n index: number\n) => {\n let iindex = index;\n let last;\n while (\n unsortable.length &&\n (last = unsortable[unsortable.length - 1]).i <= iindex\n ) {\n unsortable.pop();\n vs?.push(last.vs);\n iindex++;\n }\n return iindex;\n};\n\n/**\n * 配置是否考虑使用之前的布局结果\n */\nconst compareWithBias = (bias: boolean, usePrev: boolean) => {\n return (entryV: ConflictEntry, entryW: ConflictEntry) => {\n // 排序的时候先判断fixorder，不行再判断重心\n if (entryV.fixorder !== undefined && entryW.fixorder !== undefined) {\n return entryV.fixorder - entryW.fixorder;\n }\n if (entryV.barycenter! < entryW.barycenter!) {\n return -1;\n }\n if (entryV.barycenter! > entryW.barycenter!) {\n return 1;\n }\n // 重心相同，考虑之前排好的顺序\n if (usePrev && entryV.order !== undefined && entryW.order !== undefined) {\n if (entryV.order < entryW.order) {\n return -1;\n }\n if (entryV.order > entryW.order) {\n return 1;\n }\n }\n\n return !bias ? entryV.i - entryW.i : entryW.i - entryV.i;\n };\n};\n","import { ID } from \"@antv/graphlib\";\nimport { Graph } from \"../../types\";\nimport { barycenter } from \"./barycenter\";\nimport resolveConflicts, { ConflictEntry } from \"./resolve-conflicts\";\nimport { sort } from \"./sort\";\n\nexport const sortSubgraph = (\n g: Graph,\n v: ID,\n cg: Graph,\n biasRight?: boolean,\n usePrev?: boolean,\n keepNodeOrder?: boolean\n) => {\n let movable = g.getChildren(v).map((n) => n.id);\n // fixorder的点不参与排序（这个方案不合适，只排了新增节点，和原来的分离）\n const node = g.getNode(v)!;\n const bl = node ? (node.data.borderLeft as ID) : undefined;\n const br = node ? (node.data.borderRight as ID) : undefined;\n const subgraphs: Record<string, Partial<ConflictEntry>> = {};\n\n if (bl) {\n movable = movable?.filter((w) => {\n return w !== bl && w !== br;\n });\n }\n\n const barycenters = barycenter(g, movable || []);\n barycenters?.forEach((entry) => {\n if (g.getChildren(entry.v)?.length) {\n const subgraphResult = sortSubgraph(\n g,\n entry.v,\n cg,\n biasRight,\n keepNodeOrder\n );\n subgraphs[entry.v] = subgraphResult;\n if (subgraphResult.hasOwnProperty(\"barycenter\")) {\n mergeBarycenters(entry, subgraphResult);\n }\n }\n });\n\n const entries = resolveConflicts(barycenters, cg);\n expandSubgraphs(entries, subgraphs);\n\n // 添加fixorder信息到entries里边\n // TODO: 不考虑复合情况，只用第一个点的fixorder信息，后续考虑更完备的实现\n entries\n .filter((e) => e.vs.length > 0)\n ?.forEach((e) => {\n const node = g.getNode(e.vs[0])!;\n if (node) {\n e.fixorder = node.data.fixorder!;\n e.order = node.data.order!;\n }\n });\n\n const result = sort(entries, biasRight, usePrev, keepNodeOrder);\n\n if (bl) {\n result.vs = [bl, result.vs, br].flat() as ID[];\n if (g.getPredecessors(bl)?.length) {\n const blPred = g.getNode(g.getPredecessors(bl)?.[0].id || \"\")!;\n const brPred = g.getNode(g.getPredecessors(br!)?.[0].id || \"\")!;\n if (!result.hasOwnProperty(\"barycenter\")) {\n result.barycenter = 0;\n result.weight = 0;\n }\n result.barycenter =\n (result.barycenter! * result.weight! +\n blPred.data.order! +\n brPred.data.order!) /\n (result.weight! + 2);\n result.weight! += 2;\n }\n }\n\n return result;\n};\n\nconst expandSubgraphs = (\n entries: ConflictEntry[],\n subgraphs: Record<string, Partial<ConflictEntry>>\n) => {\n entries?.forEach((entry) => {\n const vss = entry.vs?.map((v: string) => {\n if (subgraphs[v]) {\n return subgraphs[v].vs!;\n }\n return v;\n });\n entry.vs = vss.flat();\n });\n};\n\nconst mergeBarycenters = (\n target: { weight?: number; barycenter?: number },\n other: { weight?: number; barycenter?: number }\n) => {\n if (target.barycenter !== undefined) {\n target.barycenter =\n (target.barycenter * target.weight! + other.barycenter! * other.weight!) /\n (target.weight! + other.weight!);\n target.weight! += other.weight!;\n } else {\n target.barycenter = other.barycenter;\n target.weight = other.weight;\n }\n};\n","import { ID } from \"@antv/graphlib\";\nimport { Graph } from \"../../types\";\n\n/**\n * TODO: The median method consistently performs better than the barycenter method and has a slight theoretical advantage\n */\nexport const barycenter = (g: Graph, movable: ID[]) => {\n return movable.map((v) => {\n const inV = g.getRelatedEdges(v, \"in\");\n if (!inV?.length) {\n return { v };\n }\n\n const result = { sum: 0, weight: 0 };\n inV?.forEach((e) => {\n const nodeU = g.getNode(e.source)!;\n result.sum += e.data.weight! * nodeU.data.order!;\n result.weight += e.data.weight!;\n });\n return {\n v,\n barycenter: result.sum / result.weight,\n weight: result.weight,\n };\n });\n};\n","import isArray from './is-array';\nvar clone = function (obj) {\n if (typeof obj !== 'object' || obj === null) {\n return obj;\n }\n var rst;\n if (isArray(obj)) {\n rst = [];\n for (var i = 0, l = obj.length; i < l; i++) {\n if (typeof obj[i] === 'object' && obj[i] != null) {\n rst[i] = clone(obj[i]);\n }\n else {\n rst[i] = obj[i];\n }\n }\n }\n else {\n rst = {};\n for (var k in obj) {\n if (typeof obj[k] === 'object' && obj[k] != null) {\n rst[k] = clone(obj[k]);\n }\n else {\n rst[k] = obj[k];\n }\n }\n }\n return rst;\n};\nexport default clone;\n//# sourceMappingURL=clone.js.map","import isType from './is-type';\nexport default (function (value) {\n return Array.isArray ? Array.isArray(value) : isType(value, 'Array');\n});\n//# sourceMappingURL=is-array.js.map","import { initOrder } from \"./init-order\";\nimport { crossCount } from \"./cross-count\";\nimport { buildLayerGraph } from \"./build-layer-graph\";\nimport { addSubgraphConstraints } from \"./add-subgraph-constraints\";\nimport { sortSubgraph } from \"./sort-subgraph\";\nimport { buildLayerMatrix, maxRank } from \"../util\";\nimport { Graph as IGraph } from \"../../types\";\nimport { Graph, ID } from \"@antv/graphlib\";\nimport { clone } from \"@antv/util\";\n\n/*\n * Applies heuristics to minimize edge crossings in the graph and sets the best\n * order solution as an order attribute on each node.\n *\n * Pre-conditions:\n *\n * 1. Graph must be DAG\n * 2. Graph nodes must be objects with a \"rank\" attribute\n * 3. Graph edges must have the \"weight\" attribute\n *\n * Post-conditions:\n *\n * 1. Graph nodes will have an \"order\" attribute based on the results of the\n * algorithm.\n */\nexport const order = (g: IGraph, keepNodeOrder?: boolean) => {\n const mxRank = maxRank(g);\n const range1 = [];\n const range2 = [];\n for (let i = 1; i < mxRank + 1; i++) range1.push(i);\n for (let i = mxRank - 1; i > -1; i--) range2.push(i);\n const downLayerGraphs = buildLayerGraphs(g, range1, \"in\");\n const upLayerGraphs = buildLayerGraphs(g, range2, \"out\");\n\n let layering = initOrder(g);\n assignOrder(g, layering);\n\n let bestCC = Number.POSITIVE_INFINITY;\n let best: string[][];\n for (let i = 0, lastBest = 0; lastBest < 4; ++i, ++lastBest) {\n sweepLayerGraphs(\n i % 2 ? downLayerGraphs : upLayerGraphs,\n i % 4 >= 2,\n false,\n keepNodeOrder\n );\n\n layering = buildLayerMatrix(g);\n const cc = crossCount(g, layering);\n if (cc < bestCC) {\n lastBest = 0;\n best = clone(layering);\n bestCC = cc;\n }\n }\n\n // consider use previous result, maybe somewhat reduendant\n layering = initOrder(g);\n assignOrder(g, layering);\n for (let i = 0, lastBest = 0; lastBest < 4; ++i, ++lastBest) {\n sweepLayerGraphs(\n i % 2 ? downLayerGraphs : upLayerGraphs,\n i % 4 >= 2,\n true,\n keepNodeOrder\n );\n\n layering = buildLayerMatrix(g);\n const cc = crossCount(g, layering);\n if (cc < bestCC) {\n lastBest = 0;\n best = clone(layering);\n bestCC = cc;\n }\n }\n assignOrder(g, best!);\n};\n\nconst buildLayerGraphs = (\n g: IGraph,\n ranks: number[],\n direction: \"in\" | \"out\"\n) => {\n return ranks.map((rank) => {\n return buildLayerGraph(g, rank, direction);\n });\n};\n\nconst sweepLayerGraphs = (\n layerGraphs: IGraph[],\n biasRight: boolean,\n usePrev?: boolean,\n keepNodeOrder?: boolean\n) => {\n const cg = new Graph();\n layerGraphs?.forEach((lg) => {\n // const root = lg.graph().root as string;\n const root = lg.getRoots()[0].id;\n const sorted = sortSubgraph(\n lg,\n root,\n cg,\n biasRight,\n usePrev,\n keepNodeOrder\n );\n for (let i = 0; i < sorted.vs?.length || 0; i++) {\n const lnode = lg.getNode(sorted.vs[i]);\n if (lnode) {\n lnode.data.order = i;\n }\n }\n addSubgraphConstraints(lg, cg, sorted.vs);\n });\n};\n\nconst assignOrder = (g: IGraph, layering: ID[][]) => {\n layering?.forEach((layer) => {\n layer?.forEach((v: ID, i: number) => {\n g.getNode(v).data.order = i;\n });\n });\n};\n","import { Graph, ID } from \"@antv/graphlib\";\nimport { EdgeData, Graph as IGraph, NodeData } from \"../../types\";\n\n/*\n * Constructs a graph that can be used to sort a layer of nodes. The graph will\n * contain all base and subgraph nodes from the request layer in their original\n * hierarchy and any edges that are incident on these nodes and are of the type\n * requested by the \"relationship\" parameter.\n *\n * Nodes from the requested rank that do not have parents are assigned a root\n * node in the output graph, which is set in the root graph attribute. This\n * makes it easy to walk the hierarchy of movable nodes during ordering.\n *\n * Pre-conditions:\n *\n * 1. Input graph is a DAG\n * 2. Base nodes in the input graph have a rank attribute\n * 3. Subgraph nodes in the input graph has minRank and maxRank attributes\n * 4. Edges have an assigned weight\n *\n * Post-conditions:\n *\n * 1. Output graph has all nodes in the movable rank with preserved\n * hierarchy.\n * 2. Root nodes in the movable layer are made children of the node\n * indicated by the root attribute of the graph.\n * 3. Non-movable nodes incident on movable nodes, selected by the\n * relationship parameter, are included in the graph (without hierarchy).\n * 4. Edges incident on movable nodes, selected by the relationship\n * parameter, are added to the output graph.\n * 5. The weights for copied edges are aggregated as need, since the output\n * graph is not a multi-graph.\n */\nexport const buildLayerGraph = (\n g: IGraph,\n rank: number,\n direction: \"in\" | \"out\"\n) => {\n const root = createRootNode(g);\n const result = new Graph<NodeData, EdgeData>({\n tree: [\n {\n id: root,\n children: [],\n data: {},\n },\n ],\n });\n\n g.getAllNodes().forEach((v) => {\n const parent = g.getParent(v.id);\n\n if (\n v.data.rank === rank ||\n (v.data.minRank! <= rank && rank <= v.data.maxRank!)\n ) {\n if (!result.hasNode(v.id)) {\n result.addNode({ ...v });\n }\n\n if (parent?.id && !result.hasNode(parent?.id)) {\n result.addNode({ ...parent });\n }\n\n result.setParent(v.id, parent?.id || root);\n\n // This assumes we have only short edges!\n g.getRelatedEdges(v.id, direction).forEach((e) => {\n const u = e.source === v.id ? e.target : e.source;\n if (!result.hasNode(u)) {\n result.addNode({ ...g.getNode(u) });\n }\n\n const edge = result\n .getRelatedEdges(u, \"out\")\n .find(({ target }) => target === v.id);\n const weight = edge !== undefined ? edge.data.weight! : 0;\n\n if (!edge) {\n result.addEdge({\n id: e.id,\n source: u,\n target: v.id,\n data: {\n weight: e.data.weight! + weight,\n },\n });\n } else {\n result.updateEdgeData(edge.id, {\n ...edge.data,\n weight: e.data.weight! + weight,\n });\n }\n });\n\n // console.log(v);\n\n if (v.data.hasOwnProperty(\"minRank\")) {\n result.updateNodeData(v.id, {\n ...v.data,\n borderLeft: (v.data.borderLeft as ID[])[rank],\n borderRight: (v.data.borderRight as ID[])[rank],\n });\n }\n }\n });\n\n return result;\n};\n\nconst createRootNode = (g: IGraph) => {\n let v;\n while (g.hasNode((v = `_root${Math.random()}`)));\n return v;\n};\n","import { ID } from \"@antv/graphlib\";\nimport { Graph } from \"../../types\";\n\nexport const addSubgraphConstraints = (g: Graph, cg: Graph, vs: ID[]) => {\n const prev: Record<ID, ID> = {};\n let rootPrev: ID;\n\n vs?.forEach((v) => {\n let child = g.getParent(v);\n let parent;\n let prevChild: ID;\n while (child) {\n parent = g.getParent(child.id);\n if (parent) {\n prevChild = prev[parent.id];\n prev[parent.id] = child.id;\n } else {\n prevChild = rootPrev;\n rootPrev = child.id;\n }\n if (prevChild && prevChild !== child.id) {\n cg.addNodes([\n {\n id: prevChild,\n data: {},\n },\n {\n id: child.id,\n data: {},\n },\n ]);\n cg.addEdge({\n id: `e${prevChild}-${child.id}`,\n source: prevChild,\n target: child.id,\n data: {},\n });\n return;\n }\n child = parent;\n }\n });\n};\n","/*\n * This module provides coordinate assignment based on Brandes and Köpf, \"Fast\n * and Simple Horizontal Coordinate Assignment.\"\n */\nimport { Graph, ID, Node } from \"@antv/graphlib\";\nimport { DagreAlign, EdgeData, Graph as IGraph, NodeData } from \"../../types\";\nimport { buildLayerMatrix, minBy } from \"../util\";\n\n/*\n * Marks all edges in the graph with a type-1 conflict with the \"type1Conflict\"\n * property. A type-1 conflict is one where a non-inner segment crosses an\n * inner segment. An inner segment is an edge with both incident nodes marked\n * with the \"dummy\" property.\n *\n * This algorithm scans layer by layer, starting with the second, for type-1\n * conflicts between the current layer and the previous layer. For each layer\n * it scans the nodes from left to right until it reaches one that is incident\n * on an inner segment. It then scans predecessors to determine if they have\n * edges that cross that inner segment. At the end a final scan is done for all\n * nodes on the current rank to see if they cross the last visited inner\n * segment.\n *\n * This algorithm (safely) assumes that a dummy node will only be incident on a\n * single node in the layers being scanned.\n */\n\ntype Conflicts = Record<ID, Record<ID, boolean>>;\n\nexport const findType1Conflicts = (g: IGraph, layering?: ID[][]) => {\n const conflicts = {};\n\n const visitLayer = (prevLayer: ID[], layer: ID[]) => {\n // last visited node in the previous layer that is incident on an inner\n // segment.\n let k0 = 0;\n // Tracks the last node in this layer scanned for crossings with a type-1\n // segment.\n let scanPos = 0;\n const prevLayerLength = prevLayer.length;\n const lastNode = layer?.[layer?.length - 1];\n\n layer?.forEach((v: ID, i: number) => {\n const w = findOtherInnerSegmentNode(g, v);\n const k1 = w ? g.getNode(w.id)!.data.order! : prevLayerLength;\n\n if (w || v === lastNode) {\n layer.slice(scanPos, i + 1)?.forEach((scanNode) => {\n g.getPredecessors(scanNode)?.forEach((u) => {\n const uLabel = g.getNode(u.id)!;\n const uPos = uLabel.data.order!;\n if (\n (uPos < k0 || k1 < uPos) &&\n !(uLabel.data.dummy && g.getNode(scanNode)?.data.dummy)\n ) {\n addConflict(conflicts, u.id, scanNode);\n }\n });\n });\n scanPos = i + 1;\n k0 = k1;\n }\n });\n\n return layer;\n };\n\n if (layering?.length) {\n layering.reduce(visitLayer);\n }\n return conflicts;\n};\n\nexport const findType2Conflicts = (g: IGraph, layering?: ID[][]) => {\n const conflicts = {};\n\n function scan(\n south: string[],\n southPos: number,\n southEnd: number,\n prevNorthBorder: number,\n nextNorthBorder: number\n ) {\n let v: string;\n for (let i = southPos; i < southEnd; i++) {\n v = south[i];\n if (g.getNode(v)?.data.dummy) {\n g.getPredecessors(v)?.forEach((u) => {\n const uNode = g.getNode(u.id)!;\n if (\n uNode.data.dummy &&\n (uNode.data.order! < prevNorthBorder ||\n uNode.data.order! > nextNorthBorder)\n ) {\n addConflict(conflicts, u.id, v);\n }\n });\n }\n }\n }\n\n function getScannedKey(params: Parameters<typeof scan>) {\n // south数组可能很大，不适合做key\n return JSON.stringify(params.slice(1));\n }\n\n function scanIfNeeded(\n params: Parameters<typeof scan>,\n scanCache: Map<string, boolean>\n ) {\n const cacheKey = getScannedKey(params);\n\n if (scanCache.get(cacheKey)) return;\n\n scan(...params);\n scanCache.set(cacheKey, true);\n }\n\n const visitLayer = (north: string[], south: string[]) => {\n let prevNorthPos = -1;\n let nextNorthPos: number;\n let southPos = 0;\n\n const scanned = new Map<string, boolean>();\n\n south?.forEach((v: string, southLookahead: number) => {\n if (g.getNode(v)?.data.dummy === \"border\") {\n const predecessors = g.getPredecessors(v) || [];\n if (predecessors.length) {\n nextNorthPos = g.getNode(predecessors[0].id)!.data.order!;\n scanIfNeeded(\n [south, southPos, southLookahead, prevNorthPos, nextNorthPos],\n scanned\n );\n southPos = southLookahead;\n prevNorthPos = nextNorthPos;\n }\n }\n scanIfNeeded(\n [south, southPos, south.length, nextNorthPos, north.length],\n scanned\n );\n });\n\n return south;\n };\n\n if (layering?.length) {\n layering.reduce(visitLayer);\n }\n return conflicts;\n};\n\nexport const findOtherInnerSegmentNode = (g: IGraph, v: ID) => {\n if (g.getNode(v)?.data.dummy) {\n return g.getPredecessors(v)?.find((u) => g.getNode(u.id).data.dummy);\n }\n};\n\nexport const addConflict = (conflicts: Conflicts, v: ID, w: ID) => {\n let vv = v;\n let ww = w;\n if (vv > ww) {\n const tmp = vv;\n vv = ww;\n ww = tmp;\n }\n\n let conflictsV = conflicts[vv];\n if (!conflictsV) {\n conflicts[vv] = conflictsV = {};\n }\n conflictsV[ww] = true;\n};\n\nexport const hasConflict = (conflicts: Conflicts, v: ID, w: ID) => {\n let vv = v;\n let ww = w;\n if (vv > ww) {\n const tmp = v;\n vv = ww;\n ww = tmp;\n }\n return !!conflicts[vv];\n};\n\n/*\n * Try to align nodes into vertical \"blocks\" where possible. This algorithm\n * attempts to align a node with one of its median neighbors. If the edge\n * connecting a neighbor is a type-1 conflict then we ignore that possibility.\n * If a previous node has already formed a block with a node after the node\n * we're trying to form a block with, we also ignore that possibility - our\n * blocks would be split in that scenario.\n */\nexport const verticalAlignment = (\n g: IGraph,\n layering: ID[][],\n conflicts: Conflicts,\n neighborFn: (v: ID) => Node<NodeData>[]\n) => {\n const root: Record<ID, ID> = {};\n const align: Record<ID, ID> = {};\n const pos: Record<ID, number> = {};\n\n // We cache the position here based on the layering because the graph and\n // layering may be out of sync. The layering matrix is manipulated to\n // generate different extreme alignments.\n layering?.forEach((layer) => {\n layer?.forEach((v, order: number) => {\n root[v] = v;\n align[v] = v;\n pos[v] = order;\n });\n });\n\n layering?.forEach((layer) => {\n let prevIdx = -1;\n layer?.forEach((v) => {\n let ws = neighborFn(v).map((n) => n.id);\n\n if (ws.length) {\n ws = ws.sort((a: ID, b: ID) => pos[a] - pos[b]);\n const mp = (ws.length - 1) / 2;\n for (let i = Math.floor(mp), il = Math.ceil(mp); i <= il; ++i) {\n const w = ws[i];\n if (\n align[v] === v &&\n prevIdx < pos[w] &&\n !hasConflict(conflicts, v, w)\n ) {\n align[w] = v;\n align[v] = root[v] = root[w];\n prevIdx = pos[w];\n }\n }\n }\n });\n });\n\n return { root, align };\n};\n\nexport const horizontalCompaction = (\n g: IGraph,\n layering: ID[][],\n root: Record<ID, ID>,\n align: Record<ID, ID>,\n nodesep: number,\n edgesep: number,\n reverseSep?: boolean\n) => {\n // This portion of the algorithm differs from BK due to a number of problems.\n // Instead of their algorithm we construct a new block graph and do two\n // sweeps. The first sweep places blocks with the smallest possible\n // coordinates. The second sweep removes unused space by moving blocks to the\n // greatest coordinates without violating separation.\n const xs: Record<ID, number> = {};\n const blockG = buildBlockGraph(\n g,\n layering,\n root,\n nodesep,\n edgesep,\n reverseSep\n );\n const borderType = reverseSep ? \"borderLeft\" : \"borderRight\";\n\n const iterate = (\n setXsFunc: (param: ID) => void,\n nextNodesFunc: (param: ID) => Node<NodeData>\n ) => {\n let stack = blockG.getAllNodes();\n let elem = stack.pop();\n const visited: Record<ID, boolean> = {};\n while (elem) {\n if (visited[elem.id]) {\n setXsFunc(elem.id);\n } else {\n visited[elem.id] = true;\n stack.push(elem);\n stack = stack.concat(nextNodesFunc(elem.id));\n }\n\n elem = stack.pop();\n }\n };\n\n // First pass, assign smallest coordinates\n const pass1 = (elem: ID) => {\n xs[elem] = (blockG.getRelatedEdges(elem, \"in\") || []).reduce(\n (acc: number, e) => {\n return Math.max(acc, (xs[e.source] || 0) + e.data.weight!);\n },\n 0\n );\n };\n\n // Second pass, assign greatest coordinates\n const pass2 = (elem: ID) => {\n const min = (blockG.getRelatedEdges(elem, \"out\") || []).reduce(\n (acc: number, e) => {\n return Math.min(acc, (xs[e.target] || 0) - e.data.weight!);\n },\n Number.POSITIVE_INFINITY\n );\n\n const node = g.getNode(elem)!;\n if (\n min !== Number.POSITIVE_INFINITY &&\n node.data.borderType !== borderType\n ) {\n xs[elem] = Math.max(xs[elem], min);\n }\n };\n\n iterate(pass1, blockG.getPredecessors.bind(blockG));\n iterate(pass2, blockG.getSuccessors.bind(blockG));\n\n // Assign x coordinates to all nodes\n Object.values(align)?.forEach((v) => {\n xs[v] = xs[root[v]];\n });\n\n return xs;\n};\n\nexport const buildBlockGraph = (\n g: IGraph,\n layering: ID[][],\n root: Record<ID, ID>,\n nodesep: number,\n edgesep: number,\n reverseSep?: boolean\n): IGraph => {\n const blockGraph = new Graph<NodeData, EdgeData>();\n const sepFn = sep(nodesep, edgesep, reverseSep as boolean);\n\n layering?.forEach((layer) => {\n let u: ID;\n layer?.forEach((v) => {\n const vRoot = root[v];\n if (!blockGraph.hasNode(vRoot)) {\n blockGraph.addNode({\n id: vRoot,\n data: {},\n });\n }\n if (u) {\n const uRoot = root[u];\n\n const edge = blockGraph\n .getRelatedEdges(uRoot, \"out\")\n .find((edge) => edge.target === vRoot);\n if (!edge) {\n blockGraph.addEdge({\n id: `e${Math.random()}`,\n source: uRoot,\n target: vRoot,\n data: {\n weight: Math.max(sepFn(g, v, u), 0),\n },\n });\n } else {\n blockGraph.updateEdgeData(edge.id, {\n ...edge.data,\n weight: Math.max(sepFn(g, v, u), edge.data.weight! || 0),\n });\n }\n }\n u = v;\n });\n });\n\n return blockGraph;\n};\n/*\n * Returns the alignment that has the smallest width of the given alignments.\n */\nexport const findSmallestWidthAlignment = (\n g: IGraph,\n xss: Record<string, Record<string, number>>\n) => {\n return minBy(Object.values(xss), (xs) => {\n let max = Number.NEGATIVE_INFINITY;\n let min = Number.POSITIVE_INFINITY;\n\n Object.keys(xs)?.forEach((v: string) => {\n const x = xs[v];\n const halfWidth = width(g, v) / 2;\n\n max = Math.max(x + halfWidth, max);\n min = Math.min(x - halfWidth, min);\n });\n\n return max - min;\n });\n};\n\n/*\n * Align the coordinates of each of the layout alignments such that\n * left-biased alignments have their minimum coordinate at the same point as\n * the minimum coordinate of the smallest width alignment and right-biased\n * alignments have their maximum coordinate at the same point as the maximum\n * coordinate of the smallest width alignment.\n */\nexport function alignCoordinates(\n xss: Record<string, Record<string, number>>,\n alignTo: Record<string, number>\n) {\n const alignToVals = Object.values(alignTo);\n const alignToMin = Math.min(...alignToVals);\n const alignToMax = Math.max(...alignToVals);\n\n [\"u\", \"d\"].forEach((vert) => {\n [\"l\", \"r\"].forEach((horiz) => {\n const alignment = vert + horiz;\n const xs = xss[alignment];\n let delta: number;\n if (xs === alignTo) return;\n\n const xsVals = Object.values(xs);\n delta =\n horiz === \"l\"\n ? alignToMin - Math.min(...xsVals)\n : alignToMax - Math.max(...xsVals);\n\n if (delta) {\n xss[alignment] = {};\n Object.keys(xs).forEach((key) => {\n xss[alignment][key] = xs[key] + delta;\n });\n }\n });\n });\n}\n\nexport const balance = (\n xss: Record<string, Record<string, number>>,\n align?: DagreAlign\n) => {\n const result: Record<string, number> = {};\n Object.keys(xss.ul).forEach((key) => {\n if (align) {\n result[key] = xss[align.toLowerCase()][key];\n } else {\n const values = Object.values(xss).map((x) => x[key]);\n result[key] = (values[0] + values[1]) / 2; // (ur + ul) / 2\n }\n });\n return result;\n};\n\nexport const positionX = (\n g: IGraph,\n options?: Partial<{\n align: DagreAlign;\n nodesep: number;\n edgesep: number;\n }>\n) => {\n const { align: graphAlign, nodesep = 0, edgesep = 0 } = options || {};\n\n const layering = buildLayerMatrix(g);\n const conflicts = Object.assign(\n findType1Conflicts(g, layering),\n findType2Conflicts(g, layering)\n );\n\n const xss: Record<string, Record<ID, number>> = {};\n let adjustedLayering: ID[][];\n [\"u\", \"d\"].forEach((vert) => {\n adjustedLayering =\n vert === \"u\" ? layering : Object.values(layering).reverse();\n [\"l\", \"r\"].forEach((horiz) => {\n if (horiz === \"r\") {\n adjustedLayering = adjustedLayering.map((inner) =>\n Object.values(inner).reverse()\n );\n }\n\n const neighborFn = (\n vert === \"u\" ? g.getPredecessors : g.getSuccessors\n ).bind(g);\n const align = verticalAlignment(\n g,\n adjustedLayering,\n conflicts,\n neighborFn\n );\n const xs = horizontalCompaction(\n g,\n adjustedLayering,\n align.root,\n align.align,\n nodesep,\n edgesep,\n horiz === \"r\"\n );\n if (horiz === \"r\") {\n Object.keys(xs).forEach((key) => {\n xs[key] = -xs[key];\n });\n }\n xss[vert + horiz] = xs;\n });\n });\n\n const smallestWidth = findSmallestWidthAlignment(g, xss);\n alignCoordinates(xss, smallestWidth);\n return balance(xss, graphAlign);\n};\n\nexport const sep = (nodeSep: number, edgeSep: number, reverseSep: boolean) => {\n return (g: IGraph, v: ID, w: ID) => {\n const vLabel = g.getNode(v)!;\n const wLabel = g.getNode(w)!;\n let sum = 0;\n let delta: number = 0;\n\n sum += vLabel.data.width! / 2;\n if (vLabel.data.hasOwnProperty(\"labelpos\")) {\n switch (((vLabel.data.labelpos as string) || \"\").toLowerCase()) {\n case \"l\":\n delta = -vLabel.data.width! / 2;\n break;\n case \"r\":\n delta = vLabel.data.width! / 2;\n break;\n }\n }\n if (delta) {\n sum += reverseSep ? delta : -delta;\n }\n delta = 0;\n\n sum += (vLabel.data.dummy ? edgeSep : nodeSep) / 2;\n sum += (wLabel.data.dummy ? edgeSep : nodeSep) / 2;\n\n sum += wLabel.data.width! / 2;\n if (wLabel.data.labelpos) {\n switch (((wLabel.data.labelpos as string) || \"\").toLowerCase()) {\n case \"l\":\n delta = wLabel.data.width! / 2;\n break;\n case \"r\":\n delta = -wLabel.data.width! / 2;\n break;\n }\n }\n if (delta) {\n sum += reverseSep ? delta : -delta;\n }\n delta = 0;\n\n return sum;\n };\n};\n\nexport const width = (g: IGraph, v: ID) => g.getNode(v)!.data.width! || 0;\n","import { ID } from \"@antv/graphlib\";\nimport { DagreAlign, Graph as IGraph } from \"../../types\";\nimport { asNonCompoundGraph, buildLayerMatrix } from \"../util\";\nimport {\n alignCoordinates,\n balance,\n findSmallestWidthAlignment,\n findType1Conflicts,\n findType2Conflicts,\n horizontalCompaction,\n verticalAlignment,\n} from \"./bk\";\n\nconst positionY = (\n g: IGraph,\n options?: Partial<{\n ranksep: number;\n }>\n) => {\n const { ranksep = 0 } = options || {};\n const layering = buildLayerMatrix(g);\n\n let prevY = 0;\n layering?.forEach((layer) => {\n const heights = layer.map((v) => g.getNode(v).data.height!);\n const maxHeight = Math.max(...heights, 0);\n layer?.forEach((v: string) => {\n g.getNode(v).data.y = prevY + maxHeight / 2;\n });\n prevY += maxHeight + ranksep;\n });\n};\n\nconst positionX = (\n g: IGraph,\n options?: Partial<{\n align: DagreAlign;\n nodesep: number;\n edgesep: number;\n }>\n): Record<ID, number> => {\n const { align: graphAlign, nodesep = 0, edgesep = 0 } = options || {};\n\n const layering = buildLayerMatrix(g);\n const conflicts = Object.assign(\n findType1Conflicts(g, layering),\n findType2Conflicts(g, layering)\n );\n\n const xss: Record<string, Record<string, number>> = {};\n let adjustedLayering: ID[][] = [];\n [\"u\", \"d\"].forEach((vert) => {\n adjustedLayering =\n vert === \"u\" ? layering : Object.values(layering).reverse();\n [\"l\", \"r\"].forEach((horiz) => {\n if (horiz === \"r\") {\n adjustedLayering = adjustedLayering.map((inner) =>\n Object.values(inner).reverse()\n );\n }\n\n const neighborFn = (\n vert === \"u\" ? g.getPredecessors : g.getSuccessors\n ).bind(g);\n const align = verticalAlignment(\n g,\n adjustedLayering,\n conflicts,\n neighborFn\n );\n const xs = horizontalCompaction(\n g,\n adjustedLayering,\n align.root,\n align.align,\n nodesep,\n edgesep,\n horiz === \"r\"\n );\n if (horiz === \"r\") {\n Object.keys(xs).forEach((xsKey) => (xs[xsKey] = -xs[xsKey]));\n }\n xss[vert + horiz] = xs;\n });\n });\n\n const smallestWidth = findSmallestWidthAlignment(g, xss);\n smallestWidth && alignCoordinates(xss, smallestWidth);\n return balance(xss, graphAlign);\n};\n\nexport const position = (\n g: IGraph,\n options?: Partial<{\n align: DagreAlign;\n nodesep: number;\n edgesep: number;\n ranksep: number;\n }>\n) => {\n const ng = asNonCompoundGraph(g);\n\n positionY(ng, options);\n const xs = positionX(ng, options);\n Object.keys(xs)?.forEach((key: ID) => {\n ng.getNode(key).data.x = xs[key];\n });\n};\n","import { Graph, ID } from \"@antv/graphlib\";\nimport { isNil } from \"@antv/util\";\nimport {\n DagreAlign,\n DagreRankdir,\n Graph as IGraph,\n NodeData,\n Point,\n} from \"../types\";\nimport { run as runAcyclic, undo as undoAcyclic } from \"./acyclic\";\nimport { run as runNormalize, undo as undoNormalize } from \"./normalize\";\nimport { rank } from \"./rank\";\nimport {\n normalizeRanks,\n removeEmptyRanks,\n asNonCompoundGraph,\n addDummyNode,\n intersectRect,\n buildLayerMatrix,\n} from \"./util\";\nimport { parentDummyChains } from \"./parent-dummy-chains\";\nimport {\n run as runNestingGraph,\n cleanup as cleanupNestingGraph,\n} from \"./nesting-graph\";\nimport { addBorderSegments } from \"./add-border-segments\";\nimport {\n adjust as adjustCoordinateSystem,\n undo as undoCoordinateSystem,\n} from \"./coordinate-system\";\nimport { order } from \"./order\";\nimport { position } from \"./position\";\nimport { initDataOrder } from \"./order/init-data-order\";\n\n// const graphNumAttrs = [\"nodesep\", \"edgesep\", \"ranksep\", \"marginx\", \"marginy\"];\n// const graphDefaults = { ranksep: 50, edgesep: 20, nodesep: 50, rankdir: \"tb\" };\n// const graphAttrs = [\"acyclicer\", \"ranker\", \"rankdir\", \"align\"];\n\nexport const layout = (\n g: IGraph,\n options: {\n keepNodeOrder: boolean;\n prevGraph: IGraph | null;\n edgeLabelSpace?: boolean;\n align?: DagreAlign;\n nodesep?: number;\n edgesep?: number;\n ranksep?: number;\n acyclicer: string;\n nodeOrder: ID[];\n ranker: \"network-simplex\" | \"tight-tree\" | \"longest-path\";\n rankdir: DagreRankdir;\n }\n) => {\n const { edgeLabelSpace, keepNodeOrder, prevGraph, rankdir, ranksep } =\n options;\n\n // 如果在原图基础上修改，继承原图的order结果\n if (!keepNodeOrder && prevGraph) {\n inheritOrder(g, prevGraph);\n }\n const layoutGraph = buildLayoutGraph(g);\n\n // 控制是否为边的label留位置（这会影响是否在边中间添加dummy node）\n if (!(!edgeLabelSpace)) {\n options.ranksep = makeSpaceForEdgeLabels(layoutGraph, {\n rankdir,\n ranksep,\n });\n }\n let dimension;\n // TODO: 暂时处理层级设置不正确时的异常报错，提示设置正确的层级\n try {\n dimension = runLayout(layoutGraph, options);\n } catch (e) {\n if (\n e.message === \"Not possible to find intersection inside of the rectangle\"\n ) {\n console.error(\n \"The following error may be caused by improper layer setting, please make sure your manual layer setting does not violate the graph's structure:\\n\",\n e\n );\n return;\n }\n throw e;\n }\n updateInputGraph(g, layoutGraph);\n return dimension;\n};\n\nconst runLayout = (\n g: IGraph,\n options: {\n acyclicer: string;\n keepNodeOrder: boolean;\n nodeOrder: ID[];\n ranker: \"network-simplex\" | \"tight-tree\" | \"longest-path\";\n rankdir: DagreRankdir;\n align?: DagreAlign;\n nodesep?: number;\n edgesep?: number;\n ranksep?: number;\n }\n) => {\n const {\n acyclicer,\n ranker,\n rankdir = \"tb\",\n nodeOrder,\n keepNodeOrder,\n align,\n nodesep = 50,\n edgesep = 20,\n ranksep = 50,\n } = options;\n\n removeSelfEdges(g);\n\n runAcyclic(g, acyclicer);\n\n const { nestingRoot, nodeRankFactor } = runNestingGraph(g);\n\n rank(asNonCompoundGraph(g), ranker);\n\n injectEdgeLabelProxies(g);\n\n removeEmptyRanks(g, nodeRankFactor);\n\n cleanupNestingGraph(g, nestingRoot);\n\n normalizeRanks(g);\n\n assignRankMinMax(g);\n\n removeEdgeLabelProxies(g);\n\n const dummyChains: ID[] = [];\n runNormalize(g, dummyChains);\n parentDummyChains(g, dummyChains);\n\n addBorderSegments(g);\n\n if (keepNodeOrder) {\n initDataOrder(g, nodeOrder);\n }\n\n order(g, keepNodeOrder);\n\n insertSelfEdges(g);\n\n adjustCoordinateSystem(g, rankdir);\n\n position(g, {\n align,\n nodesep,\n edgesep,\n ranksep,\n });\n\n positionSelfEdges(g);\n\n removeBorderNodes(g);\n\n undoNormalize(g, dummyChains);\n\n fixupEdgeLabelCoords(g);\n\n undoCoordinateSystem(g, rankdir);\n\n const { width, height } = translateGraph(g);\n\n assignNodeIntersects(g);\n\n reversePointsForReversedEdges(g);\n\n undoAcyclic(g);\n\n return { width, height };\n};\n\n/**\n * 继承上一个布局中的order，防止翻转\n * TODO: 暂时没有考虑涉及层级变动的布局，只保证原来布局层级和相对顺序不变\n */\nconst inheritOrder = (currG: IGraph, prevG: IGraph) => {\n currG.getAllNodes().forEach((n) => {\n const node = currG.getNode(n.id)!;\n const prevNode = prevG.getNode(n.id)!;\n if (prevNode !== undefined) {\n node.data.fixorder = prevNode.data._order as number;\n delete prevNode.data._order;\n } else {\n delete node.data.fixorder;\n }\n });\n};\n\n/*\n * Copies final layout information from the layout graph back to the input\n * graph. This process only copies whitelisted attributes from the layout graph\n * to the input graph, so it serves as a good place to determine what\n * attributes can influence layout.\n */\nconst updateInputGraph = (inputGraph: IGraph, layoutGraph: IGraph) => {\n inputGraph.getAllNodes().forEach((v) => {\n const inputLabel = inputGraph.getNode(v.id);\n\n if (inputLabel) {\n const layoutLabel = layoutGraph.getNode(v.id)!;\n inputLabel.data.x = layoutLabel.data.x;\n inputLabel.data.y = layoutLabel.data.y;\n inputLabel.data._order = layoutLabel.data.order;\n inputLabel.data._rank = layoutLabel.data.rank;\n\n if (layoutGraph.getChildren(v.id)?.length) {\n inputLabel.data.width = layoutLabel.data.width;\n inputLabel.data.height = layoutLabel.data.height;\n }\n }\n });\n\n inputGraph.getAllEdges().forEach((e) => {\n const inputLabel = inputGraph.getEdge(e.id)!;\n const layoutLabel = layoutGraph.getEdge(e.id)!;\n\n inputLabel.data.points = layoutLabel ? layoutLabel.data.points : [];\n if (layoutLabel && layoutLabel.data.hasOwnProperty(\"x\")) {\n inputLabel.data.x = layoutLabel.data.x;\n inputLabel.data.y = layoutLabel.data.y;\n }\n });\n\n // inputGraph.graph().width = layoutGraph.graph().width;\n // inputGraph.graph().height = layoutGraph.graph().height;\n};\n\nconst nodeNumAttrs = [\"width\", \"height\", \"layer\", \"fixorder\"]; // 需要传入layer, fixOrder作为参数参考\nconst nodeDefaults = { width: 0, height: 0 };\nconst edgeNumAttrs = [\"minlen\", \"weight\", \"width\", \"height\", \"labeloffset\"];\nconst edgeDefaults = {\n minlen: 1,\n weight: 1,\n width: 0,\n height: 0,\n labeloffset: 10,\n labelpos: \"r\",\n};\nconst edgeAttrs = [\"labelpos\"];\n\n/*\n * Constructs a new graph from the input graph, which can be used for layout.\n * This process copies only whitelisted attributes from the input graph to the\n * layout graph. Thus this function serves as a good place to determine what\n * attributes can influence layout.\n */\nconst buildLayoutGraph = (inputGraph: IGraph) => {\n const g = new Graph({ tree: [] });\n inputGraph.getAllNodes().forEach((v) => {\n const node = canonicalize(inputGraph.getNode(v.id).data);\n const defaultNode = {\n ...nodeDefaults,\n ...node,\n } as NodeData;\n const defaultAttrs = selectNumberAttrs(defaultNode, nodeNumAttrs) as Node;\n\n if (!g.hasNode(v.id)) {\n g.addNode({\n id: v.id,\n data: {\n ...defaultAttrs,\n },\n });\n }\n\n const parent = inputGraph.getParent(v.id);\n if (!isNil(parent)) {\n if (!g.hasNode(parent.id)) {\n g.addNode({ ...parent });\n }\n g.setParent(v.id, parent.id);\n }\n });\n\n inputGraph.getAllEdges().forEach((e) => {\n const edge = canonicalize(inputGraph.getEdge(e.id).data);\n\n const pickedProperties: any = {};\n edgeAttrs?.forEach((key) => {\n if (edge[key] !== undefined) pickedProperties[key] = edge[key];\n });\n\n g.addEdge({\n id: e.id,\n source: e.source,\n target: e.target,\n data: Object.assign(\n {},\n edgeDefaults,\n selectNumberAttrs(edge, edgeNumAttrs),\n pickedProperties\n ),\n });\n });\n\n return g;\n};\n\n/*\n * This idea comes from the Gansner paper: to account for edge labels in our\n * layout we split each rank in half by doubling minlen and halving ranksep.\n * Then we can place labels at these mid-points between nodes.\n *\n * We also add some minimal padding to the width to push the label for the edge\n * away from the edge itself a bit.\n */\nconst makeSpaceForEdgeLabels = (\n g: IGraph,\n options: {\n ranksep?: number;\n rankdir: string;\n }\n) => {\n const { ranksep = 0, rankdir } = options;\n g.getAllNodes().forEach((node) => {\n if (!isNaN(node.data.layer!)) {\n if (!node.data.layer) node.data.layer = 0;\n }\n });\n g.getAllEdges().forEach((edge) => {\n edge.data.minlen! *= 2;\n if ((edge.data.labelpos as string)?.toLowerCase() !== \"c\") {\n if (rankdir === \"TB\" || rankdir === \"BT\") {\n edge.data.width! += edge.data.labeloffset!;\n } else {\n edge.data.height! += edge.data.labeloffset!;\n }\n }\n });\n\n return ranksep / 2;\n};\n\n/*\n * Creates temporary dummy nodes that capture the rank in which each edge's\n * label is going to, if it has one of non-zero width and height. We do this\n * so that we can safely remove empty ranks while preserving balance for the\n * label's position.\n */\nconst injectEdgeLabelProxies = (g: IGraph) => {\n g.getAllEdges().forEach((e) => {\n if (e.data.width && e.data.height) {\n const v = g.getNode(e.source)!;\n const w = g.getNode(e.target)!;\n const label = {\n e,\n rank: (w.data.rank! - v.data.rank!) / 2 + v.data.rank!,\n };\n addDummyNode(g, \"edge-proxy\", label, \"_ep\");\n }\n });\n};\n\nconst assignRankMinMax = (g: IGraph): number => {\n let maxRank = 0;\n g.getAllNodes().forEach((node) => {\n if (node.data.borderTop) {\n node.data.minRank = g.getNode(node.data.borderTop as ID)?.data.rank;\n node.data.maxRank = g.getNode(node.data.borderBottom as ID)?.data.rank;\n maxRank = Math.max(maxRank, node.data.maxRank || -Infinity);\n }\n });\n\n return maxRank;\n};\n\nconst removeEdgeLabelProxies = (g: IGraph) => {\n g.getAllNodes().forEach((node) => {\n if (node.data.dummy === \"edge-proxy\") {\n g.getEdge(node.data.e!.id)!.data.labelRank = node.data.rank;\n g.removeNode(node.id);\n }\n });\n};\n\nconst translateGraph = (\n g: IGraph,\n options?: {\n marginx: number;\n marginy: number;\n }\n) => {\n let minX: number;\n let maxX = 0;\n let minY: number;\n let maxY = 0;\n\n const { marginx: marginX = 0, marginy: marginY = 0 } = options || {};\n\n const getExtremes = (attrs: any) => {\n if (!attrs.data) return;\n const x = attrs.data.x;\n const y = attrs.data.y;\n const w = attrs.data.width;\n const h = attrs.data.height;\n if (!isNaN(x) && !isNaN(w)) {\n if (minX === undefined) {\n minX = x - w / 2;\n }\n minX = Math.min(minX, x - w / 2);\n maxX = Math.max(maxX, x + w / 2);\n }\n if (!isNaN(y) && !isNaN(h)) {\n if (minY === undefined) {\n minY = y - h / 2;\n }\n minY = Math.min(minY, y - h / 2);\n maxY = Math.max(maxY, y + h / 2);\n }\n };\n\n g.getAllNodes().forEach((v) => {\n getExtremes(v);\n });\n g.getAllEdges().forEach((e) => {\n if (e?.data.hasOwnProperty(\"x\")) {\n getExtremes(e);\n }\n });\n\n minX! -= marginX;\n minY! -= marginY;\n\n g.getAllNodes().forEach((node) => {\n node.data.x! -= minX;\n node.data.y! -= minY;\n });\n\n g.getAllEdges().forEach((edge) => {\n edge.data.points?.forEach((p) => {\n p.x -= minX;\n p.y -= minY;\n });\n if (edge.data.hasOwnProperty(\"x\")) {\n edge.data.x! -= minX;\n }\n if (edge.data.hasOwnProperty(\"y\")) {\n edge.data.y! -= minY;\n }\n });\n\n return {\n width: maxX - minX! + marginX,\n height: maxY - minY! + marginY,\n };\n};\n\nconst assignNodeIntersects = (g: IGraph) => {\n g.getAllEdges().forEach((e) => {\n const nodeV = g.getNode(e.source)!;\n const nodeW = g.getNode(e.target)!;\n let p1: Point;\n let p2: Point;\n if (!e.data.points) {\n e.data.points = [];\n p1 = { x: nodeW.data.x!, y: nodeW.data.y! };\n p2 = { x: nodeV.data.x!, y: nodeV.data.y! };\n } else {\n p1 = e.data.points[0];\n p2 = e.data.points[e.data.points.length - 1];\n }\n\n e.data.points.unshift(intersectRect(nodeV.data, p1));\n e.data.points.push(intersectRect(nodeW.data, p2));\n });\n};\n\nconst fixupEdgeLabelCoords = (g: IGraph) => {\n g.getAllEdges().forEach((edge) => {\n if (edge.data.hasOwnProperty(\"x\")) {\n if (edge.data.labelpos === \"l\" || edge.data.labelpos === \"r\") {\n edge.data.width! -= edge.data.labeloffset!;\n }\n switch (edge.data.labelpos) {\n case \"l\":\n edge.data.x! -= edge.data.width! / 2 + edge.data.labeloffset!;\n break;\n case \"r\":\n edge.data.x! += edge.data.width! / 2 + edge.data.labeloffset!;\n break;\n }\n }\n });\n};\n\nconst reversePointsForReversedEdges = (g: IGraph) => {\n g.getAllEdges().forEach((edge) => {\n if (edge.data.reversed) {\n edge.data.points?.reverse();\n }\n });\n};\n\nconst removeBorderNodes = (g: IGraph) => {\n g.getAllNodes().forEach((v) => {\n if (g.getChildren(v.id)?.length) {\n const node = g.getNode(v.id)!;\n const t = g.getNode(node.data.borderTop as ID);\n const b = g.getNode(node.data.borderBottom as ID);\n const l = g.getNode(\n (node.data.borderLeft as ID[])[\n (node.data.borderLeft as ID[])?.length - 1\n ]\n );\n const r = g.getNode(\n (node.data.borderRight as ID[])[\n (node.data.borderRight as ID[])?.length - 1\n ]\n );\n\n node.data.width = Math.abs(r?.data.x! - l?.data.x!) || 10;\n node.data.height = Math.abs(b?.data.y! - t?.data.y!) || 10;\n node.data.x = (l?.data.x! || 0) + node.data.width! / 2;\n node.data.y = (t?.data.y! || 0) + node.data.height! / 2;\n }\n });\n\n g.getAllNodes().forEach((n) => {\n if (n.data.dummy === \"border\") {\n g.removeNode(n.id);\n }\n });\n};\n\nconst removeSelfEdges = (g: IGraph) => {\n g.getAllEdges().forEach((e) => {\n if (e.source === e.target) {\n const node = g.getNode(e.source)!;\n if (!node.data.selfEdges) {\n node.data.selfEdges = [];\n }\n node.data.selfEdges.push(e);\n g.removeEdge(e.id);\n }\n });\n};\n\nconst insertSelfEdges = (g: IGraph) => {\n const layers = buildLayerMatrix(g);\n layers?.forEach((layer: ID[]) => {\n let orderShift = 0;\n layer?.forEach((v: ID, i: number) => {\n const node = g.getNode(v)!;\n node.data.order = i + orderShift;\n node.data.selfEdges?.forEach((selfEdge) => {\n addDummyNode(\n g,\n \"selfedge\",\n {\n width: selfEdge.data.width,\n height: selfEdge.data.height,\n rank: node.data.rank,\n order: i + ++orderShift,\n e: selfEdge,\n },\n \"_se\"\n );\n });\n delete node.data.selfEdges;\n });\n });\n};\n\nconst positionSelfEdges = (g: IGraph) => {\n g.getAllNodes().forEach((v) => {\n const node = g.getNode(v.id)!;\n if (node.data.dummy === \"selfedge\") {\n const selfNode = g.getNode(node.data.e!.source)!;\n const x = selfNode.data.x! + selfNode.data.width! / 2;\n const y = selfNode.data.y!;\n const dx = node.data.x! - x;\n const dy = selfNode.data.height! / 2;\n\n if (g.hasEdge(node.data.e!.id)) {\n g.updateEdgeData(node.data.e!.id, node.data.e!.data);\n } else {\n g.addEdge({\n id: node.data.e!.id,\n source: node.data.e!.source,\n target: node.data.e!.target,\n data: node.data.e!.data,\n });\n }\n g.removeNode(v.id);\n\n node.data.e!.data.points = [\n { x: x + (2 * dx) / 3, y: y - dy },\n { x: x + (5 * dx) / 6, y: y - dy },\n { y, x: x + dx },\n { x: x + (5 * dx) / 6, y: y + dy },\n { x: x + (2 * dx) / 3, y: y + dy },\n ];\n\n node.data.e!.data.x = node.data.x;\n node.data.e!.data.y = node.data.y;\n }\n });\n};\n\nconst selectNumberAttrs = (obj: Record<string, any>, attrs: string[]) => {\n const pickedProperties: Record<string, any> = {};\n attrs?.forEach((key: string) => {\n if (obj[key] === undefined) return;\n pickedProperties[key] = +obj[key];\n });\n return pickedProperties;\n};\n\nconst canonicalize = (attrs: Record<string, any> = {}) => {\n const newAttrs: Record<string, any> = {};\n Object.keys(attrs).forEach((k: string) => {\n newAttrs[k.toLowerCase()] = attrs[k];\n });\n return newAttrs;\n};\n","import { Edge, ID } from \"@antv/graphlib\";\nimport { EdgeData, Graph as IGraph } from \"../types\";\n\ntype OrderItem = { low: number; lim: number };\n\n// deep first search with both order low for pre, lim for post\nconst dfsBothOrder = (g: IGraph) => {\n const result: Record<ID, OrderItem> = {};\n let lim = 0;\n\n const dfs = (v: ID) => {\n const low = lim;\n g.getChildren(v).forEach((n) => dfs(n.id));\n result[v] = { low, lim: lim++ };\n };\n g.getRoots().forEach((n) => dfs(n.id));\n\n return result;\n};\n\n// Find a path from v to w through the lowest common ancestor (LCA). Return the\n// full path and the LCA.\nconst findPath = (\n g: IGraph,\n postorderNums: Record<ID, OrderItem>,\n v: ID,\n w: ID\n) => {\n const vPath: ID[] = [];\n const wPath: ID[] = [];\n const low = Math.min(postorderNums[v].low, postorderNums[w].low);\n const lim = Math.max(postorderNums[v].lim, postorderNums[w].lim);\n let parent: ID | undefined;\n let lca: ID | undefined;\n\n // Traverse up from v to find the LCA\n parent = v;\n do {\n parent = g.getParent(parent)?.id;\n vPath.push(parent!);\n } while (\n parent &&\n (postorderNums[parent].low > low || lim > postorderNums[parent].lim)\n );\n lca = parent;\n\n // Traverse from w to LCA\n parent = w;\n while (parent && parent !== lca) {\n wPath.push(parent);\n parent = g.getParent(parent)?.id;\n }\n\n return { lca, path: vPath.concat(wPath.reverse()) };\n};\n\nexport const parentDummyChains = (g: IGraph, dummyChains: ID[]) => {\n const postorderNums = dfsBothOrder(g);\n\n dummyChains.forEach((startV) => {\n let v = startV;\n let node = g.getNode(v)!;\n const originalEdge = node.data.originalEdge as Edge<EdgeData>;\n if (!originalEdge) return;\n const pathData = findPath(\n g,\n postorderNums,\n originalEdge.source,\n originalEdge.target\n );\n const path = pathData.path;\n const lca = pathData.lca;\n let pathIdx = 0;\n let pathV = path[pathIdx]!;\n let ascending = true;\n\n while (v !== originalEdge.target) {\n node = g.getNode(v)!;\n\n if (ascending) {\n while (\n pathV !== lca &&\n g.getNode(pathV)?.data.maxRank! < node.data.rank!\n ) {\n pathIdx++;\n pathV = path[pathIdx]!;\n }\n\n if (pathV === lca) {\n ascending = false;\n }\n }\n\n if (!ascending) {\n while (\n pathIdx < path.length - 1 &&\n g.getNode(path[pathIdx + 1]!)?.data.minRank! <= node.data.rank!\n ) {\n pathIdx++;\n }\n pathV = path[pathIdx]!;\n }\n\n if (g.hasNode(pathV)) {\n g.setParent(v, pathV);\n }\n\n v = g.getSuccessors(v)![0].id;\n }\n });\n};\n","import { ID } from \"@antv/graphlib\";\nimport { Graph } from \"../../types\";\n\n/**\n * 按照数据中的结果设置fixorder\n */\nexport const initDataOrder = (g: Graph, nodeOrder?: ID[]) => {\n const simpleNodes = g.getAllNodes().filter((v) => {\n return !g.getChildren(v.id)?.length;\n });\n const ranks = simpleNodes.map((v) => v.data.rank!);\n const maxRank = Math.max(...ranks);\n const layers: ID[][] = [];\n for (let i = 0; i < maxRank + 1; i++) {\n layers[i] = [];\n }\n\n nodeOrder?.forEach((n) => {\n const node = g.getNode(n);\n // 只考虑原有节点，dummy节点需要按照后续算法排出\n if (!node || node.data.dummy) {\n return;\n }\n if (!isNaN(node.data.rank!)) {\n node.data.fixorder = layers[node.data.rank!].length; // 设置fixorder为当层的顺序\n layers[node.data.rank!].push(n);\n }\n });\n};\n","import { Graph } from \"@antv/graphlib\";\nimport { isNumber } from \"@antv/util\";\nimport { layout } from \"./dagre/layout\";\nimport type {\n Graph as IGraph,\n Layout,\n LayoutMapping,\n OutNode,\n Node,\n Edge,\n DagreLayoutOptions,\n NodeData,\n EdgeData,\n Point,\n} from \"./types\";\nimport { cloneFormatData, formatNumberFn, formatNodeSize } from \"./util\";\n\nconst DEFAULTS_LAYOUT_OPTIONS: Partial<DagreLayoutOptions> = {\n rankdir: \"TB\",\n nodesep: 50, // 节点水平间距(px)\n ranksep: 50, // 每一层节点之间间距\n edgeLabelSpace: true,\n controlPoints: false, // 是否保留布局连线的控制点\n radial: false, // 是否基于 dagre 进行辐射布局\n focusNode: null, // radial 为 true 时生效，关注的节点\n};\n\n/**\n * Layout arranging the nodes in a circle.\n *\n * @example\n * // Assign layout options when initialization.\n * const layout = new CircularLayout({ radius: 10 });\n * const positions = await layout.execute(graph); // { nodes: [], edges: [] }\n *\n * // Or use different options later.\n * const layout = new CircularLayout({ radius: 10 });\n * const positions = await layout.execute(graph, { radius: 20 }); // { nodes: [], edges: [] }\n *\n * // If you want to assign the positions directly to the nodes, use assign method.\n * await layout.assign(graph, { radius: 20 });\n */\nexport class DagreLayout implements Layout<DagreLayoutOptions> {\n id = \"dagre\";\n\n constructor(public options: DagreLayoutOptions = {} as DagreLayoutOptions) {\n this.options = {\n ...DEFAULTS_LAYOUT_OPTIONS,\n ...options,\n };\n }\n\n /**\n * Return the positions of nodes and edges(if needed).\n */\n async execute(graph: IGraph, options?: DagreLayoutOptions) {\n return this.genericDagreLayout(false, graph, options);\n }\n\n /**\n * To directly assign the positions to the nodes.\n */\n async assign(graph: IGraph, options?: DagreLayoutOptions) {\n await this.genericDagreLayout(true, graph, options);\n }\n\n private async genericDagreLayout(\n assign: false,\n graph: IGraph,\n options?: DagreLayoutOptions\n ): Promise<LayoutMapping>;\n private async genericDagreLayout(\n assign: true,\n graph: IGraph,\n options?: DagreLayoutOptions\n ): Promise<void>;\n private async genericDagreLayout(\n assign: boolean,\n graph: IGraph,\n options?: DagreLayoutOptions\n ): Promise<LayoutMapping | void> {\n const mergedOptions = { ...this.options, ...options };\n const {\n nodeSize,\n align,\n rankdir = \"TB\",\n ranksep,\n nodesep,\n ranksepFunc,\n nodesepFunc,\n edgeLabelSpace,\n nodeOrder,\n begin,\n controlPoints,\n radial,\n // focusNode,\n // prevGraph,\n } = mergedOptions;\n\n const g = new Graph<NodeData, EdgeData>({\n tree: [],\n });\n\n const ranksepfunc = formatNumberFn(ranksep || 50, ranksepFunc);\n const nodesepfunc = formatNumberFn(nodesep || 50, nodesepFunc);\n let horisep: (d?: Node | undefined) => number = nodesepfunc;\n let vertisep: (d?: Node | undefined) => number = ranksepfunc;\n if (rankdir === \"LR\" || rankdir === \"RL\") {\n horisep = ranksepfunc;\n vertisep = nodesepfunc;\n }\n const nodeSizeFunc = formatNodeSize(nodeSize, undefined);\n\n // copy graph to g\n const nodes: Node[] = graph.getAllNodes();\n const edges: Edge[] = graph.getAllEdges();\n\n nodes\n .filter((node) => node.data.layout)\n .forEach((node) => {\n const size = nodeSizeFunc(node);\n const verti = vertisep(node);\n const hori = horisep(node);\n // FIXME: support 2 dimensions?\n // const width = size[0] + 2 * hori;\n // const height = size[1] + 2 * verti;\n const width = size + 2 * hori;\n const height = size + 2 * verti;\n const layer = node.data.layer;\n if (isNumber(layer)) {\n // 如果有layer属性，加入到node的label中\n g.addNode({\n id: node.id,\n data: { width, height, layer },\n });\n } else {\n g.addNode({\n id: node.id,\n data: { width, height },\n });\n }\n\n // TODO: combo\n // if (this.sortByCombo && node.comboId) {\n // if (!comboMap[node.comboId]) {\n // comboMap[node.comboId] = { id: node.comboId };\n // g.setNode(node.comboId, {});\n // }\n // g.setParent(node.id, node.comboId);\n // }\n });\n\n edges.forEach((edge) => {\n // dagrejs Wiki https://github.com/dagrejs/dagre/wiki#configuring-the-layout\n if (\n this.layoutNode(g.getNode(edge.source)) &&\n this.layoutNode(g.getNode(edge.target))\n ) {\n g.addEdge({\n id: edge.id,\n source: edge.source,\n target: edge.target,\n data: {\n weight: edge.data.weight || 1,\n },\n });\n }\n });\n\n // TODO: combo & prevGraph\n layout(g, {\n prevGraph: null,\n edgeLabelSpace,\n keepNodeOrder: !!nodeOrder,\n nodeOrder: nodeOrder || [],\n acyclicer: \"greedy\",\n ranker: \"network-simplex\",\n rankdir,\n nodesep,\n align,\n });\n\n const layoutTopLeft = [0, 0];\n if (begin) {\n let minX = Infinity;\n let minY = Infinity;\n g.getAllNodes().forEach((node) => {\n if (minX > node.data.x!) minX = node.data.x!;\n if (minY > node.data.y!) minY = node.data.y!;\n });\n g.getAllEdges().forEach((edge) => {\n edge.data.points?.forEach((point) => {\n if (minX > point.x) minX = point.x;\n if (minY > point.y) minY = point.y;\n });\n });\n layoutTopLeft[0] = begin[0] - minX;\n layoutTopLeft[1] = begin[1] - minY;\n }\n\n const isHorizontal = rankdir === \"LR\" || rankdir === \"RL\";\n if (radial) {\n // const focusId = (isString(focusNode) ? focusNode : focusNode?.id) as ID;\n // const focusLayer = focusId ? g.getNode(focusId)?.data._rank as number : 0;\n // const layers: any[] = [];\n // const dim = isHorizontal ? \"y\" : \"x\";\n // const sizeDim = isHorizontal ? \"height\" : \"width\";\n // // 找到整个图作为环的坐标维度（dim）的最大、最小值，考虑节点宽度\n // let min = Infinity;\n // let max = -Infinity;\n // g.getAllNodes().forEach((node) => {\n // const currentNodesep = nodesepfunc(node);\n // if (focusLayer === 0) {\n // if (!layers[node.data._rank!]) {\n // layers[node.data._rank!] = {\n // nodes: [],\n // totalWidth: 0,\n // maxSize: -Infinity,\n // };\n // }\n // layers[node.data._rank!].nodes.push(node);\n // layers[node.data._rank!].totalWidth += currentNodesep * 2 + node.data[sizeDim]!;\n // if (\n // layers[node.data._rank!].maxSize < Math.max(node.data.width!, node.data.height!)\n // ) {\n // layers[node.data._rank!].maxSize = Math.max(node.data.width!, node.data.height!);\n // }\n // } else {\n // const diffLayer = node.data._rank! - focusLayer!;\n // if (diffLayer === 0) {\n // if (!layers[diffLayer]) {\n // layers[diffLayer] = {\n // nodes: [],\n // totalWidth: 0,\n // maxSize: -Infinity,\n // };\n // }\n // layers[diffLayer].nodes.push(node);\n // layers[diffLayer].totalWidth += currentNodesep * 2 + node.data[sizeDim]!;\n // if (\n // layers[diffLayer].maxSize < Math.max(node.data.width!, node.data.height!)\n // ) {\n // layers[diffLayer].maxSize = Math.max(node.data.width!, node.data.height!);\n // }\n // } else {\n // const diffLayerAbs = Math.abs(diffLayer);\n // if (!layers[diffLayerAbs]) {\n // layers[diffLayerAbs] = {\n // left: [],\n // right: [],\n // totalWidth: 0,\n // maxSize: -Infinity,\n // };\n // }\n // layers[diffLayerAbs].totalWidth +=\n // currentNodesep * 2 + node.data[sizeDim]!;\n // if (\n // layers[diffLayerAbs].maxSize < Math.max(node.data.width!, node.data.height!)\n // ) {\n // layers[diffLayerAbs].maxSize = Math.max(\n // node.data.width!,\n // node.data.height!\n // );\n // }\n // if (diffLayer < 0) {\n // layers[diffLayerAbs].left.push(node);\n // } else {\n // layers[diffLayerAbs].right.push(node);\n // }\n // }\n // }\n // const leftPos = node.data[dim]! - node.data[sizeDim]! / 2 - currentNodesep;\n // const rightPos = node.data[dim]! + node.data[sizeDim]! / 2 + currentNodesep;\n // if (leftPos < min) min = leftPos;\n // if (rightPos > max) max = rightPos;\n // });\n // // const padding = (max - min) * 0.1; // TODO\n // // 初始化为第一圈的半径，后面根据每层 ranksep 叠加\n // let radius = ranksep || 50; // TODO;\n // const radiusMap: any = {};\n // // 扩大最大最小值范围，以便为环上留出接缝处的空隙\n // const rangeLength = (max - min) / 0.9;\n // const range = [\n // (min + max - rangeLength) * 0.5,\n // (min + max + rangeLength) * 0.5,\n // ];\n // // 根据半径、分布比例，计算节点在环上的位置，并返回该组节点中最大的 ranksep 值\n // const processNodes = (\n // layerNodes: any,\n // radius: number,\n // propsMaxRanksep = -Infinity,\n // arcRange = [0, 1]\n // ) => {\n // let maxRanksep = propsMaxRanksep;\n // layerNodes.forEach((node: any) => {\n // const coord = g.node(node);\n // radiusMap[node] = radius;\n // // 获取变形为 radial 后的直角坐标系坐标\n // const { x: newX, y: newY } = getRadialPos(\n // coord![dim]!,\n // range,\n // rangeLength,\n // radius,\n // arcRange\n // );\n // // 将新坐标写入源数据\n // const i = nodes.findIndex((it) => it.id === node);\n // if (!nodes[i]) return;\n // nodes[i].x = newX + dBegin[0];\n // nodes[i].y = newY + dBegin[1];\n // // @ts-ignore: pass layer order to data for increment layout use\n // nodes[i]._order = coord._order;\n // // 找到本层最大的一个 ranksep，作为下一层与本层的间隙，叠加到下一层的半径上\n // const currentNodeRanksep = ranksepfunc(nodes[i]);\n // if (maxRanksep < currentNodeRanksep) maxRanksep = currentNodeRanksep;\n // });\n // return maxRanksep;\n // };\n // let isFirstLevel = true;\n // const lastLayerMaxNodeSize = 0;\n // layers.forEach((layerNodes) => {\n // if (\n // !layerNodes?.nodes?.length &&\n // !layerNodes?.left?.length &&\n // !layerNodes?.right?.length\n // ) {\n // return;\n // }\n // // 第一层只有一个节点，直接放在圆心，初始半径设定为 0\n // if (isFirstLevel && layerNodes.nodes.length === 1) {\n // // 将新坐标写入源数据\n // const i = nodes.findIndex((it) => it.id === layerNodes.nodes[0]);\n // if (i <= -1) return;\n // nodes[i].x = dBegin[0];\n // nodes[i].y = dBegin[1];\n // radiusMap[layerNodes.nodes[0]] = 0;\n // radius = ranksepfunc(nodes[i]);\n // isFirstLevel = false;\n // return;\n // }\n // // 为接缝留出空隙，半径也需要扩大\n // radius = Math.max(radius, layerNodes.totalWidth / (2 * Math.PI)); // / 0.9;\n // let maxRanksep = -Infinity;\n // if (focusLayer === 0 || layerNodes.nodes?.length) {\n // maxRanksep = processNodes(\n // layerNodes.nodes,\n // radius,\n // maxRanksep,\n // [0, 1]\n // ); // 0.8\n // } else {\n // const leftRatio =\n // layerNodes.left?.length /\n // (layerNodes.left?.length + layerNodes.right?.length);\n // maxRanksep = processNodes(layerNodes.left, radius, maxRanksep, [\n // 0,\n // leftRatio,\n // ]); // 接缝留出 0.05 的缝隙\n // maxRanksep = processNodes(layerNodes.right, radius, maxRanksep, [\n // leftRatio + 0.05,\n // 1,\n // ]); // 接缝留出 0.05 的缝隙\n // }\n // radius += maxRanksep;\n // isFirstLevel = false;\n // lastLayerMaxNodeSize - layerNodes.maxSize;\n // });\n // g.edges().forEach((edge: any) => {\n // const coord = g.edge(edge);\n // const i = edges.findIndex((it) => {\n // const source = getEdgeTerminal(it, \"source\");\n // const target = getEdgeTerminal(it, \"target\");\n // return source === edge.v && target === edge.w;\n // });\n // if (i <= -1) return;\n // if (\n // self.edgeLabelSpace &&\n // self.controlPoints &&\n // edges[i].type !== \"loop\"\n // ) {\n // const otherDim = dim === \"x\" ? \"y\" : \"x\";\n // const controlPoints = coord?.points?.slice(\n // 1,\n // coord.points.length - 1\n // );\n // const newControlPoints: Point[] = [];\n // const sourceOtherDimValue = g.node(edge.v)?.[otherDim]!;\n // const otherDimDist =\n // sourceOtherDimValue - g.node(edge.w)?.[otherDim]!;\n // const sourceRadius = radiusMap[edge.v];\n // const radiusDist = sourceRadius - radiusMap[edge.w];\n // controlPoints?.forEach((point: any) => {\n // // 根据该边的起点、终点半径，及起点、终点、控制点位置关系，确定该控制点的半径\n // const cRadius =\n // ((point[otherDim] - sourceOtherDimValue) / otherDimDist) *\n // radiusDist +\n // sourceRadius;\n // // 获取变形为 radial 后的直角坐标系坐标\n // const newPos = getRadialPos(\n // point[dim],\n // range,\n // rangeLength,\n // cRadius\n // );\n // newControlPoints.push({\n // x: newPos.x + dBegin[0],\n // y: newPos.y + dBegin[1],\n // });\n // });\n // edges[i].controlPoints = newControlPoints;\n // }\n // });\n } else {\n const layerCoords: Set<number> = new Set();\n const isInvert = rankdir === \"BT\" || rankdir === \"RL\";\n const layerCoordSort = isInvert\n ? (a: number, b: number) => b - a\n : (a: number, b: number) => a - b;\n g.getAllNodes().forEach((node) => {\n // let ndata: any = this.nodeMap[node];\n // if (!ndata) {\n // ndata = combos?.find((it) => it.id === node);\n // }\n // if (!ndata) return;\n // ndata.x = node.data.x! + dBegin[0];\n // ndata.y = node.data.y! + dBegin[1];\n // // pass layer order to data for increment layout use\n // ndata._order = node.data._order;\n // layerCoords.add(isHorizontal ? ndata.x : ndata.y);\n\n node.data.x = node.data.x! + layoutTopLeft[0];\n node.data.y = node.data.y! + layoutTopLeft[1];\n layerCoords.add(isHorizontal ? node.data.x : node.data.y);\n });\n const layerCoordsArr = Array.from(layerCoords).sort(layerCoordSort);\n\n // pre-define the isHorizontal related functions to avoid redundant calc in interations\n const isDifferentLayer = isHorizontal\n ? (point1: Point, point2: Point) => point1.x !== point2.x\n : (point1: Point, point2: Point) => point1.y !== point2.y;\n const filterControlPointsOutOfBoundary = isHorizontal\n ? (ps: Point[], point1: Point, point2: Point) => {\n const max = Math.max(point1.y, point2.y);\n const min = Math.min(point1.y, point2.y);\n return ps.filter((point) => point.y <= max && point.y >= min);\n }\n : (ps: Point[], point1: Point, point2: Point) => {\n const max = Math.max(point1.x, point2.x);\n const min = Math.min(point1.x, point2.x);\n return ps.filter((point) => point.x <= max && point.x >= min);\n };\n\n g.getAllEdges().forEach((edge, i) => {\n // const i = edges.findIndex((it) => {\n // return it.source === edge.source && it.target === edge.target;\n // });\n // if (i <= -1) return;\n if (edgeLabelSpace && controlPoints && edge.data.type !== \"loop\") {\n edge.data.controlPoints = getControlPoints(\n edge.data.points?.map(({ x, y }) => ({\n x: x + layoutTopLeft[0],\n y: y + layoutTopLeft[1],\n })),\n g.getNode(edge.source),\n g.getNode(edge.target),\n layerCoordsArr,\n isHorizontal,\n isDifferentLayer,\n filterControlPointsOutOfBoundary\n );\n }\n });\n }\n\n // calculated nodes as temporary result\n let layoutNodes: OutNode[] = [];\n // layout according to the original order in the data.nodes\n layoutNodes = g\n .getAllNodes()\n .map((node) => cloneFormatData(node) as OutNode);\n const layoutEdges = g.getAllEdges();\n\n if (assign) {\n layoutNodes.forEach((node) => {\n graph.mergeNodeData(node.id, {\n x: node.data.x,\n y: node.data.y,\n });\n });\n layoutEdges.forEach((edge) => {\n graph.mergeEdgeData(edge.id, {\n controlPoints: edge.data.controlPoints,\n });\n });\n }\n\n const result = {\n nodes: layoutNodes,\n edges: layoutEdges,\n };\n\n return result;\n }\n\n layoutNode = (node: Node) => {\n return node.data.layout;\n }\n}\n\n/**\n * Format controlPoints to avoid polylines crossing nodes\n * @param points\n * @param sourceNode\n * @param targetNode\n * @param layerCoordsArr\n * @param isHorizontal\n * @returns\n */\nconst getControlPoints = (\n points: Point[] | undefined,\n sourceNode: Node,\n targetNode: Node,\n layerCoordsArr: number[],\n isHorizontal: boolean,\n isDifferentLayer: (point1: Point, point2: Point) => boolean,\n filterControlPointsOutOfBoundary: (\n ps: Point[],\n point1: Point,\n point2: Point\n ) => Point[]\n) => {\n let controlPoints = points?.slice(1, points.length - 1) || []; // 去掉头尾\n // 酌情增加控制点，使折线不穿过跨层的节点\n if (sourceNode && targetNode) {\n let { x: sourceX, y: sourceY } = sourceNode.data;\n let { x: targetX, y: targetY } = targetNode.data;\n if (isHorizontal) {\n sourceX = sourceNode.data.y;\n sourceY = sourceNode.data.x;\n targetX = targetNode.data.y;\n targetY = targetNode.data.x;\n }\n // 为跨层级的边增加第一个控制点。忽略垂直的/横向的边。\n // 新控制点 = {\n // x: 终点x,\n // y: (起点y + 下一层y) / 2, #下一层y可能不等于终点y\n // }\n if (targetY !== sourceY && sourceX !== targetX) {\n const sourceLayer = layerCoordsArr.indexOf(sourceY!);\n const sourceNextLayerCoord = layerCoordsArr[sourceLayer + 1];\n if (sourceNextLayerCoord) {\n const firstControlPoint = controlPoints[0];\n const insertStartControlPoint = (\n isHorizontal\n ? {\n x: (sourceY! + sourceNextLayerCoord) / 2,\n y: firstControlPoint?.y || targetX,\n }\n : {\n x: firstControlPoint?.x || targetX,\n y: (sourceY! + sourceNextLayerCoord) / 2,\n }\n ) as Point;\n // 当新增的控制点不存在（!=当前第一个控制点）时添加\n if (\n !firstControlPoint ||\n isDifferentLayer(firstControlPoint, insertStartControlPoint)\n ) {\n controlPoints.unshift(insertStartControlPoint);\n }\n }\n\n const targetLayer = layerCoordsArr.indexOf(targetY!);\n const layerDiff = Math.abs(targetLayer - sourceLayer);\n if (layerDiff === 1) {\n controlPoints = filterControlPointsOutOfBoundary(\n controlPoints,\n sourceNode.data as Point,\n targetNode.data as Point\n );\n // one controlPoint at least\n if (!controlPoints.length) {\n controlPoints.push(\n (isHorizontal\n ? {\n x: (sourceY! + targetY!) / 2,\n y: sourceX,\n }\n : {\n x: sourceX,\n y: (sourceY! + targetY!) / 2,\n }) as Point\n );\n }\n } else if (layerDiff > 1) {\n const targetLastLayerCoord = layerCoordsArr[targetLayer - 1];\n if (targetLastLayerCoord) {\n const lastControlPoints = controlPoints[controlPoints.length - 1];\n const insertEndControlPoint = (\n isHorizontal\n ? {\n x: (targetY! + targetLastLayerCoord) / 2,\n y: lastControlPoints?.y || targetX,\n }\n : {\n x: lastControlPoints?.x || sourceX,\n y: (targetY! + targetLastLayerCoord) / 2,\n }\n ) as Point;\n // 当新增的控制点不存在（!=当前最后一个控制点）时添加\n if (\n !lastControlPoints ||\n isDifferentLayer(lastControlPoints, insertEndControlPoint)\n ) {\n controlPoints.push(insertEndControlPoint);\n }\n }\n }\n }\n }\n return controlPoints;\n};\n","// isFinite,\nvar isNil = function (value) {\n /**\n * isNil(null) => true\n * isNil() => true\n */\n return value === null || value === undefined;\n};\nexport default isNil;\n//# sourceMappingURL=is-nil.js.map","export default function(d) {\n const x = +this._x.call(null, d),\n y = +this._y.call(null, d),\n z = +this._z.call(null, d);\n return add(this.cover(x, y, z), x, y, z, d);\n}\n\nfunction add(tree, x, y, z, d) {\n if (isNaN(x) || isNaN(y) || isNaN(z)) return tree; // ignore invalid points\n\n var parent,\n node = tree._root,\n leaf = {data: d},\n x0 = tree._x0,\n y0 = tree._y0,\n z0 = tree._z0,\n x1 = tree._x1,\n y1 = tree._y1,\n z1 = tree._z1,\n xm,\n ym,\n zm,\n xp,\n yp,\n zp,\n right,\n bottom,\n deep,\n i,\n j;\n\n // If the tree is empty, initialize the root as a leaf.\n if (!node) return tree._root = leaf, tree;\n\n // Find the existing leaf for the new point, or add it.\n while (node.length) {\n if (right = x >= (xm = (x0 + x1) / 2)) x0 = xm; else x1 = xm;\n if (bottom = y >= (ym = (y0 + y1) / 2)) y0 = ym; else y1 = ym;\n if (deep = z >= (zm = (z0 + z1) / 2)) z0 = zm; else z1 = zm;\n if (parent = node, !(node = node[i = deep << 2 | bottom << 1 | right])) return parent[i] = leaf, tree;\n }\n\n // Is the new point is exactly coincident with the existing point?\n xp = +tree._x.call(null, node.data);\n yp = +tree._y.call(null, node.data);\n zp = +tree._z.call(null, node.data);\n if (x === xp && y === yp && z === zp) return leaf.next = node, parent ? parent[i] = leaf : tree._root = leaf, tree;\n\n // Otherwise, split the leaf node until the old and new point are separated.\n do {\n parent = parent ? parent[i] = new Array(8) : tree._root = new Array(8);\n if (right = x >= (xm = (x0 + x1) / 2)) x0 = xm; else x1 = xm;\n if (bottom = y >= (ym = (y0 + y1) / 2)) y0 = ym; else y1 = ym;\n if (deep = z >= (zm = (z0 + z1) / 2)) z0 = zm; else z1 = zm;\n } while ((i = deep << 2 | bottom << 1 | right) === (j = (zp >= zm) << 2 | (yp >= ym) << 1 | (xp >= xm)));\n return parent[j] = node, parent[i] = leaf, tree;\n}\n\nexport function addAll(data) {\n if (!Array.isArray(data)) data = Array.from(data);\n const n = data.length;\n const xz = new Float64Array(n);\n const yz = new Float64Array(n);\n const zz = new Float64Array(n);\n let x0 = Infinity,\n y0 = Infinity,\n z0 = Infinity,\n x1 = -Infinity,\n y1 = -Infinity,\n z1 = -Infinity;\n\n // Compute the points and their extent.\n for (let i = 0, d, x, y, z; i < n; ++i) {\n if (isNaN(x = +this._x.call(null, d = data[i])) || isNaN(y = +this._y.call(null, d)) || isNaN(z = +this._z.call(null, d))) continue;\n xz[i] = x;\n yz[i] = y;\n zz[i] = z;\n if (x < x0) x0 = x;\n if (x > x1) x1 = x;\n if (y < y0) y0 = y;\n if (y > y1) y1 = y;\n if (z < z0) z0 = z;\n if (z > z1) z1 = z;\n }\n\n // If there were no (valid) points, abort.\n if (x0 > x1 || y0 > y1 || z0 > z1) return this;\n\n // Expand the tree to cover the new points.\n this.cover(x0, y0, z0).cover(x1, y1, z1);\n\n // Add the new points.\n for (let i = 0; i < n; ++i) {\n add(this, xz[i], yz[i], zz[i], data[i]);\n }\n\n return this;\n}\n","export default function(node, x0, y0, z0, x1, y1, z1) {\n this.node = node;\n this.x0 = x0;\n this.y0 = y0;\n this.z0 = z0;\n this.x1 = x1;\n this.y1 = y1;\n this.z1 = z1;\n}\n","export function defaultX(d) {\n return d[0];\n}\n\nexport default function(_) {\n return arguments.length ? (this._x = _, this) : this._x;\n}\n","export function defaultY(d) {\n return d[1];\n}\n\nexport default function(_) {\n return arguments.length ? (this._y = _, this) : this._y;\n}\n","export function defaultZ(d) {\n return d[2];\n}\n\nexport default function(_) {\n return arguments.length ? (this._z = _, this) : this._z;\n}\n","import tree_add, {addAll as tree_addAll} from \"./add.js\";\nimport tree_cover from \"./cover.js\";\nimport tree_data from \"./data.js\";\nimport tree_extent from \"./extent.js\";\nimport tree_find from \"./find.js\";\nimport tree_remove, {removeAll as tree_removeAll} from \"./remove.js\";\nimport tree_root from \"./root.js\";\nimport tree_size from \"./size.js\";\nimport tree_visit from \"./visit.js\";\nimport tree_visitAfter from \"./visitAfter.js\";\nimport tree_x, {defaultX} from \"./x.js\";\nimport tree_y, {defaultY} from \"./y.js\";\nimport tree_z, {defaultZ} from \"./z.js\";\n\nexport default function octree(nodes, x, y, z) {\n var tree = new Octree(x == null ? defaultX : x, y == null ? defaultY : y, z == null ? defaultZ : z, NaN, NaN, NaN, NaN, NaN, NaN);\n return nodes == null ? tree : tree.addAll(nodes);\n}\n\nfunction Octree(x, y, z, x0, y0, z0, x1, y1, z1) {\n this._x = x;\n this._y = y;\n this._z = z;\n this._x0 = x0;\n this._y0 = y0;\n this._z0 = z0;\n this._x1 = x1;\n this._y1 = y1;\n this._z1 = z1;\n this._root = undefined;\n}\n\nfunction leaf_copy(leaf) {\n var copy = {data: leaf.data}, next = copy;\n while (leaf = leaf.next) next = next.next = {data: leaf.data};\n return copy;\n}\n\nvar treeProto = octree.prototype = Octree.prototype;\n\ntreeProto.copy = function() {\n var copy = new Octree(this._x, this._y, this._z, this._x0, this._y0, this._z0, this._x1, this._y1, this._z1),\n node = this._root,\n nodes,\n child;\n\n if (!node) return copy;\n\n if (!node.length) return copy._root = leaf_copy(node), copy;\n\n nodes = [{source: node, target: copy._root = new Array(8)}];\n while (node = nodes.pop()) {\n for (var i = 0; i < 8; ++i) {\n if (child = node.source[i]) {\n if (child.length) nodes.push({source: child, target: node.target[i] = new Array(8)});\n else node.target[i] = leaf_copy(child);\n }\n }\n }\n\n return copy;\n};\n\ntreeProto.add = tree_add;\ntreeProto.addAll = tree_addAll;\ntreeProto.cover = tree_cover;\ntreeProto.data = tree_data;\ntreeProto.extent = tree_extent;\ntreeProto.find = tree_find;\ntreeProto.remove = tree_remove;\ntreeProto.removeAll = tree_removeAll;\ntreeProto.root = tree_root;\ntreeProto.size = tree_size;\ntreeProto.visit = tree_visit;\ntreeProto.visitAfter = tree_visitAfter;\ntreeProto.x = tree_x;\ntreeProto.y = tree_y;\ntreeProto.z = tree_z;\n","import { quadtree } from \"d3-quadtree\";\n// @ts-ignore\nimport { octree } from \"d3-octree\";\nimport { Point } from \"../types\";\nimport { CalcGraph } from \"./types\";\n\nconst theta2 = 0.81; // Barnes-Hut approximation threshold\nconst epsilon = 0.1; // 为了防止出现除0的情况，加一个epsilon\n\ninterface InternalNode {\n x: number;\n y: number;\n z?: number;\n vx: number;\n vy: number;\n vz?: number;\n weight: number;\n size: number;\n}\n\nexport function forceNBody(\n calcGraph: CalcGraph,\n factor: number,\n coulombDisScale2: number,\n accMap: { [id: string]: Point },\n dimensions: number,\n) {\n const weightParam = factor / coulombDisScale2;\n const calcNodes = calcGraph.getAllNodes();\n const data = calcNodes.map((calcNode, i) => {\n const { nodeStrength, x, y, z, size } = calcNode.data;\n return {\n x,\n y,\n z,\n size,\n index: i,\n vx: 0,\n vy: 0,\n vz: 0,\n weight: weightParam * nodeStrength,\n };\n });\n\n const tree = (dimensions === 2 ? quadtree(\n data,\n (d: any) => d.x,\n (d: any) => d.y\n ) : octree(\n data,\n (d: any) => d.x,\n (d: any) => d.y,\n (d: any) => d.z\n )).visitAfter(accumulate); // init internal node\n\n data.forEach((n) => {\n // @ts-ignore\n computeForce(n, tree, dimensions);\n });\n\n data.map((n, i) => {\n const { id, data } = calcNodes[i];\n const { mass = 1 } = data;\n // 从 0 开始，= 初始化 + 加斥力\n accMap[id] = {\n x: n.vx / mass,\n y: n.vy / mass,\n z: n.vz / mass,\n };\n });\n return accMap;\n}\n\nfunction accumulate(treeNode: any) {\n let accWeight = 0;\n let accX = 0;\n let accY = 0;\n let accZ = 0;\n const numChildren = treeNode.length;\n\n if (numChildren) {\n // internal node, accumulate 4 child quads\n for (let i = 0; i < numChildren; i++) {\n const q = treeNode[i];\n if (q && q.weight) {\n accWeight += q.weight;\n accX += q.x * q.weight;\n accY += q.y * q.weight;\n accZ += q.z * q.weight;\n }\n }\n treeNode.x = accX / accWeight;\n treeNode.y = accY / accWeight;\n treeNode.z = accZ / accWeight;\n treeNode.weight = accWeight;\n } else {\n // leaf node\n const q = treeNode;\n treeNode.x = q.data.x;\n treeNode.y = q.data.y;\n treeNode.z = q.data.z;\n treeNode.weight = q.data.weight;\n }\n}\n\nconst apply = (\n treeNode: any,\n x1: number,\n arg1: number,\n arg2: number,\n arg3: number,\n node: InternalNode,\n dimensions: number,\n) => {\n const x2 = [arg1, arg2, arg3][dimensions - 1];\n\n const dx = node.x - treeNode.x || epsilon;\n const dy = node.y - treeNode.y || epsilon;\n const dz = node.z - treeNode.z || epsilon;\n const width = x2 - x1;\n const len2 = dx * dx + dy * dy + dz * dz;\n const len3 = Math.sqrt(len2) * len2;\n\n // far node, apply Barnes-Hut approximation\n if (width * width * theta2 < len2) {\n const param = treeNode.weight / len3;\n node.vx += dx * param;\n node.vy += dy * param;\n node.vz += dz * param;\n return true;\n }\n // near quad, compute force directly\n if (treeNode.length) return false; // internal node, visit children\n\n // leaf node\n\n if (treeNode.data !== node) {\n const param = treeNode.data.weight / len3;\n node.vx += dx * param;\n node.vy += dy * param;\n node.vz += dz * param;\n }\n};\n\n// @ts-ignore\nfunction computeForce(node: InternalNode, tree: any, dimensions: number) {\n // @ts-ignore\n tree.visit((treeNode, x1, y1, x2, y2) => apply(treeNode, x1, y1, x2, y2, node, dimensions));\n}\n","export default function(x, y, z) {\n if (isNaN(x = +x) || isNaN(y = +y) || isNaN(z = +z)) return this; // ignore invalid points\n\n var x0 = this._x0,\n y0 = this._y0,\n z0 = this._z0,\n x1 = this._x1,\n y1 = this._y1,\n z1 = this._z1;\n\n // If the octree has no extent, initialize them.\n // Integer extent are necessary so that if we later double the extent,\n // the existing octant boundaries don’t change due to floating point error!\n if (isNaN(x0)) {\n x1 = (x0 = Math.floor(x)) + 1;\n y1 = (y0 = Math.floor(y)) + 1;\n z1 = (z0 = Math.floor(z)) + 1;\n }\n\n // Otherwise, double repeatedly to cover.\n else {\n var t = x1 - x0 || 1,\n node = this._root,\n parent,\n i;\n\n while (x0 > x || x >= x1 || y0 > y || y >= y1 || z0 > z || z >= z1) {\n i = (z < z0) << 2 | (y < y0) << 1 | (x < x0);\n parent = new Array(8), parent[i] = node, node = parent, t *= 2;\n switch (i) {\n case 0: x1 = x0 + t, y1 = y0 + t, z1 = z0 + t; break;\n case 1: x0 = x1 - t, y1 = y0 + t, z1 = z0 + t; break;\n case 2: x1 = x0 + t, y0 = y1 - t, z1 = z0 + t; break;\n case 3: x0 = x1 - t, y0 = y1 - t, z1 = z0 + t; break;\n case 4: x1 = x0 + t, y1 = y0 + t, z0 = z1 - t; break;\n case 5: x0 = x1 - t, y1 = y0 + t, z0 = z1 - t; break;\n case 6: x1 = x0 + t, y0 = y1 - t, z0 = z1 - t; break;\n case 7: x0 = x1 - t, y0 = y1 - t, z0 = z1 - t; break;\n }\n }\n\n if (this._root && this._root.length) this._root = node;\n }\n\n this._x0 = x0;\n this._y0 = y0;\n this._z0 = z0;\n this._x1 = x1;\n this._y1 = y1;\n this._z1 = z1;\n return this;\n}\n","export default function() {\n var data = [];\n this.visit(function(node) {\n if (!node.length) do data.push(node.data); while (node = node.next)\n });\n return data;\n}\n","export default function(_) {\n return arguments.length\n ? this.cover(+_[0][0], +_[0][1], +_[0][2]).cover(+_[1][0], +_[1][1], +_[1][2])\n : isNaN(this._x0) ? undefined : [[this._x0, this._y0, this._z0], [this._x1, this._y1, this._z1]];\n}\n","import Octant from \"./octant.js\";\n\nexport default function(x, y, z, radius) {\n var data,\n x0 = this._x0,\n y0 = this._y0,\n z0 = this._z0,\n x1,\n y1,\n z1,\n x2,\n y2,\n z2,\n x3 = this._x1,\n y3 = this._y1,\n z3 = this._z1,\n octs = [],\n node = this._root,\n q,\n i;\n\n if (node) octs.push(new Octant(node, x0, y0, z0, x3, y3, z3));\n if (radius == null) radius = Infinity;\n else {\n x0 = x - radius, y0 = y - radius, z0 = z - radius;\n x3 = x + radius, y3 = y + radius, z3 = z + radius;\n radius *= radius;\n }\n\n while (q = octs.pop()) {\n\n // Stop searching if this octant can’t contain a closer node.\n if (!(node = q.node)\n || (x1 = q.x0) > x3\n || (y1 = q.y0) > y3\n || (z1 = q.z0) > z3\n || (x2 = q.x1) < x0\n || (y2 = q.y1) < y0\n || (z2 = q.z1) < z0) continue;\n\n // Bisect the current octant.\n if (node.length) {\n var xm = (x1 + x2) / 2,\n ym = (y1 + y2) / 2,\n zm = (z1 + z2) / 2;\n\n octs.push(\n new Octant(node[7], xm, ym, zm, x2, y2, z2),\n new Octant(node[6], x1, ym, zm, xm, y2, z2),\n new Octant(node[5], xm, y1, zm, x2, ym, z2),\n new Octant(node[4], x1, y1, zm, xm, ym, z2),\n new Octant(node[3], xm, ym, z1, x2, y2, zm),\n new Octant(node[2], x1, ym, z1, xm, y2, zm),\n new Octant(node[1], xm, y1, z1, x2, ym, zm),\n new Octant(node[0], x1, y1, z1, xm, ym, zm)\n );\n\n // Visit the closest octant first.\n if (i = (z >= zm) << 2 | (y >= ym) << 1 | (x >= xm)) {\n q = octs[octs.length - 1];\n octs[octs.length - 1] = octs[octs.length - 1 - i];\n octs[octs.length - 1 - i] = q;\n }\n }\n\n // Visit this point. (Visiting coincident points isn’t necessary!)\n else {\n var dx = x - +this._x.call(null, node.data),\n dy = y - +this._y.call(null, node.data),\n dz = z - +this._z.call(null, node.data),\n d2 = dx * dx + dy * dy + dz * dz;\n if (d2 < radius) {\n var d = Math.sqrt(radius = d2);\n x0 = x - d, y0 = y - d, z0 = z - d;\n x3 = x + d, y3 = y + d, z3 = z + d;\n data = node.data;\n }\n }\n }\n\n return data;\n}\n","export default function(d) {\n if (isNaN(x = +this._x.call(null, d)) || isNaN(y = +this._y.call(null, d)) || isNaN(z = +this._z.call(null, d))) return this; // ignore invalid points\n\n var parent,\n node = this._root,\n retainer,\n previous,\n next,\n x0 = this._x0,\n y0 = this._y0,\n z0 = this._z0,\n x1 = this._x1,\n y1 = this._y1,\n z1 = this._z1,\n x,\n y,\n z,\n xm,\n ym,\n zm,\n right,\n bottom,\n deep,\n i,\n j;\n\n // If the tree is empty, initialize the root as a leaf.\n if (!node) return this;\n\n // Find the leaf node for the point.\n // While descending, also retain the deepest parent with a non-removed sibling.\n if (node.length) while (true) {\n if (right = x >= (xm = (x0 + x1) / 2)) x0 = xm; else x1 = xm;\n if (bottom = y >= (ym = (y0 + y1) / 2)) y0 = ym; else y1 = ym;\n if (deep = z >= (zm = (z0 + z1) / 2)) z0 = zm; else z1 = zm;\n if (!(parent = node, node = node[i = deep << 2 | bottom << 1 | right])) return this;\n if (!node.length) break;\n if (parent[(i + 1) & 7] || parent[(i + 2) & 7] || parent[(i + 3) & 7] || parent[(i + 4) & 7] || parent[(i + 5) & 7] || parent[(i + 6) & 7] || parent[(i + 7) & 7]) retainer = parent, j = i;\n }\n\n // Find the point to remove.\n while (node.data !== d) if (!(previous = node, node = node.next)) return this;\n if (next = node.next) delete node.next;\n\n // If there are multiple coincident points, remove just the point.\n if (previous) return (next ? previous.next = next : delete previous.next), this;\n\n // If this is the root point, remove it.\n if (!parent) return this._root = next, this;\n\n // Remove this leaf.\n next ? parent[i] = next : delete parent[i];\n\n // If the parent now contains exactly one leaf, collapse superfluous parents.\n if ((node = parent[0] || parent[1] || parent[2] || parent[3] || parent[4] || parent[5] || parent[6] || parent[7])\n && node === (parent[7] || parent[6] || parent[5] || parent[4] || parent[3] || parent[2] || parent[1] || parent[0])\n && !node.length) {\n if (retainer) retainer[j] = node;\n else this._root = node;\n }\n\n return this;\n}\n\nexport function removeAll(data) {\n for (var i = 0, n = data.length; i < n; ++i) this.remove(data[i]);\n return this;\n}\n","export default function() {\n return this._root;\n}\n","export default function() {\n var size = 0;\n this.visit(function(node) {\n if (!node.length) do ++size; while (node = node.next)\n });\n return size;\n}\n","import Octant from \"./octant.js\";\n\nexport default function(callback) {\n var octs = [], q, node = this._root, child, x0, y0, z0, x1, y1, z1;\n if (node) octs.push(new Octant(node, this._x0, this._y0, this._z0, this._x1, this._y1, this._z1));\n while (q = octs.pop()) {\n if (!callback(node = q.node, x0 = q.x0, y0 = q.y0, z0 = q.z0, x1 = q.x1, y1 = q.y1, z1 = q.z1) && node.length) {\n var xm = (x0 + x1) / 2, ym = (y0 + y1) / 2, zm = (z0 + z1) / 2;\n if (child = node[7]) octs.push(new Octant(child, xm, ym, zm, x1, y1, z1));\n if (child = node[6]) octs.push(new Octant(child, x0, ym, zm, xm, y1, z1));\n if (child = node[5]) octs.push(new Octant(child, xm, y0, zm, x1, ym, z1));\n if (child = node[4]) octs.push(new Octant(child, x0, y0, zm, xm, ym, z1));\n if (child = node[3]) octs.push(new Octant(child, xm, ym, z0, x1, y1, zm));\n if (child = node[2]) octs.push(new Octant(child, x0, ym, z0, xm, y1, zm));\n if (child = node[1]) octs.push(new Octant(child, xm, y0, z0, x1, ym, zm));\n if (child = node[0]) octs.push(new Octant(child, x0, y0, z0, xm, ym, zm));\n }\n }\n return this;\n}\n","import Octant from \"./octant.js\";\n\nexport default function(callback) {\n var octs = [], next = [], q;\n if (this._root) octs.push(new Octant(this._root, this._x0, this._y0, this._z0, this._x1, this._y1, this._z1));\n while (q = octs.pop()) {\n var node = q.node;\n if (node.length) {\n var child, x0 = q.x0, y0 = q.y0, z0 = q.z0, x1 = q.x1, y1 = q.y1, z1 = q.z1, xm = (x0 + x1) / 2, ym = (y0 + y1) / 2, zm = (z0 + z1) / 2;\n if (child = node[0]) octs.push(new Octant(child, x0, y0, z0, xm, ym, zm));\n if (child = node[1]) octs.push(new Octant(child, xm, y0, z0, x1, ym, zm));\n if (child = node[2]) octs.push(new Octant(child, x0, ym, z0, xm, y1, zm));\n if (child = node[3]) octs.push(new Octant(child, xm, ym, z0, x1, y1, zm));\n if (child = node[4]) octs.push(new Octant(child, x0, y0, zm, xm, ym, z1));\n if (child = node[5]) octs.push(new Octant(child, xm, y0, zm, x1, ym, z1));\n if (child = node[6]) octs.push(new Octant(child, x0, ym, zm, xm, y1, z1));\n if (child = node[7]) octs.push(new Octant(child, xm, ym, zm, x1, y1, z1));\n }\n next.push(q);\n }\n while (q = next.pop()) {\n callback(q.node, q.x0, q.y0, q.z0, q.x1, q.y1, q.z1);\n }\n return this;\n}\n","import { Graph as IGraph } from \"@antv/graphlib\";\nimport { isNumber, isObject } from \"@antv/util\";\nimport {\n Graph,\n Node,\n Edge,\n LayoutMapping,\n ForceLayoutOptions,\n Point,\n OutNode,\n LayoutWithIterations,\n} from \"../types\";\nimport { formatNumberFn, isArray } from \"../util\";\nimport { forceNBody } from \"./forceNBody\";\nimport {\n CalcNode,\n CalcEdge,\n CalcNodeData,\n CalcEdgeData,\n CalcGraph,\n FormatedOptions,\n} from \"./types\";\n\nconst DEFAULTS_LAYOUT_OPTIONS: Partial<ForceLayoutOptions> = {\n dimensions: 2,\n maxIteration: 500,\n gravity: 10,\n factor: 1,\n edgeStrength: 200,\n nodeStrength: 1000,\n coulombDisScale: 0.005,\n damping: 0.9,\n maxSpeed: 500,\n minMovement: 0.4,\n interval: 0.02,\n linkDistance: 200,\n clusterNodeStrength: 20,\n preventOverlap: true,\n distanceThresholdMode: \"mean\",\n};\n\n/**\n * Layout with faster force\n *\n * @example\n * // Assign layout options when initialization.\n * const layout = new ForceLayout({ center: [100, 100] });\n * const positions = await layout.execute(graph); // { nodes: [], edges: [] }\n *\n * // Or use different options later.\n * const layout = new ForceLayout({ center: [100, 100] });\n * const positions = await layout.execute(graph, { center: [100, 100] }); // { nodes: [], edges: [] }\n *\n * // If you want to assign the positions directly to the nodes, use assign method.\n * await layout.assign(graph, { center: [100, 100] });\n */\nexport class ForceLayout implements LayoutWithIterations<ForceLayoutOptions> {\n id = \"force\";\n /**\n * time interval for layout force animations\n */\n private timeInterval: number = 0;\n /**\n * compare with minMovement to end the nodes' movement\n */\n private judgingDistance: number = 0;\n\n private running: boolean = false;\n private lastLayoutNodes: OutNode[];\n private lastLayoutEdges: Edge[];\n private lastAssign: boolean;\n private lastCalcGraph: IGraph<CalcNodeData, CalcEdgeData>;\n private lastGraph: Graph;\n private lastOptions: FormatedOptions;\n private lastVelMap: {\n [id: string]: Point;\n };\n private lastResult: LayoutMapping;\n\n constructor(public options: ForceLayoutOptions = {} as ForceLayoutOptions) {\n this.options = {\n ...DEFAULTS_LAYOUT_OPTIONS,\n ...options,\n };\n }\n\n /**\n * Return the positions of nodes and edges(if needed).\n */\n async execute(graph: Graph, options?: ForceLayoutOptions) {\n return this.genericForceLayout(false, graph, options);\n }\n /**\n * To directly assign the positions to the nodes.\n */\n async assign(graph: Graph, options?: ForceLayoutOptions) {\n this.genericForceLayout(true, graph, options);\n }\n\n /**\n * Stop simulation immediately.\n */\n stop() {\n if (this.timeInterval && typeof window !== \"undefined\") {\n window.clearInterval(this.timeInterval);\n }\n this.running = false;\n }\n\n /**\n * Manually steps the simulation by the specified number of iterations.\n * @see https://github.com/d3/d3-force#simulation_tick\n */\n tick(iterations = this.options.maxIteration || 1) {\n if (this.lastResult) {\n return this.lastResult;\n }\n\n for (\n let i = 0;\n (this.judgingDistance > this.lastOptions.minMovement || i < 1) &&\n i < iterations;\n i++\n ) {\n this.runOneStep(\n this.lastCalcGraph,\n this.lastGraph,\n i,\n this.lastVelMap,\n this.lastOptions\n );\n this.updatePosition(\n this.lastGraph,\n this.lastCalcGraph,\n this.lastVelMap,\n this.lastOptions\n );\n }\n\n const result = {\n nodes: this.lastLayoutNodes,\n edges: this.lastLayoutEdges,\n };\n\n if (this.lastAssign) {\n result.nodes.forEach((node) =>\n this.lastGraph.mergeNodeData(node.id, {\n x: node.data.x,\n y: node.data.y,\n z: this.options.dimensions === 3 ? node.data.z : undefined\n })\n );\n }\n\n return result;\n }\n\n private async genericForceLayout(\n assign: false,\n graph: Graph,\n options?: ForceLayoutOptions\n ): Promise<LayoutMapping>;\n private async genericForceLayout(\n assign: true,\n graph: Graph,\n options?: ForceLayoutOptions\n ): Promise<void>;\n private async genericForceLayout(\n assign: boolean,\n graph: Graph,\n options?: ForceLayoutOptions\n ): Promise<LayoutMapping | void> {\n const mergedOptions = { ...this.options, ...options };\n\n const nodes = graph.getAllNodes();\n const edges = graph.getAllEdges();\n\n const formattedOptions = this.formatOptions(mergedOptions, graph);\n const {\n dimensions,\n width,\n height,\n nodeSize,\n getMass,\n nodeStrength,\n edgeStrength,\n linkDistance,\n } = formattedOptions;\n\n // clones the original data and attaches calculation attributes for this layout algorithm\n const layoutNodes: CalcNode[] = nodes.map(\n (node, i) =>\n ({\n ...node,\n data: {\n ...node.data,\n // ...randomDistribution(node, dimensions, 30, i),\n x: isNumber(node.data.x) ? node.data.x : Math.random() * width,\n y: isNumber(node.data.y) ? node.data.y : Math.random() * height,\n z: isNumber(node.data.z) ? node.data.z : Math.random() * Math.sqrt(width * height),\n size: nodeSize(node) || 30,\n mass: getMass(node),\n nodeStrength: nodeStrength(node),\n },\n } as CalcNode)\n );\n const layoutEdges: CalcEdge[] = edges.map((edge) => ({\n ...edge,\n data: {\n ...edge.data,\n edgeStrength: edgeStrength(edge),\n linkDistance: linkDistance(\n edge,\n graph.getNode(edge.source),\n graph.getNode(edge.target)\n ),\n },\n }));\n\n if (!nodes?.length) {\n this.lastResult = { nodes: [], edges };\n return { nodes: [], edges };\n }\n\n const velMap: { [id: string]: Point } = {};\n nodes.forEach((node, i) => {\n velMap[node.id] = {\n x: 0,\n y: 0,\n z: 0,\n };\n });\n\n const calcGraph = new IGraph<CalcNodeData, CalcEdgeData>({\n nodes: layoutNodes,\n edges: layoutEdges,\n });\n\n this.formatCentripetal(formattedOptions, calcGraph);\n\n const { maxIteration, minMovement, onTick } = formattedOptions;\n\n // Use them later in `tick`.\n this.lastLayoutNodes = layoutNodes;\n this.lastLayoutEdges = layoutEdges;\n this.lastAssign = assign;\n this.lastGraph = graph;\n this.lastCalcGraph = calcGraph;\n this.lastOptions = formattedOptions;\n this.lastVelMap = velMap;\n\n if (typeof window === \"undefined\") return;\n let iter = 0;\n\n return new Promise((resolve) => {\n // interval for render the result after each iteration\n this.timeInterval = window.setInterval(() => {\n if (!nodes || !this.running) {\n resolve({\n nodes: formatOutNodes(graph, layoutNodes),\n edges,\n });\n }\n this.runOneStep(calcGraph, graph, iter, velMap, formattedOptions);\n this.updatePosition(graph, calcGraph, velMap, formattedOptions);\n if (assign) {\n layoutNodes.forEach((node) =>\n graph.mergeNodeData(node.id, {\n x: node.data.x,\n y: node.data.y,\n z: dimensions === 3 ? node.data.z : undefined\n })\n );\n }\n onTick?.({\n nodes: formatOutNodes(graph, layoutNodes),\n edges,\n });\n iter++;\n if (iter >= maxIteration || this.judgingDistance < minMovement) {\n window.clearInterval(this.timeInterval);\n\n resolve({\n nodes: formatOutNodes(graph, layoutNodes),\n edges,\n });\n }\n }, 0);\n this.running = true;\n });\n }\n\n /**\n * Format merged layout options.\n * @param options merged layout options\n * @param graph original graph\n * @returns\n */\n private formatOptions(\n options: ForceLayoutOptions,\n graph: Graph\n ): FormatedOptions {\n const formattedOptions = options as FormatedOptions;\n const { width: propsWidth, height: propsHeight, getMass } = options;\n\n // === formating width, height, and center =====\n formattedOptions.width =\n !propsWidth && typeof window !== \"undefined\"\n ? window.innerWidth\n : (propsWidth as number);\n formattedOptions.height =\n !propsHeight && typeof window !== \"undefined\"\n ? window.innerHeight\n : (propsHeight as number);\n if (!options.center) {\n formattedOptions.center = [\n formattedOptions.width / 2,\n formattedOptions.height / 2,\n ];\n }\n\n // === formating node mass =====\n if (!getMass) {\n formattedOptions.getMass = (d?: Node) => {\n let massWeight = 1;\n if (isNumber(d?.data.mass)) massWeight = d?.data.mass as number;\n const degree = graph.getDegree(d!.id, \"both\");\n return !degree || degree < 5 ? massWeight : degree * 5 * massWeight;\n };\n }\n\n // === formating node size =====\n if (options.preventOverlap) {\n const nodeSpacingFunc = formatNumberFn<Node>(0, options.nodeSpacing);\n if (!options.nodeSize) {\n formattedOptions.nodeSize = (d?: Node) => {\n const { size } = d?.data || {};\n if (size) {\n if (isArray(size)) {\n return Math.max(size[0], size[1]) + nodeSpacingFunc(d);\n }\n if (isObject<{ width: number; height: number }>(size)) {\n return Math.max(size.width, size.height) + nodeSpacingFunc(d);\n }\n return (size as number) + nodeSpacingFunc(d);\n }\n return 10 + nodeSpacingFunc(d);\n };\n } else if (isArray(options.nodeSize)) {\n formattedOptions.nodeSize = (d?: Node) => {\n const nodeSize = options.nodeSize as [number, number];\n return Math.max(nodeSize[0], nodeSize[1]) + nodeSpacingFunc(d);\n };\n } else {\n formattedOptions.nodeSize = (d?: Node) =>\n (options.nodeSize as number) + nodeSpacingFunc(d);\n }\n }\n\n // === formating node / edge strengths =====\n formattedOptions.linkDistance = options.linkDistance\n ? formatNumberFn(1, options.linkDistance)\n : (edge?: Edge) =>\n 1 +\n formattedOptions.nodeSize(graph.getNode(edge!.source)) +\n formattedOptions.nodeSize(graph.getNode(edge!.target));\n formattedOptions.nodeStrength = formatNumberFn(1, options.nodeStrength);\n formattedOptions.edgeStrength = formatNumberFn(1, options.edgeStrength);\n\n return options as FormatedOptions;\n }\n\n /**\n * Format centripetalOption in the option.\n * @param options merged layout options\n * @param calcGraph calculation graph\n */\n private formatCentripetal(options: FormatedOptions, calcGraph: CalcGraph) {\n const {\n centripetalOptions,\n center,\n clusterNodeStrength,\n leafCluster,\n clustering,\n nodeClusterBy,\n } = options;\n const calcNodes = calcGraph.getAllNodes();\n // === formating centripetalOptions =====\n const basicCentripetal = centripetalOptions || {\n leaf: 2,\n single: 2,\n others: 1,\n // eslint-disable-next-line\n center: (n: any) => {\n return {\n x: center[0],\n y: center[1],\n };\n },\n };\n if (typeof clusterNodeStrength !== \"function\") {\n options.clusterNodeStrength = (node?: Node) =>\n clusterNodeStrength as number;\n }\n let sameTypeLeafMap: any;\n let clusters: string[] = [];\n if (leafCluster && nodeClusterBy) {\n sameTypeLeafMap = getSameTypeLeafMap(calcGraph, nodeClusterBy);\n clusters =\n Array.from(\n new Set(calcNodes?.map((node) => node.data[nodeClusterBy] as string))\n ) || [];\n // @ts-ignore\n options.centripetalOptions = Object.assign(basicCentripetal, {\n single: 100,\n leaf: (node: Node) => {\n // 找出与它关联的边的起点或终点出发的所有一度节点中同类型的叶子节点\n const { siblingLeaves, sameTypeLeaves } =\n sameTypeLeafMap[node.id] || {};\n // 如果都是同一类型或者每种类型只有1个，则施加默认向心力\n if (\n sameTypeLeaves?.length === siblingLeaves?.length ||\n clusters?.length === 1\n ) {\n return 1;\n }\n return options.clusterNodeStrength(node);\n },\n others: 1,\n center: (node: Node) => {\n const degree = calcGraph.getDegree(node.id, \"both\");\n // 孤点默认给1个远离的中心点\n if (!degree) {\n return {\n x: 100,\n y: 100,\n };\n }\n let centerPos: Point | undefined;\n if (degree === 1) {\n // 如果为叶子节点\n // 找出与它关联的边的起点出发的所有一度节点中同类型的叶子节点\n const { sameTypeLeaves = [] } = sameTypeLeafMap[node.id] || {};\n if (sameTypeLeaves.length === 1) {\n // 如果同类型的叶子节点只有1个，中心位置为undefined\n centerPos = undefined;\n } else if (sameTypeLeaves.length > 1) {\n // 找出同类型节点平均位置作为中心\n centerPos = getAvgNodePosition(sameTypeLeaves);\n }\n } else {\n centerPos = undefined;\n }\n return {\n x: centerPos?.x!,\n y: centerPos?.y!,\n };\n },\n });\n }\n if (clustering && nodeClusterBy) {\n if (!sameTypeLeafMap) {\n sameTypeLeafMap = getSameTypeLeafMap(calcGraph, nodeClusterBy);\n }\n if (!clusters) {\n clusters = Array.from(\n new Set(\n calcNodes.map((node: Node) => node.data[nodeClusterBy] as string)\n )\n );\n }\n clusters = clusters.filter((item) => item !== undefined);\n\n const centerInfo: { [key: string]: Point } = {};\n clusters.forEach((cluster) => {\n const sameTypeNodes = calcNodes\n .filter((node) => node.data[nodeClusterBy] === cluster)\n .map((node) => calcGraph.getNode(node.id));\n // 找出同类型节点平均位置节点的距离最近的节点作为中心节点\n centerInfo[cluster] = getAvgNodePosition(sameTypeNodes);\n });\n options.centripetalOptions = Object.assign(basicCentripetal, {\n single: (node: Node) => options.clusterNodeStrength(node),\n leaf: (node: Node) => options.clusterNodeStrength(node),\n others: (node: Node) => options.clusterNodeStrength(node),\n center: (node: Node) => {\n // 找出同类型节点平均位置节点的距离最近的节点作为中心节点\n const centerPos = centerInfo[node.data[nodeClusterBy] as string];\n return {\n x: centerPos?.x!,\n y: centerPos?.y!,\n };\n },\n });\n }\n const { leaf, single, others } = options.centripetalOptions || {};\n if (leaf && typeof leaf !== \"function\") {\n options.centripetalOptions.leaf = () => leaf;\n }\n if (single && typeof single !== \"function\") {\n options.centripetalOptions.single = () => single;\n }\n if (others && typeof others !== \"function\") {\n options.centripetalOptions.others = () => others;\n }\n }\n\n /**\n * One iteration.\n * @param calcGraph calculation graph\n * @param graph origin graph\n * @param iter current iteration index\n * @param velMap nodes' velocity map\n * @param options formatted layout options\n * @returns\n */\n private runOneStep(\n calcGraph: CalcGraph,\n graph: Graph,\n iter: number,\n velMap: { [id: string]: Point },\n options: FormatedOptions\n ) {\n const accMap: { [id: string]: Point } = {};\n const calcNodes = calcGraph.getAllNodes();\n const calcEdges = calcGraph.getAllEdges();\n if (!calcNodes?.length) return;\n const { monitor } = options;\n this.calRepulsive(calcGraph, accMap, options);\n if (calcEdges) this.calAttractive(calcGraph, accMap, options);\n this.calGravity(calcGraph, graph, accMap, options);\n this.updateVelocity(calcGraph, accMap, velMap, options);\n\n /** 如果需要监控信息，则提供给用户 */\n if (monitor) {\n const energy = this.calTotalEnergy(accMap, calcNodes);\n monitor({\n energy,\n nodes: graph.getAllNodes(),\n edges: graph.getAllEdges(),\n iterations: iter,\n });\n }\n }\n\n /**\n * Calculate graph energy for monitoring convergence.\n * @param accMap acceleration map\n * @param nodes calculation nodes\n * @returns energy\n */\n private calTotalEnergy(accMap: { [id: string]: Point }, nodes: CalcNode[]) {\n if (!nodes?.length) return 0;\n let energy = 0.0;\n\n nodes.forEach((node, i) => {\n const vx = accMap[node.id].x;\n const vy = accMap[node.id].y;\n const vz = this.options.dimensions === 3 ? accMap[node.id].z : 0;\n const speed2 = vx * vx + vy * vy + vz * vz;\n const { mass = 1 } = node.data;\n energy += mass * speed2 * 0.5; // p = 1/2*(mv^2)\n });\n\n return energy;\n }\n\n /**\n * Calculate the repulsive forces according to coulombs law.\n * @param calcGraph calculation graph\n * @param accMap acceleration map\n * @param options formatted layout options\n */\n public calRepulsive(\n calcGraph: CalcGraph,\n accMap: { [id: string]: Point },\n options: FormatedOptions\n ) {\n const { dimensions, factor, coulombDisScale } = options;\n forceNBody(calcGraph, factor, coulombDisScale * coulombDisScale, accMap, dimensions);\n }\n\n /**\n * Calculate the attractive forces according to hooks law.\n * @param calcGraph calculation graph\n * @param accMap acceleration map\n */\n public calAttractive(calcGraph: CalcGraph, accMap: { [id: string]: Point }, options: FormatedOptions) {\n const { dimensions } = options;\n calcGraph.getAllEdges().forEach((edge, i) => {\n const { source, target } = edge;\n const sourceNode = calcGraph.getNode(source);\n const targetNode = calcGraph.getNode(target);\n if (!sourceNode || !targetNode) return;\n let vecX = targetNode.data.x - sourceNode.data.x;\n let vecY = targetNode.data.y - sourceNode.data.y;\n let vecZ = dimensions === 3 ? targetNode.data.z - sourceNode.data.z : 0;\n if (!vecX && !vecY) {\n vecX = Math.random() * 0.01;\n vecY = Math.random() * 0.01;\n\n if (dimensions === 3 && !vecZ) {\n vecZ = Math.random() * 0.01;\n }\n }\n const vecLength = Math.sqrt(vecX * vecX + vecY * vecY + vecZ * vecZ);\n const direX = vecX / vecLength;\n const direY = vecY / vecLength;\n const direZ = vecZ / vecLength;\n const { linkDistance = 200, edgeStrength = 200 } = edge.data || {};\n const diff = linkDistance - vecLength;\n const param = diff * edgeStrength;\n const massSource = sourceNode.data.mass || 1;\n const massTarget = targetNode.data.mass || 1;\n // 质量占比越大，对另一端影响程度越大\n const sourceMassRatio = 1 / massSource;\n const targetMassRatio = 1 / massTarget;\n const disX = direX * param;\n const disY = direY * param;\n const disZ = direZ * param;\n accMap[source].x -= disX * sourceMassRatio;\n accMap[source].y -= disY * sourceMassRatio;\n accMap[source].z -= disZ * sourceMassRatio;\n accMap[target].x += disX * targetMassRatio;\n accMap[target].y += disY * targetMassRatio;\n accMap[target].z += disZ * targetMassRatio;\n });\n }\n\n /**\n * Calculate the gravity forces toward center.\n * @param calcGraph calculation graph\n * @param graph origin graph\n * @param accMap acceleration map\n * @param options formatted layout options\n */\n public calGravity(\n calcGraph: CalcGraph,\n graph: Graph,\n accMap: { [id: string]: Point },\n options: FormatedOptions\n ) {\n const { getCenter } = options;\n const calcNodes = calcGraph.getAllNodes();\n const nodes = graph.getAllNodes();\n const edges = graph.getAllEdges();\n const {\n width,\n height,\n center,\n gravity: defaultGravity,\n centripetalOptions,\n } = options;\n if (!calcNodes) return;\n calcNodes.forEach((calcNode) => {\n const { id, data } = calcNode;\n const { mass, x, y, z } = data;\n const node = graph.getNode(id);\n let vecX = 0;\n let vecY = 0;\n let vecZ = 0;\n let gravity = defaultGravity;\n const inDegree = calcGraph.getDegree(id, \"in\");\n const outDegree = calcGraph.getDegree(id, \"out\");\n const degree = calcGraph.getDegree(id, \"both\");\n const forceCenter = getCenter?.(node, degree);\n if (forceCenter) {\n const [centerX, centerY, strength] = forceCenter;\n vecX = x - centerX;\n vecY = y - centerY;\n gravity = strength;\n } else {\n vecX = x - center[0];\n vecY = y - center[1];\n vecZ = z - center[2];\n }\n\n if (gravity) {\n accMap[id].x -= (gravity * vecX) / mass;\n accMap[id].y -= (gravity * vecY) / mass;\n accMap[id].z -= (gravity * vecZ) / mass;\n }\n\n if (centripetalOptions) {\n const {\n leaf,\n single,\n others,\n center: centriCenter,\n } = centripetalOptions;\n const {\n x: centriX,\n y: centriY,\n z: centriZ,\n centerStrength,\n } = centriCenter?.(node, nodes, edges, width, height) || {\n x: 0,\n y: 0,\n z: 0,\n centerStrength: 0,\n };\n if (!isNumber(centriX) || !isNumber(centriY)) return;\n const vx = (x - centriX) / mass;\n const vy = (y - centriY) / mass;\n const vz = (z - centriZ) / mass;\n if (centerStrength) {\n accMap[id].x -= centerStrength * vx;\n accMap[id].y -= centerStrength * vy;\n accMap[id].z -= centerStrength * vz;\n }\n\n // 孤点\n if (degree === 0) {\n const singleStrength = single(node);\n if (!singleStrength) return;\n accMap[id].x -= singleStrength * vx;\n accMap[id].y -= singleStrength * vy;\n accMap[id].z -= singleStrength * vz;\n return;\n }\n\n // 没有出度或没有入度，都认为是叶子节点\n if (inDegree === 0 || outDegree === 0) {\n const leafStrength = leaf(node, nodes, edges);\n if (!leafStrength) return;\n accMap[id].x -= leafStrength * vx;\n accMap[id].y -= leafStrength * vy;\n accMap[id].z -= leafStrength * vz;\n return;\n }\n\n /** others */\n const othersStrength = others(node);\n if (!othersStrength) return;\n accMap[id].x -= othersStrength * vx;\n accMap[id].y -= othersStrength * vy;\n accMap[id].z -= othersStrength * vz;\n }\n });\n }\n\n /**\n * Update the velocities for nodes.\n * @param calcGraph calculation graph\n * @param accMap acceleration map\n * @param velMap velocity map\n * @param options formatted layout options\n * @returns\n */\n public updateVelocity(\n calcGraph: CalcGraph,\n accMap: { [id: string]: Point },\n velMap: { [id: string]: Point },\n options: FormatedOptions\n ) {\n const { damping, maxSpeed, interval, dimensions } = options;\n const calcNodes = calcGraph.getAllNodes();\n if (!calcNodes?.length) return;\n calcNodes.forEach((calcNode) => {\n const { id } = calcNode;\n let vx = (velMap[id].x + accMap[id].x * interval) * damping || 0.01;\n let vy = (velMap[id].y + accMap[id].y * interval) * damping || 0.01;\n let vz = dimensions === 3 ? ((velMap[id].z + accMap[id].z * interval) * damping || 0.01) : 0.0;\n const vLength = Math.sqrt(vx * vx + vy * vy + vz * vz);\n if (vLength > maxSpeed) {\n const param2 = maxSpeed / vLength;\n vx = param2 * vx;\n vy = param2 * vy;\n vz = param2 * vz;\n }\n velMap[id] = {\n x: vx,\n y: vy,\n z: vz\n };\n });\n }\n\n /**\n * Update nodes' positions.\n * @param graph origin graph\n * @param calcGraph calculatition graph\n * @param velMap velocity map\n * @param options formatted layou options\n * @returns\n */\n public updatePosition(\n graph: Graph,\n calcGraph: CalcGraph,\n velMap: { [id: string]: Point },\n options: FormatedOptions\n ) {\n const { distanceThresholdMode, interval, dimensions } = options;\n const calcNodes = calcGraph.getAllNodes();\n if (!calcNodes?.length) {\n this.judgingDistance = 0;\n return;\n }\n let sum = 0;\n if (distanceThresholdMode === \"max\") this.judgingDistance = -Infinity;\n else if (distanceThresholdMode === \"min\") this.judgingDistance = Infinity;\n\n calcNodes.forEach((calcNode: CalcNode) => {\n const { id } = calcNode;\n const node = graph.getNode(id);\n if (isNumber(node.data.fx) && isNumber(node.data.fy)) {\n calcGraph.mergeNodeData(id, {\n x: node.data.fx,\n y: node.data.fy,\n z: dimensions === 3 ? node.data.fz as number : undefined,\n });\n return;\n }\n const distX = velMap[id].x * interval;\n const distY = velMap[id].y * interval;\n const distZ = dimensions === 3 ? velMap[id].z * interval : 0.0;\n calcGraph.mergeNodeData(id, {\n x: calcNode.data.x + distX,\n y: calcNode.data.y + distY,\n z: calcNode.data.z + distZ,\n });\n\n const distanceMagnitude = Math.sqrt(distX * distX + distY * distY + distZ * distZ);\n switch (distanceThresholdMode) {\n case \"max\":\n if (this.judgingDistance < distanceMagnitude) {\n this.judgingDistance = distanceMagnitude;\n }\n break;\n case \"min\":\n if (this.judgingDistance > distanceMagnitude) {\n this.judgingDistance = distanceMagnitude;\n }\n break;\n default:\n sum = sum + distanceMagnitude;\n break;\n }\n });\n if (!distanceThresholdMode || distanceThresholdMode === \"mean\") {\n this.judgingDistance = sum / calcNodes.length;\n }\n }\n}\n\ntype SameTypeLeafMap = {\n [nodeId: string]: {\n coreNode: Node;\n siblingLeaves: Node[];\n sameTypeLeaves: Node[];\n };\n};\n\n/**\n * Group the leaf nodes according to nodeClusterBy field.\n * @param calcGraph calculation graph\n * @param nodeClusterBy the field name in node.data to ditinguish different node clusters\n * @returns related same group leaf nodes for each leaf node\n */\nconst getSameTypeLeafMap = (\n calcGraph: CalcGraph,\n nodeClusterBy: string\n): SameTypeLeafMap => {\n const calcNodes = calcGraph.getAllNodes();\n if (!calcNodes?.length) return {};\n const sameTypeLeafMap: SameTypeLeafMap = {};\n calcNodes.forEach((node, i) => {\n const degree = calcGraph.getDegree(node.id, \"both\");\n if (degree === 1) {\n sameTypeLeafMap[node.id] = getCoreNodeAndSiblingLeaves(\n calcGraph,\n \"leaf\",\n node,\n nodeClusterBy\n );\n }\n });\n return sameTypeLeafMap;\n};\n\n/**\n * Find the successor or predecessor of node as coreNode, the sibling leaf nodes\n * @param calcGraph calculation graph\n * @param type ('all') filter out the not-same-cluster nodes, ('leaf') or filter out the not-leaf nodes in the same time\n * @param node the target node\n * @param nodeClusterBy the field name in node.data to ditinguish different node clusters\n * @returns coreNode, sibling leaf nodes, and grouped sibling leaf nodes\n */\nconst getCoreNodeAndSiblingLeaves = (\n calcGraph: CalcGraph,\n type: \"leaf\" | \"all\",\n node: Node,\n nodeClusterBy: string\n): {\n coreNode: Node;\n siblingLeaves: Node[];\n sameTypeLeaves: Node[];\n} => {\n const inDegree = calcGraph.getDegree(node.id, \"in\");\n const outDegree = calcGraph.getDegree(node.id, \"out\");\n // node is not a leaf, coreNode is itself, siblingLeaves is empty\n let coreNode: Node = node;\n let siblingLeaves: Node[] = [];\n if (inDegree === 0) {\n // node is a leaf node without out edges, its related(successor) node is coreNode, siblingLeaves is the neighbors of its related node\n coreNode = calcGraph.getSuccessors(node.id)[0];\n siblingLeaves = calcGraph.getNeighbors(coreNode.id);\n } else if (outDegree === 0) {\n // node is a leaf node without in edges, its related(predecessor) node is coreNode, siblingLeaves is the neighbors of its related node\n coreNode = calcGraph.getPredecessors(node.id)[0];\n siblingLeaves = calcGraph.getNeighbors(coreNode.id);\n }\n // siblingLeaves are leaf nodes\n siblingLeaves = siblingLeaves.filter(\n (node) =>\n calcGraph.getDegree(node.id, \"in\") === 0 ||\n calcGraph.getDegree(node.id, \"out\") === 0\n );\n const sameTypeLeaves = getSameTypeNodes(\n calcGraph,\n type,\n nodeClusterBy,\n node,\n siblingLeaves\n );\n return { coreNode, siblingLeaves, sameTypeLeaves };\n};\n\n/**\n * Find the same type (according to nodeClusterBy field) of node in relativeNodes.\n * @param calcGraph calculation graph\n * @param type ('all') filter out the not-same-cluster nodes, ('leaf') or filter out the not-leaf nodes in the same time\n * @param nodeClusterBy the field name in node.data to ditinguish different node clusters\n * @param node the target node\n * @param relativeNodes node's related ndoes to be filtered\n * @returns related nodes that meet the filtering conditions\n */\nconst getSameTypeNodes = (\n calcGraph: CalcGraph,\n type: \"leaf\" | \"all\",\n nodeClusterBy: string,\n node: Node,\n relativeNodes: Node[]\n) => {\n const typeName = node.data[nodeClusterBy] || \"\";\n let sameTypeNodes =\n relativeNodes?.filter((item) => item.data[nodeClusterBy] === typeName) ||\n [];\n if (type === \"leaf\") {\n sameTypeNodes = sameTypeNodes.filter(\n (item) =>\n calcGraph.getDegree(item.id, \"in\") === 0 ||\n calcGraph.getDegree(item.id, \"out\") === 0\n );\n }\n return sameTypeNodes;\n};\n\n/**\n * Get the average position of nodes.\n * @param nodes nodes set\n * @returns average ppsition\n */\nconst getAvgNodePosition = (nodes: CalcNode[]): Point => {\n const totalNodes = { x: 0, y: 0 };\n nodes.forEach((node) => {\n const { x, y } = node.data;\n totalNodes.x += x || 0;\n totalNodes.y += y || 0;\n });\n // 获取均值向量\n const length = nodes.length || 1;\n return {\n x: totalNodes.x / length,\n y: totalNodes.y / length,\n };\n};\n\n/**\n * Format the output nodes from CalcNode[].\n * @param graph origin graph\n * @param layoutNodes calculation nodes\n * @returns output nodes\n */\nconst formatOutNodes = (graph: Graph, layoutNodes: CalcNode[]): OutNode[] =>\n layoutNodes.map((calcNode) => {\n const { id, data } = calcNode;\n const node = graph.getNode(id);\n return {\n ...node,\n data: {\n ...node.data,\n x: data.x,\n y: data.y,\n z: data.z\n },\n } as OutNode;\n });\n","import Quad from './quad';\n\n/**\n * @fileOverview body\n * @author shiwu.wyy@antfin.com\n */\n\ntype BodyProps = {\n id?: Number;\n rx: number;\n ry: number;\n fx?: number;\n fy?: number;\n mass: number;\n degree: number;\n g?: number;\n};\n\n// represents a body(a point mass) and its position\nexport default class Body {\n public id: Number;\n public rx: number;\n public ry: number;\n public fx: number;\n public fy: number;\n public mass: number;\n public degree: number;\n public g: number;\n \n constructor(params: BodyProps) {\n /**\n * the id of this body, the same with the node id\n * @type {number}\n */\n this.id = params.id || 0;\n /**\n * the position of this body\n * @type {number}\n */\n this.rx = params.rx;\n /**\n * the position of this body\n * @type {number}\n */\n this.ry = params.ry;\n /**\n * the force acting on this body\n * @type {number}\n */\n this.fx = 0;\n /**\n * the force acting on this body\n * @type {number}\n */\n this.fy = 0;\n /**\n * the mass of this body, =1 for a node\n * @type {number}\n */\n this.mass = params.mass;\n /**\n * the degree of the node represented by this body\n * @type {number}\n */\n this.degree = params.degree;\n /**\n * the parameter for repulsive force, = kr\n * @type {number}\n */\n this.g = params.g || 0;\n }\n // returns the euclidean distance\n distanceTo(bo: Body) {\n const dx = this.rx - bo.rx;\n const dy = this.ry - bo.ry;\n return Math.hypot(dx, dy);\n }\n setPos(x: number, y: number) {\n this.rx = x;\n this.ry = y;\n }\n // resets the forces\n resetForce() {\n this.fx = 0;\n this.fy = 0;\n }\n addForce(b: Body) {\n const dx = b.rx - this.rx;\n const dy = b.ry - this.ry;\n let dist = Math.hypot(dx, dy);\n dist = dist < 0.0001 ? 0.0001 : dist;\n // the repulsive defined by force atlas 2\n const F = (this.g * (this.degree + 1) * (b.degree + 1)) / dist;\n this.fx += F * dx / dist;\n this.fy += F * dy / dist;\n }\n // if quad contains this body\n in(quad: Quad) {\n return quad.contains(this.rx, this.ry);\n }\n // returns a new body\n add(bo: Body) {\n const nenwMass = this.mass + bo.mass;\n const x = (this.rx * this.mass + bo.rx * bo.mass) / nenwMass;\n const y = (this.ry * this.mass + bo.ry * bo.mass) / nenwMass;\n const dg = this.degree + bo.degree;\n const params: BodyProps = {\n rx: x,\n ry: y,\n mass: nenwMass,\n degree: dg\n };\n return new Body(params);\n }\n}","import { PointTuple } from \"../types\";\n\n/**\n * @fileOverview quad\n * @author shiwu.wyy@antfin.com\n */\n\ntype QuadProps = {\n xmid: number;\n ymid: number;\n length: number;\n massCenter?: PointTuple;\n mass?: number;\n};\n\nexport default class Quad {\n public xmid: number;\n public ymid: number;\n public length: number;\n public massCenter: PointTuple;\n public mass: number;\n constructor(params: QuadProps) {\n /**\n * the center position of this quad\n * @type {number}\n */\n this.xmid = params.xmid;\n /**\n * the center position of this quad\n * @type {number}\n */\n this.ymid = params.ymid;\n /**\n * the length of this quad\n * @type {number}\n */\n this.length = params.length;\n /**\n * the mass center of this quad\n * @type {number}\n */\n this.massCenter = params.massCenter || [0, 0];\n /**\n * the mass of this quad\n * @type {number}\n */\n this.mass = params.mass || 1;\n }\n getLength() {\n return this.length;\n }\n contains(x: number, y: number) {\n const halfLen = this.length / 2;\n return (x <= this.xmid + halfLen &&\n x >= this.xmid - halfLen &&\n y <= this.ymid + halfLen &&\n y >= this.ymid - halfLen);\n }\n // northwest quadrant\n // tslint:disable-next-line\n NW() {\n const x = this.xmid - this.length / 4;\n const y = this.ymid + this.length / 4;\n const len = this.length / 2;\n const params: QuadProps = {\n xmid: x,\n ymid: y,\n length: len\n };\n const NW = new Quad(params);\n return NW;\n }\n // northeast\n // tslint:disable-next-line\n NE() {\n const x = this.xmid + this.length / 4;\n const y = this.ymid + this.length / 4;\n const len = this.length / 2;\n const params = {\n xmid: x,\n ymid: y,\n length: len\n };\n const NE = new Quad(params);\n return NE;\n }\n // southwest\n // tslint:disable-next-line\n SW() {\n const x = this.xmid - this.length / 4;\n const y = this.ymid - this.length / 4;\n const len = this.length / 2;\n const params = {\n xmid: x,\n ymid: y,\n length: len\n };\n const SW = new Quad(params);\n return SW;\n }\n // southeast\n // tslint:disable-next-line\n SE() {\n const x = this.xmid + this.length / 4;\n const y = this.ymid - this.length / 4;\n const len = this.length / 2;\n const params = {\n xmid: x,\n ymid: y,\n length: len\n };\n const SE = new Quad(params);\n return SE;\n }\n}","import Body from './body';\nimport Quad from './quad';\n\n/**\n * @fileOverview quadTree\n * @author shiwu.wyy@antfin.com\n */\n\nexport default class QuadTree {\n public body: Body | null;\n public quad: Quad | null;\n public theta: number;\n public NW: QuadTree | null;\n public NE: QuadTree | null;\n public SW: QuadTree | null;\n public SE: QuadTree | null;\n\n // each quadtree represents a quadrant and an aggregate body\n // that represents all bodies inside the quadrant\n constructor(param: Quad | null) {\n /**\n * (aggregated) body in this quad\n * @type {object}\n */\n this.body = null;\n /**\n * tree representing the northwest quadrant\n * @type {object}\n */\n this.quad = null;\n this.NW = null;\n this.NE = null;\n this.SW = null;\n this.SE = null;\n /**\n * threshold\n * @type {number}\n */\n this.theta = 0.5;\n if (param != null) this.quad = param;\n }\n // insert a body(node) into the tree\n insert(bo: Body) {\n // if this node does not contain a body, put the new body bo here\n if (this.body == null) {\n this.body = bo;\n return;\n }\n // internal node\n if (!this._isExternal()) {\n // update mass info\n this.body = this.body.add(bo);\n // insert body into quadrant\n this._putBody(bo);\n } else { // external node\n // divide this region into four children\n if (this.quad) {\n this.NW = new QuadTree(this.quad.NW());\n this.NE = new QuadTree(this.quad.NE());\n this.SW = new QuadTree(this.quad.SW());\n this.SE = new QuadTree(this.quad.SE());\n }\n\n // insert this body and bo\n this._putBody(this.body);\n this._putBody(bo);\n // update the mass info\n this.body = this.body.add(bo);\n\n }\n }\n // inserts bo into a quad\n // tslint:disable-next-line\n _putBody(bo: Body) {\n if (!this.quad) return;\n if (bo.in(this.quad.NW()) && this.NW) this.NW.insert(bo);\n else if (bo.in(this.quad.NE()) && this.NE) this.NE.insert(bo);\n else if (bo.in(this.quad.SW()) && this.SW )this.SW.insert(bo);\n else if (bo.in(this.quad.SE()) && this.SE) this.SE.insert(bo);\n }\n // tslint:disable-next-line\n _isExternal() {\n // four children are null\n return (this.NW == null && this.NE == null && this.SW == null && this.SE == null);\n }\n // update the forces\n updateForce(bo: Body) {\n if (this.body == null || bo === this.body) {\n return;\n }\n // if the current node is external\n if (this._isExternal()) bo.addForce(this.body);\n // internal nodes\n else {\n const s = this.quad ? this.quad.getLength() : 0;\n const d = this.body.distanceTo(bo);\n // b is far enough\n if ((s / d) < this.theta) bo.addForce(this.body);\n else {\n this.NW && this.NW.updateForce(bo);\n this.NE && this.NE.updateForce(bo);\n this.SW && this.SW.updateForce(bo);\n this.SE && this.SE.updateForce(bo);\n }\n }\n }\n}","import { isFunction, isNumber, isObject } from \"@antv/util\";\nimport { Graph as GGraph } from \"@antv/graphlib\";\nimport type {\n Graph,\n LayoutMapping,\n Node,\n Edge,\n OutNode,\n PointTuple,\n ForceAtlas2LayoutOptions,\n OutNodeData,\n EdgeData,\n Layout,\n} from \"../types\";\nimport { cloneFormatData, isArray } from \"../util\";\nimport { handleSingleNodeGraph } from \"../util/common\";\nimport Body from \"./body\";\nimport Quad from \"./quad\";\nimport QuadTree from \"./quadTree\";\n\nconst DEFAULTS_LAYOUT_OPTIONS: Partial<ForceAtlas2LayoutOptions> = {\n center: [0, 0],\n width: 300,\n height: 300,\n kr: 5,\n kg: 1,\n mode: \"normal\",\n preventOverlap: false,\n dissuadeHubs: false,\n maxIteration: 0,\n ks: 0.1,\n ksmax: 10,\n tao: 0.1,\n};\n\ninterface FormattedOptions extends ForceAtlas2LayoutOptions {\n width: number;\n height: number;\n maxIteration: number;\n center: PointTuple;\n kr: number;\n kg: number;\n ks: number;\n ksmax: number;\n tao: number;\n}\ntype ForceMap = {\n [id: string]: PointTuple;\n};\ntype BodyMap = {\n [id: string]: Body;\n};\ntype SizeMap = { [id: string]: number };\ntype CalcGraph = GGraph<OutNodeData, EdgeData>;\n\n/**\n * Layout nodes with force atlas 2 model\n *\n * @example\n * // Assign layout options when initialization.\n * const layout = new ForceAtlas2Layout({ center: [100, 100] });\n * const positions = await layout.execute(graph); // { nodes: [], edges: [] }\n *\n * // Or use different options later.\n * const layout = new ForceAtlas2Layout({ center: [100, 100] });\n * const positions = await layout.execute(graph, { center: [100, 100] }); // { nodes: [], edges: [] }\n *\n * // If you want to assign the positions directly to the nodes, use assign method.\n * await layout.assign(graph, { center: [100, 100] });\n */\nexport class ForceAtlas2Layout implements Layout<ForceAtlas2LayoutOptions> {\n id = \"forceAtlas2\";\n\n constructor(\n public options: ForceAtlas2LayoutOptions = {} as ForceAtlas2LayoutOptions\n ) {\n this.options = {\n ...DEFAULTS_LAYOUT_OPTIONS,\n ...options,\n };\n }\n\n /**\n * Return the positions of nodes and edges(if needed).\n */\n async execute(graph: Graph, options?: ForceAtlas2LayoutOptions) {\n return this.genericForceAtlas2Layout(false, graph, options);\n }\n /**\n * To directly assign the positions to the nodes.\n */\n async assign(graph: Graph, options?: ForceAtlas2LayoutOptions) {\n this.genericForceAtlas2Layout(true, graph, options);\n }\n\n private async genericForceAtlas2Layout(\n assign: false,\n graph: Graph,\n options?: ForceAtlas2LayoutOptions\n ): Promise<LayoutMapping>;\n private async genericForceAtlas2Layout(\n assign: true,\n graph: Graph,\n options?: ForceAtlas2LayoutOptions\n ): Promise<void>;\n private async genericForceAtlas2Layout(\n assign: boolean,\n graph: Graph,\n options?: ForceAtlas2LayoutOptions\n ): Promise<LayoutMapping | void> {\n const edges = graph.getAllEdges();\n const nodes = graph.getAllNodes();\n\n const mergedOptions = this.formatOptions(options, nodes.length);\n const { width, height, prune, maxIteration, nodeSize, center } =\n mergedOptions;\n\n if (!nodes?.length || nodes.length === 1) {\n return handleSingleNodeGraph(graph, assign, center);\n }\n\n const calcNodes = nodes.map(\n (node) => cloneFormatData(node, [width, height]) as OutNode\n );\n const calcEdges = edges.filter((edge: Edge) => {\n const { source, target } = edge;\n return source !== target;\n });\n const calcGraph = new GGraph<OutNodeData, EdgeData>({\n nodes: calcNodes,\n edges: calcEdges,\n });\n const sizes: SizeMap = this.getSizes(calcGraph, graph, nodeSize);\n\n this.run(calcGraph, graph, maxIteration, sizes, assign, mergedOptions);\n\n // if prune, place the leaves around their parents, and then re-layout for several iterations.\n if (prune) {\n for (let j = 0; j < calcEdges.length; j += 1) {\n const { source, target } = calcEdges[j];\n const sourceDegree = calcGraph.getDegree(source);\n const targetDegree = calcGraph.getDegree(source);\n if (sourceDegree <= 1) {\n const targetNode = calcGraph.getNode(target);\n calcGraph.mergeNodeData(source, {\n x: targetNode.data.x,\n y: targetNode.data.y,\n });\n } else if (targetDegree <= 1) {\n const sourceNode = calcGraph.getNode(source);\n calcGraph.mergeNodeData(target, {\n x: sourceNode.data.x,\n y: sourceNode.data.y,\n });\n }\n }\n const postOptions = {\n ...mergedOptions,\n prune: false,\n barnesHut: false,\n };\n this.run(calcGraph, graph, 100, sizes, assign, postOptions);\n }\n\n return {\n nodes: calcNodes,\n edges,\n };\n }\n\n /**\n * Init the node positions if there is no initial positions.\n * And pre-calculate the size (max of width and height) for each node.\n * @param calcGraph graph for calculation\n * @param graph origin graph\n * @param nodeSize node size config from layout options\n * @returns {SizeMap} node'id mapped to max of its width and height\n */\n private getSizes(\n calcGraph: CalcGraph,\n graph: Graph,\n nodeSize?: number | number[] | ((d?: Node) => number)\n ): SizeMap {\n const nodes = calcGraph.getAllNodes();\n const sizes: SizeMap = {};\n for (let i = 0; i < nodes.length; i += 1) {\n const { id, data } = nodes[i];\n sizes[id] = 10;\n if (isNumber(data.size)) {\n sizes[id] = data.size;\n } else if (isArray(data.size)) {\n if (!isNaN(data.size[0])) sizes[id] = Math.max(data.size[0]);\n if (!isNaN(data.size[1])) sizes[id] = Math.max(data.size[1]);\n } else if (isObject(data.size)) {\n // @ts-ignore\n sizes[id] = Math.max(data.size.width, data.size.height);\n } else if (isFunction(nodeSize)) {\n const originNode = graph.getNode(id);\n const size = nodeSize(originNode);\n if (isArray(size)) {\n sizes[id] = Math.max(...size);\n } else {\n sizes[id] = size;\n }\n } else if (isArray(nodeSize)) {\n sizes[id] = Math.max(...nodeSize);\n } else if (isNumber(nodeSize)) {\n sizes[id] = nodeSize;\n }\n }\n return sizes;\n }\n\n /**\n * Format the options.\n * @param options input options\n * @param nodeNum number of nodes\n * @returns formatted options\n */\n private formatOptions(\n options: ForceAtlas2LayoutOptions = {},\n nodeNum: number\n ): FormattedOptions {\n const mergedOptions = { ...this.options, ...options } as FormattedOptions;\n const { center, width, height, barnesHut, prune, maxIteration, kr, kg } =\n mergedOptions;\n mergedOptions.width =\n !width && typeof window !== \"undefined\" ? window.innerWidth : width;\n mergedOptions.height =\n !height && typeof window !== \"undefined\" ? window.innerHeight : height;\n mergedOptions.center = !center\n ? [mergedOptions.width / 2, mergedOptions.height / 2]\n : center;\n\n if (barnesHut === undefined && nodeNum > 250) {\n mergedOptions.barnesHut = true;\n }\n if (prune === undefined && nodeNum > 100) mergedOptions.prune = true;\n if (maxIteration === 0 && !prune) {\n mergedOptions.maxIteration = 250;\n if (nodeNum <= 200 && nodeNum > 100) mergedOptions.maxIteration = 1000;\n else if (nodeNum > 200) mergedOptions.maxIteration = 1200;\n } else if (maxIteration === 0 && prune) {\n mergedOptions.maxIteration = 100;\n if (nodeNum <= 200 && nodeNum > 100) mergedOptions.maxIteration = 500;\n else if (nodeNum > 200) mergedOptions.maxIteration = 950;\n }\n\n if (!kr) {\n mergedOptions.kr = 50;\n if (nodeNum > 100 && nodeNum <= 500) mergedOptions.kr = 20;\n else if (nodeNum > 500) mergedOptions.kr = 1;\n }\n if (!kg) {\n mergedOptions.kg = 20;\n if (nodeNum > 100 && nodeNum <= 500) mergedOptions.kg = 10;\n else if (nodeNum > 500) mergedOptions.kg = 1;\n }\n\n return mergedOptions;\n }\n\n /**\n * Loops for fa2.\n * @param calcGraph graph for calculation\n * @param graph original graph\n * @param iteration iteration number\n * @param sizes nodes' size\n * @param options formatted layout options\n * @returns\n */\n private run(\n calcGraph: CalcGraph,\n graph: Graph,\n iteration: number,\n sizes: SizeMap,\n assign: boolean,\n options: FormattedOptions\n ) {\n const { kr, barnesHut, onTick } = options;\n const calcNodes = calcGraph.getAllNodes();\n let sg = 0;\n let iter = iteration;\n const forces: ForceMap = {};\n const preForces: ForceMap = {};\n const bodies: BodyMap = {};\n\n for (let i = 0; i < calcNodes.length; i += 1) {\n const { data, id } = calcNodes[i];\n forces[id] = [0, 0];\n\n if (barnesHut) {\n const params = {\n id: i,\n rx: data.x,\n ry: data.y,\n mass: 1,\n g: kr,\n degree: calcGraph.getDegree(id),\n };\n bodies[id] = new Body(params);\n }\n }\n\n while (iter > 0) {\n sg = this.oneStep(\n calcGraph,\n {\n iter,\n preventOverlapIters: 50,\n krPrime: 100,\n sg,\n forces,\n preForces,\n bodies,\n sizes,\n },\n options\n );\n iter--;\n onTick?.({\n nodes: calcNodes,\n edges: graph.getAllEdges(),\n });\n // if (assign) {\n // calcNodes.forEach(({ id, data }) => graph.mergeNodeData(id, {\n // x: data.x,\n // y: data.y\n // }))\n // }\n }\n\n return calcGraph;\n }\n\n /**\n * One step for a loop.\n * @param graph graph for calculation\n * @param params parameters for a loop\n * @param options formatted layout's input options\n * @returns\n */\n private oneStep(\n graph: CalcGraph,\n params: {\n iter: number;\n preventOverlapIters: number;\n krPrime: number;\n sg: number;\n forces: ForceMap;\n preForces: ForceMap;\n bodies: BodyMap;\n sizes: SizeMap;\n },\n options: FormattedOptions\n ) {\n const { iter, preventOverlapIters, krPrime, sg, preForces, bodies, sizes } =\n params;\n let { forces } = params;\n const { preventOverlap, barnesHut } = options;\n const nodes = graph.getAllNodes();\n for (let i = 0; i < nodes.length; i += 1) {\n const { id } = nodes[i];\n preForces[id] = [...forces[id]];\n forces[id] = [0, 0];\n }\n // attractive forces, existing on every actual edge\n forces = this.getAttrForces(\n graph,\n iter,\n preventOverlapIters,\n sizes,\n forces,\n options\n );\n\n // repulsive forces and Gravity, existing on every node pair\n // if preventOverlap, using the no-optimized method in the last preventOverlapIters instead.\n if (\n barnesHut &&\n ((preventOverlap && iter > preventOverlapIters) || !preventOverlap)\n ) {\n forces = this.getOptRepGraForces(graph, forces, bodies, options);\n } else {\n forces = this.getRepGraForces(\n graph,\n iter,\n preventOverlapIters,\n forces,\n krPrime,\n sizes,\n options\n );\n }\n // update the positions\n return this.updatePos(graph, forces, preForces, sg, options);\n }\n\n /**\n * Calculate the attract forces for nodes.\n * @param graph graph for calculation\n * @param iter current iteration index\n * @param preventOverlapIters the iteration number for preventing overlappings\n * @param sizes nodes' sizes\n * @param forces forces for nodes, which will be modified\n * @param options formatted layout's input options\n * @returns\n */\n private getAttrForces(\n graph: CalcGraph,\n iter: number,\n preventOverlapIters: number,\n sizes: SizeMap,\n forces: ForceMap,\n options: FormattedOptions\n ): ForceMap {\n const { preventOverlap, dissuadeHubs, mode, prune } = options;\n const edges = graph.getAllEdges();\n for (let i = 0; i < edges.length; i += 1) {\n const { source, target } = edges[i];\n const sourceNode = graph.getNode(source);\n const targetNode = graph.getNode(target);\n\n const sourceDegree = graph.getDegree(source);\n const targetDegree = graph.getDegree(target);\n if (prune && (sourceDegree <= 1 || targetDegree <= 1)) continue;\n\n const dir = [\n targetNode.data.x - sourceNode.data.x,\n targetNode.data.y - sourceNode.data.y,\n ];\n let eucliDis = Math.hypot(dir[0], dir[1]);\n eucliDis = eucliDis < 0.0001 ? 0.0001 : eucliDis;\n dir[0] = dir[0] / eucliDis;\n dir[1] = dir[1] / eucliDis;\n\n if (preventOverlap && iter < preventOverlapIters) {\n eucliDis = eucliDis - sizes[source] - sizes[target];\n }\n let fa1 = eucliDis;\n let fa2 = fa1;\n if (mode === \"linlog\") {\n fa1 = Math.log(1 + eucliDis);\n fa2 = fa1;\n }\n if (dissuadeHubs) {\n fa1 = eucliDis / sourceDegree;\n fa2 = eucliDis / targetDegree;\n }\n if (preventOverlap && iter < preventOverlapIters && eucliDis <= 0) {\n fa1 = 0;\n fa2 = 0;\n } else if (preventOverlap && iter < preventOverlapIters && eucliDis > 0) {\n fa1 = eucliDis;\n fa2 = eucliDis;\n }\n forces[source][0] += fa1 * dir[0];\n forces[target][0] -= fa2 * dir[0];\n forces[source][1] += fa1 * dir[1];\n forces[target][1] -= fa2 * dir[1];\n }\n return forces;\n }\n\n /**\n * Calculate the repulsive forces for nodes under barnesHut mode.\n * @param graph graph for calculatiion\n * @param forces forces for nodes, which will be modified\n * @param bodies force body map\n * @param options formatted layout's input options\n * @returns\n */\n private getOptRepGraForces(\n graph: CalcGraph,\n forces: ForceMap,\n bodies: BodyMap,\n options: FormattedOptions\n ) {\n const { kg, center, prune } = options;\n const nodes = graph.getAllNodes();\n const nodeNum = nodes.length;\n let minx = 9e10;\n let maxx = -9e10;\n let miny = 9e10;\n let maxy = -9e10;\n for (let i = 0; i < nodeNum; i += 1) {\n const { id, data } = nodes[i];\n if (prune && graph.getDegree(id) <= 1) continue;\n bodies[id].setPos(data.x, data.y);\n if (data.x >= maxx) maxx = data.x;\n if (data.x <= minx) minx = data.x;\n if (data.y >= maxy) maxy = data.y;\n if (data.y <= miny) miny = data.y;\n }\n\n const width = Math.max(maxx - minx, maxy - miny);\n\n const quadParams = {\n xmid: (maxx + minx) / 2,\n ymid: (maxy + miny) / 2,\n length: width,\n massCenter: center,\n mass: nodeNum,\n };\n const quad = new Quad(quadParams);\n const quadTree = new QuadTree(quad);\n\n // build the tree, insert the nodes(quads) into the tree\n for (let i = 0; i < nodeNum; i += 1) {\n const { id } = nodes[i];\n if (prune && graph.getDegree(id) <= 1) continue;\n\n if (bodies[id].in(quad)) quadTree.insert(bodies[id]);\n }\n // update the repulsive forces and the gravity.\n for (let i = 0; i < nodeNum; i += 1) {\n const { id, data } = nodes[i];\n const degree = graph.getDegree(id);\n if (prune && degree <= 1) continue;\n\n bodies[id].resetForce();\n quadTree.updateForce(bodies[id]);\n forces[id][0] -= bodies[id].fx;\n forces[id][1] -= bodies[id].fy;\n\n // gravity\n const dir = [data.x - center[0], data.y - center[1]];\n let eucliDis = Math.hypot(dir[0], dir[1]);\n eucliDis = eucliDis < 0.0001 ? 0.0001 : eucliDis;\n dir[0] = dir[0] / eucliDis;\n dir[1] = dir[1] / eucliDis;\n const fg = kg * (degree + 1); // tslint:disable-line\n forces[id][0] -= fg * dir[0];\n forces[id][1] -= fg * dir[1];\n }\n return forces;\n }\n\n /**\n * Calculate the repulsive forces for nodes.\n * @param graph graph for calculatiion\n * @param iter current iteration index\n * @param preventOverlapIters the iteration number for preventing overlappings\n * @param forces forces for nodes, which will be modified\n * @param krPrime larger the krPrime, larger the repulsive force\n * @param sizes nodes' sizes\n * @param options formatted layout's input options\n * @returns\n */\n private getRepGraForces(\n graph: CalcGraph,\n iter: number,\n preventOverlapIters: number,\n forces: ForceMap,\n krPrime: number,\n sizes: SizeMap,\n options: FormattedOptions\n ): ForceMap {\n const { preventOverlap, kr, kg, center, prune } = options;\n const nodes = graph.getAllNodes();\n const nodeNum = nodes.length;\n for (let i = 0; i < nodeNum; i += 1) {\n const nodei = nodes[i];\n const degreei = graph.getDegree(nodei.id);\n for (let j = i + 1; j < nodeNum; j += 1) {\n const nodej = nodes[j];\n const degreej = graph.getDegree(nodej.id);\n\n if (prune && (degreei <= 1 || degreej <= 1)) continue;\n\n const dir = [nodej.data.x - nodei.data.x, nodej.data.y - nodei.data.y];\n let eucliDis = Math.hypot(dir[0], dir[1]);\n eucliDis = eucliDis < 0.0001 ? 0.0001 : eucliDis;\n dir[0] = dir[0] / eucliDis;\n dir[1] = dir[1] / eucliDis;\n\n if (preventOverlap && iter < preventOverlapIters) {\n eucliDis = eucliDis - sizes[nodei.id] - sizes[nodej.id];\n }\n\n let fr = (kr * (degreei + 1) * (degreej + 1)) / eucliDis;\n\n if (preventOverlap && iter < preventOverlapIters && eucliDis < 0) {\n fr = krPrime * (degreei + 1) * (degreej + 1);\n } else if (\n preventOverlap &&\n iter < preventOverlapIters &&\n eucliDis === 0\n ) {\n fr = 0;\n } else if (\n preventOverlap &&\n iter < preventOverlapIters &&\n eucliDis > 0\n ) {\n fr = (kr * (degreei + 1) * (degreej + 1)) / eucliDis;\n }\n forces[nodei.id][0] -= fr * dir[0];\n forces[nodej.id][0] += fr * dir[0];\n forces[nodei.id][1] -= fr * dir[1];\n forces[nodej.id][1] += fr * dir[1];\n }\n\n // gravity\n const dir = [nodei.data.x - center[0], nodei.data.y - center[1]];\n const eucliDis = Math.hypot(dir[0], dir[1]);\n dir[0] = dir[0] / eucliDis;\n dir[1] = dir[1] / eucliDis;\n const fg = kg * (degreei + 1); // tslint:disable-line\n forces[nodei.id][0] -= fg * dir[0];\n forces[nodei.id][1] -= fg * dir[1];\n }\n return forces;\n }\n\n /**\n * Update node positions.\n * @param graph graph for calculatiion\n * @param forces forces for nodes, which will be modified\n * @param preForces previous forces for nodes, which will be modified\n * @param sg constant for move distance of one step\n * @param options formatted layout's input options\n * @returns\n */\n private updatePos(\n graph: CalcGraph,\n forces: ForceMap,\n preForces: ForceMap,\n sg: number,\n options: FormattedOptions\n ): number {\n const { ks, tao, prune, ksmax } = options;\n const nodes = graph.getAllNodes();\n const nodeNum = nodes.length;\n const swgns = [];\n const trans = [];\n // swg(G) and tra(G)\n let swgG = 0;\n let traG = 0;\n let usingSg = sg;\n for (let i = 0; i < nodeNum; i += 1) {\n const { id } = nodes[i];\n const degree = graph.getDegree(id);\n if (prune && degree <= 1) continue;\n\n const minus = [\n forces[id][0] - preForces[id][0],\n forces[id][1] - preForces[id][1],\n ];\n const minusNorm = Math.hypot(minus[0], minus[1]);\n const add = [\n forces[id][0] + preForces[id][0],\n forces[id][1] + preForces[id][1],\n ];\n const addNorm = Math.hypot(add[0], add[1]);\n\n swgns[i] = minusNorm;\n trans[i] = addNorm / 2;\n\n swgG += (degree + 1) * swgns[i];\n traG += (degree + 1) * trans[i];\n }\n\n const preSG = usingSg;\n usingSg = (tao * traG) / swgG;\n if (preSG !== 0) {\n usingSg = usingSg > 1.5 * preSG ? 1.5 * preSG : usingSg;\n }\n // update the node positions\n for (let i = 0; i < nodeNum; i += 1) {\n const { id, data } = nodes[i];\n const degree = graph.getDegree(id);\n if (prune && degree <= 1) continue;\n if (isNumber(data.fx) && isNumber(data.fy)) continue;\n\n let sn = (ks * usingSg) / (1 + usingSg * Math.sqrt(swgns[i]));\n let absForce = Math.hypot(forces[id][0], forces[id][1]);\n absForce = absForce < 0.0001 ? 0.0001 : absForce;\n const max = ksmax / absForce;\n sn = sn > max ? max : sn;\n const dnx = sn * forces[id][0];\n const dny = sn * forces[id][1];\n graph.mergeNodeData(id, {\n x: data.x + dnx,\n y: data.y + dny,\n });\n }\n return usingSg;\n }\n}\n","import { isNumber } from \"@antv/util\";\nimport { Graph as IGraph } from \"@antv/graphlib\";\nimport type {\n Graph,\n LayoutMapping,\n OutNode,\n PointTuple,\n FruchtermanLayoutOptions,\n OutNodeData,\n Edge,\n EdgeData,\n Point,\n LayoutWithIterations,\n} from \"./types\";\nimport { cloneFormatData } from \"./util\";\n\nconst DEFAULTS_LAYOUT_OPTIONS: Partial<FruchtermanLayoutOptions> = {\n maxIteration: 1000,\n gravity: 10,\n speed: 5,\n clustering: false,\n clusterGravity: 10,\n width: 300,\n height: 300,\n nodeClusterBy: \"cluster\",\n};\nconst SPEED_DIVISOR = 800;\n\ninterface ClusterMap {\n [clusterName: string]: {\n name: string;\n cx: number;\n cy: number;\n count: number;\n };\n}\n\ntype CalcGraph = IGraph<OutNodeData, EdgeData>;\n\ntype DisplacementMap = {\n [id: string]: Point;\n};\n\ninterface FormattedOptions extends FruchtermanLayoutOptions {\n width: number;\n height: number;\n center: PointTuple;\n maxIteration: number;\n nodeClusterBy: string;\n gravity: number;\n speed: number;\n}\n\n/**\n * Layout with fructherman force model\n *\n * @example\n * // Assign layout options when initialization.\n * const layout = new FruchtermanLayout({ center: [100, 100] });\n * const positions = await layout.execute(graph); // { nodes: [], edges: [] }\n *\n * // Or use different options later.\n * const layout = new FruchtermanLayout({ center: [100, 100] });\n * const positions = await layout.execute(graph, { center: [100, 100] }); // { nodes: [], edges: [] }\n *\n * // If you want to assign the positions directly to the nodes, use assign method.\n * await layout.assign(graph, { center: [100, 100] });\n */\nexport class FruchtermanLayout\n implements LayoutWithIterations<FruchtermanLayoutOptions>\n{\n id = \"fruchterman\";\n\n private timeInterval: number = 0;\n\n private running: boolean = false;\n private lastLayoutNodes: OutNode[];\n private lastLayoutEdges: Edge[];\n private lastAssign: boolean;\n private lastGraph: IGraph<OutNodeData, EdgeData>;\n private lastOptions: FormattedOptions;\n private lastClusterMap: ClusterMap;\n private lastResult: LayoutMapping;\n\n constructor(\n public options: FruchtermanLayoutOptions = {} as FruchtermanLayoutOptions\n ) {\n this.options = {\n ...DEFAULTS_LAYOUT_OPTIONS,\n ...options,\n };\n }\n\n /**\n * Return the positions of nodes and edges(if needed).\n */\n async execute(graph: Graph, options?: FruchtermanLayoutOptions) {\n return this.genericFruchtermanLayout(false, graph, options);\n }\n /**\n * To directly assign the positions to the nodes.\n */\n async assign(graph: Graph, options?: FruchtermanLayoutOptions) {\n this.genericFruchtermanLayout(true, graph, options);\n }\n\n /**\n * Stop simulation immediately.\n */\n stop() {\n if (this.timeInterval && typeof window !== \"undefined\") {\n window.clearInterval(this.timeInterval);\n }\n this.running = false;\n }\n\n /**\n * Manually steps the simulation by the specified number of iterations.\n * @see https://github.com/d3/d3-force#simulation_tick\n */\n tick(iterations = this.options.maxIteration || 1) {\n if (this.lastResult) {\n return this.lastResult;\n }\n\n for (let i = 0; i < iterations; i++) {\n this.runOneStep(this.lastGraph, this.lastClusterMap, this.lastOptions);\n }\n\n const result = {\n nodes: this.lastLayoutNodes,\n edges: this.lastLayoutEdges,\n };\n\n if (this.lastAssign) {\n result.nodes.forEach((node) =>\n this.lastGraph.mergeNodeData(node.id, {\n x: node.data.x,\n y: node.data.y,\n z: this.options.dimensions === 3 ? node.data.z : undefined\n })\n );\n }\n\n return result;\n }\n\n private async genericFruchtermanLayout(\n assign: false,\n graph: Graph,\n options?: FruchtermanLayoutOptions\n ): Promise<LayoutMapping>;\n private async genericFruchtermanLayout(\n assign: true,\n graph: Graph,\n options?: FruchtermanLayoutOptions\n ): Promise<void>;\n private async genericFruchtermanLayout(\n assign: boolean,\n graph: Graph,\n options?: FruchtermanLayoutOptions\n ): Promise<LayoutMapping | void> {\n if (this.running) return;\n\n const formattedOptions = this.formatOptions(options);\n const {\n dimensions,\n width,\n height,\n center,\n clustering,\n nodeClusterBy,\n maxIteration,\n onTick,\n } = formattedOptions;\n\n const nodes = graph.getAllNodes();\n const edges = graph.getAllEdges();\n\n if (!nodes?.length) {\n const result = { nodes: [] as any[], edges };\n this.lastResult = result;\n return result;\n }\n\n if (nodes.length === 1) {\n if (assign) {\n graph.mergeNodeData(nodes[0].id, {\n x: center[0],\n y: center[1],\n z: dimensions === 3 ? center[2] : undefined\n });\n }\n const result = {\n nodes: [\n {\n ...nodes[0],\n data: {\n ...nodes[0].data,\n x: center[0],\n y: center[1],\n z: dimensions === 3 ? center[2] : undefined\n },\n },\n ],\n edges,\n };\n this.lastResult = result;\n return result;\n }\n\n const layoutNodes: OutNode[] = nodes.map(\n (node) => cloneFormatData(node, [width, height]) as OutNode\n );\n const calcGraph = new IGraph<OutNodeData, EdgeData>({\n nodes: layoutNodes,\n edges,\n });\n\n // clustering info\n const clusterMap: ClusterMap = {};\n if (clustering) {\n layoutNodes.forEach((node) => {\n const clusterValue = node.data[nodeClusterBy] as string;\n if (!clusterMap[clusterValue]) {\n clusterMap[clusterValue] = {\n name: clusterValue,\n cx: 0,\n cy: 0,\n count: 0,\n };\n }\n });\n }\n\n // Use them later in `tick`.\n this.lastLayoutNodes = layoutNodes;\n this.lastLayoutEdges = edges;\n this.lastAssign = assign;\n this.lastGraph = calcGraph;\n this.lastOptions = formattedOptions;\n this.lastClusterMap = clusterMap;\n\n if (typeof window === \"undefined\") return;\n let iter = 0;\n\n return new Promise((resolve) => {\n // interval for render the result after each iteration\n this.timeInterval = window.setInterval(() => {\n if (!this.running) {\n resolve({ nodes: layoutNodes, edges });\n return;\n }\n\n this.runOneStep(calcGraph, clusterMap, formattedOptions);\n if (assign) {\n layoutNodes.forEach(({ id, data }) =>\n graph.mergeNodeData(id, {\n x: data.x,\n y: data.y,\n z: dimensions === 3 ? data.z : undefined\n })\n );\n }\n onTick?.({\n nodes: layoutNodes,\n edges,\n });\n iter++;\n if (iter >= maxIteration) {\n window.clearInterval(this.timeInterval);\n resolve({ nodes: layoutNodes, edges });\n }\n }, 0);\n this.running = true;\n });\n }\n\n private formatOptions(\n options: FruchtermanLayoutOptions = {}\n ): FormattedOptions {\n const mergedOptions = { ...this.options, ...options } as FormattedOptions;\n const { clustering, nodeClusterBy } = mergedOptions;\n\n const {\n center: propsCenter,\n width: propsWidth,\n height: propsHeight,\n } = mergedOptions;\n mergedOptions.width =\n !propsWidth && typeof window !== \"undefined\"\n ? window.innerWidth\n : (propsWidth as number);\n mergedOptions.height =\n !propsHeight && typeof window !== \"undefined\"\n ? window.innerHeight\n : (propsHeight as number);\n mergedOptions.center = !propsCenter\n ? [mergedOptions.width / 2, mergedOptions.height / 2]\n : (propsCenter as PointTuple);\n\n mergedOptions.clustering = clustering && !!nodeClusterBy;\n\n return mergedOptions;\n }\n\n private runOneStep(\n calcGraph: CalcGraph,\n clusterMap: ClusterMap,\n options: FormattedOptions\n ) {\n const {\n dimensions,\n height,\n width,\n gravity,\n center,\n speed,\n clustering,\n nodeClusterBy,\n clusterGravity: propsClusterGravity,\n } = options;\n const area = height * width;\n const maxDisplace = Math.sqrt(area) / 10;\n const nodes = calcGraph.getAllNodes();\n const k2 = area / (nodes.length + 1);\n const k = Math.sqrt(k2);\n const displacements: DisplacementMap = {};\n this.applyCalculate(calcGraph, displacements, k, k2);\n\n // gravity for clusters\n if (clustering) {\n // reset the clustering centers\n for (const key in clusterMap) {\n clusterMap[key].cx = 0;\n clusterMap[key].cy = 0;\n clusterMap[key].count = 0;\n }\n // re-compute clustering centers\n nodes.forEach((node) => {\n const { data } = node; // node is one of layoutNodes, which is formatted and data field exists\n const c = clusterMap[data[nodeClusterBy] as string];\n if (isNumber(data.x)) {\n c.cx += data.x;\n }\n if (isNumber(data.y)) {\n c.cy += data.y;\n }\n c.count++;\n });\n for (const key in clusterMap) {\n clusterMap[key].cx /= clusterMap[key].count;\n clusterMap[key].cy /= clusterMap[key].count;\n }\n\n // compute the cluster gravity forces\n const clusterGravity = (propsClusterGravity || gravity) as number;\n nodes.forEach((node, j) => {\n const { id, data } = node;\n if (!isNumber(data.x) || !isNumber(data.y)) return;\n const c = clusterMap[data[nodeClusterBy] as string];\n const distLength = Math.sqrt(\n (data.x - c.cx) * (data.x - c.cx) + (data.y - c.cy) * (data.y - c.cy)\n );\n const gravityForce = k * clusterGravity;\n displacements[id].x -= (gravityForce * (data.x - c.cx)) / distLength;\n displacements[id].y -= (gravityForce * (data.y - c.cy)) / distLength;\n });\n }\n\n // gravity\n nodes.forEach((node, j) => {\n const { id, data } = node;\n if (!isNumber(data.x) || !isNumber(data.y)) return;\n const gravityForce = 0.01 * k * gravity;\n displacements[id].x -= gravityForce * (data.x - center[0]);\n displacements[id].y -= gravityForce * (data.y - center[1]);\n if (dimensions === 3) {\n displacements[id].z -= gravityForce * (data.z - center[2]);\n }\n });\n\n // move\n nodes.forEach((node: OutNode, j) => {\n const { id, data } = node;\n if (isNumber(data.fx) && isNumber(data.fy)) {\n data.x = data.fx as number;\n data.y = data.fy as number;\n if (dimensions === 3) {\n data.z = data.fz as number;\n }\n return;\n }\n if (!isNumber(data.x) || !isNumber(data.y)) return;\n const distLength = Math.sqrt(\n displacements[id].x * displacements[id].x +\n displacements[id].y * displacements[id].y + (dimensions === 3 ? displacements[id].z * displacements[id].z : 0)\n );\n if (distLength > 0) {\n // && !n.isFixed()\n const limitedDist = Math.min(\n maxDisplace * (speed / SPEED_DIVISOR),\n distLength\n );\n calcGraph.mergeNodeData(id, {\n x: data.x + (displacements[id].x / distLength) * limitedDist,\n y: data.y + (displacements[id].y / distLength) * limitedDist,\n z: dimensions === 3 ? data.z + (displacements[id].z / distLength) * limitedDist : undefined\n });\n }\n });\n }\n private applyCalculate(\n calcGraph: CalcGraph,\n displacements: DisplacementMap,\n k: number,\n k2: number\n ) {\n this.calRepulsive(calcGraph, displacements, k2);\n this.calAttractive(calcGraph, displacements, k);\n }\n\n private calRepulsive(\n calcGraph: CalcGraph,\n displacements: DisplacementMap,\n k2: number\n ) {\n const nodes = calcGraph.getAllNodes();\n nodes.forEach(({ data: v, id: vid }, i) => {\n displacements[vid] = { x: 0, y: 0, z: 0 };\n nodes.forEach(({ data: u, id: uid }, j) => {\n if (\n i <= j ||\n !isNumber(v.x) ||\n !isNumber(u.x) ||\n !isNumber(v.y) ||\n !isNumber(u.y)\n ) {\n return;\n }\n let vecX = v.x - u.x;\n let vecY = v.y - u.y;\n let vecZ = this.options.dimensions === 3 ? v.z - u.z : 0;\n let lengthSqr = vecX * vecX + vecY * vecY + vecZ * vecZ;\n if (lengthSqr === 0) {\n lengthSqr = 1;\n vecX = 0.01;\n vecY = 0.01;\n vecZ = 0.01;\n }\n const common = k2 / lengthSqr;\n const dispX = vecX * common;\n const dispY = vecY * common;\n const dispZ = vecZ * common;\n displacements[vid].x += dispX;\n displacements[vid].y += dispY;\n displacements[uid].x -= dispX;\n displacements[uid].y -= dispY;\n\n if (this.options.dimensions === 3) {\n displacements[vid].z += dispZ;\n displacements[uid].z -= dispZ;\n }\n });\n });\n }\n\n private calAttractive(\n calcGraph: CalcGraph,\n displacements: DisplacementMap,\n k: number\n ) {\n const edges = calcGraph.getAllEdges();\n edges.forEach((e) => {\n const { source, target } = e;\n if (!source || !target || source === target) {\n return;\n }\n const { data: u } = calcGraph.getNode(source);\n const { data: v } = calcGraph.getNode(target);\n if (\n !isNumber(v.x) ||\n !isNumber(u.x) ||\n !isNumber(v.y) ||\n !isNumber(u.y)\n ) {\n return;\n }\n const vecX = v.x - u.x;\n const vecY = v.y - u.y;\n const vecZ = this.options.dimensions === 3 ? v.z - u.z : 0;\n const common = Math.sqrt(vecX * vecX + vecY * vecY + vecZ * vecZ) / k;\n const dispX = vecX * common;\n const dispY = vecY * common;\n const dispZ = vecZ * common;\n displacements[source].x += dispX;\n displacements[source].y += dispY;\n displacements[target].x -= dispX;\n displacements[target].y -= dispY;\n\n if (this.options.dimensions === 3) {\n displacements[source].z += dispZ;\n displacements[target].z -= dispZ;\n }\n });\n }\n}\n","import { isString, isNumber } from \"@antv/util\";\nimport { isArray, formatSizeFn, formatNumberFn, cloneFormatData } from \"./util\";\nimport type {\n Graph,\n GridLayoutOptions,\n LayoutMapping,\n PointTuple,\n Layout,\n OutNode,\n Node,\n Edge,\n} from \"./types\";\nimport { handleSingleNodeGraph } from \"./util/common\";\n\ntype RowsAndCols = {\n rows: number;\n cols: number;\n};\n\ntype RowAndCol = {\n row: number;\n col: number;\n};\n\ntype IdMapRowAndCol = {\n [id: string]: RowAndCol;\n};\n\ntype VisitMap = {\n [id: string]: boolean;\n};\n\nconst DEFAULTS_LAYOUT_OPTIONS: Partial<GridLayoutOptions> = {\n begin: [0, 0],\n preventOverlap: true,\n preventOverlapPadding: 10,\n condense: false,\n rows: undefined,\n cols: undefined,\n position: undefined,\n sortBy: \"degree\",\n nodeSize: 30,\n width: 300,\n height: 300,\n};\n\n/**\n * Layout arranging the nodes in a grid.\n *\n * @example\n * // Assign layout options when initialization.\n * const layout = new GridLayout({ rows: 10 });\n * const positions = await layout.execute(graph); // { nodes: [], edges: [] }\n *\n * // Or use different options later.\n * const layout = new GridLayout({ rows: 10 });\n * const positions = await layout.execute(graph, { rows: 20 }); // { nodes: [], edges: [] }\n *\n * // If you want to assign the positions directly to the nodes, use assign method.\n * await layout.assign(graph, { rows: 20 });\n */\nexport class GridLayout implements Layout<GridLayoutOptions> {\n id = \"grid\";\n\n constructor(public options: GridLayoutOptions = {} as GridLayoutOptions) {\n this.options = {\n ...DEFAULTS_LAYOUT_OPTIONS,\n ...options,\n };\n }\n\n /**\n * Return the positions of nodes and edges(if needed).\n */\n async execute(graph: Graph, options?: GridLayoutOptions) {\n return this.genericGridLayout(false, graph, options);\n }\n /**\n * To directly assign the positions to the nodes.\n */\n async assign(graph: Graph, options?: GridLayoutOptions) {\n this.genericGridLayout(true, graph, options);\n }\n\n private async genericGridLayout(\n assign: false,\n graph: Graph,\n options?: GridLayoutOptions\n ): Promise<LayoutMapping>;\n private async genericGridLayout(\n assign: true,\n graph: Graph,\n options?: GridLayoutOptions\n ): Promise<void>;\n private async genericGridLayout(\n assign: boolean,\n graph: Graph,\n options?: GridLayoutOptions\n ): Promise<LayoutMapping | void> {\n const mergedOptions = { ...this.options, ...options };\n const {\n begin = [0, 0],\n condense,\n preventOverlapPadding,\n preventOverlap,\n rows: propsRows,\n cols: propsCols,\n nodeSpacing: paramNodeSpacing,\n nodeSize: paramNodeSize,\n width: propsWidth,\n height: propsHeight,\n position,\n } = mergedOptions;\n let { sortBy } = mergedOptions;\n\n const nodes: Node[] = graph.getAllNodes();\n const edges: Edge[] = graph.getAllEdges();\n\n const n = nodes?.length;\n\n // Need no layout if there is no node.\n if (!n || n === 1) {\n return handleSingleNodeGraph(graph, assign, begin);\n }\n\n const layoutNodes: OutNode[] = nodes.map(\n (node) => cloneFormatData(node) as OutNode\n );\n\n if (\n // `id` should be reserved keyword\n sortBy !== \"id\" &&\n (!isString(sortBy) || (layoutNodes[0] as any).data[sortBy] === undefined)\n ) {\n sortBy = \"degree\";\n }\n\n if (sortBy === \"degree\") {\n layoutNodes.sort(\n (n1, n2) =>\n graph.getDegree(n2.id, \"both\") - graph.getDegree(n1.id, \"both\")\n );\n } else if (sortBy === \"id\") {\n // sort nodes by ID\n layoutNodes.sort((n1, n2) => {\n if (isNumber(n2.id) && isNumber(n1.id)) {\n return n2.id - n1.id;\n }\n return `${n1.id}`.localeCompare(`${n2.id}`);\n });\n } else {\n // sort nodes by value\n layoutNodes.sort(\n (n1, n2) => (n2 as any).data[sortBy!] - (n1 as any).data[sortBy!]\n );\n }\n const width =\n !propsWidth && typeof window !== \"undefined\"\n ? window.innerWidth\n : (propsWidth as number);\n const height =\n !propsHeight && typeof window !== \"undefined\"\n ? window.innerHeight\n : (propsHeight as number);\n\n const cells = n;\n const rcs = { rows: propsRows, cols: propsCols } as RowsAndCols;\n\n // if rows or columns were set in self, use those values\n if (propsRows != null && propsCols != null) {\n rcs.rows = propsRows;\n rcs.cols = propsCols;\n } else if (propsRows != null && propsCols == null) {\n rcs.rows = propsRows;\n rcs.cols = Math.ceil(cells / rcs.rows);\n } else if (propsRows == null && propsCols != null) {\n rcs.cols = propsCols;\n rcs.rows = Math.ceil(cells / rcs.cols);\n } else {\n // otherwise use the automatic values and adjust accordingly\t // otherwise use the automatic values and adjust accordingly\n // width/height * splits^2 = cells where splits is number of times to split width\n const splits = Math.sqrt((cells * height) / width);\n rcs.rows = Math.round(splits);\n rcs.cols = Math.round((width / height) * splits);\n }\n rcs.rows = Math.max(rcs.rows, 1);\n rcs.cols = Math.max(rcs.cols, 1);\n if (rcs.cols * rcs.rows > cells) {\n // otherwise use the automatic values and adjust accordingly\n // if rounding was up, see if we can reduce rows or columns\n const sm = small(rcs) as number;\n const lg = large(rcs) as number;\n\n // reducing the small side takes away the most cells, so try it first\n if ((sm - 1) * lg >= cells) {\n small(rcs, sm - 1);\n } else if ((lg - 1) * sm >= cells) {\n large(rcs, lg - 1);\n }\n } else {\n // if rounding was too low, add rows or columns\n while (rcs.cols * rcs.rows < cells) {\n const sm = small(rcs) as number;\n const lg = large(rcs) as number;\n\n // try to add to larger side first (adds less in multiplication)\n if ((lg + 1) * sm >= cells) {\n large(rcs, lg + 1);\n } else {\n small(rcs, sm + 1);\n }\n }\n }\n\n let cellWidth = condense ? 0 : width / rcs.cols;\n let cellHeight = condense ? 0 : height / rcs.rows;\n\n if (preventOverlap || paramNodeSpacing) {\n const nodeSpacing: Function = formatNumberFn(\n 10,\n paramNodeSpacing as number\n );\n const nodeSize: Function = formatSizeFn(30, paramNodeSize, false);\n layoutNodes.forEach((node) => {\n if (!node.data.x || !node.data.y) {\n // for bb\n node.data.x = 0;\n node.data.y = 0;\n }\n\n const oNode = graph.getNode(node.id);\n const res = nodeSize(oNode) || 30;\n\n let nodeW;\n let nodeH;\n\n if (isArray(res)) {\n nodeW = res[0];\n nodeH = res[1];\n } else {\n nodeW = res;\n nodeH = res;\n }\n\n const p =\n nodeSpacing !== undefined ? nodeSpacing(node) : preventOverlapPadding;\n\n const w = nodeW + p;\n const h = nodeH + p;\n\n cellWidth = Math.max(cellWidth, w);\n cellHeight = Math.max(cellHeight, h);\n });\n }\n\n const cellUsed: VisitMap = {}; // e.g. 'c-0-2' => true\n\n // to keep track of current cell position\n const rc = { row: 0, col: 0 };\n\n // get a cache of all the manual positions\n const id2manPos: IdMapRowAndCol = {};\n for (let i = 0; i < layoutNodes.length; i++) {\n const node = layoutNodes[i];\n let rcPos;\n if (position) {\n // TODO: not sure the api name\n rcPos = position(graph.getNode(node.id));\n }\n\n if (rcPos && (rcPos.row !== undefined || rcPos.col !== undefined)) {\n // must have at least row or col def'd\n const pos = {\n row: rcPos.row,\n col: rcPos.col,\n } as RowAndCol;\n\n if (pos.col === undefined) {\n // find unused col\n pos.col = 0;\n\n while (used(cellUsed, pos)) {\n pos.col++;\n }\n } else if (pos.row === undefined) {\n // find unused row\n pos.row = 0;\n\n while (used(cellUsed, pos)) {\n pos.row++;\n }\n }\n\n id2manPos[node.id] = pos as RowAndCol;\n use(cellUsed, pos);\n }\n getPos(node, begin, cellWidth, cellHeight, id2manPos, rcs, rc, cellUsed);\n }\n const result = {\n nodes: layoutNodes,\n edges,\n };\n\n if (assign) {\n layoutNodes.forEach((node) => {\n graph.mergeNodeData(node.id, {\n x: node.data.x,\n y: node.data.y,\n });\n });\n }\n return result;\n }\n}\n\nconst small = (\n rcs: { rows: number; cols: number },\n val?: number\n): number | undefined => {\n let res: number | undefined;\n const rows = rcs.rows || 5;\n const cols = rcs.cols || 5;\n if (val == null) {\n res = Math.min(rows, cols);\n } else {\n const min = Math.min(rows, cols);\n if (min === rcs.rows) {\n rcs.rows = val;\n } else {\n rcs.cols = val;\n }\n }\n return res;\n};\n\nconst large = (rcs: RowsAndCols, val?: number): number | undefined => {\n let result: number | undefined;\n const usedRows = rcs.rows || 5;\n const usedCols = rcs.cols || 5;\n if (val == null) {\n result = Math.max(usedRows, usedCols);\n } else {\n const max = Math.max(usedRows, usedCols);\n if (max === rcs.rows) {\n rcs.rows = val;\n } else {\n rcs.cols = val;\n }\n }\n return result;\n};\n\nconst used = (cellUsed: VisitMap, rc: RowAndCol) =>\n cellUsed[`c-${rc.row}-${rc.col}`] || false;\n\nconst use = (cellUsed: VisitMap, rc: RowAndCol) =>\n (cellUsed[`c-${rc.row}-${rc.col}`] = true);\n\nconst moveToNextCell = (rcs: RowsAndCols, rc: RowAndCol) => {\n const cols = rcs.cols || 5;\n rc.col++;\n if (rc.col >= cols) {\n rc.col = 0;\n rc.row++;\n }\n};\n\nconst getPos = (\n node: OutNode,\n begin: PointTuple,\n cellWidth: number,\n cellHeight: number,\n id2manPos: IdMapRowAndCol,\n rcs: RowsAndCols,\n rc: RowAndCol,\n cellUsed: VisitMap\n) => {\n let x: number;\n let y: number;\n\n // see if we have a manual position set\n const rcPos = id2manPos[node.id];\n if (rcPos) {\n x = rcPos.col * cellWidth + cellWidth / 2 + begin[0];\n y = rcPos.row * cellHeight + cellHeight / 2 + begin[1];\n } else {\n // otherwise set automatically\n\n while (used(cellUsed, rc)) {\n moveToNextCell(rcs, rc);\n }\n\n x = rc.col * cellWidth + cellWidth / 2 + begin[0];\n y = rc.row * cellHeight + cellHeight / 2 + begin[1];\n use(cellUsed, rc);\n\n moveToNextCell(rcs, rc);\n }\n node.data.x = x;\n node.data.y = y;\n};\n","// eslint-disable-next-line @typescript-eslint/unbound-method\nconst toString = Object.prototype.toString;\n/**\n * Checks if an object is an instance of an Array (array or typed array, except those that contain bigint values).\n *\n * @param value - Object to check.\n * @returns True if the object is an array or a typed array.\n */\nexport function isAnyArray(value) {\n const tag = toString.call(value);\n return tag.endsWith('Array]') && !tag.includes('Big');\n}\n//# sourceMappingURL=index.js.map","import { isAnyArray } from 'is-any-array';\nimport max from 'ml-array-max';\nimport min from 'ml-array-min';\n\nfunction rescale(input) {\n var options = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : {};\n\n if (!isAnyArray(input)) {\n throw new TypeError('input must be an array');\n } else if (input.length === 0) {\n throw new TypeError('input must not be empty');\n }\n\n var output;\n\n if (options.output !== undefined) {\n if (!isAnyArray(options.output)) {\n throw new TypeError('output option must be an array if specified');\n }\n\n output = options.output;\n } else {\n output = new Array(input.length);\n }\n\n var currentMin = min(input);\n var currentMax = max(input);\n\n if (currentMin === currentMax) {\n throw new RangeError('minimum and maximum input values are equal. Cannot rescale a constant array');\n }\n\n var _options$min = options.min,\n minValue = _options$min === void 0 ? options.autoMinMax ? currentMin : 0 : _options$min,\n _options$max = options.max,\n maxValue = _options$max === void 0 ? options.autoMinMax ? currentMax : 1 : _options$max;\n\n if (minValue >= maxValue) {\n throw new RangeError('min option must be smaller than max option');\n }\n\n var factor = (maxValue - minValue) / (currentMax - currentMin);\n\n for (var i = 0; i < input.length; i++) {\n output[i] = (input[i] - currentMin) * factor + minValue;\n }\n\n return output;\n}\n\nexport { rescale as default };\n","import { isAnyArray } from 'is-any-array';\n\nfunction min(input) {\n var options = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : {};\n\n if (!isAnyArray(input)) {\n throw new TypeError('input must be an array');\n }\n\n if (input.length === 0) {\n throw new TypeError('input must not be empty');\n }\n\n var _options$fromIndex = options.fromIndex,\n fromIndex = _options$fromIndex === void 0 ? 0 : _options$fromIndex,\n _options$toIndex = options.toIndex,\n toIndex = _options$toIndex === void 0 ? input.length : _options$toIndex;\n\n if (fromIndex < 0 || fromIndex >= input.length || !Number.isInteger(fromIndex)) {\n throw new Error('fromIndex must be a positive integer smaller than length');\n }\n\n if (toIndex <= fromIndex || toIndex > input.length || !Number.isInteger(toIndex)) {\n throw new Error('toIndex must be an integer greater than fromIndex and at most equal to length');\n }\n\n var minValue = input[fromIndex];\n\n for (var i = fromIndex + 1; i < toIndex; i++) {\n if (input[i] < minValue) minValue = input[i];\n }\n\n return minValue;\n}\n\nexport { min as default };\n","import { isAnyArray } from 'is-any-array';\n\nfunction max(input) {\n var options = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : {};\n\n if (!isAnyArray(input)) {\n throw new TypeError('input must be an array');\n }\n\n if (input.length === 0) {\n throw new TypeError('input must not be empty');\n }\n\n var _options$fromIndex = options.fromIndex,\n fromIndex = _options$fromIndex === void 0 ? 0 : _options$fromIndex,\n _options$toIndex = options.toIndex,\n toIndex = _options$toIndex === void 0 ? input.length : _options$toIndex;\n\n if (fromIndex < 0 || fromIndex >= input.length || !Number.isInteger(fromIndex)) {\n throw new Error('fromIndex must be a positive integer smaller than length');\n }\n\n if (toIndex <= fromIndex || toIndex > input.length || !Number.isInteger(toIndex)) {\n throw new Error('toIndex must be an integer greater than fromIndex and at most equal to length');\n }\n\n var maxValue = input[fromIndex];\n\n for (var i = fromIndex + 1; i < toIndex; i++) {\n if (input[i] > maxValue) maxValue = input[i];\n }\n\n return maxValue;\n}\n\nexport { max as default };\n","const indent = ' '.repeat(2);\nconst indentData = ' '.repeat(4);\n\nexport function inspectMatrix() {\n return inspectMatrixWithOptions(this);\n}\n\nexport function inspectMatrixWithOptions(matrix, options = {}) {\n const {\n maxRows = 15,\n maxColumns = 10,\n maxNumSize = 8,\n padMinus = 'auto',\n } = options;\n return `${matrix.constructor.name} {\n${indent}[\n${indentData}${inspectData(matrix, maxRows, maxColumns, maxNumSize, padMinus)}\n${indent}]\n${indent}rows: ${matrix.rows}\n${indent}columns: ${matrix.columns}\n}`;\n}\n\nfunction inspectData(matrix, maxRows, maxColumns, maxNumSize, padMinus) {\n const { rows, columns } = matrix;\n const maxI = Math.min(rows, maxRows);\n const maxJ = Math.min(columns, maxColumns);\n const result = [];\n\n if (padMinus === 'auto') {\n padMinus = false;\n loop: for (let i = 0; i < maxI; i++) {\n for (let j = 0; j < maxJ; j++) {\n if (matrix.get(i, j) < 0) {\n padMinus = true;\n break loop;\n }\n }\n }\n }\n\n for (let i = 0; i < maxI; i++) {\n let line = [];\n for (let j = 0; j < maxJ; j++) {\n line.push(formatNumber(matrix.get(i, j), maxNumSize, padMinus));\n }\n result.push(`${line.join(' ')}`);\n }\n if (maxJ !== columns) {\n result[result.length - 1] += ` ... ${columns - maxColumns} more columns`;\n }\n if (maxI !== rows) {\n result.push(`... ${rows - maxRows} more rows`);\n }\n return result.join(`\\n${indentData}`);\n}\n\nfunction formatNumber(num, maxNumSize, padMinus) {\n return (\n num >= 0 && padMinus\n ? ` ${formatNumber2(num, maxNumSize - 1)}`\n : formatNumber2(num, maxNumSize)\n ).padEnd(maxNumSize);\n}\n\nfunction formatNumber2(num, len) {\n // small.length numbers should be as is\n let str = num.toString();\n if (str.length <= len) return str;\n\n // (7)'0.00123' is better then (7)'1.23e-2'\n // (8)'0.000123' is worse then (7)'1.23e-3',\n let fix = num.toFixed(len);\n if (fix.length > len) {\n fix = num.toFixed(Math.max(0, len - (fix.length - len)));\n }\n if (\n fix.length <= len &&\n !fix.startsWith('0.000') &&\n !fix.startsWith('-0.000')\n ) {\n return fix;\n }\n\n // well, if it's still too long the user should've used longer numbers\n let exp = num.toExponential(len);\n if (exp.length > len) {\n exp = num.toExponential(Math.max(0, len - (exp.length - len)));\n }\n return exp.slice(0);\n}\n","import { isAnyArray } from 'is-any-array';\n\n/**\n * @private\n * Check that a row index is not out of bounds\n * @param {Matrix} matrix\n * @param {number} index\n * @param {boolean} [outer]\n */\nexport function checkRowIndex(matrix, index, outer) {\n let max = outer ? matrix.rows : matrix.rows - 1;\n if (index < 0 || index > max) {\n throw new RangeError('Row index out of range');\n }\n}\n\n/**\n * @private\n * Check that a column index is not out of bounds\n * @param {Matrix} matrix\n * @param {number} index\n * @param {boolean} [outer]\n */\nexport function checkColumnIndex(matrix, index, outer) {\n let max = outer ? matrix.columns : matrix.columns - 1;\n if (index < 0 || index > max) {\n throw new RangeError('Column index out of range');\n }\n}\n\n/**\n * @private\n * Check that the provided vector is an array with the right length\n * @param {Matrix} matrix\n * @param {Array|Matrix} vector\n * @return {Array}\n * @throws {RangeError}\n */\nexport function checkRowVector(matrix, vector) {\n if (vector.to1DArray) {\n vector = vector.to1DArray();\n }\n if (vector.length !== matrix.columns) {\n throw new RangeError(\n 'vector size must be the same as the number of columns',\n );\n }\n return vector;\n}\n\n/**\n * @private\n * Check that the provided vector is an array with the right length\n * @param {Matrix} matrix\n * @param {Array|Matrix} vector\n * @return {Array}\n * @throws {RangeError}\n */\nexport function checkColumnVector(matrix, vector) {\n if (vector.to1DArray) {\n vector = vector.to1DArray();\n }\n if (vector.length !== matrix.rows) {\n throw new RangeError('vector size must be the same as the number of rows');\n }\n return vector;\n}\n\nexport function checkRowIndices(matrix, rowIndices) {\n if (!isAnyArray(rowIndices)) {\n throw new TypeError('row indices must be an array');\n }\n\n for (let i = 0; i < rowIndices.length; i++) {\n if (rowIndices[i] < 0 || rowIndices[i] >= matrix.rows) {\n throw new RangeError('row indices are out of range');\n }\n }\n}\n\nexport function checkColumnIndices(matrix, columnIndices) {\n if (!isAnyArray(columnIndices)) {\n throw new TypeError('column indices must be an array');\n }\n\n for (let i = 0; i < columnIndices.length; i++) {\n if (columnIndices[i] < 0 || columnIndices[i] >= matrix.columns) {\n throw new RangeError('column indices are out of range');\n }\n }\n}\n\nexport function checkRange(matrix, startRow, endRow, startColumn, endColumn) {\n if (arguments.length !== 5) {\n throw new RangeError('expected 4 arguments');\n }\n checkNumber('startRow', startRow);\n checkNumber('endRow', endRow);\n checkNumber('startColumn', startColumn);\n checkNumber('endColumn', endColumn);\n if (\n startRow > endRow ||\n startColumn > endColumn ||\n startRow < 0 ||\n startRow >= matrix.rows ||\n endRow < 0 ||\n endRow >= matrix.rows ||\n startColumn < 0 ||\n startColumn >= matrix.columns ||\n endColumn < 0 ||\n endColumn >= matrix.columns\n ) {\n throw new RangeError('Submatrix indices are out of range');\n }\n}\n\nexport function newArray(length, value = 0) {\n let array = [];\n for (let i = 0; i < length; i++) {\n array.push(value);\n }\n return array;\n}\n\nfunction checkNumber(name, value) {\n if (typeof value !== 'number') {\n throw new TypeError(`${name} must be a number`);\n }\n}\n\nexport function checkNonEmpty(matrix) {\n if (matrix.isEmpty()) {\n throw new Error('Empty matrix has no elements to index');\n }\n}\n","import { isAnyArray } from 'is-any-array';\nimport rescale from 'ml-array-rescale';\n\nimport { inspectMatrix, inspectMatrixWithOptions } from './inspect';\nimport { installMathOperations } from './mathOperations';\nimport {\n sumByRow,\n sumByColumn,\n sumAll,\n productByRow,\n productByColumn,\n productAll,\n varianceByRow,\n varianceByColumn,\n varianceAll,\n centerByRow,\n centerByColumn,\n centerAll,\n scaleByRow,\n scaleByColumn,\n scaleAll,\n getScaleByRow,\n getScaleByColumn,\n getScaleAll,\n} from './stat';\nimport {\n checkRowVector,\n checkRowIndex,\n checkColumnIndex,\n checkColumnVector,\n checkRange,\n checkNonEmpty,\n checkRowIndices,\n checkColumnIndices,\n} from './util';\n\nexport class AbstractMatrix {\n static from1DArray(newRows, newColumns, newData) {\n let length = newRows * newColumns;\n if (length !== newData.length) {\n throw new RangeError('data length does not match given dimensions');\n }\n let newMatrix = new Matrix(newRows, newColumns);\n for (let row = 0; row < newRows; row++) {\n for (let column = 0; column < newColumns; column++) {\n newMatrix.set(row, column, newData[row * newColumns + column]);\n }\n }\n return newMatrix;\n }\n\n static rowVector(newData) {\n let vector = new Matrix(1, newData.length);\n for (let i = 0; i < newData.length; i++) {\n vector.set(0, i, newData[i]);\n }\n return vector;\n }\n\n static columnVector(newData) {\n let vector = new Matrix(newData.length, 1);\n for (let i = 0; i < newData.length; i++) {\n vector.set(i, 0, newData[i]);\n }\n return vector;\n }\n\n static zeros(rows, columns) {\n return new Matrix(rows, columns);\n }\n\n static ones(rows, columns) {\n return new Matrix(rows, columns).fill(1);\n }\n\n static rand(rows, columns, options = {}) {\n if (typeof options !== 'object') {\n throw new TypeError('options must be an object');\n }\n const { random = Math.random } = options;\n let matrix = new Matrix(rows, columns);\n for (let i = 0; i < rows; i++) {\n for (let j = 0; j < columns; j++) {\n matrix.set(i, j, random());\n }\n }\n return matrix;\n }\n\n static randInt(rows, columns, options = {}) {\n if (typeof options !== 'object') {\n throw new TypeError('options must be an object');\n }\n const { min = 0, max = 1000, random = Math.random } = options;\n if (!Number.isInteger(min)) throw new TypeError('min must be an integer');\n if (!Number.isInteger(max)) throw new TypeError('max must be an integer');\n if (min >= max) throw new RangeError('min must be smaller than max');\n let interval = max - min;\n let matrix = new Matrix(rows, columns);\n for (let i = 0; i < rows; i++) {\n for (let j = 0; j < columns; j++) {\n let value = min + Math.round(random() * interval);\n matrix.set(i, j, value);\n }\n }\n return matrix;\n }\n\n static eye(rows, columns, value) {\n if (columns === undefined) columns = rows;\n if (value === undefined) value = 1;\n let min = Math.min(rows, columns);\n let matrix = this.zeros(rows, columns);\n for (let i = 0; i < min; i++) {\n matrix.set(i, i, value);\n }\n return matrix;\n }\n\n static diag(data, rows, columns) {\n let l = data.length;\n if (rows === undefined) rows = l;\n if (columns === undefined) columns = rows;\n let min = Math.min(l, rows, columns);\n let matrix = this.zeros(rows, columns);\n for (let i = 0; i < min; i++) {\n matrix.set(i, i, data[i]);\n }\n return matrix;\n }\n\n static min(matrix1, matrix2) {\n matrix1 = this.checkMatrix(matrix1);\n matrix2 = this.checkMatrix(matrix2);\n let rows = matrix1.rows;\n let columns = matrix1.columns;\n let result = new Matrix(rows, columns);\n for (let i = 0; i < rows; i++) {\n for (let j = 0; j < columns; j++) {\n result.set(i, j, Math.min(matrix1.get(i, j), matrix2.get(i, j)));\n }\n }\n return result;\n }\n\n static max(matrix1, matrix2) {\n matrix1 = this.checkMatrix(matrix1);\n matrix2 = this.checkMatrix(matrix2);\n let rows = matrix1.rows;\n let columns = matrix1.columns;\n let result = new this(rows, columns);\n for (let i = 0; i < rows; i++) {\n for (let j = 0; j < columns; j++) {\n result.set(i, j, Math.max(matrix1.get(i, j), matrix2.get(i, j)));\n }\n }\n return result;\n }\n\n static checkMatrix(value) {\n return AbstractMatrix.isMatrix(value) ? value : new Matrix(value);\n }\n\n static isMatrix(value) {\n return value != null && value.klass === 'Matrix';\n }\n\n get size() {\n return this.rows * this.columns;\n }\n\n apply(callback) {\n if (typeof callback !== 'function') {\n throw new TypeError('callback must be a function');\n }\n for (let i = 0; i < this.rows; i++) {\n for (let j = 0; j < this.columns; j++) {\n callback.call(this, i, j);\n }\n }\n return this;\n }\n\n to1DArray() {\n let array = [];\n for (let i = 0; i < this.rows; i++) {\n for (let j = 0; j < this.columns; j++) {\n array.push(this.get(i, j));\n }\n }\n return array;\n }\n\n to2DArray() {\n let copy = [];\n for (let i = 0; i < this.rows; i++) {\n copy.push([]);\n for (let j = 0; j < this.columns; j++) {\n copy[i].push(this.get(i, j));\n }\n }\n return copy;\n }\n\n toJSON() {\n return this.to2DArray();\n }\n\n isRowVector() {\n return this.rows === 1;\n }\n\n isColumnVector() {\n return this.columns === 1;\n }\n\n isVector() {\n return this.rows === 1 || this.columns === 1;\n }\n\n isSquare() {\n return this.rows === this.columns;\n }\n\n isEmpty() {\n return this.rows === 0 || this.columns === 0;\n }\n\n isSymmetric() {\n if (this.isSquare()) {\n for (let i = 0; i < this.rows; i++) {\n for (let j = 0; j <= i; j++) {\n if (this.get(i, j) !== this.get(j, i)) {\n return false;\n }\n }\n }\n return true;\n }\n return false;\n }\n\n isEchelonForm() {\n let i = 0;\n let j = 0;\n let previousColumn = -1;\n let isEchelonForm = true;\n let checked = false;\n while (i < this.rows && isEchelonForm) {\n j = 0;\n checked = false;\n while (j < this.columns && checked === false) {\n if (this.get(i, j) === 0) {\n j++;\n } else if (this.get(i, j) === 1 && j > previousColumn) {\n checked = true;\n previousColumn = j;\n } else {\n isEchelonForm = false;\n checked = true;\n }\n }\n i++;\n }\n return isEchelonForm;\n }\n\n isReducedEchelonForm() {\n let i = 0;\n let j = 0;\n let previousColumn = -1;\n let isReducedEchelonForm = true;\n let checked = false;\n while (i < this.rows && isReducedEchelonForm) {\n j = 0;\n checked = false;\n while (j < this.columns && checked === false) {\n if (this.get(i, j) === 0) {\n j++;\n } else if (this.get(i, j) === 1 && j > previousColumn) {\n checked = true;\n previousColumn = j;\n } else {\n isReducedEchelonForm = false;\n checked = true;\n }\n }\n for (let k = j + 1; k < this.rows; k++) {\n if (this.get(i, k) !== 0) {\n isReducedEchelonForm = false;\n }\n }\n i++;\n }\n return isReducedEchelonForm;\n }\n\n echelonForm() {\n let result = this.clone();\n let h = 0;\n let k = 0;\n while (h < result.rows && k < result.columns) {\n let iMax = h;\n for (let i = h; i < result.rows; i++) {\n if (result.get(i, k) > result.get(iMax, k)) {\n iMax = i;\n }\n }\n if (result.get(iMax, k) === 0) {\n k++;\n } else {\n result.swapRows(h, iMax);\n let tmp = result.get(h, k);\n for (let j = k; j < result.columns; j++) {\n result.set(h, j, result.get(h, j) / tmp);\n }\n for (let i = h + 1; i < result.rows; i++) {\n let factor = result.get(i, k) / result.get(h, k);\n result.set(i, k, 0);\n for (let j = k + 1; j < result.columns; j++) {\n result.set(i, j, result.get(i, j) - result.get(h, j) * factor);\n }\n }\n h++;\n k++;\n }\n }\n return result;\n }\n\n reducedEchelonForm() {\n let result = this.echelonForm();\n let m = result.columns;\n let n = result.rows;\n let h = n - 1;\n while (h >= 0) {\n if (result.maxRow(h) === 0) {\n h--;\n } else {\n let p = 0;\n let pivot = false;\n while (p < n && pivot === false) {\n if (result.get(h, p) === 1) {\n pivot = true;\n } else {\n p++;\n }\n }\n for (let i = 0; i < h; i++) {\n let factor = result.get(i, p);\n for (let j = p; j < m; j++) {\n let tmp = result.get(i, j) - factor * result.get(h, j);\n result.set(i, j, tmp);\n }\n }\n h--;\n }\n }\n return result;\n }\n\n set() {\n throw new Error('set method is unimplemented');\n }\n\n get() {\n throw new Error('get method is unimplemented');\n }\n\n repeat(options = {}) {\n if (typeof options !== 'object') {\n throw new TypeError('options must be an object');\n }\n const { rows = 1, columns = 1 } = options;\n if (!Number.isInteger(rows) || rows <= 0) {\n throw new TypeError('rows must be a positive integer');\n }\n if (!Number.isInteger(columns) || columns <= 0) {\n throw new TypeError('columns must be a positive integer');\n }\n let matrix = new Matrix(this.rows * rows, this.columns * columns);\n for (let i = 0; i < rows; i++) {\n for (let j = 0; j < columns; j++) {\n matrix.setSubMatrix(this, this.rows * i, this.columns * j);\n }\n }\n return matrix;\n }\n\n fill(value) {\n for (let i = 0; i < this.rows; i++) {\n for (let j = 0; j < this.columns; j++) {\n this.set(i, j, value);\n }\n }\n return this;\n }\n\n neg() {\n return this.mulS(-1);\n }\n\n getRow(index) {\n checkRowIndex(this, index);\n let row = [];\n for (let i = 0; i < this.columns; i++) {\n row.push(this.get(index, i));\n }\n return row;\n }\n\n getRowVector(index) {\n return Matrix.rowVector(this.getRow(index));\n }\n\n setRow(index, array) {\n checkRowIndex(this, index);\n array = checkRowVector(this, array);\n for (let i = 0; i < this.columns; i++) {\n this.set(index, i, array[i]);\n }\n return this;\n }\n\n swapRows(row1, row2) {\n checkRowIndex(this, row1);\n checkRowIndex(this, row2);\n for (let i = 0; i < this.columns; i++) {\n let temp = this.get(row1, i);\n this.set(row1, i, this.get(row2, i));\n this.set(row2, i, temp);\n }\n return this;\n }\n\n getColumn(index) {\n checkColumnIndex(this, index);\n let column = [];\n for (let i = 0; i < this.rows; i++) {\n column.push(this.get(i, index));\n }\n return column;\n }\n\n getColumnVector(index) {\n return Matrix.columnVector(this.getColumn(index));\n }\n\n setColumn(index, array) {\n checkColumnIndex(this, index);\n array = checkColumnVector(this, array);\n for (let i = 0; i < this.rows; i++) {\n this.set(i, index, array[i]);\n }\n return this;\n }\n\n swapColumns(column1, column2) {\n checkColumnIndex(this, column1);\n checkColumnIndex(this, column2);\n for (let i = 0; i < this.rows; i++) {\n let temp = this.get(i, column1);\n this.set(i, column1, this.get(i, column2));\n this.set(i, column2, temp);\n }\n return this;\n }\n\n addRowVector(vector) {\n vector = checkRowVector(this, vector);\n for (let i = 0; i < this.rows; i++) {\n for (let j = 0; j < this.columns; j++) {\n this.set(i, j, this.get(i, j) + vector[j]);\n }\n }\n return this;\n }\n\n subRowVector(vector) {\n vector = checkRowVector(this, vector);\n for (let i = 0; i < this.rows; i++) {\n for (let j = 0; j < this.columns; j++) {\n this.set(i, j, this.get(i, j) - vector[j]);\n }\n }\n return this;\n }\n\n mulRowVector(vector) {\n vector = checkRowVector(this, vector);\n for (let i = 0; i < this.rows; i++) {\n for (let j = 0; j < this.columns; j++) {\n this.set(i, j, this.get(i, j) * vector[j]);\n }\n }\n return this;\n }\n\n divRowVector(vector) {\n vector = checkRowVector(this, vector);\n for (let i = 0; i < this.rows; i++) {\n for (let j = 0; j < this.columns; j++) {\n this.set(i, j, this.get(i, j) / vector[j]);\n }\n }\n return this;\n }\n\n addColumnVector(vector) {\n vector = checkColumnVector(this, vector);\n for (let i = 0; i < this.rows; i++) {\n for (let j = 0; j < this.columns; j++) {\n this.set(i, j, this.get(i, j) + vector[i]);\n }\n }\n return this;\n }\n\n subColumnVector(vector) {\n vector = checkColumnVector(this, vector);\n for (let i = 0; i < this.rows; i++) {\n for (let j = 0; j < this.columns; j++) {\n this.set(i, j, this.get(i, j) - vector[i]);\n }\n }\n return this;\n }\n\n mulColumnVector(vector) {\n vector = checkColumnVector(this, vector);\n for (let i = 0; i < this.rows; i++) {\n for (let j = 0; j < this.columns; j++) {\n this.set(i, j, this.get(i, j) * vector[i]);\n }\n }\n return this;\n }\n\n divColumnVector(vector) {\n vector = checkColumnVector(this, vector);\n for (let i = 0; i < this.rows; i++) {\n for (let j = 0; j < this.columns; j++) {\n this.set(i, j, this.get(i, j) / vector[i]);\n }\n }\n return this;\n }\n\n mulRow(index, value) {\n checkRowIndex(this, index);\n for (let i = 0; i < this.columns; i++) {\n this.set(index, i, this.get(index, i) * value);\n }\n return this;\n }\n\n mulColumn(index, value) {\n checkColumnIndex(this, index);\n for (let i = 0; i < this.rows; i++) {\n this.set(i, index, this.get(i, index) * value);\n }\n return this;\n }\n\n max(by) {\n if (this.isEmpty()) {\n return NaN;\n }\n switch (by) {\n case 'row': {\n const max = new Array(this.rows).fill(Number.NEGATIVE_INFINITY);\n for (let row = 0; row < this.rows; row++) {\n for (let column = 0; column < this.columns; column++) {\n if (this.get(row, column) > max[row]) {\n max[row] = this.get(row, column);\n }\n }\n }\n return max;\n }\n case 'column': {\n const max = new Array(this.columns).fill(Number.NEGATIVE_INFINITY);\n for (let row = 0; row < this.rows; row++) {\n for (let column = 0; column < this.columns; column++) {\n if (this.get(row, column) > max[column]) {\n max[column] = this.get(row, column);\n }\n }\n }\n return max;\n }\n case undefined: {\n let max = this.get(0, 0);\n for (let row = 0; row < this.rows; row++) {\n for (let column = 0; column < this.columns; column++) {\n if (this.get(row, column) > max) {\n max = this.get(row, column);\n }\n }\n }\n return max;\n }\n default:\n throw new Error(`invalid option: ${by}`);\n }\n }\n\n maxIndex() {\n checkNonEmpty(this);\n let v = this.get(0, 0);\n let idx = [0, 0];\n for (let i = 0; i < this.rows; i++) {\n for (let j = 0; j < this.columns; j++) {\n if (this.get(i, j) > v) {\n v = this.get(i, j);\n idx[0] = i;\n idx[1] = j;\n }\n }\n }\n return idx;\n }\n\n min(by) {\n if (this.isEmpty()) {\n return NaN;\n }\n\n switch (by) {\n case 'row': {\n const min = new Array(this.rows).fill(Number.POSITIVE_INFINITY);\n for (let row = 0; row < this.rows; row++) {\n for (let column = 0; column < this.columns; column++) {\n if (this.get(row, column) < min[row]) {\n min[row] = this.get(row, column);\n }\n }\n }\n return min;\n }\n case 'column': {\n const min = new Array(this.columns).fill(Number.POSITIVE_INFINITY);\n for (let row = 0; row < this.rows; row++) {\n for (let column = 0; column < this.columns; column++) {\n if (this.get(row, column) < min[column]) {\n min[column] = this.get(row, column);\n }\n }\n }\n return min;\n }\n case undefined: {\n let min = this.get(0, 0);\n for (let row = 0; row < this.rows; row++) {\n for (let column = 0; column < this.columns; column++) {\n if (this.get(row, column) < min) {\n min = this.get(row, column);\n }\n }\n }\n return min;\n }\n default:\n throw new Error(`invalid option: ${by}`);\n }\n }\n\n minIndex() {\n checkNonEmpty(this);\n let v = this.get(0, 0);\n let idx = [0, 0];\n for (let i = 0; i < this.rows; i++) {\n for (let j = 0; j < this.columns; j++) {\n if (this.get(i, j) < v) {\n v = this.get(i, j);\n idx[0] = i;\n idx[1] = j;\n }\n }\n }\n return idx;\n }\n\n maxRow(row) {\n checkRowIndex(this, row);\n if (this.isEmpty()) {\n return NaN;\n }\n let v = this.get(row, 0);\n for (let i = 1; i < this.columns; i++) {\n if (this.get(row, i) > v) {\n v = this.get(row, i);\n }\n }\n return v;\n }\n\n maxRowIndex(row) {\n checkRowIndex(this, row);\n checkNonEmpty(this);\n let v = this.get(row, 0);\n let idx = [row, 0];\n for (let i = 1; i < this.columns; i++) {\n if (this.get(row, i) > v) {\n v = this.get(row, i);\n idx[1] = i;\n }\n }\n return idx;\n }\n\n minRow(row) {\n checkRowIndex(this, row);\n if (this.isEmpty()) {\n return NaN;\n }\n let v = this.get(row, 0);\n for (let i = 1; i < this.columns; i++) {\n if (this.get(row, i) < v) {\n v = this.get(row, i);\n }\n }\n return v;\n }\n\n minRowIndex(row) {\n checkRowIndex(this, row);\n checkNonEmpty(this);\n let v = this.get(row, 0);\n let idx = [row, 0];\n for (let i = 1; i < this.columns; i++) {\n if (this.get(row, i) < v) {\n v = this.get(row, i);\n idx[1] = i;\n }\n }\n return idx;\n }\n\n maxColumn(column) {\n checkColumnIndex(this, column);\n if (this.isEmpty()) {\n return NaN;\n }\n let v = this.get(0, column);\n for (let i = 1; i < this.rows; i++) {\n if (this.get(i, column) > v) {\n v = this.get(i, column);\n }\n }\n return v;\n }\n\n maxColumnIndex(column) {\n checkColumnIndex(this, column);\n checkNonEmpty(this);\n let v = this.get(0, column);\n let idx = [0, column];\n for (let i = 1; i < this.rows; i++) {\n if (this.get(i, column) > v) {\n v = this.get(i, column);\n idx[0] = i;\n }\n }\n return idx;\n }\n\n minColumn(column) {\n checkColumnIndex(this, column);\n if (this.isEmpty()) {\n return NaN;\n }\n let v = this.get(0, column);\n for (let i = 1; i < this.rows; i++) {\n if (this.get(i, column) < v) {\n v = this.get(i, column);\n }\n }\n return v;\n }\n\n minColumnIndex(column) {\n checkColumnIndex(this, column);\n checkNonEmpty(this);\n let v = this.get(0, column);\n let idx = [0, column];\n for (let i = 1; i < this.rows; i++) {\n if (this.get(i, column) < v) {\n v = this.get(i, column);\n idx[0] = i;\n }\n }\n return idx;\n }\n\n diag() {\n let min = Math.min(this.rows, this.columns);\n let diag = [];\n for (let i = 0; i < min; i++) {\n diag.push(this.get(i, i));\n }\n return diag;\n }\n\n norm(type = 'frobenius') {\n let result = 0;\n if (type === 'max') {\n return this.max();\n } else if (type === 'frobenius') {\n for (let i = 0; i < this.rows; i++) {\n for (let j = 0; j < this.columns; j++) {\n result = result + this.get(i, j) * this.get(i, j);\n }\n }\n return Math.sqrt(result);\n } else {\n throw new RangeError(`unknown norm type: ${type}`);\n }\n }\n\n cumulativeSum() {\n let sum = 0;\n for (let i = 0; i < this.rows; i++) {\n for (let j = 0; j < this.columns; j++) {\n sum += this.get(i, j);\n this.set(i, j, sum);\n }\n }\n return this;\n }\n\n dot(vector2) {\n if (AbstractMatrix.isMatrix(vector2)) vector2 = vector2.to1DArray();\n let vector1 = this.to1DArray();\n if (vector1.length !== vector2.length) {\n throw new RangeError('vectors do not have the same size');\n }\n let dot = 0;\n for (let i = 0; i < vector1.length; i++) {\n dot += vector1[i] * vector2[i];\n }\n return dot;\n }\n\n mmul(other) {\n other = Matrix.checkMatrix(other);\n\n let m = this.rows;\n let n = this.columns;\n let p = other.columns;\n\n let result = new Matrix(m, p);\n\n let Bcolj = new Float64Array(n);\n for (let j = 0; j < p; j++) {\n for (let k = 0; k < n; k++) {\n Bcolj[k] = other.get(k, j);\n }\n\n for (let i = 0; i < m; i++) {\n let s = 0;\n for (let k = 0; k < n; k++) {\n s += this.get(i, k) * Bcolj[k];\n }\n\n result.set(i, j, s);\n }\n }\n return result;\n }\n\n strassen2x2(other) {\n other = Matrix.checkMatrix(other);\n let result = new Matrix(2, 2);\n const a11 = this.get(0, 0);\n const b11 = other.get(0, 0);\n const a12 = this.get(0, 1);\n const b12 = other.get(0, 1);\n const a21 = this.get(1, 0);\n const b21 = other.get(1, 0);\n const a22 = this.get(1, 1);\n const b22 = other.get(1, 1);\n\n // Compute intermediate values.\n const m1 = (a11 + a22) * (b11 + b22);\n const m2 = (a21 + a22) * b11;\n const m3 = a11 * (b12 - b22);\n const m4 = a22 * (b21 - b11);\n const m5 = (a11 + a12) * b22;\n const m6 = (a21 - a11) * (b11 + b12);\n const m7 = (a12 - a22) * (b21 + b22);\n\n // Combine intermediate values into the output.\n const c00 = m1 + m4 - m5 + m7;\n const c01 = m3 + m5;\n const c10 = m2 + m4;\n const c11 = m1 - m2 + m3 + m6;\n\n result.set(0, 0, c00);\n result.set(0, 1, c01);\n result.set(1, 0, c10);\n result.set(1, 1, c11);\n return result;\n }\n\n strassen3x3(other) {\n other = Matrix.checkMatrix(other);\n let result = new Matrix(3, 3);\n\n const a00 = this.get(0, 0);\n const a01 = this.get(0, 1);\n const a02 = this.get(0, 2);\n const a10 = this.get(1, 0);\n const a11 = this.get(1, 1);\n const a12 = this.get(1, 2);\n const a20 = this.get(2, 0);\n const a21 = this.get(2, 1);\n const a22 = this.get(2, 2);\n\n const b00 = other.get(0, 0);\n const b01 = other.get(0, 1);\n const b02 = other.get(0, 2);\n const b10 = other.get(1, 0);\n const b11 = other.get(1, 1);\n const b12 = other.get(1, 2);\n const b20 = other.get(2, 0);\n const b21 = other.get(2, 1);\n const b22 = other.get(2, 2);\n\n const m1 = (a00 + a01 + a02 - a10 - a11 - a21 - a22) * b11;\n const m2 = (a00 - a10) * (-b01 + b11);\n const m3 = a11 * (-b00 + b01 + b10 - b11 - b12 - b20 + b22);\n const m4 = (-a00 + a10 + a11) * (b00 - b01 + b11);\n const m5 = (a10 + a11) * (-b00 + b01);\n const m6 = a00 * b00;\n const m7 = (-a00 + a20 + a21) * (b00 - b02 + b12);\n const m8 = (-a00 + a20) * (b02 - b12);\n const m9 = (a20 + a21) * (-b00 + b02);\n const m10 = (a00 + a01 + a02 - a11 - a12 - a20 - a21) * b12;\n const m11 = a21 * (-b00 + b02 + b10 - b11 - b12 - b20 + b21);\n const m12 = (-a02 + a21 + a22) * (b11 + b20 - b21);\n const m13 = (a02 - a22) * (b11 - b21);\n const m14 = a02 * b20;\n const m15 = (a21 + a22) * (-b20 + b21);\n const m16 = (-a02 + a11 + a12) * (b12 + b20 - b22);\n const m17 = (a02 - a12) * (b12 - b22);\n const m18 = (a11 + a12) * (-b20 + b22);\n const m19 = a01 * b10;\n const m20 = a12 * b21;\n const m21 = a10 * b02;\n const m22 = a20 * b01;\n const m23 = a22 * b22;\n\n const c00 = m6 + m14 + m19;\n const c01 = m1 + m4 + m5 + m6 + m12 + m14 + m15;\n const c02 = m6 + m7 + m9 + m10 + m14 + m16 + m18;\n const c10 = m2 + m3 + m4 + m6 + m14 + m16 + m17;\n const c11 = m2 + m4 + m5 + m6 + m20;\n const c12 = m14 + m16 + m17 + m18 + m21;\n const c20 = m6 + m7 + m8 + m11 + m12 + m13 + m14;\n const c21 = m12 + m13 + m14 + m15 + m22;\n const c22 = m6 + m7 + m8 + m9 + m23;\n\n result.set(0, 0, c00);\n result.set(0, 1, c01);\n result.set(0, 2, c02);\n result.set(1, 0, c10);\n result.set(1, 1, c11);\n result.set(1, 2, c12);\n result.set(2, 0, c20);\n result.set(2, 1, c21);\n result.set(2, 2, c22);\n return result;\n }\n\n mmulStrassen(y) {\n y = Matrix.checkMatrix(y);\n let x = this.clone();\n let r1 = x.rows;\n let c1 = x.columns;\n let r2 = y.rows;\n let c2 = y.columns;\n if (c1 !== r2) {\n // eslint-disable-next-line no-console\n console.warn(\n `Multiplying ${r1} x ${c1} and ${r2} x ${c2} matrix: dimensions do not match.`,\n );\n }\n\n // Put a matrix into the top left of a matrix of zeros.\n // `rows` and `cols` are the dimensions of the output matrix.\n function embed(mat, rows, cols) {\n let r = mat.rows;\n let c = mat.columns;\n if (r === rows && c === cols) {\n return mat;\n } else {\n let resultat = AbstractMatrix.zeros(rows, cols);\n resultat = resultat.setSubMatrix(mat, 0, 0);\n return resultat;\n }\n }\n\n // Make sure both matrices are the same size.\n // This is exclusively for simplicity:\n // this algorithm can be implemented with matrices of different sizes.\n\n let r = Math.max(r1, r2);\n let c = Math.max(c1, c2);\n x = embed(x, r, c);\n y = embed(y, r, c);\n\n // Our recursive multiplication function.\n function blockMult(a, b, rows, cols) {\n // For small matrices, resort to naive multiplication.\n if (rows <= 512 || cols <= 512) {\n return a.mmul(b); // a is equivalent to this\n }\n\n // Apply dynamic padding.\n if (rows % 2 === 1 && cols % 2 === 1) {\n a = embed(a, rows + 1, cols + 1);\n b = embed(b, rows + 1, cols + 1);\n } else if (rows % 2 === 1) {\n a = embed(a, rows + 1, cols);\n b = embed(b, rows + 1, cols);\n } else if (cols % 2 === 1) {\n a = embed(a, rows, cols + 1);\n b = embed(b, rows, cols + 1);\n }\n\n let halfRows = parseInt(a.rows / 2, 10);\n let halfCols = parseInt(a.columns / 2, 10);\n // Subdivide input matrices.\n let a11 = a.subMatrix(0, halfRows - 1, 0, halfCols - 1);\n let b11 = b.subMatrix(0, halfRows - 1, 0, halfCols - 1);\n\n let a12 = a.subMatrix(0, halfRows - 1, halfCols, a.columns - 1);\n let b12 = b.subMatrix(0, halfRows - 1, halfCols, b.columns - 1);\n\n let a21 = a.subMatrix(halfRows, a.rows - 1, 0, halfCols - 1);\n let b21 = b.subMatrix(halfRows, b.rows - 1, 0, halfCols - 1);\n\n let a22 = a.subMatrix(halfRows, a.rows - 1, halfCols, a.columns - 1);\n let b22 = b.subMatrix(halfRows, b.rows - 1, halfCols, b.columns - 1);\n\n // Compute intermediate values.\n let m1 = blockMult(\n AbstractMatrix.add(a11, a22),\n AbstractMatrix.add(b11, b22),\n halfRows,\n halfCols,\n );\n let m2 = blockMult(AbstractMatrix.add(a21, a22), b11, halfRows, halfCols);\n let m3 = blockMult(a11, AbstractMatrix.sub(b12, b22), halfRows, halfCols);\n let m4 = blockMult(a22, AbstractMatrix.sub(b21, b11), halfRows, halfCols);\n let m5 = blockMult(AbstractMatrix.add(a11, a12), b22, halfRows, halfCols);\n let m6 = blockMult(\n AbstractMatrix.sub(a21, a11),\n AbstractMatrix.add(b11, b12),\n halfRows,\n halfCols,\n );\n let m7 = blockMult(\n AbstractMatrix.sub(a12, a22),\n AbstractMatrix.add(b21, b22),\n halfRows,\n halfCols,\n );\n\n // Combine intermediate values into the output.\n let c11 = AbstractMatrix.add(m1, m4);\n c11.sub(m5);\n c11.add(m7);\n let c12 = AbstractMatrix.add(m3, m5);\n let c21 = AbstractMatrix.add(m2, m4);\n let c22 = AbstractMatrix.sub(m1, m2);\n c22.add(m3);\n c22.add(m6);\n\n // Crop output to the desired size (undo dynamic padding).\n let resultat = AbstractMatrix.zeros(2 * c11.rows, 2 * c11.columns);\n resultat = resultat.setSubMatrix(c11, 0, 0);\n resultat = resultat.setSubMatrix(c12, c11.rows, 0);\n resultat = resultat.setSubMatrix(c21, 0, c11.columns);\n resultat = resultat.setSubMatrix(c22, c11.rows, c11.columns);\n return resultat.subMatrix(0, rows - 1, 0, cols - 1);\n }\n\n return blockMult(x, y, r, c);\n }\n\n scaleRows(options = {}) {\n if (typeof options !== 'object') {\n throw new TypeError('options must be an object');\n }\n const { min = 0, max = 1 } = options;\n if (!Number.isFinite(min)) throw new TypeError('min must be a number');\n if (!Number.isFinite(max)) throw new TypeError('max must be a number');\n if (min >= max) throw new RangeError('min must be smaller than max');\n let newMatrix = new Matrix(this.rows, this.columns);\n for (let i = 0; i < this.rows; i++) {\n const row = this.getRow(i);\n if (row.length > 0) {\n rescale(row, { min, max, output: row });\n }\n newMatrix.setRow(i, row);\n }\n return newMatrix;\n }\n\n scaleColumns(options = {}) {\n if (typeof options !== 'object') {\n throw new TypeError('options must be an object');\n }\n const { min = 0, max = 1 } = options;\n if (!Number.isFinite(min)) throw new TypeError('min must be a number');\n if (!Number.isFinite(max)) throw new TypeError('max must be a number');\n if (min >= max) throw new RangeError('min must be smaller than max');\n let newMatrix = new Matrix(this.rows, this.columns);\n for (let i = 0; i < this.columns; i++) {\n const column = this.getColumn(i);\n if (column.length) {\n rescale(column, {\n min: min,\n max: max,\n output: column,\n });\n }\n newMatrix.setColumn(i, column);\n }\n return newMatrix;\n }\n\n flipRows() {\n const middle = Math.ceil(this.columns / 2);\n for (let i = 0; i < this.rows; i++) {\n for (let j = 0; j < middle; j++) {\n let first = this.get(i, j);\n let last = this.get(i, this.columns - 1 - j);\n this.set(i, j, last);\n this.set(i, this.columns - 1 - j, first);\n }\n }\n return this;\n }\n\n flipColumns() {\n const middle = Math.ceil(this.rows / 2);\n for (let j = 0; j < this.columns; j++) {\n for (let i = 0; i < middle; i++) {\n let first = this.get(i, j);\n let last = this.get(this.rows - 1 - i, j);\n this.set(i, j, last);\n this.set(this.rows - 1 - i, j, first);\n }\n }\n return this;\n }\n\n kroneckerProduct(other) {\n other = Matrix.checkMatrix(other);\n\n let m = this.rows;\n let n = this.columns;\n let p = other.rows;\n let q = other.columns;\n\n let result = new Matrix(m * p, n * q);\n for (let i = 0; i < m; i++) {\n for (let j = 0; j < n; j++) {\n for (let k = 0; k < p; k++) {\n for (let l = 0; l < q; l++) {\n result.set(p * i + k, q * j + l, this.get(i, j) * other.get(k, l));\n }\n }\n }\n }\n return result;\n }\n\n kroneckerSum(other) {\n other = Matrix.checkMatrix(other);\n if (!this.isSquare() || !other.isSquare()) {\n throw new Error('Kronecker Sum needs two Square Matrices');\n }\n let m = this.rows;\n let n = other.rows;\n let AxI = this.kroneckerProduct(Matrix.eye(n, n));\n let IxB = Matrix.eye(m, m).kroneckerProduct(other);\n return AxI.add(IxB);\n }\n\n transpose() {\n let result = new Matrix(this.columns, this.rows);\n for (let i = 0; i < this.rows; i++) {\n for (let j = 0; j < this.columns; j++) {\n result.set(j, i, this.get(i, j));\n }\n }\n return result;\n }\n\n sortRows(compareFunction = compareNumbers) {\n for (let i = 0; i < this.rows; i++) {\n this.setRow(i, this.getRow(i).sort(compareFunction));\n }\n return this;\n }\n\n sortColumns(compareFunction = compareNumbers) {\n for (let i = 0; i < this.columns; i++) {\n this.setColumn(i, this.getColumn(i).sort(compareFunction));\n }\n return this;\n }\n\n subMatrix(startRow, endRow, startColumn, endColumn) {\n checkRange(this, startRow, endRow, startColumn, endColumn);\n let newMatrix = new Matrix(\n endRow - startRow + 1,\n endColumn - startColumn + 1,\n );\n for (let i = startRow; i <= endRow; i++) {\n for (let j = startColumn; j <= endColumn; j++) {\n newMatrix.set(i - startRow, j - startColumn, this.get(i, j));\n }\n }\n return newMatrix;\n }\n\n subMatrixRow(indices, startColumn, endColumn) {\n if (startColumn === undefined) startColumn = 0;\n if (endColumn === undefined) endColumn = this.columns - 1;\n if (\n startColumn > endColumn ||\n startColumn < 0 ||\n startColumn >= this.columns ||\n endColumn < 0 ||\n endColumn >= this.columns\n ) {\n throw new RangeError('Argument out of range');\n }\n\n let newMatrix = new Matrix(indices.length, endColumn - startColumn + 1);\n for (let i = 0; i < indices.length; i++) {\n for (let j = startColumn; j <= endColumn; j++) {\n if (indices[i] < 0 || indices[i] >= this.rows) {\n throw new RangeError(`Row index out of range: ${indices[i]}`);\n }\n newMatrix.set(i, j - startColumn, this.get(indices[i], j));\n }\n }\n return newMatrix;\n }\n\n subMatrixColumn(indices, startRow, endRow) {\n if (startRow === undefined) startRow = 0;\n if (endRow === undefined) endRow = this.rows - 1;\n if (\n startRow > endRow ||\n startRow < 0 ||\n startRow >= this.rows ||\n endRow < 0 ||\n endRow >= this.rows\n ) {\n throw new RangeError('Argument out of range');\n }\n\n let newMatrix = new Matrix(endRow - startRow + 1, indices.length);\n for (let i = 0; i < indices.length; i++) {\n for (let j = startRow; j <= endRow; j++) {\n if (indices[i] < 0 || indices[i] >= this.columns) {\n throw new RangeError(`Column index out of range: ${indices[i]}`);\n }\n newMatrix.set(j - startRow, i, this.get(j, indices[i]));\n }\n }\n return newMatrix;\n }\n\n setSubMatrix(matrix, startRow, startColumn) {\n matrix = Matrix.checkMatrix(matrix);\n if (matrix.isEmpty()) {\n return this;\n }\n let endRow = startRow + matrix.rows - 1;\n let endColumn = startColumn + matrix.columns - 1;\n checkRange(this, startRow, endRow, startColumn, endColumn);\n for (let i = 0; i < matrix.rows; i++) {\n for (let j = 0; j < matrix.columns; j++) {\n this.set(startRow + i, startColumn + j, matrix.get(i, j));\n }\n }\n return this;\n }\n\n selection(rowIndices, columnIndices) {\n checkRowIndices(this, rowIndices);\n checkColumnIndices(this, columnIndices);\n let newMatrix = new Matrix(rowIndices.length, columnIndices.length);\n for (let i = 0; i < rowIndices.length; i++) {\n let rowIndex = rowIndices[i];\n for (let j = 0; j < columnIndices.length; j++) {\n let columnIndex = columnIndices[j];\n newMatrix.set(i, j, this.get(rowIndex, columnIndex));\n }\n }\n return newMatrix;\n }\n\n trace() {\n let min = Math.min(this.rows, this.columns);\n let trace = 0;\n for (let i = 0; i < min; i++) {\n trace += this.get(i, i);\n }\n return trace;\n }\n\n clone() {\n let newMatrix = new Matrix(this.rows, this.columns);\n for (let row = 0; row < this.rows; row++) {\n for (let column = 0; column < this.columns; column++) {\n newMatrix.set(row, column, this.get(row, column));\n }\n }\n return newMatrix;\n }\n\n sum(by) {\n switch (by) {\n case 'row':\n return sumByRow(this);\n case 'column':\n return sumByColumn(this);\n case undefined:\n return sumAll(this);\n default:\n throw new Error(`invalid option: ${by}`);\n }\n }\n\n product(by) {\n switch (by) {\n case 'row':\n return productByRow(this);\n case 'column':\n return productByColumn(this);\n case undefined:\n return productAll(this);\n default:\n throw new Error(`invalid option: ${by}`);\n }\n }\n\n mean(by) {\n const sum = this.sum(by);\n switch (by) {\n case 'row': {\n for (let i = 0; i < this.rows; i++) {\n sum[i] /= this.columns;\n }\n return sum;\n }\n case 'column': {\n for (let i = 0; i < this.columns; i++) {\n sum[i] /= this.rows;\n }\n return sum;\n }\n case undefined:\n return sum / this.size;\n default:\n throw new Error(`invalid option: ${by}`);\n }\n }\n\n variance(by, options = {}) {\n if (typeof by === 'object') {\n options = by;\n by = undefined;\n }\n if (typeof options !== 'object') {\n throw new TypeError('options must be an object');\n }\n const { unbiased = true, mean = this.mean(by) } = options;\n if (typeof unbiased !== 'boolean') {\n throw new TypeError('unbiased must be a boolean');\n }\n switch (by) {\n case 'row': {\n if (!isAnyArray(mean)) {\n throw new TypeError('mean must be an array');\n }\n return varianceByRow(this, unbiased, mean);\n }\n case 'column': {\n if (!isAnyArray(mean)) {\n throw new TypeError('mean must be an array');\n }\n return varianceByColumn(this, unbiased, mean);\n }\n case undefined: {\n if (typeof mean !== 'number') {\n throw new TypeError('mean must be a number');\n }\n return varianceAll(this, unbiased, mean);\n }\n default:\n throw new Error(`invalid option: ${by}`);\n }\n }\n\n standardDeviation(by, options) {\n if (typeof by === 'object') {\n options = by;\n by = undefined;\n }\n const variance = this.variance(by, options);\n if (by === undefined) {\n return Math.sqrt(variance);\n } else {\n for (let i = 0; i < variance.length; i++) {\n variance[i] = Math.sqrt(variance[i]);\n }\n return variance;\n }\n }\n\n center(by, options = {}) {\n if (typeof by === 'object') {\n options = by;\n by = undefined;\n }\n if (typeof options !== 'object') {\n throw new TypeError('options must be an object');\n }\n const { center = this.mean(by) } = options;\n switch (by) {\n case 'row': {\n if (!isAnyArray(center)) {\n throw new TypeError('center must be an array');\n }\n centerByRow(this, center);\n return this;\n }\n case 'column': {\n if (!isAnyArray(center)) {\n throw new TypeError('center must be an array');\n }\n centerByColumn(this, center);\n return this;\n }\n case undefined: {\n if (typeof center !== 'number') {\n throw new TypeError('center must be a number');\n }\n centerAll(this, center);\n return this;\n }\n default:\n throw new Error(`invalid option: ${by}`);\n }\n }\n\n scale(by, options = {}) {\n if (typeof by === 'object') {\n options = by;\n by = undefined;\n }\n if (typeof options !== 'object') {\n throw new TypeError('options must be an object');\n }\n let scale = options.scale;\n switch (by) {\n case 'row': {\n if (scale === undefined) {\n scale = getScaleByRow(this);\n } else if (!isAnyArray(scale)) {\n throw new TypeError('scale must be an array');\n }\n scaleByRow(this, scale);\n return this;\n }\n case 'column': {\n if (scale === undefined) {\n scale = getScaleByColumn(this);\n } else if (!isAnyArray(scale)) {\n throw new TypeError('scale must be an array');\n }\n scaleByColumn(this, scale);\n return this;\n }\n case undefined: {\n if (scale === undefined) {\n scale = getScaleAll(this);\n } else if (typeof scale !== 'number') {\n throw new TypeError('scale must be a number');\n }\n scaleAll(this, scale);\n return this;\n }\n default:\n throw new Error(`invalid option: ${by}`);\n }\n }\n\n toString(options) {\n return inspectMatrixWithOptions(this, options);\n }\n}\n\nAbstractMatrix.prototype.klass = 'Matrix';\nif (typeof Symbol !== 'undefined') {\n AbstractMatrix.prototype[Symbol.for('nodejs.util.inspect.custom')] =\n inspectMatrix;\n}\n\nfunction compareNumbers(a, b) {\n return a - b;\n}\n\nfunction isArrayOfNumbers(array) {\n return array.every((element) => {\n return typeof element === 'number';\n });\n}\n\n// Synonyms\nAbstractMatrix.random = AbstractMatrix.rand;\nAbstractMatrix.randomInt = AbstractMatrix.randInt;\nAbstractMatrix.diagonal = AbstractMatrix.diag;\nAbstractMatrix.prototype.diagonal = AbstractMatrix.prototype.diag;\nAbstractMatrix.identity = AbstractMatrix.eye;\nAbstractMatrix.prototype.negate = AbstractMatrix.prototype.neg;\nAbstractMatrix.prototype.tensorProduct =\n AbstractMatrix.prototype.kroneckerProduct;\n\nexport default class Matrix extends AbstractMatrix {\n constructor(nRows, nColumns) {\n super();\n if (Matrix.isMatrix(nRows)) {\n // eslint-disable-next-line no-constructor-return\n return nRows.clone();\n } else if (Number.isInteger(nRows) && nRows >= 0) {\n // Create an empty matrix\n this.data = [];\n if (Number.isInteger(nColumns) && nColumns >= 0) {\n for (let i = 0; i < nRows; i++) {\n this.data.push(new Float64Array(nColumns));\n }\n } else {\n throw new TypeError('nColumns must be a positive integer');\n }\n } else if (isAnyArray(nRows)) {\n // Copy the values from the 2D array\n const arrayData = nRows;\n nRows = arrayData.length;\n nColumns = nRows ? arrayData[0].length : 0;\n if (typeof nColumns !== 'number') {\n throw new TypeError(\n 'Data must be a 2D array with at least one element',\n );\n }\n this.data = [];\n for (let i = 0; i < nRows; i++) {\n if (arrayData[i].length !== nColumns) {\n throw new RangeError('Inconsistent array dimensions');\n }\n if (!isArrayOfNumbers(arrayData[i])) {\n throw new TypeError('Input data contains non-numeric values');\n }\n this.data.push(Float64Array.from(arrayData[i]));\n }\n } else {\n throw new TypeError(\n 'First argument must be a positive number or an array',\n );\n }\n this.rows = nRows;\n this.columns = nColumns;\n }\n\n set(rowIndex, columnIndex, value) {\n this.data[rowIndex][columnIndex] = value;\n return this;\n }\n\n get(rowIndex, columnIndex) {\n return this.data[rowIndex][columnIndex];\n }\n\n removeRow(index) {\n checkRowIndex(this, index);\n this.data.splice(index, 1);\n this.rows -= 1;\n return this;\n }\n\n addRow(index, array) {\n if (array === undefined) {\n array = index;\n index = this.rows;\n }\n checkRowIndex(this, index, true);\n array = Float64Array.from(checkRowVector(this, array));\n this.data.splice(index, 0, array);\n this.rows += 1;\n return this;\n }\n\n removeColumn(index) {\n checkColumnIndex(this, index);\n for (let i = 0; i < this.rows; i++) {\n const newRow = new Float64Array(this.columns - 1);\n for (let j = 0; j < index; j++) {\n newRow[j] = this.data[i][j];\n }\n for (let j = index + 1; j < this.columns; j++) {\n newRow[j - 1] = this.data[i][j];\n }\n this.data[i] = newRow;\n }\n this.columns -= 1;\n return this;\n }\n\n addColumn(index, array) {\n if (typeof array === 'undefined') {\n array = index;\n index = this.columns;\n }\n checkColumnIndex(this, index, true);\n array = checkColumnVector(this, array);\n for (let i = 0; i < this.rows; i++) {\n const newRow = new Float64Array(this.columns + 1);\n let j = 0;\n for (; j < index; j++) {\n newRow[j] = this.data[i][j];\n }\n newRow[j++] = array[i];\n for (; j < this.columns + 1; j++) {\n newRow[j] = this.data[i][j - 1];\n }\n this.data[i] = newRow;\n }\n this.columns += 1;\n return this;\n }\n}\n\ninstallMathOperations(AbstractMatrix, Matrix);\n","import { newArray } from './util';\n\nexport function sumByRow(matrix) {\n let sum = newArray(matrix.rows);\n for (let i = 0; i < matrix.rows; ++i) {\n for (let j = 0; j < matrix.columns; ++j) {\n sum[i] += matrix.get(i, j);\n }\n }\n return sum;\n}\n\nexport function sumByColumn(matrix) {\n let sum = newArray(matrix.columns);\n for (let i = 0; i < matrix.rows; ++i) {\n for (let j = 0; j < matrix.columns; ++j) {\n sum[j] += matrix.get(i, j);\n }\n }\n return sum;\n}\n\nexport function sumAll(matrix) {\n let v = 0;\n for (let i = 0; i < matrix.rows; i++) {\n for (let j = 0; j < matrix.columns; j++) {\n v += matrix.get(i, j);\n }\n }\n return v;\n}\n\nexport function productByRow(matrix) {\n let sum = newArray(matrix.rows, 1);\n for (let i = 0; i < matrix.rows; ++i) {\n for (let j = 0; j < matrix.columns; ++j) {\n sum[i] *= matrix.get(i, j);\n }\n }\n return sum;\n}\n\nexport function productByColumn(matrix) {\n let sum = newArray(matrix.columns, 1);\n for (let i = 0; i < matrix.rows; ++i) {\n for (let j = 0; j < matrix.columns; ++j) {\n sum[j] *= matrix.get(i, j);\n }\n }\n return sum;\n}\n\nexport function productAll(matrix) {\n let v = 1;\n for (let i = 0; i < matrix.rows; i++) {\n for (let j = 0; j < matrix.columns; j++) {\n v *= matrix.get(i, j);\n }\n }\n return v;\n}\n\nexport function varianceByRow(matrix, unbiased, mean) {\n const rows = matrix.rows;\n const cols = matrix.columns;\n const variance = [];\n\n for (let i = 0; i < rows; i++) {\n let sum1 = 0;\n let sum2 = 0;\n let x = 0;\n for (let j = 0; j < cols; j++) {\n x = matrix.get(i, j) - mean[i];\n sum1 += x;\n sum2 += x * x;\n }\n if (unbiased) {\n variance.push((sum2 - (sum1 * sum1) / cols) / (cols - 1));\n } else {\n variance.push((sum2 - (sum1 * sum1) / cols) / cols);\n }\n }\n return variance;\n}\n\nexport function varianceByColumn(matrix, unbiased, mean) {\n const rows = matrix.rows;\n const cols = matrix.columns;\n const variance = [];\n\n for (let j = 0; j < cols; j++) {\n let sum1 = 0;\n let sum2 = 0;\n let x = 0;\n for (let i = 0; i < rows; i++) {\n x = matrix.get(i, j) - mean[j];\n sum1 += x;\n sum2 += x * x;\n }\n if (unbiased) {\n variance.push((sum2 - (sum1 * sum1) / rows) / (rows - 1));\n } else {\n variance.push((sum2 - (sum1 * sum1) / rows) / rows);\n }\n }\n return variance;\n}\n\nexport function varianceAll(matrix, unbiased, mean) {\n const rows = matrix.rows;\n const cols = matrix.columns;\n const size = rows * cols;\n\n let sum1 = 0;\n let sum2 = 0;\n let x = 0;\n for (let i = 0; i < rows; i++) {\n for (let j = 0; j < cols; j++) {\n x = matrix.get(i, j) - mean;\n sum1 += x;\n sum2 += x * x;\n }\n }\n if (unbiased) {\n return (sum2 - (sum1 * sum1) / size) / (size - 1);\n } else {\n return (sum2 - (sum1 * sum1) / size) / size;\n }\n}\n\nexport function centerByRow(matrix, mean) {\n for (let i = 0; i < matrix.rows; i++) {\n for (let j = 0; j < matrix.columns; j++) {\n matrix.set(i, j, matrix.get(i, j) - mean[i]);\n }\n }\n}\n\nexport function centerByColumn(matrix, mean) {\n for (let i = 0; i < matrix.rows; i++) {\n for (let j = 0; j < matrix.columns; j++) {\n matrix.set(i, j, matrix.get(i, j) - mean[j]);\n }\n }\n}\n\nexport function centerAll(matrix, mean) {\n for (let i = 0; i < matrix.rows; i++) {\n for (let j = 0; j < matrix.columns; j++) {\n matrix.set(i, j, matrix.get(i, j) - mean);\n }\n }\n}\n\nexport function getScaleByRow(matrix) {\n const scale = [];\n for (let i = 0; i < matrix.rows; i++) {\n let sum = 0;\n for (let j = 0; j < matrix.columns; j++) {\n sum += Math.pow(matrix.get(i, j), 2) / (matrix.columns - 1);\n }\n scale.push(Math.sqrt(sum));\n }\n return scale;\n}\n\nexport function scaleByRow(matrix, scale) {\n for (let i = 0; i < matrix.rows; i++) {\n for (let j = 0; j < matrix.columns; j++) {\n matrix.set(i, j, matrix.get(i, j) / scale[i]);\n }\n }\n}\n\nexport function getScaleByColumn(matrix) {\n const scale = [];\n for (let j = 0; j < matrix.columns; j++) {\n let sum = 0;\n for (let i = 0; i < matrix.rows; i++) {\n sum += Math.pow(matrix.get(i, j), 2) / (matrix.rows - 1);\n }\n scale.push(Math.sqrt(sum));\n }\n return scale;\n}\n\nexport function scaleByColumn(matrix, scale) {\n for (let i = 0; i < matrix.rows; i++) {\n for (let j = 0; j < matrix.columns; j++) {\n matrix.set(i, j, matrix.get(i, j) / scale[j]);\n }\n }\n}\n\nexport function getScaleAll(matrix) {\n const divider = matrix.size - 1;\n let sum = 0;\n for (let j = 0; j < matrix.columns; j++) {\n for (let i = 0; i < matrix.rows; i++) {\n sum += Math.pow(matrix.get(i, j), 2) / divider;\n }\n }\n return Math.sqrt(sum);\n}\n\nexport function scaleAll(matrix, scale) {\n for (let i = 0; i < matrix.rows; i++) {\n for (let j = 0; j < matrix.columns; j++) {\n matrix.set(i, j, matrix.get(i, j) / scale);\n }\n }\n}\n","export function installMathOperations(AbstractMatrix, Matrix) {\n AbstractMatrix.prototype.add = function add(value) {\n if (typeof value === 'number') return this.addS(value);\n return this.addM(value);\n };\n\n AbstractMatrix.prototype.addS = function addS(value) {\n for (let i = 0; i < this.rows; i++) {\n for (let j = 0; j < this.columns; j++) {\n this.set(i, j, this.get(i, j) + value);\n }\n }\n return this;\n };\n\n AbstractMatrix.prototype.addM = function addM(matrix) {\n matrix = Matrix.checkMatrix(matrix);\n if (this.rows !== matrix.rows ||\n this.columns !== matrix.columns) {\n throw new RangeError('Matrices dimensions must be equal');\n }\n for (let i = 0; i < this.rows; i++) {\n for (let j = 0; j < this.columns; j++) {\n this.set(i, j, this.get(i, j) + matrix.get(i, j));\n }\n }\n return this;\n };\n\n AbstractMatrix.add = function add(matrix, value) {\n const newMatrix = new Matrix(matrix);\n return newMatrix.add(value);\n };\n\n AbstractMatrix.prototype.sub = function sub(value) {\n if (typeof value === 'number') return this.subS(value);\n return this.subM(value);\n };\n\n AbstractMatrix.prototype.subS = function subS(value) {\n for (let i = 0; i < this.rows; i++) {\n for (let j = 0; j < this.columns; j++) {\n this.set(i, j, this.get(i, j) - value);\n }\n }\n return this;\n };\n\n AbstractMatrix.prototype.subM = function subM(matrix) {\n matrix = Matrix.checkMatrix(matrix);\n if (this.rows !== matrix.rows ||\n this.columns !== matrix.columns) {\n throw new RangeError('Matrices dimensions must be equal');\n }\n for (let i = 0; i < this.rows; i++) {\n for (let j = 0; j < this.columns; j++) {\n this.set(i, j, this.get(i, j) - matrix.get(i, j));\n }\n }\n return this;\n };\n\n AbstractMatrix.sub = function sub(matrix, value) {\n const newMatrix = new Matrix(matrix);\n return newMatrix.sub(value);\n };\n AbstractMatrix.prototype.subtract = AbstractMatrix.prototype.sub;\n AbstractMatrix.prototype.subtractS = AbstractMatrix.prototype.subS;\n AbstractMatrix.prototype.subtractM = AbstractMatrix.prototype.subM;\n AbstractMatrix.subtract = AbstractMatrix.sub;\n\n AbstractMatrix.prototype.mul = function mul(value) {\n if (typeof value === 'number') return this.mulS(value);\n return this.mulM(value);\n };\n\n AbstractMatrix.prototype.mulS = function mulS(value) {\n for (let i = 0; i < this.rows; i++) {\n for (let j = 0; j < this.columns; j++) {\n this.set(i, j, this.get(i, j) * value);\n }\n }\n return this;\n };\n\n AbstractMatrix.prototype.mulM = function mulM(matrix) {\n matrix = Matrix.checkMatrix(matrix);\n if (this.rows !== matrix.rows ||\n this.columns !== matrix.columns) {\n throw new RangeError('Matrices dimensions must be equal');\n }\n for (let i = 0; i < this.rows; i++) {\n for (let j = 0; j < this.columns; j++) {\n this.set(i, j, this.get(i, j) * matrix.get(i, j));\n }\n }\n return this;\n };\n\n AbstractMatrix.mul = function mul(matrix, value) {\n const newMatrix = new Matrix(matrix);\n return newMatrix.mul(value);\n };\n AbstractMatrix.prototype.multiply = AbstractMatrix.prototype.mul;\n AbstractMatrix.prototype.multiplyS = AbstractMatrix.prototype.mulS;\n AbstractMatrix.prototype.multiplyM = AbstractMatrix.prototype.mulM;\n AbstractMatrix.multiply = AbstractMatrix.mul;\n\n AbstractMatrix.prototype.div = function div(value) {\n if (typeof value === 'number') return this.divS(value);\n return this.divM(value);\n };\n\n AbstractMatrix.prototype.divS = function divS(value) {\n for (let i = 0; i < this.rows; i++) {\n for (let j = 0; j < this.columns; j++) {\n this.set(i, j, this.get(i, j) / value);\n }\n }\n return this;\n };\n\n AbstractMatrix.prototype.divM = function divM(matrix) {\n matrix = Matrix.checkMatrix(matrix);\n if (this.rows !== matrix.rows ||\n this.columns !== matrix.columns) {\n throw new RangeError('Matrices dimensions must be equal');\n }\n for (let i = 0; i < this.rows; i++) {\n for (let j = 0; j < this.columns; j++) {\n this.set(i, j, this.get(i, j) / matrix.get(i, j));\n }\n }\n return this;\n };\n\n AbstractMatrix.div = function div(matrix, value) {\n const newMatrix = new Matrix(matrix);\n return newMatrix.div(value);\n };\n AbstractMatrix.prototype.divide = AbstractMatrix.prototype.div;\n AbstractMatrix.prototype.divideS = AbstractMatrix.prototype.divS;\n AbstractMatrix.prototype.divideM = AbstractMatrix.prototype.divM;\n AbstractMatrix.divide = AbstractMatrix.div;\n\n AbstractMatrix.prototype.mod = function mod(value) {\n if (typeof value === 'number') return this.modS(value);\n return this.modM(value);\n };\n\n AbstractMatrix.prototype.modS = function modS(value) {\n for (let i = 0; i < this.rows; i++) {\n for (let j = 0; j < this.columns; j++) {\n this.set(i, j, this.get(i, j) % value);\n }\n }\n return this;\n };\n\n AbstractMatrix.prototype.modM = function modM(matrix) {\n matrix = Matrix.checkMatrix(matrix);\n if (this.rows !== matrix.rows ||\n this.columns !== matrix.columns) {\n throw new RangeError('Matrices dimensions must be equal');\n }\n for (let i = 0; i < this.rows; i++) {\n for (let j = 0; j < this.columns; j++) {\n this.set(i, j, this.get(i, j) % matrix.get(i, j));\n }\n }\n return this;\n };\n\n AbstractMatrix.mod = function mod(matrix, value) {\n const newMatrix = new Matrix(matrix);\n return newMatrix.mod(value);\n };\n AbstractMatrix.prototype.modulus = AbstractMatrix.prototype.mod;\n AbstractMatrix.prototype.modulusS = AbstractMatrix.prototype.modS;\n AbstractMatrix.prototype.modulusM = AbstractMatrix.prototype.modM;\n AbstractMatrix.modulus = AbstractMatrix.mod;\n\n AbstractMatrix.prototype.and = function and(value) {\n if (typeof value === 'number') return this.andS(value);\n return this.andM(value);\n };\n\n AbstractMatrix.prototype.andS = function andS(value) {\n for (let i = 0; i < this.rows; i++) {\n for (let j = 0; j < this.columns; j++) {\n this.set(i, j, this.get(i, j) & value);\n }\n }\n return this;\n };\n\n AbstractMatrix.prototype.andM = function andM(matrix) {\n matrix = Matrix.checkMatrix(matrix);\n if (this.rows !== matrix.rows ||\n this.columns !== matrix.columns) {\n throw new RangeError('Matrices dimensions must be equal');\n }\n for (let i = 0; i < this.rows; i++) {\n for (let j = 0; j < this.columns; j++) {\n this.set(i, j, this.get(i, j) & matrix.get(i, j));\n }\n }\n return this;\n };\n\n AbstractMatrix.and = function and(matrix, value) {\n const newMatrix = new Matrix(matrix);\n return newMatrix.and(value);\n };\n\n AbstractMatrix.prototype.or = function or(value) {\n if (typeof value === 'number') return this.orS(value);\n return this.orM(value);\n };\n\n AbstractMatrix.prototype.orS = function orS(value) {\n for (let i = 0; i < this.rows; i++) {\n for (let j = 0; j < this.columns; j++) {\n this.set(i, j, this.get(i, j) | value);\n }\n }\n return this;\n };\n\n AbstractMatrix.prototype.orM = function orM(matrix) {\n matrix = Matrix.checkMatrix(matrix);\n if (this.rows !== matrix.rows ||\n this.columns !== matrix.columns) {\n throw new RangeError('Matrices dimensions must be equal');\n }\n for (let i = 0; i < this.rows; i++) {\n for (let j = 0; j < this.columns; j++) {\n this.set(i, j, this.get(i, j) | matrix.get(i, j));\n }\n }\n return this;\n };\n\n AbstractMatrix.or = function or(matrix, value) {\n const newMatrix = new Matrix(matrix);\n return newMatrix.or(value);\n };\n\n AbstractMatrix.prototype.xor = function xor(value) {\n if (typeof value === 'number') return this.xorS(value);\n return this.xorM(value);\n };\n\n AbstractMatrix.prototype.xorS = function xorS(value) {\n for (let i = 0; i < this.rows; i++) {\n for (let j = 0; j < this.columns; j++) {\n this.set(i, j, this.get(i, j) ^ value);\n }\n }\n return this;\n };\n\n AbstractMatrix.prototype.xorM = function xorM(matrix) {\n matrix = Matrix.checkMatrix(matrix);\n if (this.rows !== matrix.rows ||\n this.columns !== matrix.columns) {\n throw new RangeError('Matrices dimensions must be equal');\n }\n for (let i = 0; i < this.rows; i++) {\n for (let j = 0; j < this.columns; j++) {\n this.set(i, j, this.get(i, j) ^ matrix.get(i, j));\n }\n }\n return this;\n };\n\n AbstractMatrix.xor = function xor(matrix, value) {\n const newMatrix = new Matrix(matrix);\n return newMatrix.xor(value);\n };\n\n AbstractMatrix.prototype.leftShift = function leftShift(value) {\n if (typeof value === 'number') return this.leftShiftS(value);\n return this.leftShiftM(value);\n };\n\n AbstractMatrix.prototype.leftShiftS = function leftShiftS(value) {\n for (let i = 0; i < this.rows; i++) {\n for (let j = 0; j < this.columns; j++) {\n this.set(i, j, this.get(i, j) << value);\n }\n }\n return this;\n };\n\n AbstractMatrix.prototype.leftShiftM = function leftShiftM(matrix) {\n matrix = Matrix.checkMatrix(matrix);\n if (this.rows !== matrix.rows ||\n this.columns !== matrix.columns) {\n throw new RangeError('Matrices dimensions must be equal');\n }\n for (let i = 0; i < this.rows; i++) {\n for (let j = 0; j < this.columns; j++) {\n this.set(i, j, this.get(i, j) << matrix.get(i, j));\n }\n }\n return this;\n };\n\n AbstractMatrix.leftShift = function leftShift(matrix, value) {\n const newMatrix = new Matrix(matrix);\n return newMatrix.leftShift(value);\n };\n\n AbstractMatrix.prototype.signPropagatingRightShift = function signPropagatingRightShift(value) {\n if (typeof value === 'number') return this.signPropagatingRightShiftS(value);\n return this.signPropagatingRightShiftM(value);\n };\n\n AbstractMatrix.prototype.signPropagatingRightShiftS = function signPropagatingRightShiftS(value) {\n for (let i = 0; i < this.rows; i++) {\n for (let j = 0; j < this.columns; j++) {\n this.set(i, j, this.get(i, j) >> value);\n }\n }\n return this;\n };\n\n AbstractMatrix.prototype.signPropagatingRightShiftM = function signPropagatingRightShiftM(matrix) {\n matrix = Matrix.checkMatrix(matrix);\n if (this.rows !== matrix.rows ||\n this.columns !== matrix.columns) {\n throw new RangeError('Matrices dimensions must be equal');\n }\n for (let i = 0; i < this.rows; i++) {\n for (let j = 0; j < this.columns; j++) {\n this.set(i, j, this.get(i, j) >> matrix.get(i, j));\n }\n }\n return this;\n };\n\n AbstractMatrix.signPropagatingRightShift = function signPropagatingRightShift(matrix, value) {\n const newMatrix = new Matrix(matrix);\n return newMatrix.signPropagatingRightShift(value);\n };\n\n AbstractMatrix.prototype.rightShift = function rightShift(value) {\n if (typeof value === 'number') return this.rightShiftS(value);\n return this.rightShiftM(value);\n };\n\n AbstractMatrix.prototype.rightShiftS = function rightShiftS(value) {\n for (let i = 0; i < this.rows; i++) {\n for (let j = 0; j < this.columns; j++) {\n this.set(i, j, this.get(i, j) >>> value);\n }\n }\n return this;\n };\n\n AbstractMatrix.prototype.rightShiftM = function rightShiftM(matrix) {\n matrix = Matrix.checkMatrix(matrix);\n if (this.rows !== matrix.rows ||\n this.columns !== matrix.columns) {\n throw new RangeError('Matrices dimensions must be equal');\n }\n for (let i = 0; i < this.rows; i++) {\n for (let j = 0; j < this.columns; j++) {\n this.set(i, j, this.get(i, j) >>> matrix.get(i, j));\n }\n }\n return this;\n };\n\n AbstractMatrix.rightShift = function rightShift(matrix, value) {\n const newMatrix = new Matrix(matrix);\n return newMatrix.rightShift(value);\n };\n AbstractMatrix.prototype.zeroFillRightShift = AbstractMatrix.prototype.rightShift;\n AbstractMatrix.prototype.zeroFillRightShiftS = AbstractMatrix.prototype.rightShiftS;\n AbstractMatrix.prototype.zeroFillRightShiftM = AbstractMatrix.prototype.rightShiftM;\n AbstractMatrix.zeroFillRightShift = AbstractMatrix.rightShift;\n\n AbstractMatrix.prototype.not = function not() {\n for (let i = 0; i < this.rows; i++) {\n for (let j = 0; j < this.columns; j++) {\n this.set(i, j, ~(this.get(i, j)));\n }\n }\n return this;\n };\n\n AbstractMatrix.not = function not(matrix) {\n const newMatrix = new Matrix(matrix);\n return newMatrix.not();\n };\n\n AbstractMatrix.prototype.abs = function abs() {\n for (let i = 0; i < this.rows; i++) {\n for (let j = 0; j < this.columns; j++) {\n this.set(i, j, Math.abs(this.get(i, j)));\n }\n }\n return this;\n };\n\n AbstractMatrix.abs = function abs(matrix) {\n const newMatrix = new Matrix(matrix);\n return newMatrix.abs();\n };\n\n AbstractMatrix.prototype.acos = function acos() {\n for (let i = 0; i < this.rows; i++) {\n for (let j = 0; j < this.columns; j++) {\n this.set(i, j, Math.acos(this.get(i, j)));\n }\n }\n return this;\n };\n\n AbstractMatrix.acos = function acos(matrix) {\n const newMatrix = new Matrix(matrix);\n return newMatrix.acos();\n };\n\n AbstractMatrix.prototype.acosh = function acosh() {\n for (let i = 0; i < this.rows; i++) {\n for (let j = 0; j < this.columns; j++) {\n this.set(i, j, Math.acosh(this.get(i, j)));\n }\n }\n return this;\n };\n\n AbstractMatrix.acosh = function acosh(matrix) {\n const newMatrix = new Matrix(matrix);\n return newMatrix.acosh();\n };\n\n AbstractMatrix.prototype.asin = function asin() {\n for (let i = 0; i < this.rows; i++) {\n for (let j = 0; j < this.columns; j++) {\n this.set(i, j, Math.asin(this.get(i, j)));\n }\n }\n return this;\n };\n\n AbstractMatrix.asin = function asin(matrix) {\n const newMatrix = new Matrix(matrix);\n return newMatrix.asin();\n };\n\n AbstractMatrix.prototype.asinh = function asinh() {\n for (let i = 0; i < this.rows; i++) {\n for (let j = 0; j < this.columns; j++) {\n this.set(i, j, Math.asinh(this.get(i, j)));\n }\n }\n return this;\n };\n\n AbstractMatrix.asinh = function asinh(matrix) {\n const newMatrix = new Matrix(matrix);\n return newMatrix.asinh();\n };\n\n AbstractMatrix.prototype.atan = function atan() {\n for (let i = 0; i < this.rows; i++) {\n for (let j = 0; j < this.columns; j++) {\n this.set(i, j, Math.atan(this.get(i, j)));\n }\n }\n return this;\n };\n\n AbstractMatrix.atan = function atan(matrix) {\n const newMatrix = new Matrix(matrix);\n return newMatrix.atan();\n };\n\n AbstractMatrix.prototype.atanh = function atanh() {\n for (let i = 0; i < this.rows; i++) {\n for (let j = 0; j < this.columns; j++) {\n this.set(i, j, Math.atanh(this.get(i, j)));\n }\n }\n return this;\n };\n\n AbstractMatrix.atanh = function atanh(matrix) {\n const newMatrix = new Matrix(matrix);\n return newMatrix.atanh();\n };\n\n AbstractMatrix.prototype.cbrt = function cbrt() {\n for (let i = 0; i < this.rows; i++) {\n for (let j = 0; j < this.columns; j++) {\n this.set(i, j, Math.cbrt(this.get(i, j)));\n }\n }\n return this;\n };\n\n AbstractMatrix.cbrt = function cbrt(matrix) {\n const newMatrix = new Matrix(matrix);\n return newMatrix.cbrt();\n };\n\n AbstractMatrix.prototype.ceil = function ceil() {\n for (let i = 0; i < this.rows; i++) {\n for (let j = 0; j < this.columns; j++) {\n this.set(i, j, Math.ceil(this.get(i, j)));\n }\n }\n return this;\n };\n\n AbstractMatrix.ceil = function ceil(matrix) {\n const newMatrix = new Matrix(matrix);\n return newMatrix.ceil();\n };\n\n AbstractMatrix.prototype.clz32 = function clz32() {\n for (let i = 0; i < this.rows; i++) {\n for (let j = 0; j < this.columns; j++) {\n this.set(i, j, Math.clz32(this.get(i, j)));\n }\n }\n return this;\n };\n\n AbstractMatrix.clz32 = function clz32(matrix) {\n const newMatrix = new Matrix(matrix);\n return newMatrix.clz32();\n };\n\n AbstractMatrix.prototype.cos = function cos() {\n for (let i = 0; i < this.rows; i++) {\n for (let j = 0; j < this.columns; j++) {\n this.set(i, j, Math.cos(this.get(i, j)));\n }\n }\n return this;\n };\n\n AbstractMatrix.cos = function cos(matrix) {\n const newMatrix = new Matrix(matrix);\n return newMatrix.cos();\n };\n\n AbstractMatrix.prototype.cosh = function cosh() {\n for (let i = 0; i < this.rows; i++) {\n for (let j = 0; j < this.columns; j++) {\n this.set(i, j, Math.cosh(this.get(i, j)));\n }\n }\n return this;\n };\n\n AbstractMatrix.cosh = function cosh(matrix) {\n const newMatrix = new Matrix(matrix);\n return newMatrix.cosh();\n };\n\n AbstractMatrix.prototype.exp = function exp() {\n for (let i = 0; i < this.rows; i++) {\n for (let j = 0; j < this.columns; j++) {\n this.set(i, j, Math.exp(this.get(i, j)));\n }\n }\n return this;\n };\n\n AbstractMatrix.exp = function exp(matrix) {\n const newMatrix = new Matrix(matrix);\n return newMatrix.exp();\n };\n\n AbstractMatrix.prototype.expm1 = function expm1() {\n for (let i = 0; i < this.rows; i++) {\n for (let j = 0; j < this.columns; j++) {\n this.set(i, j, Math.expm1(this.get(i, j)));\n }\n }\n return this;\n };\n\n AbstractMatrix.expm1 = function expm1(matrix) {\n const newMatrix = new Matrix(matrix);\n return newMatrix.expm1();\n };\n\n AbstractMatrix.prototype.floor = function floor() {\n for (let i = 0; i < this.rows; i++) {\n for (let j = 0; j < this.columns; j++) {\n this.set(i, j, Math.floor(this.get(i, j)));\n }\n }\n return this;\n };\n\n AbstractMatrix.floor = function floor(matrix) {\n const newMatrix = new Matrix(matrix);\n return newMatrix.floor();\n };\n\n AbstractMatrix.prototype.fround = function fround() {\n for (let i = 0; i < this.rows; i++) {\n for (let j = 0; j < this.columns; j++) {\n this.set(i, j, Math.fround(this.get(i, j)));\n }\n }\n return this;\n };\n\n AbstractMatrix.fround = function fround(matrix) {\n const newMatrix = new Matrix(matrix);\n return newMatrix.fround();\n };\n\n AbstractMatrix.prototype.log = function log() {\n for (let i = 0; i < this.rows; i++) {\n for (let j = 0; j < this.columns; j++) {\n this.set(i, j, Math.log(this.get(i, j)));\n }\n }\n return this;\n };\n\n AbstractMatrix.log = function log(matrix) {\n const newMatrix = new Matrix(matrix);\n return newMatrix.log();\n };\n\n AbstractMatrix.prototype.log1p = function log1p() {\n for (let i = 0; i < this.rows; i++) {\n for (let j = 0; j < this.columns; j++) {\n this.set(i, j, Math.log1p(this.get(i, j)));\n }\n }\n return this;\n };\n\n AbstractMatrix.log1p = function log1p(matrix) {\n const newMatrix = new Matrix(matrix);\n return newMatrix.log1p();\n };\n\n AbstractMatrix.prototype.log10 = function log10() {\n for (let i = 0; i < this.rows; i++) {\n for (let j = 0; j < this.columns; j++) {\n this.set(i, j, Math.log10(this.get(i, j)));\n }\n }\n return this;\n };\n\n AbstractMatrix.log10 = function log10(matrix) {\n const newMatrix = new Matrix(matrix);\n return newMatrix.log10();\n };\n\n AbstractMatrix.prototype.log2 = function log2() {\n for (let i = 0; i < this.rows; i++) {\n for (let j = 0; j < this.columns; j++) {\n this.set(i, j, Math.log2(this.get(i, j)));\n }\n }\n return this;\n };\n\n AbstractMatrix.log2 = function log2(matrix) {\n const newMatrix = new Matrix(matrix);\n return newMatrix.log2();\n };\n\n AbstractMatrix.prototype.round = function round() {\n for (let i = 0; i < this.rows; i++) {\n for (let j = 0; j < this.columns; j++) {\n this.set(i, j, Math.round(this.get(i, j)));\n }\n }\n return this;\n };\n\n AbstractMatrix.round = function round(matrix) {\n const newMatrix = new Matrix(matrix);\n return newMatrix.round();\n };\n\n AbstractMatrix.prototype.sign = function sign() {\n for (let i = 0; i < this.rows; i++) {\n for (let j = 0; j < this.columns; j++) {\n this.set(i, j, Math.sign(this.get(i, j)));\n }\n }\n return this;\n };\n\n AbstractMatrix.sign = function sign(matrix) {\n const newMatrix = new Matrix(matrix);\n return newMatrix.sign();\n };\n\n AbstractMatrix.prototype.sin = function sin() {\n for (let i = 0; i < this.rows; i++) {\n for (let j = 0; j < this.columns; j++) {\n this.set(i, j, Math.sin(this.get(i, j)));\n }\n }\n return this;\n };\n\n AbstractMatrix.sin = function sin(matrix) {\n const newMatrix = new Matrix(matrix);\n return newMatrix.sin();\n };\n\n AbstractMatrix.prototype.sinh = function sinh() {\n for (let i = 0; i < this.rows; i++) {\n for (let j = 0; j < this.columns; j++) {\n this.set(i, j, Math.sinh(this.get(i, j)));\n }\n }\n return this;\n };\n\n AbstractMatrix.sinh = function sinh(matrix) {\n const newMatrix = new Matrix(matrix);\n return newMatrix.sinh();\n };\n\n AbstractMatrix.prototype.sqrt = function sqrt() {\n for (let i = 0; i < this.rows; i++) {\n for (let j = 0; j < this.columns; j++) {\n this.set(i, j, Math.sqrt(this.get(i, j)));\n }\n }\n return this;\n };\n\n AbstractMatrix.sqrt = function sqrt(matrix) {\n const newMatrix = new Matrix(matrix);\n return newMatrix.sqrt();\n };\n\n AbstractMatrix.prototype.tan = function tan() {\n for (let i = 0; i < this.rows; i++) {\n for (let j = 0; j < this.columns; j++) {\n this.set(i, j, Math.tan(this.get(i, j)));\n }\n }\n return this;\n };\n\n AbstractMatrix.tan = function tan(matrix) {\n const newMatrix = new Matrix(matrix);\n return newMatrix.tan();\n };\n\n AbstractMatrix.prototype.tanh = function tanh() {\n for (let i = 0; i < this.rows; i++) {\n for (let j = 0; j < this.columns; j++) {\n this.set(i, j, Math.tanh(this.get(i, j)));\n }\n }\n return this;\n };\n\n AbstractMatrix.tanh = function tanh(matrix) {\n const newMatrix = new Matrix(matrix);\n return newMatrix.tanh();\n };\n\n AbstractMatrix.prototype.trunc = function trunc() {\n for (let i = 0; i < this.rows; i++) {\n for (let j = 0; j < this.columns; j++) {\n this.set(i, j, Math.trunc(this.get(i, j)));\n }\n }\n return this;\n };\n\n AbstractMatrix.trunc = function trunc(matrix) {\n const newMatrix = new Matrix(matrix);\n return newMatrix.trunc();\n };\n\n AbstractMatrix.pow = function pow(matrix, arg0) {\n const newMatrix = new Matrix(matrix);\n return newMatrix.pow(arg0);\n };\n\n AbstractMatrix.prototype.pow = function pow(value) {\n if (typeof value === 'number') return this.powS(value);\n return this.powM(value);\n };\n\n AbstractMatrix.prototype.powS = function powS(value) {\n for (let i = 0; i < this.rows; i++) {\n for (let j = 0; j < this.columns; j++) {\n this.set(i, j, Math.pow(this.get(i, j), value));\n }\n }\n return this;\n };\n\n AbstractMatrix.prototype.powM = function powM(matrix) {\n matrix = Matrix.checkMatrix(matrix);\n if (this.rows !== matrix.rows ||\n this.columns !== matrix.columns) {\n throw new RangeError('Matrices dimensions must be equal');\n }\n for (let i = 0; i < this.rows; i++) {\n for (let j = 0; j < this.columns; j++) {\n this.set(i, j, Math.pow(this.get(i, j), matrix.get(i, j)));\n }\n }\n return this;\n };\n}\n","import { AbstractMatrix } from '../matrix';\n\nexport default class WrapperMatrix2D extends AbstractMatrix {\n constructor(data) {\n super();\n this.data = data;\n this.rows = data.length;\n this.columns = data[0].length;\n }\n\n set(rowIndex, columnIndex, value) {\n this.data[rowIndex][columnIndex] = value;\n return this;\n }\n\n get(rowIndex, columnIndex) {\n return this.data[rowIndex][columnIndex];\n }\n}\n","export function hypotenuse(a, b) {\n let r = 0;\n if (Math.abs(a) > Math.abs(b)) {\n r = b / a;\n return Math.abs(a) * Math.sqrt(1 + r * r);\n }\n if (b !== 0) {\n r = a / b;\n return Math.abs(b) * Math.sqrt(1 + r * r);\n }\n return 0;\n}\n","import Matrix from '../matrix';\nimport WrapperMatrix2D from '../wrap/WrapperMatrix2D';\n\nimport { hypotenuse } from './util';\n\nexport default class SingularValueDecomposition {\n constructor(value, options = {}) {\n value = WrapperMatrix2D.checkMatrix(value);\n\n if (value.isEmpty()) {\n throw new Error('Matrix must be non-empty');\n }\n\n let m = value.rows;\n let n = value.columns;\n\n const {\n computeLeftSingularVectors = true,\n computeRightSingularVectors = true,\n autoTranspose = false,\n } = options;\n\n let wantu = Boolean(computeLeftSingularVectors);\n let wantv = Boolean(computeRightSingularVectors);\n\n let swapped = false;\n let a;\n if (m < n) {\n if (!autoTranspose) {\n a = value.clone();\n // eslint-disable-next-line no-console\n console.warn(\n 'Computing SVD on a matrix with more columns than rows. Consider enabling autoTranspose',\n );\n } else {\n a = value.transpose();\n m = a.rows;\n n = a.columns;\n swapped = true;\n let aux = wantu;\n wantu = wantv;\n wantv = aux;\n }\n } else {\n a = value.clone();\n }\n\n let nu = Math.min(m, n);\n let ni = Math.min(m + 1, n);\n let s = new Float64Array(ni);\n let U = new Matrix(m, nu);\n let V = new Matrix(n, n);\n\n let e = new Float64Array(n);\n let work = new Float64Array(m);\n\n let si = new Float64Array(ni);\n for (let i = 0; i < ni; i++) si[i] = i;\n\n let nct = Math.min(m - 1, n);\n let nrt = Math.max(0, Math.min(n - 2, m));\n let mrc = Math.max(nct, nrt);\n\n for (let k = 0; k < mrc; k++) {\n if (k < nct) {\n s[k] = 0;\n for (let i = k; i < m; i++) {\n s[k] = hypotenuse(s[k], a.get(i, k));\n }\n if (s[k] !== 0) {\n if (a.get(k, k) < 0) {\n s[k] = -s[k];\n }\n for (let i = k; i < m; i++) {\n a.set(i, k, a.get(i, k) / s[k]);\n }\n a.set(k, k, a.get(k, k) + 1);\n }\n s[k] = -s[k];\n }\n\n for (let j = k + 1; j < n; j++) {\n if (k < nct && s[k] !== 0) {\n let t = 0;\n for (let i = k; i < m; i++) {\n t += a.get(i, k) * a.get(i, j);\n }\n t = -t / a.get(k, k);\n for (let i = k; i < m; i++) {\n a.set(i, j, a.get(i, j) + t * a.get(i, k));\n }\n }\n e[j] = a.get(k, j);\n }\n\n if (wantu && k < nct) {\n for (let i = k; i < m; i++) {\n U.set(i, k, a.get(i, k));\n }\n }\n\n if (k < nrt) {\n e[k] = 0;\n for (let i = k + 1; i < n; i++) {\n e[k] = hypotenuse(e[k], e[i]);\n }\n if (e[k] !== 0) {\n if (e[k + 1] < 0) {\n e[k] = 0 - e[k];\n }\n for (let i = k + 1; i < n; i++) {\n e[i] /= e[k];\n }\n e[k + 1] += 1;\n }\n e[k] = -e[k];\n if (k + 1 < m && e[k] !== 0) {\n for (let i = k + 1; i < m; i++) {\n work[i] = 0;\n }\n for (let i = k + 1; i < m; i++) {\n for (let j = k + 1; j < n; j++) {\n work[i] += e[j] * a.get(i, j);\n }\n }\n for (let j = k + 1; j < n; j++) {\n let t = -e[j] / e[k + 1];\n for (let i = k + 1; i < m; i++) {\n a.set(i, j, a.get(i, j) + t * work[i]);\n }\n }\n }\n if (wantv) {\n for (let i = k + 1; i < n; i++) {\n V.set(i, k, e[i]);\n }\n }\n }\n }\n\n let p = Math.min(n, m + 1);\n if (nct < n) {\n s[nct] = a.get(nct, nct);\n }\n if (m < p) {\n s[p - 1] = 0;\n }\n if (nrt + 1 < p) {\n e[nrt] = a.get(nrt, p - 1);\n }\n e[p - 1] = 0;\n\n if (wantu) {\n for (let j = nct; j < nu; j++) {\n for (let i = 0; i < m; i++) {\n U.set(i, j, 0);\n }\n U.set(j, j, 1);\n }\n for (let k = nct - 1; k >= 0; k--) {\n if (s[k] !== 0) {\n for (let j = k + 1; j < nu; j++) {\n let t = 0;\n for (let i = k; i < m; i++) {\n t += U.get(i, k) * U.get(i, j);\n }\n t = -t / U.get(k, k);\n for (let i = k; i < m; i++) {\n U.set(i, j, U.get(i, j) + t * U.get(i, k));\n }\n }\n for (let i = k; i < m; i++) {\n U.set(i, k, -U.get(i, k));\n }\n U.set(k, k, 1 + U.get(k, k));\n for (let i = 0; i < k - 1; i++) {\n U.set(i, k, 0);\n }\n } else {\n for (let i = 0; i < m; i++) {\n U.set(i, k, 0);\n }\n U.set(k, k, 1);\n }\n }\n }\n\n if (wantv) {\n for (let k = n - 1; k >= 0; k--) {\n if (k < nrt && e[k] !== 0) {\n for (let j = k + 1; j < n; j++) {\n let t = 0;\n for (let i = k + 1; i < n; i++) {\n t += V.get(i, k) * V.get(i, j);\n }\n t = -t / V.get(k + 1, k);\n for (let i = k + 1; i < n; i++) {\n V.set(i, j, V.get(i, j) + t * V.get(i, k));\n }\n }\n }\n for (let i = 0; i < n; i++) {\n V.set(i, k, 0);\n }\n V.set(k, k, 1);\n }\n }\n\n let pp = p - 1;\n let iter = 0;\n let eps = Number.EPSILON;\n while (p > 0) {\n let k, kase;\n for (k = p - 2; k >= -1; k--) {\n if (k === -1) {\n break;\n }\n const alpha =\n Number.MIN_VALUE + eps * Math.abs(s[k] + Math.abs(s[k + 1]));\n if (Math.abs(e[k]) <= alpha || Number.isNaN(e[k])) {\n e[k] = 0;\n break;\n }\n }\n if (k === p - 2) {\n kase = 4;\n } else {\n let ks;\n for (ks = p - 1; ks >= k; ks--) {\n if (ks === k) {\n break;\n }\n let t =\n (ks !== p ? Math.abs(e[ks]) : 0) +\n (ks !== k + 1 ? Math.abs(e[ks - 1]) : 0);\n if (Math.abs(s[ks]) <= eps * t) {\n s[ks] = 0;\n break;\n }\n }\n if (ks === k) {\n kase = 3;\n } else if (ks === p - 1) {\n kase = 1;\n } else {\n kase = 2;\n k = ks;\n }\n }\n\n k++;\n\n switch (kase) {\n case 1: {\n let f = e[p - 2];\n e[p - 2] = 0;\n for (let j = p - 2; j >= k; j--) {\n let t = hypotenuse(s[j], f);\n let cs = s[j] / t;\n let sn = f / t;\n s[j] = t;\n if (j !== k) {\n f = -sn * e[j - 1];\n e[j - 1] = cs * e[j - 1];\n }\n if (wantv) {\n for (let i = 0; i < n; i++) {\n t = cs * V.get(i, j) + sn * V.get(i, p - 1);\n V.set(i, p - 1, -sn * V.get(i, j) + cs * V.get(i, p - 1));\n V.set(i, j, t);\n }\n }\n }\n break;\n }\n case 2: {\n let f = e[k - 1];\n e[k - 1] = 0;\n for (let j = k; j < p; j++) {\n let t = hypotenuse(s[j], f);\n let cs = s[j] / t;\n let sn = f / t;\n s[j] = t;\n f = -sn * e[j];\n e[j] = cs * e[j];\n if (wantu) {\n for (let i = 0; i < m; i++) {\n t = cs * U.get(i, j) + sn * U.get(i, k - 1);\n U.set(i, k - 1, -sn * U.get(i, j) + cs * U.get(i, k - 1));\n U.set(i, j, t);\n }\n }\n }\n break;\n }\n case 3: {\n const scale = Math.max(\n Math.abs(s[p - 1]),\n Math.abs(s[p - 2]),\n Math.abs(e[p - 2]),\n Math.abs(s[k]),\n Math.abs(e[k]),\n );\n const sp = s[p - 1] / scale;\n const spm1 = s[p - 2] / scale;\n const epm1 = e[p - 2] / scale;\n const sk = s[k] / scale;\n const ek = e[k] / scale;\n const b = ((spm1 + sp) * (spm1 - sp) + epm1 * epm1) / 2;\n const c = sp * epm1 * (sp * epm1);\n let shift = 0;\n if (b !== 0 || c !== 0) {\n if (b < 0) {\n shift = 0 - Math.sqrt(b * b + c);\n } else {\n shift = Math.sqrt(b * b + c);\n }\n shift = c / (b + shift);\n }\n let f = (sk + sp) * (sk - sp) + shift;\n let g = sk * ek;\n for (let j = k; j < p - 1; j++) {\n let t = hypotenuse(f, g);\n if (t === 0) t = Number.MIN_VALUE;\n let cs = f / t;\n let sn = g / t;\n if (j !== k) {\n e[j - 1] = t;\n }\n f = cs * s[j] + sn * e[j];\n e[j] = cs * e[j] - sn * s[j];\n g = sn * s[j + 1];\n s[j + 1] = cs * s[j + 1];\n if (wantv) {\n for (let i = 0; i < n; i++) {\n t = cs * V.get(i, j) + sn * V.get(i, j + 1);\n V.set(i, j + 1, -sn * V.get(i, j) + cs * V.get(i, j + 1));\n V.set(i, j, t);\n }\n }\n t = hypotenuse(f, g);\n if (t === 0) t = Number.MIN_VALUE;\n cs = f / t;\n sn = g / t;\n s[j] = t;\n f = cs * e[j] + sn * s[j + 1];\n s[j + 1] = -sn * e[j] + cs * s[j + 1];\n g = sn * e[j + 1];\n e[j + 1] = cs * e[j + 1];\n if (wantu && j < m - 1) {\n for (let i = 0; i < m; i++) {\n t = cs * U.get(i, j) + sn * U.get(i, j + 1);\n U.set(i, j + 1, -sn * U.get(i, j) + cs * U.get(i, j + 1));\n U.set(i, j, t);\n }\n }\n }\n e[p - 2] = f;\n iter = iter + 1;\n break;\n }\n case 4: {\n if (s[k] <= 0) {\n s[k] = s[k] < 0 ? -s[k] : 0;\n if (wantv) {\n for (let i = 0; i <= pp; i++) {\n V.set(i, k, -V.get(i, k));\n }\n }\n }\n while (k < pp) {\n if (s[k] >= s[k + 1]) {\n break;\n }\n let t = s[k];\n s[k] = s[k + 1];\n s[k + 1] = t;\n if (wantv && k < n - 1) {\n for (let i = 0; i < n; i++) {\n t = V.get(i, k + 1);\n V.set(i, k + 1, V.get(i, k));\n V.set(i, k, t);\n }\n }\n if (wantu && k < m - 1) {\n for (let i = 0; i < m; i++) {\n t = U.get(i, k + 1);\n U.set(i, k + 1, U.get(i, k));\n U.set(i, k, t);\n }\n }\n k++;\n }\n iter = 0;\n p--;\n break;\n }\n // no default\n }\n }\n\n if (swapped) {\n let tmp = V;\n V = U;\n U = tmp;\n }\n\n this.m = m;\n this.n = n;\n this.s = s;\n this.U = U;\n this.V = V;\n }\n\n solve(value) {\n let Y = value;\n let e = this.threshold;\n let scols = this.s.length;\n let Ls = Matrix.zeros(scols, scols);\n\n for (let i = 0; i < scols; i++) {\n if (Math.abs(this.s[i]) <= e) {\n Ls.set(i, i, 0);\n } else {\n Ls.set(i, i, 1 / this.s[i]);\n }\n }\n\n let U = this.U;\n let V = this.rightSingularVectors;\n\n let VL = V.mmul(Ls);\n let vrows = V.rows;\n let urows = U.rows;\n let VLU = Matrix.zeros(vrows, urows);\n\n for (let i = 0; i < vrows; i++) {\n for (let j = 0; j < urows; j++) {\n let sum = 0;\n for (let k = 0; k < scols; k++) {\n sum += VL.get(i, k) * U.get(j, k);\n }\n VLU.set(i, j, sum);\n }\n }\n\n return VLU.mmul(Y);\n }\n\n solveForDiagonal(value) {\n return this.solve(Matrix.diag(value));\n }\n\n inverse() {\n let V = this.V;\n let e = this.threshold;\n let vrows = V.rows;\n let vcols = V.columns;\n let X = new Matrix(vrows, this.s.length);\n\n for (let i = 0; i < vrows; i++) {\n for (let j = 0; j < vcols; j++) {\n if (Math.abs(this.s[j]) > e) {\n X.set(i, j, V.get(i, j) / this.s[j]);\n }\n }\n }\n\n let U = this.U;\n\n let urows = U.rows;\n let ucols = U.columns;\n let Y = new Matrix(vrows, urows);\n\n for (let i = 0; i < vrows; i++) {\n for (let j = 0; j < urows; j++) {\n let sum = 0;\n for (let k = 0; k < ucols; k++) {\n sum += X.get(i, k) * U.get(j, k);\n }\n Y.set(i, j, sum);\n }\n }\n\n return Y;\n }\n\n get condition() {\n return this.s[0] / this.s[Math.min(this.m, this.n) - 1];\n }\n\n get norm2() {\n return this.s[0];\n }\n\n get rank() {\n let tol = Math.max(this.m, this.n) * this.s[0] * Number.EPSILON;\n let r = 0;\n let s = this.s;\n for (let i = 0, ii = s.length; i < ii; i++) {\n if (s[i] > tol) {\n r++;\n }\n }\n return r;\n }\n\n get diagonal() {\n return Array.from(this.s);\n }\n\n get threshold() {\n return (Number.EPSILON / 2) * Math.max(this.m, this.n) * this.s[0];\n }\n\n get leftSingularVectors() {\n return this.U;\n }\n\n get rightSingularVectors() {\n return this.V;\n }\n\n get diagonalMatrix() {\n return Matrix.diag(this.s);\n }\n}\n","import { Matrix as MLMatrix, SingularValueDecomposition } from \"ml-matrix\";\nimport type {\n Graph,\n LayoutMapping,\n OutNode,\n PointTuple,\n MDSLayoutOptions,\n Layout,\n Matrix,\n} from \"./types\";\nimport {\n cloneFormatData,\n floydWarshall,\n getAdjMatrix,\n scaleMatrix,\n} from \"./util\";\nimport { handleSingleNodeGraph } from \"./util/common\";\n\nconst DEFAULTS_LAYOUT_OPTIONS: Partial<MDSLayoutOptions> = {\n center: [0, 0],\n linkDistance: 50,\n};\n\n/**\n * Layout arranging the nodes with multiple dimensional scaling algorithm\n *\n * @example\n * // Assign layout options when initialization.\n * const layout = new MDSLayout({ center: [100, 100] });\n * const positions = await layout.execute(graph); // { nodes: [], edges: [] }\n *\n * // Or use different options later.\n * const layout = new MDSLayout({ center: [100, 100] });\n * const positions = await layout.execute(graph, { rows: 20 }); // { nodes: [], edges: [] }\n *\n * // If you want to assign the positions directly to the nodes, use assign method.\n * await layout.assign(graph, { center: [100, 100] });\n */\nexport class MDSLayout implements Layout<MDSLayoutOptions> {\n id = \"mds\";\n\n constructor(public options: MDSLayoutOptions = {} as MDSLayoutOptions) {\n this.options = {\n ...DEFAULTS_LAYOUT_OPTIONS,\n ...options,\n };\n }\n\n /**\n * Return the positions of nodes and edges(if needed).\n */\n async execute(graph: Graph, options?: MDSLayoutOptions) {\n return this.genericMDSLayout(false, graph, options);\n }\n /**\n * To directly assign the positions to the nodes.\n */\n async assign(graph: Graph, options?: MDSLayoutOptions) {\n this.genericMDSLayout(true, graph, options);\n }\n\n private async genericMDSLayout(\n assign: false,\n graph: Graph,\n options?: MDSLayoutOptions\n ): Promise<LayoutMapping>;\n private async genericMDSLayout(\n assign: true,\n graph: Graph,\n options?: MDSLayoutOptions\n ): Promise<void>;\n private async genericMDSLayout(\n assign: boolean,\n graph: Graph,\n options?: MDSLayoutOptions\n ): Promise<LayoutMapping | void> {\n const mergedOptions = { ...this.options, ...options };\n const { center = [0, 0], linkDistance = 50 } = mergedOptions;\n\n const nodes = graph.getAllNodes();\n const edges = graph.getAllEdges();\n\n if (!nodes?.length || nodes.length === 1) {\n return handleSingleNodeGraph(graph, assign, center);\n }\n\n // the graph-theoretic distance (shortest path distance) matrix\n const adjMatrix = getAdjMatrix({ nodes, edges }, false);\n const distances = floydWarshall(adjMatrix);\n handleInfinity(distances);\n\n // scale the ideal edge length acoording to linkDistance\n const scaledD = scaleMatrix(distances, linkDistance);\n\n // get positions by MDS\n const positions = runMDS(scaledD);\n const layoutNodes: OutNode[] = [];\n positions.forEach((p: number[], i: number) => {\n const cnode = cloneFormatData(nodes[i]) as OutNode;\n cnode.data.x = p[0] + center[0];\n cnode.data.y = p[1] + center[1];\n layoutNodes.push(cnode);\n });\n\n if (assign) {\n layoutNodes.forEach((node) =>\n graph.mergeNodeData(node.id, {\n x: node.data.x,\n y: node.data.y,\n })\n );\n }\n\n const result = {\n nodes: layoutNodes,\n edges,\n };\n\n return result;\n }\n}\n\nconst handleInfinity = (distances: Matrix[]) => {\n let maxDistance = -999999;\n distances.forEach((row) => {\n row.forEach((value) => {\n if (value === Infinity) {\n return;\n }\n if (maxDistance < value) {\n maxDistance = value;\n }\n });\n });\n distances.forEach((row, i) => {\n row.forEach((value, j) => {\n if (value === Infinity) {\n distances[i][j] = maxDistance;\n }\n });\n });\n};\n\n/**\n * mds 算法\n * @return {array} positions 计算后的节点位置数组\n */\nconst runMDS = (distances: Matrix[]): PointTuple[] => {\n const dimension = 2;\n\n // square distances\n const M = MLMatrix.mul(MLMatrix.pow(distances, 2), -0.5);\n\n // double centre the rows/columns\n const rowMeans = M.mean(\"row\");\n const colMeans = M.mean(\"column\");\n const totalMean = M.mean();\n M.add(totalMean).subRowVector(rowMeans).subColumnVector(colMeans);\n\n // take the SVD of the double centred matrix, and return the\n // points from it\n const ret = new SingularValueDecomposition(M);\n const eigenValues = MLMatrix.sqrt(ret.diagonalMatrix).diagonal();\n return ret.leftSingularVectors.toJSON().map((row: number[]) => {\n return MLMatrix.mul([row], [eigenValues])\n .toJSON()[0]\n .splice(0, dimension) as PointTuple;\n });\n};\n","import type { Graph, Node, Point } from \"../types\";\n\nconst SPEED_DIVISOR = 800;\n\nexport type RadialNonoverlapForceOptions = {\n positions: Point[];\n focusIdx: number;\n radii: number[];\n iterations: number;\n height: number;\n width: number;\n k: number;\n strictRadial: boolean;\n nodes: Node[];\n speed?: number;\n gravity?: number;\n nodeSizeFunc: (node: Node) => number;\n};\n\nconst DEFAULTS_LAYOUT_OPTIONS: Partial<RadialNonoverlapForceOptions> = {\n iterations: 10,\n height: 10,\n width: 10,\n speed: 100,\n gravity: 10,\n k: 5\n};\n\nexport const radialNonoverlapForce = (graph: Graph, options: RadialNonoverlapForceOptions): Point[] => {\n const mergedOptions = { ...DEFAULTS_LAYOUT_OPTIONS, ...options };\n const { positions, iterations, width, k, speed = 100, strictRadial, focusIdx, radii = [], nodeSizeFunc } = mergedOptions;\n\n const nodes = graph.getAllNodes();\n\n const disp: Point[] = [];\n const maxDisplace = width / 10;\n\n for (let i = 0; i < iterations; i++) {\n positions.forEach((_: Point, k: number) => {\n disp[k] = { x: 0, y: 0 };\n });\n // 给重叠的节点增加斥力\n getRepulsion(nodes, positions, disp, k, radii, nodeSizeFunc);\n updatePositions(positions, disp, speed, strictRadial, focusIdx, maxDisplace, width, radii);\n }\n return positions;\n};\n\nconst getRepulsion = (nodes: Node[], positions: Point[], disp: Point[], k: number, radii: number[], nodeSizeFunc: (node: Node) => number) => {\n positions.forEach((v: Point, i: number) => {\n disp[i] = { x: 0, y: 0 };\n positions.forEach((u: Point, j: number) => {\n if (i === j) {\n return;\n }\n // v and u are not on the same circle, return\n if (radii[i] !== radii[j]) {\n return;\n }\n let vecx = v.x - u.x;\n let vecy = v.y - u.y;\n let vecLength = Math.sqrt(vecx * vecx + vecy * vecy);\n if (vecLength === 0) {\n vecLength = 1;\n const sign = i > j ? 1 : -1;\n vecx = 0.01 * sign;\n vecy = 0.01 * sign;\n }\n // these two nodes overlap\n if (vecLength < nodeSizeFunc(nodes[i]) / 2 + nodeSizeFunc(nodes[j]) / 2) {\n const common = (k * k) / vecLength;\n disp[i].x += (vecx / vecLength) * common;\n disp[i].y += (vecy / vecLength) * common;\n }\n });\n });\n};\n\nconst updatePositions = (positions: Point[], disp: Point[], speed: number, strictRadial: boolean, focusIdx: number, maxDisplace: number, width: number, radii: number[]) => {\n const maxDisp = maxDisplace || width / 10;\n if (strictRadial) {\n disp.forEach((di, i) => {\n const vx = positions[i].x - positions[focusIdx].x;\n const vy = positions[i].y - positions[focusIdx].y;\n const vLength = Math.sqrt(vx * vx + vy * vy);\n let vpx = vy / vLength;\n let vpy = -vx / vLength;\n const diLength = Math.sqrt(di.x * di.x + di.y * di.y);\n let alpha = Math.acos((vpx * di.x + vpy * di.y) / diLength);\n if (alpha > Math.PI / 2) {\n alpha -= Math.PI / 2;\n vpx *= -1;\n vpy *= -1;\n }\n const tdispLength = Math.cos(alpha) * diLength;\n di.x = vpx * tdispLength;\n di.y = vpy * tdispLength;\n });\n }\n\n // move\n positions.forEach((n, i) => {\n if (i === focusIdx) {\n return;\n }\n const distLength = Math.sqrt(disp[i].x * disp[i].x + disp[i].y * disp[i].y);\n if (distLength > 0 && i !== focusIdx) {\n const limitedDist = Math.min(maxDisp * (speed / SPEED_DIVISOR), distLength);\n n.x += (disp[i].x / distLength) * limitedDist;\n n.y += (disp[i].y / distLength) * limitedDist;\n if (strictRadial) {\n let vx = n.x - positions[focusIdx].x;\n let vy = n.y - positions[focusIdx].y;\n const nfDis = Math.sqrt(vx * vx + vy * vy);\n vx = (vx / nfDis) * radii[i];\n vy = (vy / nfDis) * radii[i];\n n.x = positions[focusIdx].x + vx;\n n.y = positions[focusIdx].y + vy;\n }\n }\n });\n return positions;\n};","import { isString } from \"@antv/util\";\nimport type {\n Graph,\n Node,\n LayoutMapping,\n Matrix,\n OutNode,\n PointTuple,\n RadialLayoutOptions,\n Layout,\n Point,\n} from \"../types\";\nimport {\n cloneFormatData,\n floydWarshall,\n getAdjMatrix,\n getEuclideanDistance,\n formatNodeSize,\n} from \"../util\";\nimport { handleSingleNodeGraph } from \"../util/common\";\nimport { mds } from \"./mds\";\nimport {\n radialNonoverlapForce,\n RadialNonoverlapForceOptions,\n} from \"./radial-nonoverlap-force\";\n\nconst DEFAULTS_LAYOUT_OPTIONS: Partial<RadialLayoutOptions> = {\n maxIteration: 1000,\n focusNode: null,\n unitRadius: null,\n linkDistance: 50,\n preventOverlap: false,\n strictRadial: true,\n maxPreventOverlapIteration: 200,\n sortStrength: 10,\n};\n\n/**\n * Layout arranging the nodes' on a radial shape\n *\n * @example\n * // Assign layout options when initialization.\n * const layout = new RadialLayout({ focusNode: 'node0' });\n * const positions = await layout.execute(graph); // { nodes: [], edges: [] }\n *\n * // Or use different options later.\n * const layout = new RadialLayout({ focusNode: 'node0' });\n * const positions = await layout.execute(graph, { focusNode: 'node0' }); // { nodes: [], edges: [] }\n *\n * // If you want to assign the positions directly to the nodes, use assign method.\n * await layout.assign(graph, { focusNode: 'node0' });\n */\nexport class RadialLayout implements Layout<RadialLayoutOptions> {\n id = \"radial\";\n\n constructor(public options: RadialLayoutOptions = {} as RadialLayoutOptions) {\n this.options = {\n ...DEFAULTS_LAYOUT_OPTIONS,\n ...options,\n };\n }\n\n /**\n * Return the positions of nodes and edges(if needed).\n */\n async execute(graph: Graph, options?: RadialLayoutOptions) {\n return this.genericRadialLayout(false, graph, options);\n }\n /**\n * To directly assign the positions to the nodes.\n */\n async assign(graph: Graph, options?: RadialLayoutOptions) {\n this.genericRadialLayout(true, graph, options);\n }\n\n private async genericRadialLayout(\n assign: false,\n graph: Graph,\n options?: RadialLayoutOptions\n ): Promise<LayoutMapping>;\n private async genericRadialLayout(\n assign: true,\n graph: Graph,\n options?: RadialLayoutOptions\n ): Promise<void>;\n private async genericRadialLayout(\n assign: boolean,\n graph: Graph,\n options?: RadialLayoutOptions\n ): Promise<LayoutMapping | void> {\n const mergedOptions = { ...this.options, ...options };\n const {\n width: propsWidth,\n height: propsHeight,\n center: propsCenter,\n focusNode: propsFocusNode,\n unitRadius: propsUnitRadius,\n nodeSize,\n nodeSpacing,\n strictRadial,\n preventOverlap,\n maxPreventOverlapIteration,\n sortBy,\n linkDistance = 50,\n sortStrength = 10,\n maxIteration = 1000,\n } = mergedOptions;\n\n const nodes = graph.getAllNodes();\n const edges = graph.getAllEdges();\n\n const width =\n !propsWidth && typeof window !== \"undefined\"\n ? window.innerWidth\n : propsWidth!;\n const height =\n !propsHeight && typeof window !== \"undefined\"\n ? window.innerHeight\n : propsHeight!;\n const center = (\n !propsCenter ? [width / 2, height / 2] : propsCenter\n ) as PointTuple;\n\n if (!nodes?.length || nodes.length === 1) {\n return handleSingleNodeGraph(graph, assign, center);\n }\n\n let focusNode = nodes[0];\n if (isString(propsFocusNode)) {\n for (let i = 0; i < nodes.length; i++) {\n if (nodes[i].id === propsFocusNode) {\n focusNode = nodes[i];\n break;\n }\n }\n } else {\n focusNode = propsFocusNode || nodes[0];\n }\n\n // the index of the focusNode in data\n const focusIndex = getIndexById(nodes, focusNode.id);\n\n // the graph-theoretic distance (shortest path distance) matrix\n const adjMatrix = getAdjMatrix({ nodes, edges }, false);\n const distances = floydWarshall(adjMatrix);\n const maxDistance = maxToFocus(distances, focusIndex);\n // replace first node in unconnected component to the circle at (maxDistance + 1)\n handleInfinity(distances, focusIndex, maxDistance + 1);\n\n // the shortest path distance from each node to focusNode\n const focusNodeD = distances[focusIndex];\n let semiWidth =\n width - center[0] > center[0] ? center[0] : width - center[0];\n let semiHeight =\n height - center[1] > center[1] ? center[1] : height - center[1];\n if (semiWidth === 0) {\n semiWidth = width / 2;\n }\n if (semiHeight === 0) {\n semiHeight = height / 2;\n }\n // the maxRadius of the graph\n const maxRadius = Math.min(semiWidth, semiHeight);\n const maxD = Math.max(...focusNodeD);\n // the radius for each nodes away from focusNode\n const radii: number[] = [];\n const unitRadius = !propsUnitRadius ? maxRadius / maxD : propsUnitRadius;\n focusNodeD.forEach((value, i) => {\n radii[i] = value * unitRadius;\n });\n\n const idealDistances = eIdealDisMatrix(\n nodes,\n distances,\n linkDistance,\n radii,\n unitRadius,\n sortBy,\n sortStrength\n );\n // the weight matrix, Wij = 1 / dij^(-2)\n const weights = getWeightMatrix(idealDistances);\n\n // the initial positions from mds, move the graph to origin, centered at focusNode\n const mdsResult = mds(linkDistance, idealDistances, linkDistance);\n let positions = mdsResult.map(([x, y]) => ({\n x:\n (isNaN(x) ? Math.random() * linkDistance : x) -\n mdsResult[focusIndex][0],\n y:\n (isNaN(y) ? Math.random() * linkDistance : y) -\n mdsResult[focusIndex][1],\n }));\n\n this.run(\n maxIteration,\n positions,\n weights,\n idealDistances,\n radii,\n focusIndex\n );\n let nodeSizeFunc;\n // stagger the overlapped nodes\n if (preventOverlap) {\n nodeSizeFunc = formatNodeSize(nodeSize, nodeSpacing);\n const nonoverlapForceParams: RadialNonoverlapForceOptions = {\n nodes,\n nodeSizeFunc,\n positions,\n radii,\n height,\n width,\n strictRadial: Boolean(strictRadial),\n focusIdx: focusIndex,\n iterations: maxPreventOverlapIteration || 200,\n k: positions.length / 4.5,\n };\n positions = radialNonoverlapForce(graph, nonoverlapForceParams);\n }\n // move the graph to center\n const layoutNodes: OutNode[] = [];\n positions.forEach((p: Point, i: number) => {\n const cnode = cloneFormatData(nodes[i]) as OutNode;\n cnode.data.x = p.x + center[0];\n cnode.data.y = p.y + center[1];\n layoutNodes.push(cnode);\n });\n\n if (assign) {\n layoutNodes.forEach((node) =>\n graph.mergeNodeData(node.id, {\n x: node.data.x,\n y: node.data.y,\n })\n );\n }\n\n const result = {\n nodes: layoutNodes,\n edges,\n };\n\n return result;\n }\n private run(\n maxIteration: number,\n positions: Point[],\n weights: Matrix[],\n idealDistances: Matrix[],\n radii: number[],\n focusIndex: number\n ) {\n for (let i = 0; i <= maxIteration; i++) {\n const param = i / maxIteration;\n this.oneIteration(\n param,\n positions,\n radii,\n idealDistances,\n weights,\n focusIndex\n );\n }\n }\n private oneIteration(\n param: number,\n positions: Point[],\n radii: number[],\n distances: Matrix[],\n weights: Matrix[],\n focusIndex: number\n ) {\n const vparam = 1 - param;\n positions.forEach((v: Point, i: number) => {\n // v\n const originDis = getEuclideanDistance(v, { x: 0, y: 0 });\n const reciODis = originDis === 0 ? 0 : 1 / originDis;\n if (i === focusIndex) {\n return;\n }\n let xMolecule = 0;\n let yMolecule = 0;\n let denominator = 0;\n positions.forEach((u, j) => {\n // u\n if (i === j) {\n return;\n }\n // the euclidean distance between v and u\n const edis = getEuclideanDistance(v, u);\n const reciEdis = edis === 0 ? 0 : 1 / edis;\n const idealDis = distances[j][i];\n // same for x and y\n denominator += weights[i][j];\n // x\n xMolecule += weights[i][j] * (u.x + idealDis * (v.x - u.x) * reciEdis);\n // y\n yMolecule += weights[i][j] * (u.y + idealDis * (v.y - u.y) * reciEdis);\n });\n const reciR = radii[i] === 0 ? 0 : 1 / radii[i];\n denominator *= vparam;\n denominator += param * reciR * reciR;\n // x\n xMolecule *= vparam;\n xMolecule += param * reciR * v.x * reciODis;\n v.x = xMolecule / denominator;\n // y\n yMolecule *= vparam;\n yMolecule += param * reciR * v.y * reciODis;\n v.y = yMolecule / denominator;\n });\n }\n}\n\nconst eIdealDisMatrix = (\n nodes: Node[],\n distances: Matrix[],\n linkDistance: number,\n radii: number[],\n unitRadius: number,\n sortBy: string | undefined,\n sortStrength: number\n): Matrix[] => {\n if (!nodes) return [];\n const result: Matrix[] = [];\n if (distances) {\n // cache the value of field sortBy for nodes to avoid dupliate calculation\n const sortValueCache: {\n [id: string]: number;\n } = {};\n distances.forEach((row: number[], i: number) => {\n const newRow: Matrix = [];\n row.forEach((v, j) => {\n if (i === j) {\n newRow.push(0);\n } else if (radii[i] === radii[j]) {\n // i and j are on the same circle\n if (sortBy === \"data\") {\n // sort the nodes on the same circle according to the ordering of the data\n newRow.push(\n (v * (Math.abs(i - j) * sortStrength)) / (radii[i] / unitRadius)\n );\n } else if (sortBy) {\n // sort the nodes on the same circle according to the attributes\n let iValue: number;\n let jValue: number;\n if (sortValueCache[nodes[i].id]) {\n iValue = sortValueCache[nodes[i].id];\n } else {\n const value =\n (sortBy === \"id\"\n ? nodes[i].id\n : (nodes[i].data?.[sortBy] as number | string)) || 0;\n if (isString(value)) {\n iValue = value.charCodeAt(0);\n } else {\n iValue = value;\n }\n sortValueCache[nodes[i].id] = iValue;\n }\n\n if (sortValueCache[nodes[j].id]) {\n jValue = sortValueCache[nodes[j].id];\n } else {\n const value =\n (sortBy === \"id\"\n ? nodes[j].id\n : (nodes[j].data?.[sortBy] as number | string)) || 0;\n if (isString(value)) {\n jValue = value.charCodeAt(0);\n } else {\n jValue = value;\n }\n sortValueCache[nodes[j].id] = jValue;\n }\n newRow.push(\n (v * (Math.abs(iValue - jValue) * sortStrength)) /\n (radii[i] / unitRadius)\n );\n } else {\n newRow.push((v * linkDistance) / (radii[i] / unitRadius));\n }\n } else {\n // i and j are on different circles\n const link = (linkDistance + unitRadius) / 2;\n newRow.push(v * link);\n }\n });\n result.push(newRow);\n });\n }\n return result;\n};\n\nconst getWeightMatrix = (idealDistances: Matrix[]) => {\n const rows = idealDistances.length;\n const cols = idealDistances[0].length;\n const result: number[][] = [];\n for (let i = 0; i < rows; i++) {\n const row: number[] = [];\n for (let j = 0; j < cols; j++) {\n if (idealDistances[i][j] !== 0) {\n row.push(1 / (idealDistances[i][j] * idealDistances[i][j]));\n } else {\n row.push(0);\n }\n }\n result.push(row);\n }\n return result;\n};\n\nconst getIndexById = (array: any[], id: string | number) => {\n let index = -1;\n array.forEach((a, i) => {\n if (a.id === id) {\n index = i;\n }\n });\n return Math.max(index, 0);\n};\n\nconst handleInfinity = (matrix: Matrix[], focusIndex: number, step: number) => {\n const length = matrix.length;\n // 遍历 matrix 中遍历 focus 对应行\n for (let i = 0; i < length; i++) {\n // matrix 关注点对应行的 Inf 项\n if (matrix[focusIndex][i] === Infinity) {\n matrix[focusIndex][i] = step;\n matrix[i][focusIndex] = step;\n // 遍历 matrix 中的 i 行，i 行中非 Inf 项若在 focus 行为 Inf，则替换 focus 行的那个 Inf\n for (let j = 0; j < length; j++) {\n if (matrix[i][j] !== Infinity && matrix[focusIndex][j] === Infinity) {\n matrix[focusIndex][j] = step + matrix[i][j];\n matrix[j][focusIndex] = step + matrix[i][j];\n }\n }\n }\n }\n // 处理其他行的 Inf。根据该行对应点与 focus 距离以及 Inf 项点 与 focus 距离，决定替换值\n for (let i = 0; i < length; i++) {\n if (i === focusIndex) {\n continue;\n }\n for (let j = 0; j < length; j++) {\n if (matrix[i][j] === Infinity) {\n let minus = Math.abs(matrix[focusIndex][i] - matrix[focusIndex][j]);\n minus = minus === 0 ? 1 : minus;\n matrix[i][j] = minus;\n }\n }\n }\n};\n\nconst maxToFocus = (matrix: Matrix[], focusIndex: number): number => {\n let max = 0;\n for (let i = 0; i < matrix[focusIndex].length; i++) {\n if (matrix[focusIndex][i] === Infinity) {\n continue;\n }\n max = matrix[focusIndex][i] > max ? matrix[focusIndex][i] : max;\n }\n return max;\n};\n","import { Matrix as MLMatrix, SingularValueDecomposition } from 'ml-matrix';\nimport type { PointTuple, Matrix } from '../types';\n\nexport const mds = (dimension: number, distances: Matrix[], linkDistance: number): PointTuple[] => {\n try {\n // square distances\n const M = MLMatrix.mul(MLMatrix.pow(distances, 2), -0.5);\n\n // double centre the rows/columns\n const rowMeans = M.mean('row');\n const colMeans = M.mean('column');\n const totalMean = M.mean();\n M.add(totalMean).subRowVector(rowMeans).subColumnVector(colMeans);\n\n // take the SVD of the double centred matrix, and return the\n // points from it\n const ret = new SingularValueDecomposition(M);\n const eigenValues = MLMatrix.sqrt(ret.diagonalMatrix).diagonal();\n return ret.leftSingularVectors.toJSON().map((row: number[]) => {\n return MLMatrix.mul([row], [eigenValues]).toJSON()[0].splice(0, dimension) as PointTuple;\n });\n } catch {\n const res: PointTuple[] = [];\n for (let i = 0; i < distances.length; i++) {\n const x = Math.random() * linkDistance;\n const y = Math.random() * linkDistance;\n res.push([x, y]);\n }\n return res;\n }\n};","import type {\n Graph,\n LayoutMapping,\n OutNode,\n PointTuple,\n RandomLayoutOptions,\n Layout,\n} from \"./types\";\n\nconst DEFAULTS_LAYOUT_OPTIONS: Partial<RandomLayoutOptions> = {\n center: [0, 0],\n width: 300,\n height: 300,\n};\n\n/**\n * Layout randomizing the nodes' position\n *\n * @example\n * // Assign layout options when initialization.\n * const layout = new RandomLayout({ center: [100, 100] });\n * const positions = await layout.execute(graph); // { nodes: [], edges: [] }\n *\n * // Or use different options later.\n * const layout = new RandomLayout({ center: [100, 100] });\n * const positions = await layout.execute(graph, { center: [100, 100] }); // { nodes: [], edges: [] }\n *\n * // If you want to assign the positions directly to the nodes, use assign method.\n * await layout.assign(graph, { center: [100, 100] });\n */\nexport class RandomLayout implements Layout<RandomLayoutOptions> {\n id = \"random\";\n\n constructor(public options: RandomLayoutOptions = {} as RandomLayoutOptions) {\n this.options = {\n ...DEFAULTS_LAYOUT_OPTIONS,\n ...options,\n };\n }\n\n /**\n * Return the positions of nodes and edges(if needed).\n */\n async execute(graph: Graph, options?: RandomLayoutOptions) {\n return this.genericRandomLayout(false, graph, options);\n }\n /**\n * To directly assign the positions to the nodes.\n */\n async assign(graph: Graph, options?: RandomLayoutOptions) {\n this.genericRandomLayout(true, graph, options);\n }\n\n private async genericRandomLayout(\n assign: false,\n graph: Graph,\n options?: RandomLayoutOptions\n ): Promise<LayoutMapping>;\n private async genericRandomLayout(\n assign: true,\n graph: Graph,\n options?: RandomLayoutOptions\n ): Promise<void>;\n private async genericRandomLayout(\n assign: boolean,\n graph: Graph,\n options?: RandomLayoutOptions\n ): Promise<LayoutMapping | void> {\n const mergedOptions = { ...this.options, ...options };\n const {\n center: propsCenter,\n width: propsWidth,\n height: propsHeight,\n } = mergedOptions;\n\n const nodes = graph.getAllNodes();\n const layoutScale = 0.9;\n const width =\n !propsWidth && typeof window !== \"undefined\"\n ? window.innerWidth\n : (propsWidth as number);\n const height =\n !propsHeight && typeof window !== \"undefined\"\n ? window.innerHeight\n : (propsHeight as number);\n const center = !propsCenter\n ? [width / 2, height / 2]\n : (propsCenter as PointTuple);\n\n const layoutNodes: OutNode[] = [];\n if (nodes) {\n nodes.forEach((node) => {\n layoutNodes.push({\n id: node.id,\n data: {\n x: (Math.random() - 0.5) * layoutScale * width + center[0],\n y: (Math.random() - 0.5) * layoutScale * height + center[1],\n },\n });\n });\n }\n\n if (assign) {\n layoutNodes.forEach((node) =>\n graph.mergeNodeData(node.id, {\n x: node.data.x,\n y: node.data.y,\n })\n );\n }\n\n const result = {\n nodes: layoutNodes,\n edges: graph.getAllEdges(),\n };\n\n return result;\n }\n}\n","import { CircularLayout } from \"./circular\";\nimport { ConcentricLayout } from \"./concentric\";\nimport { D3ForceLayout } from \"./d3Force\";\nimport { DagreLayout } from \"./dagre\";\nimport { ForceLayout } from \"./force\";\nimport { ForceAtlas2Layout } from \"./forceAtlas2\";\nimport { FruchtermanLayout } from \"./fruchterman\";\nimport { GridLayout } from \"./grid\";\nimport { MDSLayout } from \"./mds\";\nimport { RadialLayout } from \"./radial\";\nimport { RandomLayout } from \"./random\";\nimport type { LayoutConstructor } from \"./types\";\n\nexport const registry: Record<string, LayoutConstructor<any>> = {\n circular: CircularLayout,\n concentric: ConcentricLayout,\n mds: MDSLayout,\n random: RandomLayout,\n grid: GridLayout,\n radial: RadialLayout,\n force: ForceLayout,\n d3force: D3ForceLayout,\n fruchterman: FruchtermanLayout,\n forceAtlas2: ForceAtlas2Layout,\n dagre: DagreLayout,\n};\nexport function registerLayout(id: string, layout: LayoutConstructor<any>) {\n registry[id] = layout;\n}\n","import {\n Graph as IGraph,\n Node as INode,\n Edge as IEdge,\n PlainObject,\n GraphView as IGraphView,\n ID,\n} from \"@antv/graphlib\";\n\nexport interface NodeData extends PlainObject {\n size?: number | number[];\n bboxSize?: number[];\n borderLeft?: ID | ID[];\n borderRight?: ID | ID[];\n x?: number;\n y?: number;\n z?: number;\n height?: number;\n width?: number;\n e?: IEdge<EdgeData>;\n selfEdges?: IEdge<EdgeData>[];\n rank?: number;\n _rank?: number;\n order?: number;\n fixorder?: number;\n minRank?: number;\n maxRank?: number;\n layout?: boolean;\n layer?: number;\n low?: number;\n lim?: number;\n}\n\nexport interface OutNodeData extends NodeData {\n x: number;\n y: number;\n z?: number;\n}\n\nexport interface EdgeData extends PlainObject {\n // temp edges e.g. the edge generated for releated collapsed combo\n virtual?: boolean;\n weight?: number;\n x?: number;\n y?: number;\n height?: number;\n width?: number;\n points?: Point[];\n controlPoints?: Point[];\n minlen?: number;\n cutvalue?: number;\n labeloffset?: number;\n}\n\n/** input node */\nexport type Node = INode<NodeData>;\n/** output node */\nexport type OutNode = INode<OutNodeData>;\n/** input and output edge */\nexport type Edge = IEdge<EdgeData>;\n\nexport type Degree = {\n in: number;\n out: number;\n all: number;\n};\n\n// maps node's id and its index in the nodes array\nexport type IndexMap = {\n [nodeId: string]: number;\n};\n\nexport type Graph = IGraph<NodeData, EdgeData>;\nexport type GraphView = IGraphView<NodeData, EdgeData>;\n\nexport type PointTuple = [number, number] | [number, number, number];\nexport type Point = { x: number; y: number; z?: number };\nexport type Matrix = number[];\nexport type LayoutMapping = { nodes: OutNode[]; edges: Edge[] };\n\nexport interface Layout<LayoutOptions> {\n /**\n * To directly assign the positions to the nodes.\n */\n assign(graph: Graph, options?: LayoutOptions): Promise<void>;\n /**\n * Return the positions of nodes and edges(if needed).\n */\n execute(graph: Graph, options?: LayoutOptions): Promise<LayoutMapping>;\n /**\n * Layout options, can be changed in runtime.\n */\n options: LayoutOptions;\n /**\n * Unique ID, it will get registered and used on the webworker-side.\n */\n id: string;\n}\n\nexport function isLayoutWithIterations(\n layout: any\n): layout is LayoutWithIterations<any> {\n return !!layout.tick && !!layout.stop;\n}\n\nexport interface LayoutWithIterations<LayoutOptions>\n extends Layout<LayoutOptions> {\n /**\n * Some layout algorithm has n iterations so that the simulation needs to be stopped at any time.\n * This method is useful for running the simulation manually.\n * @see https://github.com/d3/d3-force#simulation_stop\n */\n stop: () => void;\n\n /**\n * Manually steps the simulation by the specified number of iterations.\n * @see https://github.com/d3/d3-force#simulation_tick\n */\n tick: (iterations?: number) => LayoutMapping;\n}\n\nexport interface LayoutConstructor<LayoutOptions> {\n new (options?: LayoutOptions): Layout<LayoutOptions>;\n}\n\nexport interface LayoutSupervisor {\n execute(): Promise<LayoutMapping>;\n stop(): void;\n kill(): void;\n isRunning(): boolean;\n}\n\nexport interface CircularLayoutOptions {\n center?: PointTuple;\n width?: number;\n height?: number;\n radius?: number | null;\n startRadius?: number | null;\n endRadius?: number | null;\n clockwise?: boolean;\n divisions?: number;\n ordering?: \"topology\" | \"topology-directed\" | \"degree\" | null;\n angleRatio?: number;\n startAngle?: number;\n endAngle?: number;\n nodeSpacing?: ((node?: Node) => number) | number;\n nodeSize?: number | number[];\n}\n\nexport interface GridLayoutOptions {\n width?: number;\n height?: number;\n begin?: PointTuple;\n preventOverlap?: boolean;\n nodeSize?: number | number[];\n preventOverlapPadding?: number;\n condense?: boolean;\n rows?: number;\n cols?: number;\n sortBy?: string;\n position?: (node?: Node) => { row?: number; col?: number };\n nodeSpacing?: ((node?: Node) => number) | number;\n}\n\nexport interface RandomLayoutOptions {\n center?: PointTuple;\n width?: number;\n height?: number;\n}\n\nexport interface MDSLayoutOptions {\n center?: PointTuple;\n linkDistance?: number;\n}\n\nexport interface ConcentricLayoutOptions {\n center?: PointTuple;\n preventOverlap?: boolean;\n nodeSize?: number | PointTuple;\n sweep?: number;\n equidistant?: boolean;\n startAngle?: number;\n clockwise?: boolean;\n maxLevelDiff?: number;\n sortBy?: string;\n width?: number;\n height?: number;\n nodeSpacing?: number | number[] | ((node?: Node) => number);\n}\n\nexport interface RadialLayoutOptions {\n center?: PointTuple;\n width?: number;\n height?: number;\n linkDistance?: number;\n maxIteration?: number;\n focusNode?: string | Node | null;\n unitRadius?: number | null;\n preventOverlap?: boolean;\n nodeSize?: number | number[];\n nodeSpacing?: number | Function;\n maxPreventOverlapIteration?: number;\n strictRadial?: boolean;\n sortBy?: string;\n sortStrength?: number;\n}\n\nexport type DagreRankdir =\n | \"TB\"\n | \"BT\"\n | \"LR\"\n | \"RL\"\n | \"tb\"\n | \"lr\"\n | \"rl\"\n | \"bt\";\nexport type DagreAlign = \"UL\" | \"UR\" | \"DL\" | \"DR\";\n\nexport interface DagreLayoutOptions {\n rankdir?: DagreRankdir;\n align?: DagreAlign;\n begin?: PointTuple;\n nodeSize?: number | number[];\n nodesep?: number;\n ranksep?: number;\n controlPoints?: boolean;\n sortByCombo?: boolean;\n edgeLabelSpace?: boolean;\n nodeOrder?: string[];\n radial?: boolean; // 是否基于 dagre 进行辐射布局\n focusNode?: ID | Node | null; // radial 为 true 时生效，关注的节点\n preset?: {\n nodes: OutNode[];\n edges: Edge[];\n };\n nodesepFunc?: (d?: Node) => number;\n ranksepFunc?: (d?: Node) => number;\n}\n\nexport interface D3ForceLayoutOptions {\n center?: PointTuple;\n linkDistance?: number | ((edge?: Edge) => number);\n edgeStrength?: number | ((edge?: Edge) => number);\n nodeStrength?: number | ((node?: Node) => number);\n preventOverlap?: boolean;\n collideStrength?: number;\n nodeSize?: number | number[] | ((node?: Node) => number);\n nodeSpacing?: number | number[] | ((node?: Node) => number);\n alpha?: number;\n alphaDecay?: number;\n alphaMin?: number;\n clustering?: boolean;\n clusterNodeStrength?: number;\n clusterEdgeStrength?: number;\n clusterEdgeDistance?: number;\n clusterNodeSize?: number;\n clusterFociStrength?: number;\n forceSimulation?: any;\n onTick?: (data: LayoutMapping) => void;\n}\n\nexport interface CentripetalOptions {\n /** Force strength for leaf nodes. */\n leaf?: number | ((node: Node, nodes: Node[], edges: Edge[]) => number);\n /** Force strength for single nodes. */\n single?: number | ((node: Node) => number);\n /** Force strength for other nodes. */\n others?: number | ((node: Node) => number);\n /** Centri force's position and sterngth, points to the canvas center by default */\n center?: (\n node: Node,\n nodes: Node[],\n edges: Edge[],\n width: number,\n height: number\n ) => {\n x: number;\n y: number;\n z?: number;\n centerStrength?: number;\n };\n}\n\ninterface CommonForceLayoutOptions {\n dimensions?: number;\n center?: PointTuple;\n minMovement?: number;\n maxIteration?: number;\n distanceThresholdMode?: \"mean\" | \"max\" | \"min\";\n\n /**\n * If distance is specified, sets the maximum distance between nodes over which this force is considered. \n * If distance is not specified, returns the current maximum distance, which defaults to infinity. \n * Specifying a finite maximum distance improves performance and produces a more localized layout.\n */\n maxDistance?: number;\n}\n\nexport interface ForceLayoutOptions extends CommonForceLayoutOptions {\n width?: number;\n height?: number;\n linkDistance?: number | ((edge?: Edge, source?: any, target?: any) => number);\n nodeStrength?: number | ((d?: Node) => number);\n edgeStrength?: number | ((d?: Edge) => number);\n preventOverlap?: boolean;\n nodeSize?: number | number[] | ((d?: Node) => number);\n nodeSpacing?: number | ((d?: Node) => number);\n damping?: number;\n maxSpeed?: number;\n coulombDisScale?: number;\n gravity?: number;\n factor?: number;\n interval?: number;\n centripetalOptions?: CentripetalOptions;\n leafCluster?: boolean;\n clustering?: boolean;\n nodeClusterBy?: string;\n clusterNodeStrength?: number | ((node: Node) => number);\n collideStrength?: number;\n onTick?: (data: LayoutMapping) => void;\n getMass?: (node?: Node) => number;\n getCenter?: (node?: Node, degree?: number) => number[];\n monitor?: (params: {\n energy: number;\n nodes: Node[];\n edges: Edge[];\n iterations: number;\n }) => void;\n}\n\nexport interface ForceAtlas2LayoutOptions extends CommonForceLayoutOptions {\n width?: number;\n height?: number;\n kr?: number;\n kg?: number;\n ks?: number;\n ksmax?: number;\n tao?: number;\n mode?: \"normal\" | \"linlog\";\n preventOverlap?: boolean;\n dissuadeHubs?: boolean;\n barnesHut?: boolean;\n prune?: boolean;\n nodeSize?: number | number[] | ((node?: Node) => number);\n onTick?: (data: LayoutMapping) => void;\n}\nexport interface FruchtermanLayoutOptions extends CommonForceLayoutOptions {\n width?: number;\n height?: number;\n gravity?: number;\n speed?: number;\n clustering?: boolean;\n clusterGravity?: number;\n nodeClusterBy?: string;\n onTick?: (data: LayoutMapping) => void;\n}\n"],"sourceRoot":""}