@antv/layout 0.1.19 → 0.1.20

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 (195) hide show
  1. package/CHANGELOG.md +17 -0
  2. package/dist/layout.min.js +1 -1
  3. package/dist/layout.min.js.LICENSE.txt +9 -0
  4. package/dist/layout.min.js.map +1 -1
  5. package/es/layout/dagre/index.d.ts +9 -0
  6. package/es/layout/dagre/index.js +33 -0
  7. package/es/layout/dagre/index.js.map +1 -0
  8. package/es/layout/dagre/src/acyclic.d.ts +7 -0
  9. package/es/layout/dagre/src/acyclic.js +52 -0
  10. package/es/layout/dagre/src/acyclic.js.map +1 -0
  11. package/es/layout/dagre/src/add-border-segments.d.ts +4 -0
  12. package/es/layout/dagre/src/add-border-segments.js +32 -0
  13. package/es/layout/dagre/src/add-border-segments.js.map +1 -0
  14. package/es/layout/dagre/src/coordinate-system.d.ts +7 -0
  15. package/es/layout/dagre/src/coordinate-system.js +57 -0
  16. package/es/layout/dagre/src/coordinate-system.js.map +1 -0
  17. package/es/layout/dagre/src/data/list.d.ts +8 -0
  18. package/es/layout/dagre/src/data/list.js +50 -0
  19. package/es/layout/dagre/src/data/list.js.map +1 -0
  20. package/es/layout/dagre/src/debug.d.ts +4 -0
  21. package/es/layout/dagre/src/debug.js +26 -0
  22. package/es/layout/dagre/src/debug.js.map +1 -0
  23. package/es/layout/dagre/src/graphlib.d.ts +2 -0
  24. package/es/layout/dagre/src/graphlib.js +8 -0
  25. package/es/layout/dagre/src/graphlib.js.map +1 -0
  26. package/es/layout/dagre/src/greedy-fas.d.ts +4 -0
  27. package/es/layout/dagre/src/greedy-fas.js +113 -0
  28. package/es/layout/dagre/src/greedy-fas.js.map +1 -0
  29. package/es/layout/dagre/src/layout.d.ts +4 -0
  30. package/es/layout/dagre/src/layout.js +435 -0
  31. package/es/layout/dagre/src/layout.js.map +1 -0
  32. package/es/layout/dagre/src/nesting-graph.d.ts +7 -0
  33. package/es/layout/dagre/src/nesting-graph.js +112 -0
  34. package/es/layout/dagre/src/nesting-graph.js.map +1 -0
  35. package/es/layout/dagre/src/normalize.d.ts +7 -0
  36. package/es/layout/dagre/src/normalize.js +88 -0
  37. package/es/layout/dagre/src/normalize.js.map +1 -0
  38. package/es/layout/dagre/src/order/add-subgraph-constraints.d.ts +4 -0
  39. package/es/layout/dagre/src/order/add-subgraph-constraints.js +27 -0
  40. package/es/layout/dagre/src/order/add-subgraph-constraints.js.map +1 -0
  41. package/es/layout/dagre/src/order/barycenter.d.ts +12 -0
  42. package/es/layout/dagre/src/order/barycenter.js +24 -0
  43. package/es/layout/dagre/src/order/barycenter.js.map +1 -0
  44. package/es/layout/dagre/src/order/build-layer-graph.d.ts +4 -0
  45. package/es/layout/dagre/src/order/build-layer-graph.js +67 -0
  46. package/es/layout/dagre/src/order/build-layer-graph.js.map +1 -0
  47. package/es/layout/dagre/src/order/cross-count.d.ts +4 -0
  48. package/es/layout/dagre/src/order/cross-count.js +64 -0
  49. package/es/layout/dagre/src/order/cross-count.js.map +1 -0
  50. package/es/layout/dagre/src/order/index.d.ts +4 -0
  51. package/es/layout/dagre/src/order/index.js +88 -0
  52. package/es/layout/dagre/src/order/index.js.map +1 -0
  53. package/es/layout/dagre/src/order/init-data-order.d.ts +7 -0
  54. package/es/layout/dagre/src/order/init-data-order.js +25 -0
  55. package/es/layout/dagre/src/order/init-data-order.js.map +1 -0
  56. package/es/layout/dagre/src/order/init-order.d.ts +4 -0
  57. package/es/layout/dagre/src/order/init-order.js +49 -0
  58. package/es/layout/dagre/src/order/init-order.js.map +1 -0
  59. package/es/layout/dagre/src/order/resolve-conflicts.d.ts +4 -0
  60. package/es/layout/dagre/src/order/resolve-conflicts.js +111 -0
  61. package/es/layout/dagre/src/order/resolve-conflicts.js.map +1 -0
  62. package/es/layout/dagre/src/order/sort-subgraph.d.ts +4 -0
  63. package/es/layout/dagre/src/order/sort-subgraph.js +79 -0
  64. package/es/layout/dagre/src/order/sort-subgraph.js.map +1 -0
  65. package/es/layout/dagre/src/order/sort.d.ts +2 -0
  66. package/es/layout/dagre/src/order/sort.js +67 -0
  67. package/es/layout/dagre/src/order/sort.js.map +1 -0
  68. package/es/layout/dagre/src/parent-dummy-chains.d.ts +4 -0
  69. package/es/layout/dagre/src/parent-dummy-chains.js +78 -0
  70. package/es/layout/dagre/src/parent-dummy-chains.js.map +1 -0
  71. package/es/layout/dagre/src/position/bk.d.ts +32 -0
  72. package/es/layout/dagre/src/position/bk.js +398 -0
  73. package/es/layout/dagre/src/position/bk.js.map +1 -0
  74. package/es/layout/dagre/src/position/index.d.ts +4 -0
  75. package/es/layout/dagre/src/position/index.js +53 -0
  76. package/es/layout/dagre/src/position/index.js.map +1 -0
  77. package/es/layout/dagre/src/rank/feasible-tree.d.ts +10 -0
  78. package/es/layout/dagre/src/rank/feasible-tree.js +149 -0
  79. package/es/layout/dagre/src/rank/feasible-tree.js.map +1 -0
  80. package/es/layout/dagre/src/rank/index.d.ts +4 -0
  81. package/es/layout/dagre/src/rank/index.js +53 -0
  82. package/es/layout/dagre/src/rank/index.js.map +1 -0
  83. package/es/layout/dagre/src/rank/network-simplex.d.ts +12 -0
  84. package/es/layout/dagre/src/rank/network-simplex.js +207 -0
  85. package/es/layout/dagre/src/rank/network-simplex.js.map +1 -0
  86. package/es/layout/dagre/src/rank/util.d.ts +12 -0
  87. package/es/layout/dagre/src/rank/util.js +109 -0
  88. package/es/layout/dagre/src/rank/util.js.map +1 -0
  89. package/es/layout/dagre/src/util.d.ts +50 -0
  90. package/es/layout/dagre/src/util.js +260 -0
  91. package/es/layout/dagre/src/util.js.map +1 -0
  92. package/es/layout/dagre.d.ts +3 -3
  93. package/es/layout/dagre.js +35 -11
  94. package/es/layout/dagre.js.map +1 -1
  95. package/es/layout/force/force-in-a-box.js +1 -0
  96. package/es/layout/force/force-in-a-box.js.map +1 -1
  97. package/es/layout/fruchterman.js +12 -36
  98. package/es/layout/fruchterman.js.map +1 -1
  99. package/es/layout/types.d.ts +1 -1
  100. package/lib/layout/dagre/index.d.ts +9 -0
  101. package/lib/layout/dagre/index.js +38 -0
  102. package/lib/layout/dagre/index.js.map +1 -0
  103. package/lib/layout/dagre/src/acyclic.d.ts +7 -0
  104. package/lib/layout/dagre/src/acyclic.js +57 -0
  105. package/lib/layout/dagre/src/acyclic.js.map +1 -0
  106. package/lib/layout/dagre/src/add-border-segments.d.ts +4 -0
  107. package/lib/layout/dagre/src/add-border-segments.js +37 -0
  108. package/lib/layout/dagre/src/add-border-segments.js.map +1 -0
  109. package/lib/layout/dagre/src/coordinate-system.d.ts +7 -0
  110. package/lib/layout/dagre/src/coordinate-system.js +59 -0
  111. package/lib/layout/dagre/src/coordinate-system.js.map +1 -0
  112. package/lib/layout/dagre/src/data/list.d.ts +8 -0
  113. package/lib/layout/dagre/src/data/list.js +53 -0
  114. package/lib/layout/dagre/src/data/list.js.map +1 -0
  115. package/lib/layout/dagre/src/debug.d.ts +4 -0
  116. package/lib/layout/dagre/src/debug.js +31 -0
  117. package/lib/layout/dagre/src/debug.js.map +1 -0
  118. package/lib/layout/dagre/src/graphlib.d.ts +2 -0
  119. package/lib/layout/dagre/src/graphlib.js +13 -0
  120. package/lib/layout/dagre/src/graphlib.js.map +1 -0
  121. package/lib/layout/dagre/src/greedy-fas.d.ts +4 -0
  122. package/lib/layout/dagre/src/greedy-fas.js +118 -0
  123. package/lib/layout/dagre/src/greedy-fas.js.map +1 -0
  124. package/lib/layout/dagre/src/layout.d.ts +4 -0
  125. package/lib/layout/dagre/src/layout.js +459 -0
  126. package/lib/layout/dagre/src/layout.js.map +1 -0
  127. package/lib/layout/dagre/src/nesting-graph.d.ts +7 -0
  128. package/lib/layout/dagre/src/nesting-graph.js +117 -0
  129. package/lib/layout/dagre/src/nesting-graph.js.map +1 -0
  130. package/lib/layout/dagre/src/normalize.d.ts +7 -0
  131. package/lib/layout/dagre/src/normalize.js +93 -0
  132. package/lib/layout/dagre/src/normalize.js.map +1 -0
  133. package/lib/layout/dagre/src/order/add-subgraph-constraints.d.ts +4 -0
  134. package/lib/layout/dagre/src/order/add-subgraph-constraints.js +29 -0
  135. package/lib/layout/dagre/src/order/add-subgraph-constraints.js.map +1 -0
  136. package/lib/layout/dagre/src/order/barycenter.d.ts +12 -0
  137. package/lib/layout/dagre/src/order/barycenter.js +26 -0
  138. package/lib/layout/dagre/src/order/barycenter.js.map +1 -0
  139. package/lib/layout/dagre/src/order/build-layer-graph.d.ts +4 -0
  140. package/lib/layout/dagre/src/order/build-layer-graph.js +72 -0
  141. package/lib/layout/dagre/src/order/build-layer-graph.js.map +1 -0
  142. package/lib/layout/dagre/src/order/cross-count.d.ts +4 -0
  143. package/lib/layout/dagre/src/order/cross-count.js +66 -0
  144. package/lib/layout/dagre/src/order/cross-count.js.map +1 -0
  145. package/lib/layout/dagre/src/order/index.d.ts +4 -0
  146. package/lib/layout/dagre/src/order/index.js +93 -0
  147. package/lib/layout/dagre/src/order/index.js.map +1 -0
  148. package/lib/layout/dagre/src/order/init-data-order.d.ts +7 -0
  149. package/lib/layout/dagre/src/order/init-data-order.js +27 -0
  150. package/lib/layout/dagre/src/order/init-data-order.js.map +1 -0
  151. package/lib/layout/dagre/src/order/init-order.d.ts +4 -0
  152. package/lib/layout/dagre/src/order/init-order.js +51 -0
  153. package/lib/layout/dagre/src/order/init-order.js.map +1 -0
  154. package/lib/layout/dagre/src/order/resolve-conflicts.d.ts +4 -0
  155. package/lib/layout/dagre/src/order/resolve-conflicts.js +116 -0
  156. package/lib/layout/dagre/src/order/resolve-conflicts.js.map +1 -0
  157. package/lib/layout/dagre/src/order/sort-subgraph.d.ts +4 -0
  158. package/lib/layout/dagre/src/order/sort-subgraph.js +84 -0
  159. package/lib/layout/dagre/src/order/sort-subgraph.js.map +1 -0
  160. package/lib/layout/dagre/src/order/sort.d.ts +2 -0
  161. package/lib/layout/dagre/src/order/sort.js +72 -0
  162. package/lib/layout/dagre/src/order/sort.js.map +1 -0
  163. package/lib/layout/dagre/src/parent-dummy-chains.d.ts +4 -0
  164. package/lib/layout/dagre/src/parent-dummy-chains.js +80 -0
  165. package/lib/layout/dagre/src/parent-dummy-chains.js.map +1 -0
  166. package/lib/layout/dagre/src/position/bk.d.ts +32 -0
  167. package/lib/layout/dagre/src/position/bk.js +413 -0
  168. package/lib/layout/dagre/src/position/bk.js.map +1 -0
  169. package/lib/layout/dagre/src/position/index.d.ts +4 -0
  170. package/lib/layout/dagre/src/position/index.js +58 -0
  171. package/lib/layout/dagre/src/position/index.js.map +1 -0
  172. package/lib/layout/dagre/src/rank/feasible-tree.d.ts +10 -0
  173. package/lib/layout/dagre/src/rank/feasible-tree.js +156 -0
  174. package/lib/layout/dagre/src/rank/feasible-tree.js.map +1 -0
  175. package/lib/layout/dagre/src/rank/index.d.ts +4 -0
  176. package/lib/layout/dagre/src/rank/index.js +58 -0
  177. package/lib/layout/dagre/src/rank/index.js.map +1 -0
  178. package/lib/layout/dagre/src/rank/network-simplex.d.ts +12 -0
  179. package/lib/layout/dagre/src/rank/network-simplex.js +212 -0
  180. package/lib/layout/dagre/src/rank/network-simplex.js.map +1 -0
  181. package/lib/layout/dagre/src/rank/util.d.ts +12 -0
  182. package/lib/layout/dagre/src/rank/util.js +114 -0
  183. package/lib/layout/dagre/src/rank/util.js.map +1 -0
  184. package/lib/layout/dagre/src/util.d.ts +50 -0
  185. package/lib/layout/dagre/src/util.js +281 -0
  186. package/lib/layout/dagre/src/util.js.map +1 -0
  187. package/lib/layout/dagre.d.ts +3 -3
  188. package/lib/layout/dagre.js +37 -13
  189. package/lib/layout/dagre.js.map +1 -1
  190. package/lib/layout/force/force-in-a-box.js +1 -0
  191. package/lib/layout/force/force-in-a-box.js.map +1 -1
  192. package/lib/layout/fruchterman.js +12 -36
  193. package/lib/layout/fruchterman.js.map +1 -1
  194. package/lib/layout/types.d.ts +1 -1
  195. package/package.json +4 -4
@@ -0,0 +1,459 @@
1
+ "use strict";
2
+ var __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {
3
+ if (k2 === undefined) k2 = k;
4
+ Object.defineProperty(o, k2, { enumerable: true, get: function() { return m[k]; } });
5
+ }) : (function(o, m, k, k2) {
6
+ if (k2 === undefined) k2 = k;
7
+ o[k2] = m[k];
8
+ }));
9
+ var __setModuleDefault = (this && this.__setModuleDefault) || (Object.create ? (function(o, v) {
10
+ Object.defineProperty(o, "default", { enumerable: true, value: v });
11
+ }) : function(o, v) {
12
+ o["default"] = v;
13
+ });
14
+ var __importStar = (this && this.__importStar) || function (mod) {
15
+ if (mod && mod.__esModule) return mod;
16
+ var result = {};
17
+ if (mod != null) for (var k in mod) if (k !== "default" && Object.prototype.hasOwnProperty.call(mod, k)) __createBinding(result, mod, k);
18
+ __setModuleDefault(result, mod);
19
+ return result;
20
+ };
21
+ var __importDefault = (this && this.__importDefault) || function (mod) {
22
+ return (mod && mod.__esModule) ? mod : { "default": mod };
23
+ };
24
+ Object.defineProperty(exports, "__esModule", { value: true });
25
+ var acyclic_1 = __importDefault(require("./acyclic"));
26
+ var normalize_1 = __importDefault(require("./normalize"));
27
+ var rank_1 = __importDefault(require("./rank"));
28
+ var util_1 = __importStar(require("./util"));
29
+ var parent_dummy_chains_1 = __importDefault(require("./parent-dummy-chains"));
30
+ var nesting_graph_1 = __importDefault(require("./nesting-graph"));
31
+ var add_border_segments_1 = __importDefault(require("./add-border-segments"));
32
+ var coordinate_system_1 = __importDefault(require("./coordinate-system"));
33
+ var order_1 = __importDefault(require("./order"));
34
+ var position_1 = __importDefault(require("./position"));
35
+ var graphlib_1 = __importDefault(require("./graphlib"));
36
+ var init_data_order_1 = __importDefault(require("./order/init-data-order"));
37
+ var Graph = graphlib_1.default.Graph;
38
+ var layout = function (g, opts) {
39
+ var time = opts && opts.debugTiming ? util_1.default.time : util_1.default.notime;
40
+ time("layout", function () {
41
+ // 如果在原图基础上修改,继承原图的order结果
42
+ if (opts && !opts.keepNodeOrder && opts.prevGraph) {
43
+ time(" inheritOrder", function () { inheritOrder(g, opts.prevGraph); });
44
+ }
45
+ var layoutGraph = time(" buildLayoutGraph", function () { return buildLayoutGraph(g); });
46
+ // 控制是否为边的label留位置(这会影响是否在边中间添加dummy node)
47
+ if (!(opts && (opts.edgeLabelSpace === false))) {
48
+ time(" makeSpaceForEdgeLabels", function () { makeSpaceForEdgeLabels(layoutGraph); });
49
+ }
50
+ // TODO: 暂时处理层级设置不正确时的异常报错,提示设置正确的层级
51
+ try {
52
+ time(" runLayout", function () { runLayout(layoutGraph, time, opts); });
53
+ }
54
+ catch (e) {
55
+ if (e.message === "Not possible to find intersection inside of the rectangle") {
56
+ 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', e);
57
+ return;
58
+ }
59
+ throw (e);
60
+ }
61
+ time(" updateInputGraph", function () { updateInputGraph(g, layoutGraph); });
62
+ });
63
+ };
64
+ var runLayout = function (g, time, opts) {
65
+ time(" removeSelfEdges", function () { removeSelfEdges(g); });
66
+ time(" acyclic", function () { acyclic_1.default.run(g); });
67
+ time(" nestingGraph.run", function () { nesting_graph_1.default.run(g); });
68
+ time(" rank", function () { (0, rank_1.default)(util_1.default.asNonCompoundGraph(g)); });
69
+ time(" injectEdgeLabelProxies", function () { injectEdgeLabelProxies(g); });
70
+ time(" removeEmptyRanks", function () { (0, util_1.removeEmptyRanks)(g); });
71
+ time(" nestingGraph.cleanup", function () { nesting_graph_1.default.cleanup(g); });
72
+ time(" normalizeRanks", function () { (0, util_1.normalizeRanks)(g); });
73
+ time(" assignRankMinMax", function () { assignRankMinMax(g); });
74
+ time(" removeEdgeLabelProxies", function () { removeEdgeLabelProxies(g); });
75
+ time(" normalize.run", function () { normalize_1.default.run(g); });
76
+ time(" parentDummyChains", function () { (0, parent_dummy_chains_1.default)(g); });
77
+ time(" addBorderSegments", function () { (0, add_border_segments_1.default)(g); });
78
+ if (opts && opts.keepNodeOrder) {
79
+ time(" initDataOrder", function () { (0, init_data_order_1.default)(g, opts.nodeOrder); });
80
+ }
81
+ time(" order", function () { (0, order_1.default)(g); });
82
+ time(" insertSelfEdges", function () { insertSelfEdges(g); });
83
+ time(" adjustCoordinateSystem", function () { coordinate_system_1.default.adjust(g); });
84
+ time(" position", function () { (0, position_1.default)(g); });
85
+ time(" positionSelfEdges", function () { positionSelfEdges(g); });
86
+ time(" removeBorderNodes", function () { removeBorderNodes(g); });
87
+ time(" normalize.undo", function () { normalize_1.default.undo(g); });
88
+ time(" fixupEdgeLabelCoords", function () { fixupEdgeLabelCoords(g); });
89
+ time(" undoCoordinateSystem", function () { coordinate_system_1.default.undo(g); });
90
+ time(" translateGraph", function () { translateGraph(g); });
91
+ time(" assignNodeIntersects", function () { assignNodeIntersects(g); });
92
+ time(" reversePoints", function () { reversePointsForReversedEdges(g); });
93
+ time(" acyclic.undo", function () { acyclic_1.default.undo(g); });
94
+ };
95
+ /**
96
+ * 继承上一个布局中的order,防止翻转
97
+ * TODO: 暂时没有考虑涉及层级变动的布局,只保证原来布局层级和相对顺序不变
98
+ */
99
+ var inheritOrder = function (currG, prevG) {
100
+ var prevNodeMap = prevG._nodes || {};
101
+ currG.nodes().forEach(function (n) {
102
+ var node = currG.node(n);
103
+ if (prevNodeMap[n] !== undefined) {
104
+ node.fixorder = prevNodeMap[n]._order;
105
+ delete prevNodeMap[n]._order;
106
+ }
107
+ else {
108
+ delete node.fixorder;
109
+ }
110
+ });
111
+ };
112
+ /*
113
+ * Copies final layout information from the layout graph back to the input
114
+ * graph. This process only copies whitelisted attributes from the layout graph
115
+ * to the input graph, so it serves as a good place to determine what
116
+ * attributes can influence layout.
117
+ */
118
+ var updateInputGraph = function (inputGraph, layoutGraph) {
119
+ inputGraph.nodes().forEach(function (v) {
120
+ var _a;
121
+ var inputLabel = inputGraph.node(v);
122
+ var layoutLabel = layoutGraph.node(v);
123
+ if (inputLabel) {
124
+ inputLabel.x = layoutLabel.x;
125
+ inputLabel.y = layoutLabel.y;
126
+ inputLabel._order = layoutLabel.order;
127
+ inputLabel._rank = layoutLabel.rank;
128
+ if ((_a = layoutGraph.children(v)) === null || _a === void 0 ? void 0 : _a.length) {
129
+ inputLabel.width = layoutLabel.width;
130
+ inputLabel.height = layoutLabel.height;
131
+ }
132
+ }
133
+ });
134
+ inputGraph.edges().forEach(function (e) {
135
+ var inputLabel = inputGraph.edge(e);
136
+ var layoutLabel = layoutGraph.edge(e);
137
+ inputLabel.points = layoutLabel.points;
138
+ if (layoutLabel.hasOwnProperty("x")) {
139
+ inputLabel.x = layoutLabel.x;
140
+ inputLabel.y = layoutLabel.y;
141
+ }
142
+ });
143
+ inputGraph.graph().width = layoutGraph.graph().width;
144
+ inputGraph.graph().height = layoutGraph.graph().height;
145
+ };
146
+ var graphNumAttrs = ["nodesep", "edgesep", "ranksep", "marginx", "marginy"];
147
+ var graphDefaults = { ranksep: 50, edgesep: 20, nodesep: 50, rankdir: "tb" };
148
+ var graphAttrs = ["acyclicer", "ranker", "rankdir", "align"];
149
+ var nodeNumAttrs = ["width", "height", "layer", "fixorder"]; // 需要传入layer, fixOrder作为参数参考
150
+ var nodeDefaults = { width: 0, height: 0 };
151
+ var edgeNumAttrs = ["minlen", "weight", "width", "height", "labeloffset"];
152
+ var edgeDefaults = {
153
+ minlen: 1, weight: 1, width: 0, height: 0,
154
+ labeloffset: 10, labelpos: "r"
155
+ };
156
+ var edgeAttrs = ["labelpos"];
157
+ /*
158
+ * Constructs a new graph from the input graph, which can be used for layout.
159
+ * This process copies only whitelisted attributes from the input graph to the
160
+ * layout graph. Thus this function serves as a good place to determine what
161
+ * attributes can influence layout.
162
+ */
163
+ var buildLayoutGraph = function (inputGraph) {
164
+ var g = new Graph({ multigraph: true, compound: true });
165
+ var graph = canonicalize(inputGraph.graph());
166
+ var pickedProperties = {};
167
+ graphAttrs.forEach(function (key) {
168
+ if (graph[key] !== undefined)
169
+ pickedProperties[key] = graph[key];
170
+ });
171
+ g.setGraph(Object.assign({}, graphDefaults, selectNumberAttrs(graph, graphNumAttrs), pickedProperties));
172
+ inputGraph.nodes().forEach(function (v) {
173
+ var node = canonicalize(inputGraph.node(v));
174
+ var defaultAttrs = selectNumberAttrs(node, nodeNumAttrs);
175
+ Object.keys(nodeDefaults).forEach(function (key) {
176
+ if (defaultAttrs[key] === undefined) {
177
+ defaultAttrs[key] = nodeDefaults[key];
178
+ }
179
+ });
180
+ g.setNode(v, defaultAttrs);
181
+ g.setParent(v, inputGraph.parent(v));
182
+ });
183
+ inputGraph.edges().forEach(function (e) {
184
+ var edge = canonicalize(inputGraph.edge(e));
185
+ var pickedProperties = {};
186
+ edgeAttrs.forEach(function (key) {
187
+ if (edge[key] !== undefined)
188
+ pickedProperties[key] = edge[key];
189
+ });
190
+ g.setEdge(e, Object.assign({}, edgeDefaults, selectNumberAttrs(edge, edgeNumAttrs), pickedProperties));
191
+ });
192
+ return g;
193
+ };
194
+ /*
195
+ * This idea comes from the Gansner paper: to account for edge labels in our
196
+ * layout we split each rank in half by doubling minlen and halving ranksep.
197
+ * Then we can place labels at these mid-points between nodes.
198
+ *
199
+ * We also add some minimal padding to the width to push the label for the edge
200
+ * away from the edge itself a bit.
201
+ */
202
+ var makeSpaceForEdgeLabels = function (g) {
203
+ var graph = g.graph();
204
+ if (!graph.ranksep)
205
+ graph.ranksep = 0;
206
+ graph.ranksep /= 2;
207
+ g.nodes().forEach(function (n) {
208
+ var node = g.node(n);
209
+ if (!isNaN(node.layer)) {
210
+ if (!node.layer)
211
+ node.layer = 0;
212
+ else
213
+ node.layer *= 2; // TODO: 因为默认的rank变为两倍,设定的layer也*2
214
+ }
215
+ });
216
+ g.edges().forEach(function (e) {
217
+ var _a;
218
+ var edge = g.edge(e);
219
+ edge.minlen *= 2;
220
+ if (((_a = edge.labelpos) === null || _a === void 0 ? void 0 : _a.toLowerCase()) !== "c") {
221
+ if (graph.rankdir === "TB" || graph.rankdir === "BT") {
222
+ edge.width += edge.labeloffset;
223
+ }
224
+ else {
225
+ edge.height += edge.labeloffset;
226
+ }
227
+ }
228
+ });
229
+ };
230
+ /*
231
+ * Creates temporary dummy nodes that capture the rank in which each edge's
232
+ * label is going to, if it has one of non-zero width and height. We do this
233
+ * so that we can safely remove empty ranks while preserving balance for the
234
+ * label's position.
235
+ */
236
+ var injectEdgeLabelProxies = function (g) {
237
+ g.edges().forEach(function (e) {
238
+ var edge = g.edge(e);
239
+ if (edge.width && edge.height) {
240
+ var v = g.node(e.v);
241
+ var w = g.node(e.w);
242
+ var label = { e: e, rank: (w.rank - v.rank) / 2 + v.rank };
243
+ util_1.default.addDummyNode(g, "edge-proxy", label, "_ep");
244
+ }
245
+ });
246
+ };
247
+ var assignRankMinMax = function (g) {
248
+ var maxRank = 0;
249
+ g.nodes().forEach(function (v) {
250
+ var node = g.node(v);
251
+ if (node.borderTop) {
252
+ node.minRank = g.node(node.borderTop).rank;
253
+ node.maxRank = g.node(node.borderBottom).rank;
254
+ maxRank = Math.max(maxRank, node.maxRank || -Infinity);
255
+ }
256
+ });
257
+ g.graph().maxRank = maxRank;
258
+ };
259
+ var removeEdgeLabelProxies = function (g) {
260
+ g.nodes().forEach(function (v) {
261
+ var node = g.node(v);
262
+ if (node.dummy === "edge-proxy") {
263
+ g.edge(node.e).labelRank = node.rank;
264
+ g.removeNode(v);
265
+ }
266
+ });
267
+ };
268
+ var translateGraph = function (g) {
269
+ var minX = Number.POSITIVE_INFINITY;
270
+ var maxX = 0;
271
+ var minY = Number.POSITIVE_INFINITY;
272
+ var maxY = 0;
273
+ var graphLabel = g.graph();
274
+ var marginX = graphLabel.marginx || 0;
275
+ var marginY = graphLabel.marginy || 0;
276
+ var getExtremes = function (attrs) {
277
+ var x = attrs.x;
278
+ var y = attrs.y;
279
+ var w = attrs.width;
280
+ var h = attrs.height;
281
+ minX = Math.min(minX, x - w / 2);
282
+ maxX = Math.max(maxX, x + w / 2);
283
+ minY = Math.min(minY, y - h / 2);
284
+ maxY = Math.max(maxY, y + h / 2);
285
+ };
286
+ g.nodes().forEach(function (v) { getExtremes(g.node(v)); });
287
+ g.edges().forEach(function (e) {
288
+ var edge = g.edge(e);
289
+ if (edge.hasOwnProperty("x")) {
290
+ getExtremes(edge);
291
+ }
292
+ });
293
+ minX -= marginX;
294
+ minY -= marginY;
295
+ g.nodes().forEach(function (v) {
296
+ var node = g.node(v);
297
+ node.x -= minX;
298
+ node.y -= minY;
299
+ });
300
+ g.edges().forEach(function (e) {
301
+ var _a;
302
+ var edge = g.edge(e);
303
+ (_a = edge.points) === null || _a === void 0 ? void 0 : _a.forEach(function (p) {
304
+ p.x -= minX;
305
+ p.y -= minY;
306
+ });
307
+ if (edge.hasOwnProperty("x")) {
308
+ edge.x -= minX;
309
+ }
310
+ if (edge.hasOwnProperty("y")) {
311
+ edge.y -= minY;
312
+ }
313
+ });
314
+ graphLabel.width = maxX - minX + marginX;
315
+ graphLabel.height = maxY - minY + marginY;
316
+ };
317
+ var assignNodeIntersects = function (g) {
318
+ g.edges().forEach(function (e) {
319
+ var edge = g.edge(e);
320
+ var nodeV = g.node(e.v);
321
+ var nodeW = g.node(e.w);
322
+ var p1;
323
+ var p2;
324
+ if (!edge.points) {
325
+ edge.points = [];
326
+ p1 = nodeW;
327
+ p2 = nodeV;
328
+ }
329
+ else {
330
+ p1 = edge.points[0];
331
+ p2 = edge.points[edge.points.length - 1];
332
+ }
333
+ edge.points.unshift(util_1.default.intersectRect(nodeV, p1));
334
+ edge.points.push(util_1.default.intersectRect(nodeW, p2));
335
+ });
336
+ };
337
+ var fixupEdgeLabelCoords = function (g) {
338
+ g.edges().forEach(function (e) {
339
+ var edge = g.edge(e);
340
+ if (edge.hasOwnProperty("x")) {
341
+ if (edge.labelpos === "l" || edge.labelpos === "r") {
342
+ edge.width -= edge.labeloffset;
343
+ }
344
+ switch (edge.labelpos) {
345
+ case "l":
346
+ edge.x -= edge.width / 2 + edge.labeloffset;
347
+ break;
348
+ case "r":
349
+ edge.x += edge.width / 2 + edge.labeloffset;
350
+ break;
351
+ }
352
+ }
353
+ });
354
+ };
355
+ var reversePointsForReversedEdges = function (g) {
356
+ g.edges().forEach(function (e) {
357
+ var edge = g.edge(e);
358
+ if (edge.reversed) {
359
+ edge.points.reverse();
360
+ }
361
+ });
362
+ };
363
+ var removeBorderNodes = function (g) {
364
+ g.nodes().forEach(function (v) {
365
+ var _a, _b, _c;
366
+ if ((_a = g.children(v)) === null || _a === void 0 ? void 0 : _a.length) {
367
+ var node = g.node(v);
368
+ var t = g.node(node.borderTop);
369
+ var b = g.node(node.borderBottom);
370
+ var l = g.node(node.borderLeft[((_b = node.borderLeft) === null || _b === void 0 ? void 0 : _b.length) - 1]);
371
+ var r = g.node(node.borderRight[((_c = node.borderRight) === null || _c === void 0 ? void 0 : _c.length) - 1]);
372
+ node.width = Math.abs(r.x - l.x);
373
+ node.height = Math.abs(b.y - t.y);
374
+ node.x = l.x + node.width / 2;
375
+ node.y = t.y + node.height / 2;
376
+ }
377
+ });
378
+ g.nodes().forEach(function (v) {
379
+ if (g.node(v).dummy === "border") {
380
+ g.removeNode(v);
381
+ }
382
+ });
383
+ };
384
+ var removeSelfEdges = function (g) {
385
+ g.edges().forEach(function (e) {
386
+ if (e.v === e.w) {
387
+ var node = g.node(e.v);
388
+ if (!node.selfEdges) {
389
+ node.selfEdges = [];
390
+ }
391
+ node.selfEdges.push({ e: e, label: g.edge(e) });
392
+ g.removeEdge(e);
393
+ }
394
+ });
395
+ };
396
+ var insertSelfEdges = function (g) {
397
+ var layers = util_1.default.buildLayerMatrix(g);
398
+ layers.forEach(function (layer) {
399
+ var orderShift = 0;
400
+ layer.forEach(function (v, i) {
401
+ var _a;
402
+ var node = g.node(v);
403
+ node.order = i + orderShift;
404
+ (_a = node.selfEdges) === null || _a === void 0 ? void 0 : _a.forEach(function (selfEdge) {
405
+ util_1.default.addDummyNode(g, "selfedge", {
406
+ width: selfEdge.label.width,
407
+ height: selfEdge.label.height,
408
+ rank: node.rank,
409
+ order: i + (++orderShift),
410
+ e: selfEdge.e,
411
+ label: selfEdge.label
412
+ }, "_se");
413
+ });
414
+ delete node.selfEdges;
415
+ });
416
+ });
417
+ };
418
+ var positionSelfEdges = function (g) {
419
+ g.nodes().forEach(function (v) {
420
+ var node = g.node(v);
421
+ if (node.dummy === "selfedge") {
422
+ var selfNode = g.node(node.e.v);
423
+ var x = selfNode.x + selfNode.width / 2;
424
+ var y = selfNode.y;
425
+ var dx = node.x - x;
426
+ var dy = selfNode.height / 2;
427
+ g.setEdge(node.e, node.label);
428
+ g.removeNode(v);
429
+ node.label.points = [
430
+ { x: x + 2 * dx / 3, y: y - dy },
431
+ { x: x + 5 * dx / 6, y: y - dy },
432
+ { y: y, x: x + dx },
433
+ { x: x + 5 * dx / 6, y: y + dy },
434
+ { x: x + 2 * dx / 3, y: y + dy }
435
+ ];
436
+ node.label.x = node.x;
437
+ node.label.y = node.y;
438
+ }
439
+ });
440
+ };
441
+ var selectNumberAttrs = function (obj, attrs) {
442
+ var pickedProperties = {};
443
+ attrs.forEach(function (key) {
444
+ if (obj[key] === undefined)
445
+ return;
446
+ pickedProperties[key] = (+obj[key]);
447
+ });
448
+ return pickedProperties;
449
+ };
450
+ var canonicalize = function (attrs) {
451
+ var newAttrs = {};
452
+ Object.keys(attrs).forEach(function (k) {
453
+ var v = attrs[k];
454
+ newAttrs[k.toLowerCase()] = v;
455
+ });
456
+ return newAttrs;
457
+ };
458
+ exports.default = layout;
459
+ //# sourceMappingURL=layout.js.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"layout.js","sourceRoot":"","sources":["../../../../src/layout/dagre/src/layout.ts"],"names":[],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;AAAA,sDAAgC;AAChC,0DAAoC;AACpC,gDAA0B;AAC1B,6CAAgE;AAChE,8EAAsD;AACtD,kEAA2C;AAC3C,8EAAsD;AACtD,0EAAmD;AACnD,kDAA4B;AAC5B,wDAAkC;AAClC,wDAAkC;AAClC,4EAAoD;AAIpD,IAAM,KAAK,GAAI,kBAAgB,CAAC,KAAK,CAAC;AAEtC,IAAM,MAAM,GAAG,UAAC,CAAS,EAAE,IAAS;IAClC,IAAM,IAAI,GAAG,IAAI,IAAI,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,cAAI,CAAC,IAAI,CAAC,CAAC,CAAC,cAAI,CAAC,MAAM,CAAC;IAChE,IAAI,CAAC,QAAQ,EAAE;QACb,0BAA0B;QAC1B,IAAI,IAAI,IAAI,CAAC,IAAI,CAAC,aAAa,IAAI,IAAI,CAAC,SAAS,EAAE;YACjD,IAAI,CAAC,gBAAgB,EAAE,cAAQ,YAAY,CAAC,CAAC,EAAE,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;SACpE;QACD,IAAM,WAAW,GACf,IAAI,CAAC,oBAAoB,EAAE,cAAQ,OAAO,gBAAgB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACpE,0CAA0C;QAC1C,IAAI,CAAC,CAAC,IAAI,IAAI,CAAC,IAAI,CAAC,cAAc,KAAK,KAAK,CAAC,CAAC,EAAE;YAC9C,IAAI,CAAC,0BAA0B,EAAE,cAAQ,sBAAsB,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;SAClF;QACD,oCAAoC;QACpC,IAAI;YACF,IAAI,CAAC,aAAa,EAAS,cAAQ,SAAS,CAAC,WAAW,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;SAC3E;QAAC,OAAM,CAAC,EAAE;YACT,IAAI,CAAC,CAAC,OAAO,KAAK,2DAA2D,EAAE;gBAC7E,OAAO,CAAC,KAAK,CAAC,oJAAoJ,EAAE,CAAC,CAAC,CAAC;gBACvK,OAAO;aACR;YACC,MAAK,CAAC,CAAC,CAAC,CAAC;SAEZ;QACD,IAAI,CAAC,oBAAoB,EAAE,cAAQ,gBAAgB,CAAC,CAAC,EAAE,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC1E,CAAC,CAAC,CAAC;AACL,CAAC,CAAC;AAEF,IAAM,SAAS,GAAG,UAAC,CAAS,EAAE,IAAS,EAAE,IAAS;IAChD,IAAI,CAAC,qBAAqB,EAAS,cAAQ,eAAe,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAClE,IAAI,CAAC,aAAa,EAAiB,cAAQ,iBAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC9D,IAAI,CAAC,sBAAsB,EAAQ,cAAQ,uBAAY,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACnE,IAAI,CAAC,UAAU,EAAoB,cAAQ,IAAA,cAAI,EAAC,cAAI,CAAC,kBAAkB,CAAC,CAAC,CAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACvF,IAAI,CAAC,4BAA4B,EAAE,cAAQ,sBAAsB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACzE,IAAI,CAAC,sBAAsB,EAAQ,cAAQ,IAAA,uBAAgB,EAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACnE,IAAI,CAAC,0BAA0B,EAAI,cAAQ,uBAAY,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACvE,IAAI,CAAC,oBAAoB,EAAU,cAAQ,IAAA,qBAAc,EAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACjE,IAAI,CAAC,sBAAsB,EAAQ,cAAQ,gBAAgB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACnE,IAAI,CAAC,4BAA4B,EAAE,cAAQ,sBAAsB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACzE,IAAI,CAAC,mBAAmB,EAAW,cAAQ,mBAAS,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAChE,IAAI,CAAC,uBAAuB,EAAO,cAAQ,IAAA,6BAAiB,EAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACpE,IAAI,CAAC,uBAAuB,EAAO,cAAQ,IAAA,6BAAiB,EAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACpE,IAAI,IAAI,IAAI,IAAI,CAAC,aAAa,EAAE;QAC9B,IAAI,CAAC,mBAAmB,EAAE,cAAQ,IAAA,yBAAa,EAAC,CAAC,EAAE,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;KACxE;IACD,IAAI,CAAC,WAAW,EAAmB,cAAQ,IAAA,eAAK,EAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACxD,IAAI,CAAC,qBAAqB,EAAS,cAAQ,eAAe,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAClE,IAAI,CAAC,4BAA4B,EAAE,cAAQ,2BAAgB,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC1E,IAAI,CAAC,cAAc,EAAgB,cAAQ,IAAA,kBAAQ,EAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC3D,IAAI,CAAC,uBAAuB,EAAO,cAAQ,iBAAiB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACpE,IAAI,CAAC,uBAAuB,EAAO,cAAQ,iBAAiB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACpE,IAAI,CAAC,oBAAoB,EAAU,cAAQ,mBAAS,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACjE,IAAI,CAAC,0BAA0B,EAAI,cAAQ,oBAAoB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACvE,IAAI,CAAC,0BAA0B,EAAI,cAAQ,2BAAgB,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACxE,IAAI,CAAC,oBAAoB,EAAU,cAAQ,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACjE,IAAI,CAAC,0BAA0B,EAAI,cAAQ,oBAAoB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACvE,IAAI,CAAC,mBAAmB,EAAW,cAAQ,6BAA6B,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAChF,IAAI,CAAC,kBAAkB,EAAY,cAAQ,iBAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AACjE,CAAC,CAAC;AAEF;;;GAGG;AACH,IAAM,YAAY,GAAG,UAAC,KAAa,EAAE,KAAa;IAChD,IAAM,WAAW,GAAQ,KAAK,CAAC,MAAM,IAAI,EAAE,CAAC;IAC5C,KAAK,CAAC,KAAK,EAAE,CAAC,OAAO,CAAC,UAAC,CAAS;QAC9B,IAAM,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC3B,IAAI,WAAW,CAAC,CAAC,CAAC,KAAK,SAAS,EAAE;YAChC,IAAI,CAAC,QAAQ,GAAG,WAAW,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;YACtC,OAAO,WAAW,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;SAC9B;aAAM;YACL,OAAO,IAAI,CAAC,QAAQ,CAAC;SACtB;IACH,CAAC,CAAC,CAAC;AACL,CAAC,CAAC;AAEF;;;;;GAKG;AACH,IAAM,gBAAgB,GAAG,UAAC,UAAkB,EAAE,WAAmB;IAC/D,UAAU,CAAC,KAAK,EAAE,CAAC,OAAO,CAAC,UAAC,CAAC;;QAC3B,IAAM,UAAU,GAAG,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACtC,IAAM,WAAW,GAAG,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAExC,IAAI,UAAU,EAAE;YACd,UAAU,CAAC,CAAC,GAAG,WAAW,CAAC,CAAC,CAAC;YAC7B,UAAU,CAAC,CAAC,GAAG,WAAW,CAAC,CAAC,CAAC;YAC7B,UAAU,CAAC,MAAM,GAAG,WAAW,CAAC,KAAK,CAAC;YACtC,UAAU,CAAC,KAAK,GAAG,WAAW,CAAC,IAAI,CAAC;YAEpC,IAAI,MAAA,WAAW,CAAC,QAAQ,CAAC,CAAC,CAAC,0CAAE,MAAM,EAAE;gBACnC,UAAU,CAAC,KAAK,GAAG,WAAW,CAAC,KAAK,CAAC;gBACrC,UAAU,CAAC,MAAM,GAAG,WAAW,CAAC,MAAM,CAAC;aACxC;SACF;IACH,CAAC,CAAC,CAAC;IAEH,UAAU,CAAC,KAAK,EAAE,CAAC,OAAO,CAAC,UAAC,CAAC;QAC3B,IAAM,UAAU,GAAG,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACtC,IAAM,WAAW,GAAG,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAExC,UAAU,CAAC,MAAM,GAAG,WAAW,CAAC,MAAM,CAAC;QACvC,IAAI,WAAW,CAAC,cAAc,CAAC,GAAG,CAAC,EAAE;YACnC,UAAU,CAAC,CAAC,GAAG,WAAW,CAAC,CAAC,CAAC;YAC7B,UAAU,CAAC,CAAC,GAAG,WAAW,CAAC,CAAC,CAAC;SAC9B;IACH,CAAC,CAAC,CAAC;IAEH,UAAU,CAAC,KAAK,EAAE,CAAC,KAAK,GAAG,WAAW,CAAC,KAAK,EAAE,CAAC,KAAK,CAAC;IACrD,UAAU,CAAC,KAAK,EAAE,CAAC,MAAM,GAAG,WAAW,CAAC,KAAK,EAAE,CAAC,MAAM,CAAC;AACzD,CAAC,CAAC;AAEF,IAAM,aAAa,GAAG,CAAC,SAAS,EAAE,SAAS,EAAE,SAAS,EAAE,SAAS,EAAE,SAAS,CAAC,CAAC;AAC9E,IAAM,aAAa,GAAG,EAAE,OAAO,EAAE,EAAE,EAAE,OAAO,EAAE,EAAE,EAAE,OAAO,EAAE,EAAE,EAAE,OAAO,EAAE,IAAI,EAAE,CAAC;AAC/E,IAAM,UAAU,GAAG,CAAC,WAAW,EAAE,QAAQ,EAAE,SAAS,EAAE,OAAO,CAAC,CAAC;AAC/D,IAAM,YAAY,GAAG,CAAC,OAAO,EAAE,QAAQ,EAAE,OAAO,EAAE,UAAU,CAAC,CAAC,CAAC,4BAA4B;AAC3F,IAAM,YAAY,GAAG,EAAE,KAAK,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC;AAC7C,IAAM,YAAY,GAAG,CAAC,QAAQ,EAAE,QAAQ,EAAE,OAAO,EAAE,QAAQ,EAAE,aAAa,CAAC,CAAC;AAC5E,IAAM,YAAY,GAAG;IACnB,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC;IACzC,WAAW,EAAE,EAAE,EAAE,QAAQ,EAAE,GAAG;CAC/B,CAAC;AACF,IAAM,SAAS,GAAG,CAAC,UAAU,CAAC,CAAC;AAE/B;;;;;GAKG;AACH,IAAM,gBAAgB,GAAG,UAAC,UAAkB;IAC1C,IAAM,CAAC,GAAG,IAAI,KAAK,CAAC,EAAE,UAAU,EAAE,IAAI,EAAE,QAAQ,EAAE,IAAI,EAAE,CAAC,CAAC;IAC1D,IAAM,KAAK,GAAG,YAAY,CAAC,UAAU,CAAC,KAAK,EAAE,CAAC,CAAC;IAE/C,IAAM,gBAAgB,GAAQ,EAAE,CAAC;IACjC,UAAU,CAAC,OAAO,CAAC,UAAC,GAAG;QACrB,IAAI,KAAK,CAAC,GAAG,CAAC,KAAK,SAAS;YAAE,gBAAgB,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC;IACnE,CAAC,CAAC,CAAC;IAEH,CAAC,CAAC,QAAQ,CAAC,MAAM,CAAC,MAAM,CAAC,EAAE,EACzB,aAAa,EACb,iBAAiB,CAAC,KAAK,EAAE,aAAa,CAAC,EACvC,gBAAgB,CACjB,CAAC,CAAC;IAEH,UAAU,CAAC,KAAK,EAAE,CAAC,OAAO,CAAC,UAAC,CAAC;QAC3B,IAAM,IAAI,GAAG,YAAY,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;QAC9C,IAAM,YAAY,GAAG,iBAAiB,CAAC,IAAI,EAAE,YAAY,CAAC,CAAC;QAC3D,MAAM,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC,OAAO,CAAC,UAAC,GAAG;YACpC,IAAI,YAAY,CAAC,GAAG,CAAC,KAAK,SAAS,EAAE;gBACnC,YAAY,CAAC,GAAG,CAAC,GAAI,YAAoB,CAAC,GAAG,CAAC,CAAC;aAChD;QACH,CAAC,CAAC,CAAC;QACH,CAAC,CAAC,OAAO,CAAC,CAAC,EAAE,YAAY,CAAC,CAAC;QAC3B,CAAC,CAAC,SAAS,CAAC,CAAC,EAAE,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;IACvC,CAAC,CAAC,CAAC;IAEH,UAAU,CAAC,KAAK,EAAE,CAAC,OAAO,CAAC,UAAC,CAAC;QAC3B,IAAM,IAAI,GAAG,YAAY,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;QAE9C,IAAM,gBAAgB,GAAQ,EAAE,CAAC;QACjC,SAAS,CAAC,OAAO,CAAC,UAAC,GAAG;YACpB,IAAI,IAAI,CAAC,GAAG,CAAC,KAAK,SAAS;gBAAE,gBAAgB,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC;QACjE,CAAC,CAAC,CAAC;QAEH,CAAC,CAAC,OAAO,CAAC,CAAC,EAAE,MAAM,CAAC,MAAM,CAAC,EAAE,EAC3B,YAAY,EACZ,iBAAiB,CAAC,IAAI,EAAE,YAAY,CAAC,EACrC,gBAAgB,CAAC,CAAC,CAAC;IACvB,CAAC,CAAC,CAAC;IAEH,OAAO,CAAC,CAAC;AACX,CAAC,CAAC;AAEF;;;;;;;GAOG;AACH,IAAM,sBAAsB,GAAG,UAAC,CAAS;IACvC,IAAM,KAAK,GAAG,CAAC,CAAC,KAAK,EAAE,CAAC;IACxB,IAAI,CAAC,KAAK,CAAC,OAAO;QAAE,KAAK,CAAC,OAAO,GAAG,CAAC,CAAC;IACtC,KAAK,CAAC,OAAO,IAAI,CAAC,CAAC;IACnB,CAAC,CAAC,KAAK,EAAE,CAAC,OAAO,CAAC,UAAC,CAAC;QAClB,IAAM,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACvB,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAY,CAAC,EAAE;YAC7B,IAAI,CAAC,IAAI,CAAC,KAAK;gBAAE,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC;;gBAC3B,IAAI,CAAC,KAAK,IAAI,CAAC,CAAC,CAAC,kCAAkC;SACzD;IACH,CAAC,CAAC,CAAC;IACH,CAAC,CAAC,KAAK,EAAE,CAAC,OAAO,CAAC,UAAC,CAAC;;QAClB,IAAM,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACvB,IAAI,CAAC,MAAM,IAAI,CAAC,CAAC;QACjB,IAAI,CAAA,MAAA,IAAI,CAAC,QAAQ,0CAAE,WAAW,EAAE,MAAK,GAAG,EAAE;YACxC,IAAI,KAAK,CAAC,OAAO,KAAK,IAAI,IAAI,KAAK,CAAC,OAAO,KAAK,IAAI,EAAE;gBACpD,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,WAAW,CAAC;aAChC;iBAAM;gBACL,IAAI,CAAC,MAAM,IAAI,IAAI,CAAC,WAAW,CAAC;aACjC;SACF;IACH,CAAC,CAAC,CAAC;AACL,CAAC,CAAC;AAEF;;;;;GAKG;AACH,IAAM,sBAAsB,GAAG,UAAC,CAAS;IACvC,CAAC,CAAC,KAAK,EAAE,CAAC,OAAO,CAAC,UAAC,CAAC;QAClB,IAAM,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACvB,IAAI,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,MAAM,EAAE;YAC7B,IAAM,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YACtB,IAAM,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YACtB,IAAM,KAAK,GAAG,EAAE,CAAC,GAAA,EAAE,IAAI,EAAE,CAAE,CAAC,CAAC,IAAe,GAAI,CAAC,CAAC,IAAe,CAAC,GAAG,CAAC,GAAI,CAAC,CAAC,IAAe,EAAE,CAAC;YAC9F,cAAI,CAAC,YAAY,CAAC,CAAC,EAAE,YAAY,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC;SAClD;IACH,CAAC,CAAC,CAAC;AACL,CAAC,CAAC;AAEF,IAAM,gBAAgB,GAAG,UAAC,CAAS;IACjC,IAAI,OAAO,GAAG,CAAC,CAAC;IAChB,CAAC,CAAC,KAAK,EAAE,CAAC,OAAO,CAAC,UAAC,CAAC;QAClB,IAAM,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACvB,IAAI,IAAI,CAAC,SAAS,EAAE;YAClB,IAAI,CAAC,OAAO,GAAG,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,IAAI,CAAC;YAC3C,IAAI,CAAC,OAAO,GAAG,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC,IAAI,CAAC;YAC9C,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,OAAO,EAAE,IAAI,CAAC,OAAO,IAAI,CAAC,QAAQ,CAAC,CAAC;SACxD;IACH,CAAC,CAAC,CAAC;IACH,CAAC,CAAC,KAAK,EAAE,CAAC,OAAO,GAAG,OAAO,CAAC;AAC9B,CAAC,CAAC;AAEF,IAAM,sBAAsB,GAAG,UAAC,CAAS;IACvC,CAAC,CAAC,KAAK,EAAE,CAAC,OAAO,CAAC,UAAC,CAAC;QAClB,IAAM,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACvB,IAAI,IAAI,CAAC,KAAK,KAAK,YAAY,EAAE;YAC/B,CAAC,CAAC,IAAI,CAAE,IAAY,CAAC,CAAC,CAAC,CAAC,SAAS,GAAG,IAAI,CAAC,IAAI,CAAC;YAC9C,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;SACjB;IACH,CAAC,CAAC,CAAC;AACL,CAAC,CAAC;AAEF,IAAM,cAAc,GAAG,UAAC,CAAS;IAC/B,IAAI,IAAI,GAAG,MAAM,CAAC,iBAAiB,CAAC;IACpC,IAAI,IAAI,GAAG,CAAC,CAAC;IACb,IAAI,IAAI,GAAG,MAAM,CAAC,iBAAiB,CAAC;IACpC,IAAI,IAAI,GAAG,CAAC,CAAC;IACb,IAAM,UAAU,GAAG,CAAC,CAAC,KAAK,EAAE,CAAC;IAC7B,IAAM,OAAO,GAAG,UAAU,CAAC,OAAO,IAAI,CAAC,CAAC;IACxC,IAAM,OAAO,GAAG,UAAU,CAAC,OAAO,IAAI,CAAC,CAAC;IAExC,IAAM,WAAW,GAAG,UAAC,KAAU;QAC7B,IAAM,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC;QAClB,IAAM,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC;QAClB,IAAM,CAAC,GAAG,KAAK,CAAC,KAAK,CAAC;QACtB,IAAM,CAAC,GAAG,KAAK,CAAC,MAAM,CAAC;QACvB,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;QACjC,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;QACjC,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;QACjC,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;IACnC,CAAC,CAAC;IAEF,CAAC,CAAC,KAAK,EAAE,CAAC,OAAO,CAAC,UAAC,CAAC,IAAO,WAAW,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACtD,CAAC,CAAC,KAAK,EAAE,CAAC,OAAO,CAAC,UAAC,CAAC;QAClB,IAAM,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACvB,IAAI,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,EAAE;YAC5B,WAAW,CAAC,IAAI,CAAC,CAAC;SACnB;IACH,CAAC,CAAC,CAAC;IAEH,IAAI,IAAI,OAAO,CAAC;IAChB,IAAI,IAAI,OAAO,CAAC;IAEhB,CAAC,CAAC,KAAK,EAAE,CAAC,OAAO,CAAC,UAAC,CAAC;QAClB,IAAM,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACvB,IAAI,CAAC,CAAC,IAAI,IAAI,CAAC;QACf,IAAI,CAAC,CAAC,IAAI,IAAI,CAAC;IACjB,CAAC,CAAC,CAAC;IAEH,CAAC,CAAC,KAAK,EAAE,CAAC,OAAO,CAAC,UAAC,CAAC;;QAClB,IAAM,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACvB,MAAA,IAAI,CAAC,MAAM,0CAAE,OAAO,CAAC,UAAC,CAAC;YACrB,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC;YACZ,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC;QACd,CAAC,CAAC,CAAC;QACH,IAAI,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,EAAE;YAAE,IAAI,CAAC,CAAC,IAAI,IAAI,CAAC;SAAE;QACjD,IAAI,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,EAAE;YAAE,IAAI,CAAC,CAAC,IAAI,IAAI,CAAC;SAAE;IACnD,CAAC,CAAC,CAAC;IAEH,UAAU,CAAC,KAAK,GAAG,IAAI,GAAG,IAAI,GAAG,OAAO,CAAC;IACzC,UAAU,CAAC,MAAM,GAAG,IAAI,GAAG,IAAI,GAAG,OAAO,CAAC;AAC5C,CAAC,CAAC;AAEF,IAAM,oBAAoB,GAAG,UAAC,CAAS;IACrC,CAAC,CAAC,KAAK,EAAE,CAAC,OAAO,CAAC,UAAC,CAAC;QAClB,IAAM,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACvB,IAAM,KAAK,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC1B,IAAM,KAAK,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC1B,IAAI,EAAE,CAAC;QACP,IAAI,EAAE,CAAC;QACP,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE;YAChB,IAAI,CAAC,MAAM,GAAG,EAAE,CAAC;YACjB,EAAE,GAAG,KAAK,CAAC;YACX,EAAE,GAAG,KAAK,CAAC;SACZ;aAAM;YACL,EAAE,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACpB,EAAE,GAAG,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;SAC1C;QACD,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,cAAI,CAAC,aAAa,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC,CAAC;QACnD,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,cAAI,CAAC,aAAa,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC,CAAC;IAClD,CAAC,CAAC,CAAC;AACL,CAAC,CAAC;AAEF,IAAM,oBAAoB,GAAG,UAAC,CAAS;IACrC,CAAC,CAAC,KAAK,EAAE,CAAC,OAAO,CAAC,UAAC,CAAC;QAClB,IAAM,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACvB,IAAI,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,EAAE;YAC5B,IAAI,IAAI,CAAC,QAAQ,KAAK,GAAG,IAAI,IAAI,CAAC,QAAQ,KAAK,GAAG,EAAE;gBAClD,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,WAAW,CAAC;aAChC;YACD,QAAQ,IAAI,CAAC,QAAQ,EAAE;gBACvB,KAAK,GAAG;oBAAE,IAAI,CAAC,CAAC,IAAI,IAAI,CAAC,KAAK,GAAG,CAAC,GAAG,IAAI,CAAC,WAAW,CAAC;oBAAC,MAAM;gBAC7D,KAAK,GAAG;oBAAE,IAAI,CAAC,CAAC,IAAI,IAAI,CAAC,KAAK,GAAG,CAAC,GAAG,IAAI,CAAC,WAAW,CAAC;oBAAC,MAAM;aAC5D;SACF;IACH,CAAC,CAAC,CAAC;AACL,CAAC,CAAC;AAEF,IAAM,6BAA6B,GAAG,UAAC,CAAS;IAC9C,CAAC,CAAC,KAAK,EAAE,CAAC,OAAO,CAAC,UAAC,CAAC;QAClB,IAAM,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACvB,IAAI,IAAI,CAAC,QAAQ,EAAE;YACjB,IAAI,CAAC,MAAM,CAAC,OAAO,EAAE,CAAC;SACvB;IACH,CAAC,CAAC,CAAC;AACL,CAAC,CAAC;AAEF,IAAM,iBAAiB,GAAG,UAAC,CAAS;IAClC,CAAC,CAAC,KAAK,EAAE,CAAC,OAAO,CAAC,UAAC,CAAC;;QAClB,IAAI,MAAA,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,0CAAE,MAAM,EAAE;YACzB,IAAM,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACvB,IAAM,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;YACjC,IAAM,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;YACpC,IAAM,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,CAAA,MAAA,IAAI,CAAC,UAAU,0CAAE,MAAM,IAAG,CAAC,CAAC,CAAC,CAAC;YAC/D,IAAM,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,CAAA,MAAA,IAAI,CAAC,WAAW,0CAAE,MAAM,IAAG,CAAC,CAAC,CAAC,CAAC;YAEjE,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;YACjC,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;YAClC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC;YAC9B,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;SAChC;IACH,CAAC,CAAC,CAAC;IAEH,CAAC,CAAC,KAAK,EAAE,CAAC,OAAO,CAAC,UAAC,CAAC;QAClB,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,KAAK,QAAQ,EAAE;YAChC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;SACjB;IACH,CAAC,CAAC,CAAC;AACL,CAAC,CAAC;AAEF,IAAM,eAAe,GAAG,UAAC,CAAS;IAChC,CAAC,CAAC,KAAK,EAAE,CAAC,OAAO,CAAC,UAAC,CAAC;QAClB,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE;YACf,IAAM,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YACzB,IAAI,CAAC,IAAI,CAAC,SAAS,EAAE;gBACnB,IAAI,CAAC,SAAS,GAAG,EAAE,CAAC;aACrB;YACD,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,EAAE,CAAC,GAAA,EAAE,KAAK,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;YAC7C,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;SACjB;IACH,CAAC,CAAC,CAAC;AACL,CAAC,CAAC;AAEF,IAAM,eAAe,GAAG,UAAC,CAAS;IAChC,IAAM,MAAM,GAAG,cAAI,CAAC,gBAAgB,CAAC,CAAC,CAAC,CAAC;IACxC,MAAM,CAAC,OAAO,CAAC,UAAC,KAAe;QAC7B,IAAI,UAAU,GAAG,CAAC,CAAC;QACnB,KAAK,CAAC,OAAO,CAAC,UAAC,CAAS,EAAE,CAAS;;YACjC,IAAM,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACvB,IAAI,CAAC,KAAK,GAAG,CAAC,GAAG,UAAU,CAAC;YAC5B,MAAA,IAAI,CAAC,SAAS,0CAAE,OAAO,CAAC,UAAC,QAAa;gBACpC,cAAI,CAAC,YAAY,CAAC,CAAC,EAAE,UAAU,EAAE;oBAC/B,KAAK,EAAE,QAAQ,CAAC,KAAK,CAAC,KAAK;oBAC3B,MAAM,EAAE,QAAQ,CAAC,KAAK,CAAC,MAAM;oBAC7B,IAAI,EAAE,IAAI,CAAC,IAAI;oBACf,KAAK,EAAE,CAAC,GAAG,CAAC,EAAE,UAAU,CAAC;oBACzB,CAAC,EAAE,QAAQ,CAAC,CAAC;oBACb,KAAK,EAAE,QAAQ,CAAC,KAAK;iBACtB,EAAE,KAAK,CAAC,CAAC;YACZ,CAAC,CAAC,CAAC;YACH,OAAO,IAAI,CAAC,SAAS,CAAC;QACxB,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;AACL,CAAC,CAAC;AAEF,IAAM,iBAAiB,GAAG,UAAC,CAAS;IAClC,CAAC,CAAC,KAAK,EAAE,CAAC,OAAO,CAAC,UAAC,CAAC;QAClB,IAAM,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACvB,IAAI,IAAI,CAAC,KAAK,KAAK,UAAU,EAAE;YAC7B,IAAM,QAAQ,GAAG,CAAC,CAAC,IAAI,CAAE,IAAY,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAC3C,IAAM,CAAC,GAAG,QAAQ,CAAC,CAAC,GAAG,QAAQ,CAAC,KAAK,GAAG,CAAC,CAAC;YAC1C,IAAM,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC;YACrB,IAAM,EAAE,GAAG,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;YACtB,IAAM,EAAE,GAAG,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC;YAC/B,CAAC,CAAC,OAAO,CAAE,IAAY,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC;YACvC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;YAChB,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG;gBAClB,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE;gBAChC,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE;gBAChC,EAAE,CAAC,GAAA,EAAE,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE;gBAChB,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE;gBAChC,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE;aACjC,CAAC;YACF,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC;YACtB,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC;SACvB;IACH,CAAC,CAAC,CAAC;AACL,CAAC,CAAC;AAEF,IAAM,iBAAiB,GAAG,UAAC,GAAQ,EAAE,KAAU;IAC7C,IAAM,gBAAgB,GAAQ,EAAE,CAAC;IACjC,KAAK,CAAC,OAAO,CAAC,UAAC,GAAW;QACxB,IAAI,GAAG,CAAC,GAAG,CAAC,KAAK,SAAS;YAAE,OAAO;QACnC,gBAAgB,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;IACtC,CAAC,CAAC,CAAC;IACH,OAAO,gBAAgB,CAAC;AAC1B,CAAC,CAAC;AAEF,IAAM,YAAY,GAAG,UAAC,KAAU;IAC9B,IAAM,QAAQ,GAAQ,EAAE,CAAC;IACzB,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,OAAO,CAAC,UAAC,CAAS;QACnC,IAAM,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;QACnB,QAAQ,CAAC,CAAC,CAAC,WAAW,EAAE,CAAC,GAAG,CAAC,CAAC;IAChC,CAAC,CAAC,CAAC;IACH,OAAO,QAAQ,CAAC;AAClB,CAAC,CAAC;AAEF,kBAAe,MAAM,CAAC"}
@@ -0,0 +1,7 @@
1
+ import { graphlib } from '../graphlib';
2
+ declare type Graph = graphlib.Graph;
3
+ declare const _default: {
4
+ run: (g: Graph) => void;
5
+ cleanup: (g: Graph) => void;
6
+ };
7
+ export default _default;
@@ -0,0 +1,117 @@
1
+ "use strict";
2
+ var __importDefault = (this && this.__importDefault) || function (mod) {
3
+ return (mod && mod.__esModule) ? mod : { "default": mod };
4
+ };
5
+ Object.defineProperty(exports, "__esModule", { value: true });
6
+ var util_1 = __importDefault(require("./util"));
7
+ /*
8
+ * A nesting graph creates dummy nodes for the tops and bottoms of subgraphs,
9
+ * adds appropriate edges to ensure that all cluster nodes are placed between
10
+ * these boundries, and ensures that the graph is connected.
11
+ *
12
+ * In addition we ensure, through the use of the minlen property, that nodes
13
+ * and subgraph border nodes to not end up on the same rank.
14
+ *
15
+ * Preconditions:
16
+ *
17
+ * 1. Input graph is a DAG
18
+ * 2. Nodes in the input graph has a minlen attribute
19
+ *
20
+ * Postconditions:
21
+ *
22
+ * 1. Input graph is connected.
23
+ * 2. Dummy nodes are added for the tops and bottoms of subgraphs.
24
+ * 3. The minlen attribute for nodes is adjusted to ensure nodes do not
25
+ * get placed on the same rank as subgraph border nodes.
26
+ *
27
+ * The nesting graph idea comes from Sander, "Layout of Compound Directed
28
+ * Graphs."
29
+ */
30
+ var run = function (g) {
31
+ var _a;
32
+ var root = util_1.default.addDummyNode(g, "root", {}, "_root");
33
+ var depths = treeDepths(g);
34
+ // @ts-ignore
35
+ var height = Math.max.apply(Math, Object.values(depths)) - 1; // Note: depths is an Object not an array
36
+ var nodeSep = 2 * height + 1;
37
+ g.graph().nestingRoot = root;
38
+ // Multiply minlen by nodeSep to align nodes on non-border ranks.
39
+ g.edges().forEach(function (e) { g.edge(e).minlen *= nodeSep; });
40
+ // Calculate a weight that is sufficient to keep subgraphs vertically compact
41
+ var weight = sumWeights(g) + 1;
42
+ // Create border nodes and link them up
43
+ (_a = g.children()) === null || _a === void 0 ? void 0 : _a.forEach(function (child) {
44
+ dfs(g, root, nodeSep, weight, height, depths, child);
45
+ });
46
+ // Save the multiplier for node layers for later removal of empty border
47
+ // layers.
48
+ g.graph().nodeRankFactor = nodeSep;
49
+ };
50
+ var dfs = function (g, root, nodeSep, weight, height, depths, v) {
51
+ var children = g.children(v);
52
+ if (!(children === null || children === void 0 ? void 0 : children.length)) {
53
+ if (v !== root) {
54
+ g.setEdge(root, v, { weight: 0, minlen: nodeSep });
55
+ }
56
+ return;
57
+ }
58
+ var top = util_1.default.addBorderNode(g, "_bt");
59
+ var bottom = util_1.default.addBorderNode(g, "_bb");
60
+ var label = g.node(v);
61
+ g.setParent(top, v);
62
+ label.borderTop = top;
63
+ g.setParent(bottom, v);
64
+ label.borderBottom = bottom;
65
+ children === null || children === void 0 ? void 0 : children.forEach(function (child) {
66
+ dfs(g, root, nodeSep, weight, height, depths, child);
67
+ var childNode = g.node(child);
68
+ var childTop = childNode.borderTop ? childNode.borderTop : child;
69
+ var childBottom = childNode.borderBottom ? childNode.borderBottom : child;
70
+ var thisWeight = childNode.borderTop ? weight : 2 * weight;
71
+ var minlen = childTop !== childBottom ? 1 : height - depths[v] + 1;
72
+ g.setEdge(top, childTop, {
73
+ minlen: minlen,
74
+ weight: thisWeight,
75
+ nestingEdge: true
76
+ });
77
+ g.setEdge(childBottom, bottom, {
78
+ minlen: minlen,
79
+ weight: thisWeight,
80
+ nestingEdge: true
81
+ });
82
+ });
83
+ if (!g.parent(v)) {
84
+ g.setEdge(root, top, { weight: 0, minlen: height + depths[v] });
85
+ }
86
+ };
87
+ var treeDepths = function (g) {
88
+ var _a;
89
+ var depths = {};
90
+ var dfs = function (v, depth) {
91
+ var children = g.children(v);
92
+ children === null || children === void 0 ? void 0 : children.forEach(function (child) { return dfs(child, depth + 1); });
93
+ depths[v] = depth;
94
+ };
95
+ (_a = g.children()) === null || _a === void 0 ? void 0 : _a.forEach(function (v) { return dfs(v, 1); });
96
+ return depths;
97
+ };
98
+ var sumWeights = function (g) {
99
+ var result = 0;
100
+ g.edges().forEach(function (e) {
101
+ result += g.edge(e).weight;
102
+ });
103
+ return result;
104
+ };
105
+ var cleanup = function (g) {
106
+ var graphLabel = g.graph();
107
+ graphLabel.nestingRoot && g.removeNode(graphLabel.nestingRoot);
108
+ delete graphLabel.nestingRoot;
109
+ g.edges().forEach(function (e) {
110
+ var edge = g.edge(e);
111
+ if (edge.nestingEdge) {
112
+ g.removeEdge(e);
113
+ }
114
+ });
115
+ };
116
+ exports.default = { run: run, cleanup: cleanup };
117
+ //# sourceMappingURL=nesting-graph.js.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"nesting-graph.js","sourceRoot":"","sources":["../../../../src/layout/dagre/src/nesting-graph.ts"],"names":[],"mappings":";;;;;AACA,gDAA0B;AAI1B;;;;;;;;;;;;;;;;;;;;;;GAsBG;AACH,IAAM,GAAG,GAAG,UAAC,CAAQ;;IACnB,IAAM,IAAI,GAAG,cAAI,CAAC,YAAY,CAAC,CAAC,EAAE,MAAM,EAAE,EAAE,EAAE,OAAO,CAAC,CAAC;IACvD,IAAM,MAAM,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC;IAE7B,aAAa;IACb,IAAM,MAAM,GAAG,IAAI,CAAC,GAAG,OAAR,IAAI,EAAQ,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,yCAAyC;IAChG,IAAM,OAAO,GAAG,CAAC,GAAG,MAAM,GAAG,CAAC,CAAC;IAE/B,CAAC,CAAC,KAAK,EAAE,CAAC,WAAW,GAAG,IAAI,CAAC;IAE7B,iEAAiE;IACjE,CAAC,CAAC,KAAK,EAAE,CAAC,OAAO,CAAC,UAAC,CAAC,IAAQ,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,MAAM,IAAI,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;IAE5D,6EAA6E;IAC7E,IAAM,MAAM,GAAG,UAAU,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IAEjC,uCAAuC;IACvC,MAAA,CAAC,CAAC,QAAQ,EAAE,0CAAE,OAAO,CAAC,UAAC,KAAK;QAC1B,GAAG,CAAC,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,KAAK,CAAC,CAAC;IACvD,CAAC,CAAC,CAAC;IAEH,wEAAwE;IACxE,UAAU;IACV,CAAC,CAAC,KAAK,EAAE,CAAC,cAAc,GAAG,OAAO,CAAC;AACrC,CAAC,CAAC;AAEF,IAAM,GAAG,GAAG,UAAC,CAAQ,EAAE,IAAY,EAAE,OAAe,EAAE,MAAc,EAAE,MAAc,EAAE,MAAW,EAAE,CAAS;IAC1G,IAAM,QAAQ,GAAG,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;IAC/B,IAAI,CAAC,CAAA,QAAQ,aAAR,QAAQ,uBAAR,QAAQ,CAAE,MAAM,CAAA,EAAE;QACrB,IAAI,CAAC,KAAK,IAAI,EAAE;YACd,CAAC,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,OAAO,EAAE,CAAC,CAAC;SACpD;QACD,OAAO;KACR;IAED,IAAM,GAAG,GAAG,cAAI,CAAC,aAAa,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;IACzC,IAAM,MAAM,GAAG,cAAI,CAAC,aAAa,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;IAC5C,IAAM,KAAK,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAExB,CAAC,CAAC,SAAS,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;IACpB,KAAK,CAAC,SAAS,GAAG,GAAG,CAAC;IACtB,CAAC,CAAC,SAAS,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;IACvB,KAAK,CAAC,YAAY,GAAG,MAAM,CAAC;IAE5B,QAAQ,aAAR,QAAQ,uBAAR,QAAQ,CAAE,OAAO,CAAC,UAAC,KAAK;QACtB,GAAG,CAAC,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,KAAK,CAAC,CAAC;QAErD,IAAM,SAAS,GAAG,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAChC,IAAM,QAAQ,GAAG,SAAS,CAAC,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,SAAS,CAAC,CAAC,CAAC,KAAK,CAAC;QACnE,IAAM,WAAW,GAAG,SAAS,CAAC,YAAY,CAAC,CAAC,CAAC,SAAS,CAAC,YAAY,CAAC,CAAC,CAAC,KAAK,CAAC;QAC5E,IAAM,UAAU,GAAG,SAAS,CAAC,SAAS,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC;QAC7D,IAAM,MAAM,GAAG,QAAQ,KAAK,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,GAAG,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QAErE,CAAC,CAAC,OAAO,CAAC,GAAG,EAAE,QAAQ,EAAE;YACvB,MAAM,QAAA;YACN,MAAM,EAAE,UAAU;YAClB,WAAW,EAAE,IAAI;SAClB,CAAC,CAAC;QAEH,CAAC,CAAC,OAAO,CAAC,WAAW,EAAE,MAAM,EAAE;YAC7B,MAAM,QAAA;YACN,MAAM,EAAE,UAAU;YAClB,WAAW,EAAE,IAAI;SAClB,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE;QAChB,CAAC,CAAC,OAAO,CAAC,IAAI,EAAE,GAAG,EAAE,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,MAAM,GAAG,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;KACjE;AACH,CAAC,CAAC;AAEF,IAAM,UAAU,GAAG,UAAC,CAAQ;;IAC1B,IAAM,MAAM,GAAQ,EAAE,CAAC;IACvB,IAAM,GAAG,GAAG,UAAC,CAAS,EAAE,KAAa;QACnC,IAAM,QAAQ,GAAG,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;QAC/B,QAAQ,aAAR,QAAQ,uBAAR,QAAQ,CAAE,OAAO,CAAC,UAAC,KAAK,IAAK,OAAA,GAAG,CAAC,KAAK,EAAE,KAAK,GAAG,CAAC,CAAC,EAArB,CAAqB,CAAC,CAAC;QACpD,MAAM,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC;IACpB,CAAC,CAAC;IACF,MAAA,CAAC,CAAC,QAAQ,EAAE,0CAAE,OAAO,CAAC,UAAC,CAAC,IAAK,OAAA,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,EAAT,CAAS,CAAC,CAAC;IACxC,OAAO,MAAM,CAAC;AAChB,CAAC,CAAC;AAEF,IAAM,UAAU,GAAG,UAAC,CAAQ;IAC1B,IAAI,MAAM,GAAG,CAAC,CAAC;IACf,CAAC,CAAC,KAAK,EAAE,CAAC,OAAO,CAAC,UAAC,CAAC;QAClB,MAAM,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;IAC7B,CAAC,CAAC,CAAC;IACH,OAAO,MAAM,CAAC;AAChB,CAAC,CAAC;AAEF,IAAM,OAAO,GAAG,UAAC,CAAQ;IACvB,IAAM,UAAU,GAAG,CAAC,CAAC,KAAK,EAAE,CAAC;IAC7B,UAAU,CAAC,WAAW,IAAI,CAAC,CAAC,UAAU,CAAC,UAAU,CAAC,WAAW,CAAC,CAAC;IAC/D,OAAO,UAAU,CAAC,WAAW,CAAC;IAC9B,CAAC,CAAC,KAAK,EAAE,CAAC,OAAO,CAAC,UAAC,CAAM;QACvB,IAAM,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACvB,IAAI,IAAI,CAAC,WAAW,EAAE;YACpB,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;SACjB;IACH,CAAC,CAAC,CAAC;AACL,CAAC,CAAC;AAIF,kBAAe,EAAE,GAAG,KAAA,EAAE,OAAO,SAAA,EAAE,CAAC"}
@@ -0,0 +1,7 @@
1
+ import { graphlib } from '../graphlib';
2
+ declare type Graph = graphlib.Graph;
3
+ declare const _default: {
4
+ run: (g: Graph) => void;
5
+ undo: (g: Graph) => void;
6
+ };
7
+ export default _default;