@antv/layout 1.2.9 → 1.2.10
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.
- package/dist/5fc550bbb6f708833d84.worker.js +2 -0
- package/dist/5fc550bbb6f708833d84.worker.js.map +1 -0
- package/dist/index.min.js +1 -1
- package/dist/index.min.js.map +1 -1
- package/package.json +1 -1
- package/dist/5c9e0aa9cf0218d179e9.worker.js +0 -2
- package/dist/5c9e0aa9cf0218d179e9.worker.js.map +0 -1
- package/lib/bundle-entry.js +0 -19
- package/lib/bundle-entry.js.map +0 -1
- package/lib/bundle-supervisor.js +0 -94
- package/lib/bundle-supervisor.js.map +0 -1
- package/lib/bundle-worker.js +0 -53
- package/lib/bundle-worker.js.map +0 -1
- package/lib/circular.js +0 -258
- package/lib/circular.js.map +0 -1
- package/lib/comboCombined.js +0 -441
- package/lib/comboCombined.js.map +0 -1
- package/lib/concentric.js +0 -229
- package/lib/concentric.js.map +0 -1
- package/lib/d3Force/forceInBox.js +0 -331
- package/lib/d3Force/forceInBox.js.map +0 -1
- package/lib/d3Force/index.js +0 -339
- package/lib/d3Force/index.js.map +0 -1
- package/lib/dagre/acyclic.js +0 -62
- package/lib/dagre/acyclic.js.map +0 -1
- package/lib/dagre/add-border-segments.js +0 -37
- package/lib/dagre/add-border-segments.js.map +0 -1
- package/lib/dagre/coordinate-system.js +0 -65
- package/lib/dagre/coordinate-system.js.map +0 -1
- package/lib/dagre/data/list.js +0 -50
- package/lib/dagre/data/list.js.map +0 -1
- package/lib/dagre/greedy-fas.js +0 -147
- package/lib/dagre/greedy-fas.js.map +0 -1
- package/lib/dagre/layout.js +0 -470
- package/lib/dagre/layout.js.map +0 -1
- package/lib/dagre/nesting-graph.js +0 -153
- package/lib/dagre/nesting-graph.js.map +0 -1
- package/lib/dagre/normalize.js +0 -98
- package/lib/dagre/normalize.js.map +0 -1
- package/lib/dagre/order/add-subgraph-constraints.js +0 -45
- package/lib/dagre/order/add-subgraph-constraints.js.map +0 -1
- package/lib/dagre/order/barycenter.js +0 -23
- package/lib/dagre/order/barycenter.js.map +0 -1
- package/lib/dagre/order/build-layer-graph.js +0 -96
- package/lib/dagre/order/build-layer-graph.js.map +0 -1
- package/lib/dagre/order/cross-count.js +0 -63
- package/lib/dagre/order/cross-count.js.map +0 -1
- package/lib/dagre/order/index.js +0 -91
- package/lib/dagre/order/index.js.map +0 -1
- package/lib/dagre/order/init-data-order.js +0 -28
- package/lib/dagre/order/init-data-order.js.map +0 -1
- package/lib/dagre/order/init-order.js +0 -50
- package/lib/dagre/order/init-order.js.map +0 -1
- package/lib/dagre/order/resolve-conflicts.js +0 -121
- package/lib/dagre/order/resolve-conflicts.js.map +0 -1
- package/lib/dagre/order/sort-subgraph.js +0 -84
- package/lib/dagre/order/sort-subgraph.js.map +0 -1
- package/lib/dagre/order/sort.js +0 -74
- package/lib/dagre/order/sort.js.map +0 -1
- package/lib/dagre/parent-dummy-chains.js +0 -80
- package/lib/dagre/parent-dummy-chains.js.map +0 -1
- package/lib/dagre/position/bk.js +0 -398
- package/lib/dagre/position/bk.js.map +0 -1
- package/lib/dagre/position/index.js +0 -54
- package/lib/dagre/position/index.js.map +0 -1
- package/lib/dagre/rank/feasible-tree.js +0 -164
- package/lib/dagre/rank/feasible-tree.js.map +0 -1
- package/lib/dagre/rank/index.js +0 -48
- package/lib/dagre/rank/index.js.map +0 -1
- package/lib/dagre/rank/network-simplex.js +0 -232
- package/lib/dagre/rank/network-simplex.js.map +0 -1
- package/lib/dagre/rank/util.js +0 -138
- package/lib/dagre/rank/util.js.map +0 -1
- package/lib/dagre/util.js +0 -289
- package/lib/dagre/util.js.map +0 -1
- package/lib/dagre.js +0 -545
- package/lib/dagre.js.map +0 -1
- package/lib/force/forceNBody.js +0 -123
- package/lib/force/forceNBody.js.map +0 -1
- package/lib/force/index.js +0 -805
- package/lib/force/index.js.map +0 -1
- package/lib/force/types.js +0 -2
- package/lib/force/types.js.map +0 -1
- package/lib/forceAtlas2/body.js +0 -91
- package/lib/forceAtlas2/body.js.map +0 -1
- package/lib/forceAtlas2/index.js +0 -562
- package/lib/forceAtlas2/index.js.map +0 -1
- package/lib/forceAtlas2/quad.js +0 -98
- package/lib/forceAtlas2/quad.js.map +0 -1
- package/lib/forceAtlas2/quadTree.js +0 -105
- package/lib/forceAtlas2/quadTree.js.map +0 -1
- package/lib/fruchterman.js +0 -376
- package/lib/fruchterman.js.map +0 -1
- package/lib/grid.js +0 -308
- package/lib/grid.js.map +0 -1
- package/lib/index.js +0 -17
- package/lib/index.js.map +0 -1
- package/lib/mds.js +0 -137
- package/lib/mds.js.map +0 -1
- package/lib/radial/index.js +0 -355
- package/lib/radial/index.js.map +0 -1
- package/lib/radial/mds.js +0 -29
- package/lib/radial/mds.js.map +0 -1
- package/lib/radial/radial-nonoverlap-force.js +0 -100
- package/lib/radial/radial-nonoverlap-force.js.map +0 -1
- package/lib/random.js +0 -98
- package/lib/random.js.map +0 -1
- package/lib/registry.js +0 -27
- package/lib/registry.js.map +0 -1
- package/lib/supervisor.js +0 -90
- package/lib/supervisor.js.map +0 -1
- package/lib/types.js +0 -4
- package/lib/types.js.map +0 -1
- package/lib/util/array.js +0 -2
- package/lib/util/array.js.map +0 -1
- package/lib/util/common.d.ts +0 -12
- package/lib/util/common.js +0 -32
- package/lib/util/common.js.map +0 -1
- package/lib/util/function.js +0 -127
- package/lib/util/function.js.map +0 -1
- package/lib/util/gpu.js +0 -214
- package/lib/util/gpu.js.map +0 -1
- package/lib/util/index.js +0 -7
- package/lib/util/index.js.map +0 -1
- package/lib/util/math.js +0 -257
- package/lib/util/math.js.map +0 -1
- package/lib/util/number.js +0 -5
- package/lib/util/number.js.map +0 -1
- package/lib/util/object.js +0 -42
- package/lib/util/object.js.map +0 -1
- package/lib/util/string.js +0 -15
- package/lib/util/string.js.map +0 -1
- package/lib/worker.d.ts +0 -1
- package/lib/worker.js +0 -45
- package/lib/worker.js.map +0 -1
package/lib/dagre/greedy-fas.js
DELETED
|
@@ -1,147 +0,0 @@
|
|
|
1
|
-
/*
|
|
2
|
-
* A greedy heuristic for finding a feedback arc set for a graph. A feedback
|
|
3
|
-
* arc set is a set of edges that can be removed to make a graph acyclic.
|
|
4
|
-
* The algorithm comes from: P. Eades, X. Lin, and W. F. Smyth, "A fast and
|
|
5
|
-
* effective heuristic for the feedback arc set problem." This implementation
|
|
6
|
-
* adjusts that from the paper to allow for weighted edges.
|
|
7
|
-
*
|
|
8
|
-
* @see https://github.com/dagrejs/dagre/blob/master/lib/greedy-fas.js
|
|
9
|
-
*/
|
|
10
|
-
import { __assign, __extends } from "tslib";
|
|
11
|
-
import { Graph } from "@antv/graphlib";
|
|
12
|
-
import RawList from "./data/list";
|
|
13
|
-
var List = /** @class */ (function (_super) {
|
|
14
|
-
__extends(List, _super);
|
|
15
|
-
function List() {
|
|
16
|
-
return _super !== null && _super.apply(this, arguments) || this;
|
|
17
|
-
}
|
|
18
|
-
return List;
|
|
19
|
-
}(RawList));
|
|
20
|
-
var DEFAULT_WEIGHT_FN = function () { return 1; };
|
|
21
|
-
export var greedyFAS = function (g, weightFn) {
|
|
22
|
-
var _a;
|
|
23
|
-
if (g.getAllNodes().length <= 1)
|
|
24
|
-
return [];
|
|
25
|
-
var state = buildState(g, weightFn || DEFAULT_WEIGHT_FN);
|
|
26
|
-
var results = doGreedyFAS(state.graph, state.buckets, state.zeroIdx);
|
|
27
|
-
return (_a = results
|
|
28
|
-
.map(function (e) {
|
|
29
|
-
return g.getRelatedEdges(e.v, "out").filter(function (_a) {
|
|
30
|
-
var target = _a.target;
|
|
31
|
-
return target === e.w;
|
|
32
|
-
});
|
|
33
|
-
})) === null || _a === void 0 ? void 0 : _a.flat();
|
|
34
|
-
};
|
|
35
|
-
var doGreedyFAS = function (g, buckets, zeroIdx) {
|
|
36
|
-
var results = [];
|
|
37
|
-
var sources = buckets[buckets.length - 1];
|
|
38
|
-
var sinks = buckets[0];
|
|
39
|
-
var entry;
|
|
40
|
-
while (g.getAllNodes().length) {
|
|
41
|
-
while ((entry = sinks.dequeue())) {
|
|
42
|
-
removeNode(g, buckets, zeroIdx, entry);
|
|
43
|
-
}
|
|
44
|
-
while ((entry = sources.dequeue())) {
|
|
45
|
-
removeNode(g, buckets, zeroIdx, entry);
|
|
46
|
-
}
|
|
47
|
-
if (g.getAllNodes().length) {
|
|
48
|
-
for (var i = buckets.length - 2; i > 0; --i) {
|
|
49
|
-
entry = buckets[i].dequeue();
|
|
50
|
-
if (entry) {
|
|
51
|
-
results = results.concat(removeNode(g, buckets, zeroIdx, entry, true));
|
|
52
|
-
break;
|
|
53
|
-
}
|
|
54
|
-
}
|
|
55
|
-
}
|
|
56
|
-
}
|
|
57
|
-
return results;
|
|
58
|
-
};
|
|
59
|
-
var removeNode = function (g, buckets, zeroIdx, entry, collectPredecessors) {
|
|
60
|
-
var _a, _b;
|
|
61
|
-
var results = [];
|
|
62
|
-
if (g.hasNode(entry.v)) {
|
|
63
|
-
(_a = g.getRelatedEdges(entry.v, "in")) === null || _a === void 0 ? void 0 : _a.forEach(function (edge) {
|
|
64
|
-
var weight = edge.data.weight;
|
|
65
|
-
var uEntry = g.getNode(edge.source);
|
|
66
|
-
if (collectPredecessors) {
|
|
67
|
-
// this result not really care about in or out
|
|
68
|
-
results.push({ v: edge.source, w: edge.target, in: 0, out: 0 });
|
|
69
|
-
}
|
|
70
|
-
if (uEntry.data.out === undefined)
|
|
71
|
-
uEntry.data.out = 0;
|
|
72
|
-
// @ts-ignore
|
|
73
|
-
uEntry.data.out -= weight;
|
|
74
|
-
assignBucket(buckets, zeroIdx, __assign({ v: uEntry.id }, uEntry.data));
|
|
75
|
-
});
|
|
76
|
-
(_b = g.getRelatedEdges(entry.v, "out")) === null || _b === void 0 ? void 0 : _b.forEach(function (edge) {
|
|
77
|
-
var weight = edge.data.weight;
|
|
78
|
-
var w = edge.target;
|
|
79
|
-
var wEntry = g.getNode(w);
|
|
80
|
-
if (wEntry.data.in === undefined)
|
|
81
|
-
wEntry.data.in = 0;
|
|
82
|
-
// @ts-ignore
|
|
83
|
-
wEntry.data.in -= weight;
|
|
84
|
-
assignBucket(buckets, zeroIdx, __assign({ v: wEntry.id }, wEntry.data));
|
|
85
|
-
});
|
|
86
|
-
g.removeNode(entry.v);
|
|
87
|
-
}
|
|
88
|
-
return collectPredecessors ? results : undefined;
|
|
89
|
-
};
|
|
90
|
-
var buildState = function (g, weightFn) {
|
|
91
|
-
var fasGraph = new Graph();
|
|
92
|
-
var maxIn = 0;
|
|
93
|
-
var maxOut = 0;
|
|
94
|
-
g.getAllNodes().forEach(function (v) {
|
|
95
|
-
fasGraph.addNode({
|
|
96
|
-
id: v.id,
|
|
97
|
-
data: { v: v.id, in: 0, out: 0 },
|
|
98
|
-
});
|
|
99
|
-
});
|
|
100
|
-
// Aggregate weights on nodes, but also sum the weights across multi-edges
|
|
101
|
-
// into a single edge for the fasGraph.
|
|
102
|
-
g.getAllEdges().forEach(function (e) {
|
|
103
|
-
var edge = fasGraph
|
|
104
|
-
.getRelatedEdges(e.source, "out")
|
|
105
|
-
.find(function (edge) { return edge.target === e.target; });
|
|
106
|
-
var weight = (weightFn === null || weightFn === void 0 ? void 0 : weightFn(e)) || 1;
|
|
107
|
-
if (!edge) {
|
|
108
|
-
fasGraph.addEdge({
|
|
109
|
-
id: e.id,
|
|
110
|
-
source: e.source,
|
|
111
|
-
target: e.target,
|
|
112
|
-
data: {
|
|
113
|
-
weight: weight,
|
|
114
|
-
},
|
|
115
|
-
});
|
|
116
|
-
}
|
|
117
|
-
else {
|
|
118
|
-
fasGraph.updateEdgeData(edge === null || edge === void 0 ? void 0 : edge.id, __assign(__assign({}, edge.data), { weight: edge.data.weight + weight }));
|
|
119
|
-
}
|
|
120
|
-
// @ts-ignore
|
|
121
|
-
maxOut = Math.max(maxOut, (fasGraph.getNode(e.source).data.out += weight));
|
|
122
|
-
// @ts-ignore
|
|
123
|
-
maxIn = Math.max(maxIn, (fasGraph.getNode(e.target).data.in += weight));
|
|
124
|
-
});
|
|
125
|
-
var buckets = [];
|
|
126
|
-
var rangeMax = maxOut + maxIn + 3;
|
|
127
|
-
for (var i = 0; i < rangeMax; i++) {
|
|
128
|
-
buckets.push(new List());
|
|
129
|
-
}
|
|
130
|
-
var zeroIdx = maxIn + 1;
|
|
131
|
-
fasGraph.getAllNodes().forEach(function (v) {
|
|
132
|
-
assignBucket(buckets, zeroIdx, __assign({ v: v.id }, fasGraph.getNode(v.id).data));
|
|
133
|
-
});
|
|
134
|
-
return { buckets: buckets, zeroIdx: zeroIdx, graph: fasGraph };
|
|
135
|
-
};
|
|
136
|
-
var assignBucket = function (buckets, zeroIdx, entry) {
|
|
137
|
-
if (!entry.out) {
|
|
138
|
-
buckets[0].enqueue(entry);
|
|
139
|
-
}
|
|
140
|
-
else if (!entry["in"]) {
|
|
141
|
-
buckets[buckets.length - 1].enqueue(entry);
|
|
142
|
-
}
|
|
143
|
-
else {
|
|
144
|
-
buckets[entry.out - entry["in"] + zeroIdx].enqueue(entry);
|
|
145
|
-
}
|
|
146
|
-
};
|
|
147
|
-
//# sourceMappingURL=greedy-fas.js.map
|
|
@@ -1 +0,0 @@
|
|
|
1
|
-
{"version":3,"file":"greedy-fas.js","sourceRoot":"","sources":["../../src/dagre/greedy-fas.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;;AAEH,OAAO,EAAQ,KAAK,EAAM,MAAM,gBAAgB,CAAC;AAEjD,OAAO,OAAO,MAAM,aAAa,CAAC;AAUlC;IAAmB,wBAAkB;IAArC;;IAAuC,CAAC;IAAD,WAAC;AAAD,CAAC,AAAxC,CAAmB,OAAO,GAAc;AAExC,IAAM,iBAAiB,GAAG,cAAM,OAAA,CAAC,EAAD,CAAC,CAAC;AAElC,MAAM,CAAC,IAAM,SAAS,GAAG,UACvB,CAAS,EACT,QAAwC;;IAExC,IAAI,CAAC,CAAC,WAAW,EAAE,CAAC,MAAM,IAAI,CAAC;QAAE,OAAO,EAAE,CAAC;IAC3C,IAAM,KAAK,GAAG,UAAU,CAAC,CAAC,EAAE,QAAQ,IAAI,iBAAiB,CAAC,CAAC;IAC3D,IAAM,OAAO,GAAG,WAAW,CAAC,KAAK,CAAC,KAAK,EAAE,KAAK,CAAC,OAAO,EAAE,KAAK,CAAC,OAAO,CAAC,CAAC;IAEvE,OAAO,MAAA,OAAO;SACX,GAAG,CAAC,UAAC,CAAC;QACL,OAAA,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,MAAM,CAAC,UAAC,EAAU;gBAAR,MAAM,YAAA;YAAO,OAAA,MAAM,KAAK,CAAC,CAAC,CAAC;QAAd,CAAc,CAAC;IAApE,CAAoE,CACrE,0CACC,IAAI,EAAE,CAAC;AACb,CAAC,CAAC;AAEF,IAAM,WAAW,GAAG,UAAC,CAAS,EAAE,OAAe,EAAE,OAAe;IAC9D,IAAI,OAAO,GAAgB,EAAE,CAAC;IAC9B,IAAM,OAAO,GAAG,OAAO,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IAC5C,IAAM,KAAK,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;IAEzB,IAAI,KAAK,CAAC;IACV,OAAO,CAAC,CAAC,WAAW,EAAE,CAAC,MAAM,EAAE;QAC7B,OAAO,CAAC,KAAK,GAAG,KAAK,CAAC,OAAO,EAAE,CAAC,EAAE;YAChC,UAAU,CAAC,CAAC,EAAE,OAAO,EAAE,OAAO,EAAE,KAAK,CAAC,CAAC;SACxC;QACD,OAAO,CAAC,KAAK,GAAG,OAAO,CAAC,OAAO,EAAE,CAAC,EAAE;YAClC,UAAU,CAAC,CAAC,EAAE,OAAO,EAAE,OAAO,EAAE,KAAK,CAAC,CAAC;SACxC;QACD,IAAI,CAAC,CAAC,WAAW,EAAE,CAAC,MAAM,EAAE;YAC1B,KAAK,IAAI,CAAC,GAAG,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,EAAE;gBAC3C,KAAK,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC;gBAC7B,IAAI,KAAK,EAAE;oBACT,OAAO,GAAG,OAAO,CAAC,MAAM,CACtB,UAAU,CAAC,CAAC,EAAE,OAAO,EAAE,OAAO,EAAE,KAAK,EAAE,IAAI,CAAE,CAC9C,CAAC;oBACF,MAAM;iBACP;aACF;SACF;KACF;IAED,OAAO,OAAO,CAAC;AACjB,CAAC,CAAC;AAEF,IAAM,UAAU,GAAG,UACjB,CAAS,EACT,OAAe,EACf,OAAe,EACf,KAAgB,EAChB,mBAA6B;;IAE7B,IAAM,OAAO,GAAgB,EAAE,CAAC;IAEhC,IAAI,CAAC,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE;QACtB,MAAA,CAAC,CAAC,eAAe,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,0CAAE,OAAO,CAAC,UAAC,IAAI;YAC7C,IAAM,MAAM,GAAG,IAAI,CAAC,IAAI,CAAC,MAAO,CAAC;YACjC,IAAM,MAAM,GAAG,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,CAAE,CAAC;YAEvC,IAAI,mBAAmB,EAAE;gBACvB,8CAA8C;gBAC9C,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,IAAI,CAAC,MAAM,EAAE,EAAE,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC;aACjE;YACD,IAAI,MAAM,CAAC,IAAI,CAAC,GAAG,KAAK,SAAS;gBAAE,MAAM,CAAC,IAAI,CAAC,GAAG,GAAG,CAAC,CAAC;YACvD,aAAa;YACb,MAAM,CAAC,IAAI,CAAC,GAAG,IAAI,MAAM,CAAC;YAC1B,YAAY,CAAC,OAAO,EAAE,OAAO,EAAE,WAC7B,CAAC,EAAE,MAAM,CAAC,EAAE,IACT,MAAM,CAAC,IAAI,CACF,CAAC,CAAC;QAClB,CAAC,CAAC,CAAC;QAEH,MAAA,CAAC,CAAC,eAAe,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,0CAAE,OAAO,CAAC,UAAC,IAAI;YAC9C,IAAM,MAAM,GAAG,IAAI,CAAC,IAAI,CAAC,MAAO,CAAC;YACjC,IAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC;YACtB,IAAM,MAAM,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAE,CAAC;YAC7B,IAAI,MAAM,CAAC,IAAI,CAAC,EAAE,KAAK,SAAS;gBAAE,MAAM,CAAC,IAAI,CAAC,EAAE,GAAG,CAAC,CAAC;YACrD,aAAa;YACb,MAAM,CAAC,IAAI,CAAC,EAAE,IAAI,MAAM,CAAC;YACzB,YAAY,CAAC,OAAO,EAAE,OAAO,EAAE,WAC7B,CAAC,EAAE,MAAM,CAAC,EAAE,IACT,MAAM,CAAC,IAAI,CACF,CAAC,CAAC;QAClB,CAAC,CAAC,CAAC;QAEH,CAAC,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;KACvB;IAED,OAAO,mBAAmB,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,SAAS,CAAC;AACnD,CAAC,CAAC;AAEF,IAAM,UAAU,GAAG,UAAC,CAAS,EAAE,QAAwC;IACrE,IAAM,QAAQ,GAAG,IAAI,KAAK,EAAsB,CAAC;IACjD,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,IAAI,MAAM,GAAG,CAAC,CAAC;IAEf,CAAC,CAAC,WAAW,EAAE,CAAC,OAAO,CAAC,UAAC,CAAC;QACxB,QAAQ,CAAC,OAAO,CAAC;YACf,EAAE,EAAE,CAAC,CAAC,EAAE;YACR,IAAI,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE;SACjC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,0EAA0E;IAC1E,uCAAuC;IACvC,CAAC,CAAC,WAAW,EAAE,CAAC,OAAO,CAAC,UAAC,CAAC;QACxB,IAAM,IAAI,GAAG,QAAQ;aAClB,eAAe,CAAC,CAAC,CAAC,MAAM,EAAE,KAAK,CAAC;aAChC,IAAI,CAAC,UAAC,IAAI,IAAK,OAAA,IAAI,CAAC,MAAM,KAAK,CAAC,CAAC,MAAM,EAAxB,CAAwB,CAAC,CAAC;QAC5C,IAAM,MAAM,GAAG,CAAA,QAAQ,aAAR,QAAQ,uBAAR,QAAQ,CAAG,CAAC,CAAC,KAAI,CAAC,CAAC;QAClC,IAAI,CAAC,IAAI,EAAE;YACT,QAAQ,CAAC,OAAO,CAAC;gBACf,EAAE,EAAE,CAAC,CAAC,EAAE;gBACR,MAAM,EAAE,CAAC,CAAC,MAAM;gBAChB,MAAM,EAAE,CAAC,CAAC,MAAM;gBAChB,IAAI,EAAE;oBACJ,MAAM,QAAA;iBACP;aACF,CAAC,CAAC;SACJ;aAAM;YACL,QAAQ,CAAC,cAAc,CAAC,IAAI,aAAJ,IAAI,uBAAJ,IAAI,CAAE,EAAG,wBAC5B,IAAI,CAAC,IAAI,KACZ,MAAM,EAAE,IAAI,CAAC,IAAI,CAAC,MAAO,GAAG,MAAM,IAClC,CAAC;SACJ;QACD,aAAa;QACb,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,EAAE,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAE,CAAC,IAAI,CAAC,GAAG,IAAI,MAAM,CAAC,CAAC,CAAC;QAC5E,aAAa;QACb,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAE,CAAC,IAAI,CAAC,EAAE,IAAI,MAAM,CAAC,CAAC,CAAC;IAC3E,CAAC,CAAC,CAAC;IAEH,IAAM,OAAO,GAAW,EAAE,CAAC;IAC3B,IAAM,QAAQ,GAAG,MAAM,GAAG,KAAK,GAAG,CAAC,CAAC;IACpC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,EAAE,CAAC,EAAE,EAAE;QACjC,OAAO,CAAC,IAAI,CAAC,IAAI,IAAI,EAAE,CAAC,CAAC;KAC1B;IACD,IAAM,OAAO,GAAG,KAAK,GAAG,CAAC,CAAC;IAE1B,QAAQ,CAAC,WAAW,EAAE,CAAC,OAAO,CAAC,UAAC,CAAC;QAC/B,YAAY,CAAC,OAAO,EAAE,OAAO,EAAE,WAC7B,CAAC,EAAE,CAAC,CAAC,EAAE,IACJ,QAAQ,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,CAClB,CAAC,CAAC;IAClB,CAAC,CAAC,CAAC;IAEH,OAAO,EAAE,OAAO,SAAA,EAAE,OAAO,SAAA,EAAE,KAAK,EAAE,QAAQ,EAAE,CAAC;AAC/C,CAAC,CAAC;AAEF,IAAM,YAAY,GAAG,UAAC,OAAe,EAAE,OAAe,EAAE,KAAgB;IACtE,IAAI,CAAC,KAAK,CAAC,GAAG,EAAE;QACd,OAAO,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;KAC3B;SAAM,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE;QACvB,OAAO,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;KAC5C;SAAM;QACL,OAAO,CAAC,KAAK,CAAC,GAAG,GAAG,KAAK,CAAC,IAAI,CAAC,GAAG,OAAO,CAAC,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;KAC3D;AACH,CAAC,CAAC"}
|
package/lib/dagre/layout.js
DELETED
|
@@ -1,470 +0,0 @@
|
|
|
1
|
-
import { __assign } from "tslib";
|
|
2
|
-
import { Graph } from '@antv/graphlib';
|
|
3
|
-
import { isNil } from '@antv/util';
|
|
4
|
-
import { run as runAcyclic, undo as undoAcyclic } from './acyclic';
|
|
5
|
-
import { run as runNormalize, undo as undoNormalize } from './normalize';
|
|
6
|
-
import { rank } from './rank';
|
|
7
|
-
import { normalizeRanks, removeEmptyRanks, asNonCompoundGraph, addDummyNode, intersectRect, buildLayerMatrix, } from './util';
|
|
8
|
-
import { parentDummyChains } from './parent-dummy-chains';
|
|
9
|
-
import { run as runNestingGraph, cleanup as cleanupNestingGraph, } from './nesting-graph';
|
|
10
|
-
import { addBorderSegments } from './add-border-segments';
|
|
11
|
-
import { adjust as adjustCoordinateSystem, undo as undoCoordinateSystem, } from './coordinate-system';
|
|
12
|
-
import { order } from './order';
|
|
13
|
-
import { position } from './position';
|
|
14
|
-
import { initDataOrder } from './order/init-data-order';
|
|
15
|
-
// const graphNumAttrs = ["nodesep", "edgesep", "ranksep", "marginx", "marginy"];
|
|
16
|
-
// const graphDefaults = { ranksep: 50, edgesep: 20, nodesep: 50, rankdir: "tb" };
|
|
17
|
-
// const graphAttrs = ["acyclicer", "ranker", "rankdir", "align"];
|
|
18
|
-
export var layout = function (g, options) {
|
|
19
|
-
var edgeLabelSpace = options.edgeLabelSpace, keepNodeOrder = options.keepNodeOrder, prevGraph = options.prevGraph, rankdir = options.rankdir, ranksep = options.ranksep;
|
|
20
|
-
// 如果在原图基础上修改,继承原图的order结果
|
|
21
|
-
if (!keepNodeOrder && prevGraph) {
|
|
22
|
-
inheritOrder(g, prevGraph);
|
|
23
|
-
}
|
|
24
|
-
var layoutGraph = buildLayoutGraph(g);
|
|
25
|
-
// 控制是否为边的label留位置(这会影响是否在边中间添加dummy node)
|
|
26
|
-
if (!!edgeLabelSpace) {
|
|
27
|
-
options.ranksep = makeSpaceForEdgeLabels(layoutGraph, {
|
|
28
|
-
rankdir: rankdir,
|
|
29
|
-
ranksep: ranksep,
|
|
30
|
-
});
|
|
31
|
-
}
|
|
32
|
-
var dimension;
|
|
33
|
-
// TODO: 暂时处理层级设置不正确时的异常报错,提示设置正确的层级
|
|
34
|
-
try {
|
|
35
|
-
dimension = runLayout(layoutGraph, options);
|
|
36
|
-
}
|
|
37
|
-
catch (e) {
|
|
38
|
-
if (e.message === 'Not possible to find intersection inside of the rectangle') {
|
|
39
|
-
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);
|
|
40
|
-
return;
|
|
41
|
-
}
|
|
42
|
-
throw e;
|
|
43
|
-
}
|
|
44
|
-
updateInputGraph(g, layoutGraph);
|
|
45
|
-
return dimension;
|
|
46
|
-
};
|
|
47
|
-
var runLayout = function (g, options) {
|
|
48
|
-
var acyclicer = options.acyclicer, ranker = options.ranker, _a = options.rankdir, rankdir = _a === void 0 ? 'tb' : _a, nodeOrder = options.nodeOrder, keepNodeOrder = options.keepNodeOrder, align = options.align, _b = options.nodesep, nodesep = _b === void 0 ? 50 : _b, _c = options.edgesep, edgesep = _c === void 0 ? 20 : _c, _d = options.ranksep, ranksep = _d === void 0 ? 50 : _d;
|
|
49
|
-
removeSelfEdges(g);
|
|
50
|
-
runAcyclic(g, acyclicer);
|
|
51
|
-
var _e = runNestingGraph(g), nestingRoot = _e.nestingRoot, nodeRankFactor = _e.nodeRankFactor;
|
|
52
|
-
rank(asNonCompoundGraph(g), ranker);
|
|
53
|
-
injectEdgeLabelProxies(g);
|
|
54
|
-
removeEmptyRanks(g, nodeRankFactor);
|
|
55
|
-
cleanupNestingGraph(g, nestingRoot);
|
|
56
|
-
normalizeRanks(g);
|
|
57
|
-
assignRankMinMax(g);
|
|
58
|
-
removeEdgeLabelProxies(g);
|
|
59
|
-
var dummyChains = [];
|
|
60
|
-
runNormalize(g, dummyChains);
|
|
61
|
-
parentDummyChains(g, dummyChains);
|
|
62
|
-
addBorderSegments(g);
|
|
63
|
-
if (keepNodeOrder) {
|
|
64
|
-
initDataOrder(g, nodeOrder);
|
|
65
|
-
}
|
|
66
|
-
order(g, keepNodeOrder);
|
|
67
|
-
insertSelfEdges(g);
|
|
68
|
-
adjustCoordinateSystem(g, rankdir);
|
|
69
|
-
position(g, {
|
|
70
|
-
align: align,
|
|
71
|
-
nodesep: nodesep,
|
|
72
|
-
edgesep: edgesep,
|
|
73
|
-
ranksep: ranksep,
|
|
74
|
-
});
|
|
75
|
-
positionSelfEdges(g);
|
|
76
|
-
removeBorderNodes(g);
|
|
77
|
-
undoNormalize(g, dummyChains);
|
|
78
|
-
fixupEdgeLabelCoords(g);
|
|
79
|
-
undoCoordinateSystem(g, rankdir);
|
|
80
|
-
var _f = translateGraph(g), width = _f.width, height = _f.height;
|
|
81
|
-
assignNodeIntersects(g);
|
|
82
|
-
reversePointsForReversedEdges(g);
|
|
83
|
-
undoAcyclic(g);
|
|
84
|
-
return { width: width, height: height };
|
|
85
|
-
};
|
|
86
|
-
/**
|
|
87
|
-
* 继承上一个布局中的order,防止翻转
|
|
88
|
-
* TODO: 暂时没有考虑涉及层级变动的布局,只保证原来布局层级和相对顺序不变
|
|
89
|
-
*/
|
|
90
|
-
var inheritOrder = function (currG, prevG) {
|
|
91
|
-
currG.getAllNodes().forEach(function (n) {
|
|
92
|
-
var node = currG.getNode(n.id);
|
|
93
|
-
var prevNode = prevG.getNode(n.id);
|
|
94
|
-
if (prevNode !== undefined) {
|
|
95
|
-
node.data.fixorder = prevNode.data._order;
|
|
96
|
-
delete prevNode.data._order;
|
|
97
|
-
}
|
|
98
|
-
else {
|
|
99
|
-
delete node.data.fixorder;
|
|
100
|
-
}
|
|
101
|
-
});
|
|
102
|
-
};
|
|
103
|
-
/*
|
|
104
|
-
* Copies final layout information from the layout graph back to the input
|
|
105
|
-
* graph. This process only copies whitelisted attributes from the layout graph
|
|
106
|
-
* to the input graph, so it serves as a good place to determine what
|
|
107
|
-
* attributes can influence layout.
|
|
108
|
-
*/
|
|
109
|
-
var updateInputGraph = function (inputGraph, layoutGraph) {
|
|
110
|
-
inputGraph.getAllNodes().forEach(function (v) {
|
|
111
|
-
var _a;
|
|
112
|
-
var inputLabel = inputGraph.getNode(v.id);
|
|
113
|
-
if (inputLabel) {
|
|
114
|
-
var layoutLabel = layoutGraph.getNode(v.id);
|
|
115
|
-
inputLabel.data.x = layoutLabel.data.x;
|
|
116
|
-
inputLabel.data.y = layoutLabel.data.y;
|
|
117
|
-
inputLabel.data._order = layoutLabel.data.order;
|
|
118
|
-
inputLabel.data._rank = layoutLabel.data.rank;
|
|
119
|
-
if ((_a = layoutGraph.getChildren(v.id)) === null || _a === void 0 ? void 0 : _a.length) {
|
|
120
|
-
inputLabel.data.width = layoutLabel.data.width;
|
|
121
|
-
inputLabel.data.height = layoutLabel.data.height;
|
|
122
|
-
}
|
|
123
|
-
}
|
|
124
|
-
});
|
|
125
|
-
inputGraph.getAllEdges().forEach(function (e) {
|
|
126
|
-
var inputLabel = inputGraph.getEdge(e.id);
|
|
127
|
-
var layoutLabel = layoutGraph.getEdge(e.id);
|
|
128
|
-
inputLabel.data.points = layoutLabel ? layoutLabel.data.points : [];
|
|
129
|
-
if (layoutLabel && layoutLabel.data.hasOwnProperty('x')) {
|
|
130
|
-
inputLabel.data.x = layoutLabel.data.x;
|
|
131
|
-
inputLabel.data.y = layoutLabel.data.y;
|
|
132
|
-
}
|
|
133
|
-
});
|
|
134
|
-
// inputGraph.graph().width = layoutGraph.graph().width;
|
|
135
|
-
// inputGraph.graph().height = layoutGraph.graph().height;
|
|
136
|
-
};
|
|
137
|
-
var nodeNumAttrs = ['width', 'height', 'layer', 'fixorder']; // 需要传入layer, fixOrder作为参数参考
|
|
138
|
-
var nodeDefaults = { width: 0, height: 0 };
|
|
139
|
-
var edgeNumAttrs = ['minlen', 'weight', 'width', 'height', 'labeloffset'];
|
|
140
|
-
var edgeDefaults = {
|
|
141
|
-
minlen: 1,
|
|
142
|
-
weight: 1,
|
|
143
|
-
width: 0,
|
|
144
|
-
height: 0,
|
|
145
|
-
labeloffset: 10,
|
|
146
|
-
labelpos: 'r',
|
|
147
|
-
};
|
|
148
|
-
var edgeAttrs = ['labelpos'];
|
|
149
|
-
/*
|
|
150
|
-
* Constructs a new graph from the input graph, which can be used for layout.
|
|
151
|
-
* This process copies only whitelisted attributes from the input graph to the
|
|
152
|
-
* layout graph. Thus this function serves as a good place to determine what
|
|
153
|
-
* attributes can influence layout.
|
|
154
|
-
*/
|
|
155
|
-
var buildLayoutGraph = function (inputGraph) {
|
|
156
|
-
var g = new Graph({ tree: [] });
|
|
157
|
-
inputGraph.getAllNodes().forEach(function (v) {
|
|
158
|
-
var node = canonicalize(inputGraph.getNode(v.id).data);
|
|
159
|
-
var defaultNode = __assign(__assign({}, nodeDefaults), node);
|
|
160
|
-
var defaultAttrs = selectNumberAttrs(defaultNode, nodeNumAttrs);
|
|
161
|
-
if (!g.hasNode(v.id)) {
|
|
162
|
-
g.addNode({
|
|
163
|
-
id: v.id,
|
|
164
|
-
data: __assign({}, defaultAttrs),
|
|
165
|
-
});
|
|
166
|
-
}
|
|
167
|
-
var parent = inputGraph.hasTreeStructure('combo')
|
|
168
|
-
? inputGraph.getParent(v.id, 'combo')
|
|
169
|
-
: inputGraph.getParent(v.id);
|
|
170
|
-
if (!isNil(parent)) {
|
|
171
|
-
if (!g.hasNode(parent.id)) {
|
|
172
|
-
g.addNode(__assign({}, parent));
|
|
173
|
-
}
|
|
174
|
-
g.setParent(v.id, parent.id);
|
|
175
|
-
}
|
|
176
|
-
});
|
|
177
|
-
inputGraph.getAllEdges().forEach(function (e) {
|
|
178
|
-
var edge = canonicalize(inputGraph.getEdge(e.id).data);
|
|
179
|
-
var pickedProperties = {};
|
|
180
|
-
edgeAttrs === null || edgeAttrs === void 0 ? void 0 : edgeAttrs.forEach(function (key) {
|
|
181
|
-
if (edge[key] !== undefined)
|
|
182
|
-
pickedProperties[key] = edge[key];
|
|
183
|
-
});
|
|
184
|
-
g.addEdge({
|
|
185
|
-
id: e.id,
|
|
186
|
-
source: e.source,
|
|
187
|
-
target: e.target,
|
|
188
|
-
data: Object.assign({}, edgeDefaults, selectNumberAttrs(edge, edgeNumAttrs), pickedProperties),
|
|
189
|
-
});
|
|
190
|
-
});
|
|
191
|
-
return g;
|
|
192
|
-
};
|
|
193
|
-
/*
|
|
194
|
-
* This idea comes from the Gansner paper: to account for edge labels in our
|
|
195
|
-
* layout we split each rank in half by doubling minlen and halving ranksep.
|
|
196
|
-
* Then we can place labels at these mid-points between nodes.
|
|
197
|
-
*
|
|
198
|
-
* We also add some minimal padding to the width to push the label for the edge
|
|
199
|
-
* away from the edge itself a bit.
|
|
200
|
-
*/
|
|
201
|
-
var makeSpaceForEdgeLabels = function (g, options) {
|
|
202
|
-
var _a = options.ranksep, ranksep = _a === void 0 ? 0 : _a, rankdir = options.rankdir;
|
|
203
|
-
g.getAllNodes().forEach(function (node) {
|
|
204
|
-
if (!isNaN(node.data.layer)) {
|
|
205
|
-
if (!node.data.layer)
|
|
206
|
-
node.data.layer = 0;
|
|
207
|
-
}
|
|
208
|
-
});
|
|
209
|
-
g.getAllEdges().forEach(function (edge) {
|
|
210
|
-
var _a;
|
|
211
|
-
edge.data.minlen *= 2;
|
|
212
|
-
if (((_a = edge.data.labelpos) === null || _a === void 0 ? void 0 : _a.toLowerCase()) !== 'c') {
|
|
213
|
-
if (rankdir === 'TB' || rankdir === 'BT') {
|
|
214
|
-
edge.data.width += edge.data.labeloffset;
|
|
215
|
-
}
|
|
216
|
-
else {
|
|
217
|
-
edge.data.height += edge.data.labeloffset;
|
|
218
|
-
}
|
|
219
|
-
}
|
|
220
|
-
});
|
|
221
|
-
return ranksep / 2;
|
|
222
|
-
};
|
|
223
|
-
/*
|
|
224
|
-
* Creates temporary dummy nodes that capture the rank in which each edge's
|
|
225
|
-
* label is going to, if it has one of non-zero width and height. We do this
|
|
226
|
-
* so that we can safely remove empty ranks while preserving balance for the
|
|
227
|
-
* label's position.
|
|
228
|
-
*/
|
|
229
|
-
var injectEdgeLabelProxies = function (g) {
|
|
230
|
-
g.getAllEdges().forEach(function (e) {
|
|
231
|
-
if (e.data.width && e.data.height) {
|
|
232
|
-
var v = g.getNode(e.source);
|
|
233
|
-
var w = g.getNode(e.target);
|
|
234
|
-
var label = {
|
|
235
|
-
e: e,
|
|
236
|
-
rank: (w.data.rank - v.data.rank) / 2 + v.data.rank,
|
|
237
|
-
};
|
|
238
|
-
addDummyNode(g, 'edge-proxy', label, '_ep');
|
|
239
|
-
}
|
|
240
|
-
});
|
|
241
|
-
};
|
|
242
|
-
var assignRankMinMax = function (g) {
|
|
243
|
-
var maxRank = 0;
|
|
244
|
-
g.getAllNodes().forEach(function (node) {
|
|
245
|
-
var _a, _b;
|
|
246
|
-
if (node.data.borderTop) {
|
|
247
|
-
node.data.minRank = (_a = g.getNode(node.data.borderTop)) === null || _a === void 0 ? void 0 : _a.data.rank;
|
|
248
|
-
node.data.maxRank = (_b = g.getNode(node.data.borderBottom)) === null || _b === void 0 ? void 0 : _b.data.rank;
|
|
249
|
-
maxRank = Math.max(maxRank, node.data.maxRank || -Infinity);
|
|
250
|
-
}
|
|
251
|
-
});
|
|
252
|
-
return maxRank;
|
|
253
|
-
};
|
|
254
|
-
var removeEdgeLabelProxies = function (g) {
|
|
255
|
-
g.getAllNodes().forEach(function (node) {
|
|
256
|
-
if (node.data.dummy === 'edge-proxy') {
|
|
257
|
-
g.getEdge(node.data.e.id).data.labelRank = node.data.rank;
|
|
258
|
-
g.removeNode(node.id);
|
|
259
|
-
}
|
|
260
|
-
});
|
|
261
|
-
};
|
|
262
|
-
var translateGraph = function (g, options) {
|
|
263
|
-
var minX;
|
|
264
|
-
var maxX = 0;
|
|
265
|
-
var minY;
|
|
266
|
-
var maxY = 0;
|
|
267
|
-
var _a = options || {}, _b = _a.marginx, marginX = _b === void 0 ? 0 : _b, _c = _a.marginy, marginY = _c === void 0 ? 0 : _c;
|
|
268
|
-
var getExtremes = function (attrs) {
|
|
269
|
-
if (!attrs.data)
|
|
270
|
-
return;
|
|
271
|
-
var x = attrs.data.x;
|
|
272
|
-
var y = attrs.data.y;
|
|
273
|
-
var w = attrs.data.width;
|
|
274
|
-
var h = attrs.data.height;
|
|
275
|
-
if (!isNaN(x) && !isNaN(w)) {
|
|
276
|
-
if (minX === undefined) {
|
|
277
|
-
minX = x - w / 2;
|
|
278
|
-
}
|
|
279
|
-
minX = Math.min(minX, x - w / 2);
|
|
280
|
-
maxX = Math.max(maxX, x + w / 2);
|
|
281
|
-
}
|
|
282
|
-
if (!isNaN(y) && !isNaN(h)) {
|
|
283
|
-
if (minY === undefined) {
|
|
284
|
-
minY = y - h / 2;
|
|
285
|
-
}
|
|
286
|
-
minY = Math.min(minY, y - h / 2);
|
|
287
|
-
maxY = Math.max(maxY, y + h / 2);
|
|
288
|
-
}
|
|
289
|
-
};
|
|
290
|
-
g.getAllNodes().forEach(function (v) {
|
|
291
|
-
getExtremes(v);
|
|
292
|
-
});
|
|
293
|
-
g.getAllEdges().forEach(function (e) {
|
|
294
|
-
if (e === null || e === void 0 ? void 0 : e.data.hasOwnProperty('x')) {
|
|
295
|
-
getExtremes(e);
|
|
296
|
-
}
|
|
297
|
-
});
|
|
298
|
-
minX -= marginX;
|
|
299
|
-
minY -= marginY;
|
|
300
|
-
g.getAllNodes().forEach(function (node) {
|
|
301
|
-
node.data.x -= minX;
|
|
302
|
-
node.data.y -= minY;
|
|
303
|
-
});
|
|
304
|
-
g.getAllEdges().forEach(function (edge) {
|
|
305
|
-
var _a;
|
|
306
|
-
(_a = edge.data.points) === null || _a === void 0 ? void 0 : _a.forEach(function (p) {
|
|
307
|
-
p.x -= minX;
|
|
308
|
-
p.y -= minY;
|
|
309
|
-
});
|
|
310
|
-
if (edge.data.hasOwnProperty('x')) {
|
|
311
|
-
edge.data.x -= minX;
|
|
312
|
-
}
|
|
313
|
-
if (edge.data.hasOwnProperty('y')) {
|
|
314
|
-
edge.data.y -= minY;
|
|
315
|
-
}
|
|
316
|
-
});
|
|
317
|
-
return {
|
|
318
|
-
width: maxX - minX + marginX,
|
|
319
|
-
height: maxY - minY + marginY,
|
|
320
|
-
};
|
|
321
|
-
};
|
|
322
|
-
var assignNodeIntersects = function (g) {
|
|
323
|
-
g.getAllEdges().forEach(function (e) {
|
|
324
|
-
var nodeV = g.getNode(e.source);
|
|
325
|
-
var nodeW = g.getNode(e.target);
|
|
326
|
-
var p1;
|
|
327
|
-
var p2;
|
|
328
|
-
if (!e.data.points) {
|
|
329
|
-
e.data.points = [];
|
|
330
|
-
p1 = { x: nodeW.data.x, y: nodeW.data.y };
|
|
331
|
-
p2 = { x: nodeV.data.x, y: nodeV.data.y };
|
|
332
|
-
}
|
|
333
|
-
else {
|
|
334
|
-
p1 = e.data.points[0];
|
|
335
|
-
p2 = e.data.points[e.data.points.length - 1];
|
|
336
|
-
}
|
|
337
|
-
e.data.points.unshift(intersectRect(nodeV.data, p1));
|
|
338
|
-
e.data.points.push(intersectRect(nodeW.data, p2));
|
|
339
|
-
});
|
|
340
|
-
};
|
|
341
|
-
var fixupEdgeLabelCoords = function (g) {
|
|
342
|
-
g.getAllEdges().forEach(function (edge) {
|
|
343
|
-
if (edge.data.hasOwnProperty('x')) {
|
|
344
|
-
if (edge.data.labelpos === 'l' || edge.data.labelpos === 'r') {
|
|
345
|
-
edge.data.width -= edge.data.labeloffset;
|
|
346
|
-
}
|
|
347
|
-
switch (edge.data.labelpos) {
|
|
348
|
-
case 'l':
|
|
349
|
-
edge.data.x -= edge.data.width / 2 + edge.data.labeloffset;
|
|
350
|
-
break;
|
|
351
|
-
case 'r':
|
|
352
|
-
edge.data.x += edge.data.width / 2 + edge.data.labeloffset;
|
|
353
|
-
break;
|
|
354
|
-
}
|
|
355
|
-
}
|
|
356
|
-
});
|
|
357
|
-
};
|
|
358
|
-
var reversePointsForReversedEdges = function (g) {
|
|
359
|
-
g.getAllEdges().forEach(function (edge) {
|
|
360
|
-
var _a;
|
|
361
|
-
if (edge.data.reversed) {
|
|
362
|
-
(_a = edge.data.points) === null || _a === void 0 ? void 0 : _a.reverse();
|
|
363
|
-
}
|
|
364
|
-
});
|
|
365
|
-
};
|
|
366
|
-
var removeBorderNodes = function (g) {
|
|
367
|
-
g.getAllNodes().forEach(function (v) {
|
|
368
|
-
var _a, _b, _c;
|
|
369
|
-
if ((_a = g.getChildren(v.id)) === null || _a === void 0 ? void 0 : _a.length) {
|
|
370
|
-
var node = g.getNode(v.id);
|
|
371
|
-
var t = g.getNode(node.data.borderTop);
|
|
372
|
-
var b = g.getNode(node.data.borderBottom);
|
|
373
|
-
var l = g.getNode(node.data.borderLeft[((_b = node.data.borderLeft) === null || _b === void 0 ? void 0 : _b.length) - 1]);
|
|
374
|
-
var r = g.getNode(node.data.borderRight[((_c = node.data.borderRight) === null || _c === void 0 ? void 0 : _c.length) - 1]);
|
|
375
|
-
node.data.width = Math.abs((r === null || r === void 0 ? void 0 : r.data.x) - (l === null || l === void 0 ? void 0 : l.data.x)) || 10;
|
|
376
|
-
node.data.height = Math.abs((b === null || b === void 0 ? void 0 : b.data.y) - (t === null || t === void 0 ? void 0 : t.data.y)) || 10;
|
|
377
|
-
node.data.x = ((l === null || l === void 0 ? void 0 : l.data.x) || 0) + node.data.width / 2;
|
|
378
|
-
node.data.y = ((t === null || t === void 0 ? void 0 : t.data.y) || 0) + node.data.height / 2;
|
|
379
|
-
}
|
|
380
|
-
});
|
|
381
|
-
g.getAllNodes().forEach(function (n) {
|
|
382
|
-
if (n.data.dummy === 'border') {
|
|
383
|
-
g.removeNode(n.id);
|
|
384
|
-
}
|
|
385
|
-
});
|
|
386
|
-
};
|
|
387
|
-
var removeSelfEdges = function (g) {
|
|
388
|
-
g.getAllEdges().forEach(function (e) {
|
|
389
|
-
if (e.source === e.target) {
|
|
390
|
-
var node = g.getNode(e.source);
|
|
391
|
-
if (!node.data.selfEdges) {
|
|
392
|
-
node.data.selfEdges = [];
|
|
393
|
-
}
|
|
394
|
-
node.data.selfEdges.push(e);
|
|
395
|
-
g.removeEdge(e.id);
|
|
396
|
-
}
|
|
397
|
-
});
|
|
398
|
-
};
|
|
399
|
-
var insertSelfEdges = function (g) {
|
|
400
|
-
var layers = buildLayerMatrix(g);
|
|
401
|
-
layers === null || layers === void 0 ? void 0 : layers.forEach(function (layer) {
|
|
402
|
-
var orderShift = 0;
|
|
403
|
-
layer === null || layer === void 0 ? void 0 : layer.forEach(function (v, i) {
|
|
404
|
-
var _a;
|
|
405
|
-
var node = g.getNode(v);
|
|
406
|
-
node.data.order = i + orderShift;
|
|
407
|
-
(_a = node.data.selfEdges) === null || _a === void 0 ? void 0 : _a.forEach(function (selfEdge) {
|
|
408
|
-
addDummyNode(g, 'selfedge', {
|
|
409
|
-
width: selfEdge.data.width,
|
|
410
|
-
height: selfEdge.data.height,
|
|
411
|
-
rank: node.data.rank,
|
|
412
|
-
order: i + ++orderShift,
|
|
413
|
-
e: selfEdge,
|
|
414
|
-
}, '_se');
|
|
415
|
-
});
|
|
416
|
-
delete node.data.selfEdges;
|
|
417
|
-
});
|
|
418
|
-
});
|
|
419
|
-
};
|
|
420
|
-
var positionSelfEdges = function (g) {
|
|
421
|
-
g.getAllNodes().forEach(function (v) {
|
|
422
|
-
var node = g.getNode(v.id);
|
|
423
|
-
if (node.data.dummy === 'selfedge') {
|
|
424
|
-
var selfNode = g.getNode(node.data.e.source);
|
|
425
|
-
var x = selfNode.data.x + selfNode.data.width / 2;
|
|
426
|
-
var y = selfNode.data.y;
|
|
427
|
-
var dx = node.data.x - x;
|
|
428
|
-
var dy = selfNode.data.height / 2;
|
|
429
|
-
if (g.hasEdge(node.data.e.id)) {
|
|
430
|
-
g.updateEdgeData(node.data.e.id, node.data.e.data);
|
|
431
|
-
}
|
|
432
|
-
else {
|
|
433
|
-
g.addEdge({
|
|
434
|
-
id: node.data.e.id,
|
|
435
|
-
source: node.data.e.source,
|
|
436
|
-
target: node.data.e.target,
|
|
437
|
-
data: node.data.e.data,
|
|
438
|
-
});
|
|
439
|
-
}
|
|
440
|
-
g.removeNode(v.id);
|
|
441
|
-
node.data.e.data.points = [
|
|
442
|
-
{ x: x + (2 * dx) / 3, y: y - dy },
|
|
443
|
-
{ x: x + (5 * dx) / 6, y: y - dy },
|
|
444
|
-
{ y: y, x: x + dx },
|
|
445
|
-
{ x: x + (5 * dx) / 6, y: y + dy },
|
|
446
|
-
{ x: x + (2 * dx) / 3, y: y + dy },
|
|
447
|
-
];
|
|
448
|
-
node.data.e.data.x = node.data.x;
|
|
449
|
-
node.data.e.data.y = node.data.y;
|
|
450
|
-
}
|
|
451
|
-
});
|
|
452
|
-
};
|
|
453
|
-
var selectNumberAttrs = function (obj, attrs) {
|
|
454
|
-
var pickedProperties = {};
|
|
455
|
-
attrs === null || attrs === void 0 ? void 0 : attrs.forEach(function (key) {
|
|
456
|
-
if (obj[key] === undefined)
|
|
457
|
-
return;
|
|
458
|
-
pickedProperties[key] = +obj[key];
|
|
459
|
-
});
|
|
460
|
-
return pickedProperties;
|
|
461
|
-
};
|
|
462
|
-
var canonicalize = function (attrs) {
|
|
463
|
-
if (attrs === void 0) { attrs = {}; }
|
|
464
|
-
var newAttrs = {};
|
|
465
|
-
Object.keys(attrs).forEach(function (k) {
|
|
466
|
-
newAttrs[k.toLowerCase()] = attrs[k];
|
|
467
|
-
});
|
|
468
|
-
return newAttrs;
|
|
469
|
-
};
|
|
470
|
-
//# sourceMappingURL=layout.js.map
|
package/lib/dagre/layout.js.map
DELETED
|
@@ -1 +0,0 @@
|
|
|
1
|
-
{"version":3,"file":"layout.js","sourceRoot":"","sources":["../../src/dagre/layout.ts"],"names":[],"mappings":";AAAA,OAAO,EAAE,KAAK,EAAM,MAAM,gBAAgB,CAAC;AAC3C,OAAO,EAAE,KAAK,EAAE,MAAM,YAAY,CAAC;AAQnC,OAAO,EAAE,GAAG,IAAI,UAAU,EAAE,IAAI,IAAI,WAAW,EAAE,MAAM,WAAW,CAAC;AACnE,OAAO,EAAE,GAAG,IAAI,YAAY,EAAE,IAAI,IAAI,aAAa,EAAE,MAAM,aAAa,CAAC;AACzE,OAAO,EAAE,IAAI,EAAE,MAAM,QAAQ,CAAC;AAC9B,OAAO,EACL,cAAc,EACd,gBAAgB,EAChB,kBAAkB,EAClB,YAAY,EACZ,aAAa,EACb,gBAAgB,GACjB,MAAM,QAAQ,CAAC;AAChB,OAAO,EAAE,iBAAiB,EAAE,MAAM,uBAAuB,CAAC;AAC1D,OAAO,EACL,GAAG,IAAI,eAAe,EACtB,OAAO,IAAI,mBAAmB,GAC/B,MAAM,iBAAiB,CAAC;AACzB,OAAO,EAAE,iBAAiB,EAAE,MAAM,uBAAuB,CAAC;AAC1D,OAAO,EACL,MAAM,IAAI,sBAAsB,EAChC,IAAI,IAAI,oBAAoB,GAC7B,MAAM,qBAAqB,CAAC;AAC7B,OAAO,EAAE,KAAK,EAAE,MAAM,SAAS,CAAC;AAChC,OAAO,EAAE,QAAQ,EAAE,MAAM,YAAY,CAAC;AACtC,OAAO,EAAE,aAAa,EAAE,MAAM,yBAAyB,CAAC;AAExD,iFAAiF;AACjF,kFAAkF;AAClF,kEAAkE;AAElE,MAAM,CAAC,IAAM,MAAM,GAAG,UACpB,CAAS,EACT,OAYC;IAEO,IAAA,cAAc,GACpB,OAAO,eADa,EAAE,aAAa,GACnC,OAAO,cAD4B,EAAE,SAAS,GAC9C,OAAO,UADuC,EAAE,OAAO,GACvD,OAAO,QADgD,EAAE,OAAO,GAChE,OAAO,QADyD,CACxD;IAEV,0BAA0B;IAC1B,IAAI,CAAC,aAAa,IAAI,SAAS,EAAE;QAC/B,YAAY,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC;KAC5B;IACD,IAAM,WAAW,GAAG,gBAAgB,CAAC,CAAC,CAAC,CAAC;IAExC,0CAA0C;IAC1C,IAAI,CAAC,CAAC,cAAc,EAAE;QACpB,OAAO,CAAC,OAAO,GAAG,sBAAsB,CAAC,WAAW,EAAE;YACpD,OAAO,SAAA;YACP,OAAO,SAAA;SACR,CAAC,CAAC;KACJ;IACD,IAAI,SAAS,CAAC;IACd,oCAAoC;IACpC,IAAI;QACF,SAAS,GAAG,SAAS,CAAC,WAAW,EAAE,OAAO,CAAC,CAAC;KAC7C;IAAC,OAAO,CAAC,EAAE;QACV,IACE,CAAC,CAAC,OAAO,KAAK,2DAA2D,EACzE;YACA,OAAO,CAAC,KAAK,CACX,mJAAmJ,EACnJ,CAAC,CACF,CAAC;YACF,OAAO;SACR;QACD,MAAM,CAAC,CAAC;KACT;IACD,gBAAgB,CAAC,CAAC,EAAE,WAAW,CAAC,CAAC;IACjC,OAAO,SAAS,CAAC;AACnB,CAAC,CAAC;AAEF,IAAM,SAAS,GAAG,UAChB,CAAS,EACT,OAUC;IAGC,IAAA,SAAS,GASP,OAAO,UATA,EACT,MAAM,GAQJ,OAAO,OARH,EACN,KAOE,OAAO,QAPK,EAAd,OAAO,mBAAG,IAAI,KAAA,EACd,SAAS,GAMP,OAAO,UANA,EACT,aAAa,GAKX,OAAO,cALI,EACb,KAAK,GAIH,OAAO,MAJJ,EACL,KAGE,OAAO,QAHG,EAAZ,OAAO,mBAAG,EAAE,KAAA,EACZ,KAEE,OAAO,QAFG,EAAZ,OAAO,mBAAG,EAAE,KAAA,EACZ,KACE,OAAO,QADG,EAAZ,OAAO,mBAAG,EAAE,KAAA,CACF;IAEZ,eAAe,CAAC,CAAC,CAAC,CAAC;IAEnB,UAAU,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC;IAEnB,IAAA,KAAkC,eAAe,CAAC,CAAC,CAAC,EAAlD,WAAW,iBAAA,EAAE,cAAc,oBAAuB,CAAC;IAE3D,IAAI,CAAC,kBAAkB,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;IAEpC,sBAAsB,CAAC,CAAC,CAAC,CAAC;IAE1B,gBAAgB,CAAC,CAAC,EAAE,cAAc,CAAC,CAAC;IAEpC,mBAAmB,CAAC,CAAC,EAAE,WAAW,CAAC,CAAC;IAEpC,cAAc,CAAC,CAAC,CAAC,CAAC;IAElB,gBAAgB,CAAC,CAAC,CAAC,CAAC;IAEpB,sBAAsB,CAAC,CAAC,CAAC,CAAC;IAE1B,IAAM,WAAW,GAAS,EAAE,CAAC;IAC7B,YAAY,CAAC,CAAC,EAAE,WAAW,CAAC,CAAC;IAC7B,iBAAiB,CAAC,CAAC,EAAE,WAAW,CAAC,CAAC;IAElC,iBAAiB,CAAC,CAAC,CAAC,CAAC;IAErB,IAAI,aAAa,EAAE;QACjB,aAAa,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC;KAC7B;IAED,KAAK,CAAC,CAAC,EAAE,aAAa,CAAC,CAAC;IAExB,eAAe,CAAC,CAAC,CAAC,CAAC;IAEnB,sBAAsB,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC;IAEnC,QAAQ,CAAC,CAAC,EAAE;QACV,KAAK,OAAA;QACL,OAAO,SAAA;QACP,OAAO,SAAA;QACP,OAAO,SAAA;KACR,CAAC,CAAC;IAEH,iBAAiB,CAAC,CAAC,CAAC,CAAC;IAErB,iBAAiB,CAAC,CAAC,CAAC,CAAC;IAErB,aAAa,CAAC,CAAC,EAAE,WAAW,CAAC,CAAC;IAE9B,oBAAoB,CAAC,CAAC,CAAC,CAAC;IAExB,oBAAoB,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC;IAE3B,IAAA,KAAoB,cAAc,CAAC,CAAC,CAAC,EAAnC,KAAK,WAAA,EAAE,MAAM,YAAsB,CAAC;IAE5C,oBAAoB,CAAC,CAAC,CAAC,CAAC;IAExB,6BAA6B,CAAC,CAAC,CAAC,CAAC;IAEjC,WAAW,CAAC,CAAC,CAAC,CAAC;IAEf,OAAO,EAAE,KAAK,OAAA,EAAE,MAAM,QAAA,EAAE,CAAC;AAC3B,CAAC,CAAC;AAEF;;;GAGG;AACH,IAAM,YAAY,GAAG,UAAC,KAAa,EAAE,KAAa;IAChD,KAAK,CAAC,WAAW,EAAE,CAAC,OAAO,CAAC,UAAC,CAAC;QAC5B,IAAM,IAAI,GAAG,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAE,CAAC;QAClC,IAAM,QAAQ,GAAG,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAE,CAAC;QACtC,IAAI,QAAQ,KAAK,SAAS,EAAE;YAC1B,IAAI,CAAC,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAC,IAAI,CAAC,MAAgB,CAAC;YACpD,OAAO,QAAQ,CAAC,IAAI,CAAC,MAAM,CAAC;SAC7B;aAAM;YACL,OAAO,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC;SAC3B;IACH,CAAC,CAAC,CAAC;AACL,CAAC,CAAC;AAEF;;;;;GAKG;AACH,IAAM,gBAAgB,GAAG,UAAC,UAAkB,EAAE,WAAmB;IAC/D,UAAU,CAAC,WAAW,EAAE,CAAC,OAAO,CAAC,UAAC,CAAC;;QACjC,IAAM,UAAU,GAAG,UAAU,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QAE5C,IAAI,UAAU,EAAE;YACd,IAAM,WAAW,GAAG,WAAW,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAE,CAAC;YAC/C,UAAU,CAAC,IAAI,CAAC,CAAC,GAAG,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC;YACvC,UAAU,CAAC,IAAI,CAAC,CAAC,GAAG,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC;YACvC,UAAU,CAAC,IAAI,CAAC,MAAM,GAAG,WAAW,CAAC,IAAI,CAAC,KAAK,CAAC;YAChD,UAAU,CAAC,IAAI,CAAC,KAAK,GAAG,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC;YAE9C,IAAI,MAAA,WAAW,CAAC,WAAW,CAAC,CAAC,CAAC,EAAE,CAAC,0CAAE,MAAM,EAAE;gBACzC,UAAU,CAAC,IAAI,CAAC,KAAK,GAAG,WAAW,CAAC,IAAI,CAAC,KAAK,CAAC;gBAC/C,UAAU,CAAC,IAAI,CAAC,MAAM,GAAG,WAAW,CAAC,IAAI,CAAC,MAAM,CAAC;aAClD;SACF;IACH,CAAC,CAAC,CAAC;IAEH,UAAU,CAAC,WAAW,EAAE,CAAC,OAAO,CAAC,UAAC,CAAC;QACjC,IAAM,UAAU,GAAG,UAAU,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAE,CAAC;QAC7C,IAAM,WAAW,GAAG,WAAW,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAE,CAAC;QAE/C,UAAU,CAAC,IAAI,CAAC,MAAM,GAAG,WAAW,CAAC,CAAC,CAAC,WAAW,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC;QACpE,IAAI,WAAW,IAAI,WAAW,CAAC,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,EAAE;YACvD,UAAU,CAAC,IAAI,CAAC,CAAC,GAAG,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC;YACvC,UAAU,CAAC,IAAI,CAAC,CAAC,GAAG,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC;SACxC;IACH,CAAC,CAAC,CAAC;IAEH,wDAAwD;IACxD,0DAA0D;AAC5D,CAAC,CAAC;AAEF,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;IACT,MAAM,EAAE,CAAC;IACT,KAAK,EAAE,CAAC;IACR,MAAM,EAAE,CAAC;IACT,WAAW,EAAE,EAAE;IACf,QAAQ,EAAE,GAAG;CACd,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,IAAI,EAAE,EAAE,EAAE,CAAC,CAAC;IAClC,UAAU,CAAC,WAAW,EAAE,CAAC,OAAO,CAAC,UAAC,CAAC;QACjC,IAAM,IAAI,GAAG,YAAY,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC;QACzD,IAAM,WAAW,GAAG,sBACf,YAAY,GACZ,IAAI,CACI,CAAC;QACd,IAAM,YAAY,GAAG,iBAAiB,CAAC,WAAW,EAAE,YAAY,CAAS,CAAC;QAE1E,IAAI,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE;YACpB,CAAC,CAAC,OAAO,CAAC;gBACR,EAAE,EAAE,CAAC,CAAC,EAAE;gBACR,IAAI,eACC,YAAY,CAChB;aACF,CAAC,CAAC;SACJ;QAED,IAAM,MAAM,GAAG,UAAU,CAAC,gBAAgB,CAAC,OAAO,CAAC;YACjD,CAAC,CAAC,UAAU,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,EAAE,OAAO,CAAC;YACrC,CAAC,CAAC,UAAU,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QAC/B,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,EAAE;YAClB,IAAI,CAAC,CAAC,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE,CAAC,EAAE;gBACzB,CAAC,CAAC,OAAO,cAAM,MAAM,EAAG,CAAC;aAC1B;YACD,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,EAAE,MAAM,CAAC,EAAE,CAAC,CAAC;SAC9B;IACH,CAAC,CAAC,CAAC;IAEH,UAAU,CAAC,WAAW,EAAE,CAAC,OAAO,CAAC,UAAC,CAAC;QACjC,IAAM,IAAI,GAAG,YAAY,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC;QAEzD,IAAM,gBAAgB,GAAQ,EAAE,CAAC;QACjC,SAAS,aAAT,SAAS,uBAAT,SAAS,CAAE,OAAO,CAAC,UAAC,GAAG;YACrB,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;YACR,EAAE,EAAE,CAAC,CAAC,EAAE;YACR,MAAM,EAAE,CAAC,CAAC,MAAM;YAChB,MAAM,EAAE,CAAC,CAAC,MAAM;YAChB,IAAI,EAAE,MAAM,CAAC,MAAM,CACjB,EAAE,EACF,YAAY,EACZ,iBAAiB,CAAC,IAAI,EAAE,YAAY,CAAC,EACrC,gBAAgB,CACjB;SACF,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,OAAO,CAAC,CAAC;AACX,CAAC,CAAC;AAEF;;;;;;;GAOG;AACH,IAAM,sBAAsB,GAAG,UAC7B,CAAS,EACT,OAGC;IAEO,IAAA,KAAyB,OAAO,QAArB,EAAX,OAAO,mBAAG,CAAC,KAAA,EAAE,OAAO,GAAK,OAAO,QAAZ,CAAa;IACzC,CAAC,CAAC,WAAW,EAAE,CAAC,OAAO,CAAC,UAAC,IAAI;QAC3B,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,KAAM,CAAC,EAAE;YAC5B,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK;gBAAE,IAAI,CAAC,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC;SAC3C;IACH,CAAC,CAAC,CAAC;IACH,CAAC,CAAC,WAAW,EAAE,CAAC,OAAO,CAAC,UAAC,IAAI;;QAC3B,IAAI,CAAC,IAAI,CAAC,MAAO,IAAI,CAAC,CAAC;QACvB,IAAI,CAAA,MAAC,IAAI,CAAC,IAAI,CAAC,QAAmB,0CAAE,WAAW,EAAE,MAAK,GAAG,EAAE;YACzD,IAAI,OAAO,KAAK,IAAI,IAAI,OAAO,KAAK,IAAI,EAAE;gBACxC,IAAI,CAAC,IAAI,CAAC,KAAM,IAAI,IAAI,CAAC,IAAI,CAAC,WAAY,CAAC;aAC5C;iBAAM;gBACL,IAAI,CAAC,IAAI,CAAC,MAAO,IAAI,IAAI,CAAC,IAAI,CAAC,WAAY,CAAC;aAC7C;SACF;IACH,CAAC,CAAC,CAAC;IAEH,OAAO,OAAO,GAAG,CAAC,CAAC;AACrB,CAAC,CAAC;AAEF;;;;;GAKG;AACH,IAAM,sBAAsB,GAAG,UAAC,CAAS;IACvC,CAAC,CAAC,WAAW,EAAE,CAAC,OAAO,CAAC,UAAC,CAAC;QACxB,IAAI,CAAC,CAAC,IAAI,CAAC,KAAK,IAAI,CAAC,CAAC,IAAI,CAAC,MAAM,EAAE;YACjC,IAAM,CAAC,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAE,CAAC;YAC/B,IAAM,CAAC,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAE,CAAC;YAC/B,IAAM,KAAK,GAAG;gBACZ,CAAC,GAAA;gBACD,IAAI,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,IAAK,GAAG,CAAC,CAAC,IAAI,CAAC,IAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,IAAK;aACvD,CAAC;YACF,YAAY,CAAC,CAAC,EAAE,YAAY,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC;SAC7C;IACH,CAAC,CAAC,CAAC;AACL,CAAC,CAAC;AAEF,IAAM,gBAAgB,GAAG,UAAC,CAAS;IACjC,IAAI,OAAO,GAAG,CAAC,CAAC;IAChB,CAAC,CAAC,WAAW,EAAE,CAAC,OAAO,CAAC,UAAC,IAAI;;QAC3B,IAAI,IAAI,CAAC,IAAI,CAAC,SAAS,EAAE;YACvB,IAAI,CAAC,IAAI,CAAC,OAAO,GAAG,MAAA,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,SAAe,CAAC,0CAAE,IAAI,CAAC,IAAI,CAAC;YACpE,IAAI,CAAC,IAAI,CAAC,OAAO,GAAG,MAAA,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,YAAkB,CAAC,0CAAE,IAAI,CAAC,IAAI,CAAC;YACvE,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,OAAO,EAAE,IAAI,CAAC,IAAI,CAAC,OAAO,IAAI,CAAC,QAAQ,CAAC,CAAC;SAC7D;IACH,CAAC,CAAC,CAAC;IAEH,OAAO,OAAO,CAAC;AACjB,CAAC,CAAC;AAEF,IAAM,sBAAsB,GAAG,UAAC,CAAS;IACvC,CAAC,CAAC,WAAW,EAAE,CAAC,OAAO,CAAC,UAAC,IAAI;QAC3B,IAAI,IAAI,CAAC,IAAI,CAAC,KAAK,KAAK,YAAY,EAAE;YACpC,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAE,CAAC,EAAE,CAAE,CAAC,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC;YAC5D,CAAC,CAAC,UAAU,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;SACvB;IACH,CAAC,CAAC,CAAC;AACL,CAAC,CAAC;AAEF,IAAM,cAAc,GAAG,UACrB,CAAS,EACT,OAGC;IAED,IAAI,IAAY,CAAC;IACjB,IAAI,IAAI,GAAG,CAAC,CAAC;IACb,IAAI,IAAY,CAAC;IACjB,IAAI,IAAI,GAAG,CAAC,CAAC;IAEP,IAAA,KAAiD,OAAO,IAAI,EAAE,EAA5D,eAAoB,EAAX,OAAO,mBAAG,CAAC,KAAA,EAAE,eAAoB,EAAX,OAAO,mBAAG,CAAC,KAAkB,CAAC;IAErE,IAAM,WAAW,GAAG,UAAC,KAAU;QAC7B,IAAI,CAAC,KAAK,CAAC,IAAI;YAAE,OAAO;QACxB,IAAM,CAAC,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC;QACvB,IAAM,CAAC,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC;QACvB,IAAM,CAAC,GAAG,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC;QAC3B,IAAM,CAAC,GAAG,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC;QAC5B,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE;YAC1B,IAAI,IAAI,KAAK,SAAS,EAAE;gBACtB,IAAI,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;aAClB;YACD,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;YACjC,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;SAClC;QACD,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE;YAC1B,IAAI,IAAI,KAAK,SAAS,EAAE;gBACtB,IAAI,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;aAClB;YACD,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;YACjC,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;SAClC;IACH,CAAC,CAAC;IAEF,CAAC,CAAC,WAAW,EAAE,CAAC,OAAO,CAAC,UAAC,CAAC;QACxB,WAAW,CAAC,CAAC,CAAC,CAAC;IACjB,CAAC,CAAC,CAAC;IACH,CAAC,CAAC,WAAW,EAAE,CAAC,OAAO,CAAC,UAAC,CAAC;QACxB,IAAI,CAAC,aAAD,CAAC,uBAAD,CAAC,CAAE,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,EAAE;YAC/B,WAAW,CAAC,CAAC,CAAC,CAAC;SAChB;IACH,CAAC,CAAC,CAAC;IAEH,IAAK,IAAI,OAAO,CAAC;IACjB,IAAK,IAAI,OAAO,CAAC;IAEjB,CAAC,CAAC,WAAW,EAAE,CAAC,OAAO,CAAC,UAAC,IAAI;QAC3B,IAAI,CAAC,IAAI,CAAC,CAAE,IAAI,IAAI,CAAC;QACrB,IAAI,CAAC,IAAI,CAAC,CAAE,IAAI,IAAI,CAAC;IACvB,CAAC,CAAC,CAAC;IAEH,CAAC,CAAC,WAAW,EAAE,CAAC,OAAO,CAAC,UAAC,IAAI;;QAC3B,MAAA,IAAI,CAAC,IAAI,CAAC,MAAM,0CAAE,OAAO,CAAC,UAAC,CAAC;YAC1B,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC;YACZ,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC;QACd,CAAC,CAAC,CAAC;QACH,IAAI,IAAI,CAAC,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,EAAE;YACjC,IAAI,CAAC,IAAI,CAAC,CAAE,IAAI,IAAI,CAAC;SACtB;QACD,IAAI,IAAI,CAAC,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,EAAE;YACjC,IAAI,CAAC,IAAI,CAAC,CAAE,IAAI,IAAI,CAAC;SACtB;IACH,CAAC,CAAC,CAAC;IAEH,OAAO;QACL,KAAK,EAAE,IAAI,GAAG,IAAK,GAAG,OAAO;QAC7B,MAAM,EAAE,IAAI,GAAG,IAAK,GAAG,OAAO;KAC/B,CAAC;AACJ,CAAC,CAAC;AAEF,IAAM,oBAAoB,GAAG,UAAC,CAAS;IACrC,CAAC,CAAC,WAAW,EAAE,CAAC,OAAO,CAAC,UAAC,CAAC;QACxB,IAAM,KAAK,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAE,CAAC;QACnC,IAAM,KAAK,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAE,CAAC;QACnC,IAAI,EAAS,CAAC;QACd,IAAI,EAAS,CAAC;QACd,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,EAAE;YAClB,CAAC,CAAC,IAAI,CAAC,MAAM,GAAG,EAAE,CAAC;YACnB,EAAE,GAAG,EAAE,CAAC,EAAE,KAAK,CAAC,IAAI,CAAC,CAAE,EAAE,CAAC,EAAE,KAAK,CAAC,IAAI,CAAC,CAAE,EAAE,CAAC;YAC5C,EAAE,GAAG,EAAE,CAAC,EAAE,KAAK,CAAC,IAAI,CAAC,CAAE,EAAE,CAAC,EAAE,KAAK,CAAC,IAAI,CAAC,CAAE,EAAE,CAAC;SAC7C;aAAM;YACL,EAAE,GAAG,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACtB,EAAE,GAAG,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;SAC9C;QAED,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,aAAa,CAAC,KAAK,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,CAAC;QACrD,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,aAAa,CAAC,KAAK,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,CAAC;IACpD,CAAC,CAAC,CAAC;AACL,CAAC,CAAC;AAEF,IAAM,oBAAoB,GAAG,UAAC,CAAS;IACrC,CAAC,CAAC,WAAW,EAAE,CAAC,OAAO,CAAC,UAAC,IAAI;QAC3B,IAAI,IAAI,CAAC,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,EAAE;YACjC,IAAI,IAAI,CAAC,IAAI,CAAC,QAAQ,KAAK,GAAG,IAAI,IAAI,CAAC,IAAI,CAAC,QAAQ,KAAK,GAAG,EAAE;gBAC5D,IAAI,CAAC,IAAI,CAAC,KAAM,IAAI,IAAI,CAAC,IAAI,CAAC,WAAY,CAAC;aAC5C;YACD,QAAQ,IAAI,CAAC,IAAI,CAAC,QAAQ,EAAE;gBAC1B,KAAK,GAAG;oBACN,IAAI,CAAC,IAAI,CAAC,CAAE,IAAI,IAAI,CAAC,IAAI,CAAC,KAAM,GAAG,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,WAAY,CAAC;oBAC9D,MAAM;gBACR,KAAK,GAAG;oBACN,IAAI,CAAC,IAAI,CAAC,CAAE,IAAI,IAAI,CAAC,IAAI,CAAC,KAAM,GAAG,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,WAAY,CAAC;oBAC9D,MAAM;aACT;SACF;IACH,CAAC,CAAC,CAAC;AACL,CAAC,CAAC;AAEF,IAAM,6BAA6B,GAAG,UAAC,CAAS;IAC9C,CAAC,CAAC,WAAW,EAAE,CAAC,OAAO,CAAC,UAAC,IAAI;;QAC3B,IAAI,IAAI,CAAC,IAAI,CAAC,QAAQ,EAAE;YACtB,MAAA,IAAI,CAAC,IAAI,CAAC,MAAM,0CAAE,OAAO,EAAE,CAAC;SAC7B;IACH,CAAC,CAAC,CAAC;AACL,CAAC,CAAC;AAEF,IAAM,iBAAiB,GAAG,UAAC,CAAS;IAClC,CAAC,CAAC,WAAW,EAAE,CAAC,OAAO,CAAC,UAAC,CAAC;;QACxB,IAAI,MAAA,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,EAAE,CAAC,0CAAE,MAAM,EAAE;YAC/B,IAAM,IAAI,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAE,CAAC;YAC9B,IAAM,CAAC,GAAG,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,SAAe,CAAC,CAAC;YAC/C,IAAM,CAAC,GAAG,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,YAAkB,CAAC,CAAC;YAClD,IAAM,CAAC,GAAG,CAAC,CAAC,OAAO,CAChB,IAAI,CAAC,IAAI,CAAC,UAAmB,CAC5B,CAAA,MAAC,IAAI,CAAC,IAAI,CAAC,UAAmB,0CAAE,MAAM,IAAG,CAAC,CAC3C,CACF,CAAC;YACF,IAAM,CAAC,GAAG,CAAC,CAAC,OAAO,CAChB,IAAI,CAAC,IAAI,CAAC,WAAoB,CAC7B,CAAA,MAAC,IAAI,CAAC,IAAI,CAAC,WAAoB,0CAAE,MAAM,IAAG,CAAC,CAC5C,CACF,CAAC;YAEF,IAAI,CAAC,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,CAAA,CAAC,aAAD,CAAC,uBAAD,CAAC,CAAE,IAAI,CAAC,CAAE,KAAG,CAAC,aAAD,CAAC,uBAAD,CAAC,CAAE,IAAI,CAAC,CAAE,CAAA,CAAC,IAAI,EAAE,CAAC;YAC1D,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,CAAA,CAAC,aAAD,CAAC,uBAAD,CAAC,CAAE,IAAI,CAAC,CAAE,KAAG,CAAC,aAAD,CAAC,uBAAD,CAAC,CAAE,IAAI,CAAC,CAAE,CAAA,CAAC,IAAI,EAAE,CAAC;YAC3D,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAA,CAAC,aAAD,CAAC,uBAAD,CAAC,CAAE,IAAI,CAAC,CAAE,KAAI,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,KAAM,GAAG,CAAC,CAAC;YACvD,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAA,CAAC,aAAD,CAAC,uBAAD,CAAC,CAAE,IAAI,CAAC,CAAE,KAAI,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,MAAO,GAAG,CAAC,CAAC;SACzD;IACH,CAAC,CAAC,CAAC;IAEH,CAAC,CAAC,WAAW,EAAE,CAAC,OAAO,CAAC,UAAC,CAAC;QACxB,IAAI,CAAC,CAAC,IAAI,CAAC,KAAK,KAAK,QAAQ,EAAE;YAC7B,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;SACpB;IACH,CAAC,CAAC,CAAC;AACL,CAAC,CAAC;AAEF,IAAM,eAAe,GAAG,UAAC,CAAS;IAChC,CAAC,CAAC,WAAW,EAAE,CAAC,OAAO,CAAC,UAAC,CAAC;QACxB,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,MAAM,EAAE;YACzB,IAAM,IAAI,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAE,CAAC;YAClC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,SAAS,EAAE;gBACxB,IAAI,CAAC,IAAI,CAAC,SAAS,GAAG,EAAE,CAAC;aAC1B;YACD,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAC5B,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;SACpB;IACH,CAAC,CAAC,CAAC;AACL,CAAC,CAAC;AAEF,IAAM,eAAe,GAAG,UAAC,CAAS;IAChC,IAAM,MAAM,GAAG,gBAAgB,CAAC,CAAC,CAAC,CAAC;IACnC,MAAM,aAAN,MAAM,uBAAN,MAAM,CAAE,OAAO,CAAC,UAAC,KAAW;QAC1B,IAAI,UAAU,GAAG,CAAC,CAAC;QACnB,KAAK,aAAL,KAAK,uBAAL,KAAK,CAAE,OAAO,CAAC,UAAC,CAAK,EAAE,CAAS;;YAC9B,IAAM,IAAI,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAE,CAAC;YAC3B,IAAI,CAAC,IAAI,CAAC,KAAK,GAAG,CAAC,GAAG,UAAU,CAAC;YACjC,MAAA,IAAI,CAAC,IAAI,CAAC,SAAS,0CAAE,OAAO,CAAC,UAAC,QAAQ;gBACpC,YAAY,CACV,CAAC,EACD,UAAU,EACV;oBACE,KAAK,EAAE,QAAQ,CAAC,IAAI,CAAC,KAAK;oBAC1B,MAAM,EAAE,QAAQ,CAAC,IAAI,CAAC,MAAM;oBAC5B,IAAI,EAAE,IAAI,CAAC,IAAI,CAAC,IAAI;oBACpB,KAAK,EAAE,CAAC,GAAG,EAAE,UAAU;oBACvB,CAAC,EAAE,QAAQ;iBACZ,EACD,KAAK,CACN,CAAC;YACJ,CAAC,CAAC,CAAC;YACH,OAAO,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC;QAC7B,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;AACL,CAAC,CAAC;AAEF,IAAM,iBAAiB,GAAG,UAAC,CAAS;IAClC,CAAC,CAAC,WAAW,EAAE,CAAC,OAAO,CAAC,UAAC,CAAC;QACxB,IAAM,IAAI,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAE,CAAC;QAC9B,IAAI,IAAI,CAAC,IAAI,CAAC,KAAK,KAAK,UAAU,EAAE;YAClC,IAAM,QAAQ,GAAG,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAE,CAAC,MAAM,CAAE,CAAC;YACjD,IAAM,CAAC,GAAG,QAAQ,CAAC,IAAI,CAAC,CAAE,GAAG,QAAQ,CAAC,IAAI,CAAC,KAAM,GAAG,CAAC,CAAC;YACtD,IAAM,CAAC,GAAG,QAAQ,CAAC,IAAI,CAAC,CAAE,CAAC;YAC3B,IAAM,EAAE,GAAG,IAAI,CAAC,IAAI,CAAC,CAAE,GAAG,CAAC,CAAC;YAC5B,IAAM,EAAE,GAAG,QAAQ,CAAC,IAAI,CAAC,MAAO,GAAG,CAAC,CAAC;YAErC,IAAI,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAE,CAAC,EAAE,CAAC,EAAE;gBAC9B,CAAC,CAAC,cAAc,CAAC,IAAI,CAAC,IAAI,CAAC,CAAE,CAAC,EAAE,EAAE,IAAI,CAAC,IAAI,CAAC,CAAE,CAAC,IAAI,CAAC,CAAC;aACtD;iBAAM;gBACL,CAAC,CAAC,OAAO,CAAC;oBACR,EAAE,EAAE,IAAI,CAAC,IAAI,CAAC,CAAE,CAAC,EAAE;oBACnB,MAAM,EAAE,IAAI,CAAC,IAAI,CAAC,CAAE,CAAC,MAAM;oBAC3B,MAAM,EAAE,IAAI,CAAC,IAAI,CAAC,CAAE,CAAC,MAAM;oBAC3B,IAAI,EAAE,IAAI,CAAC,IAAI,CAAC,CAAE,CAAC,IAAI;iBACxB,CAAC,CAAC;aACJ;YACD,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;YAEnB,IAAI,CAAC,IAAI,CAAC,CAAE,CAAC,IAAI,CAAC,MAAM,GAAG;gBACzB,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE;gBAClC,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE;gBAClC,EAAE,CAAC,GAAA,EAAE,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE;gBAChB,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE;gBAClC,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE;aACnC,CAAC;YAEF,IAAI,CAAC,IAAI,CAAC,CAAE,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;YAClC,IAAI,CAAC,IAAI,CAAC,CAAE,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;SACnC;IACH,CAAC,CAAC,CAAC;AACL,CAAC,CAAC;AAEF,IAAM,iBAAiB,GAAG,UAAC,GAAwB,EAAE,KAAe;IAClE,IAAM,gBAAgB,GAAwB,EAAE,CAAC;IACjD,KAAK,aAAL,KAAK,uBAAL,KAAK,CAAE,OAAO,CAAC,UAAC,GAAW;QACzB,IAAI,GAAG,CAAC,GAAG,CAAC,KAAK,SAAS;YAAE,OAAO;QACnC,gBAAgB,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IACpC,CAAC,CAAC,CAAC;IACH,OAAO,gBAAgB,CAAC;AAC1B,CAAC,CAAC;AAEF,IAAM,YAAY,GAAG,UAAC,KAA+B;IAA/B,sBAAA,EAAA,UAA+B;IACnD,IAAM,QAAQ,GAAwB,EAAE,CAAC;IACzC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,OAAO,CAAC,UAAC,CAAS;QACnC,QAAQ,CAAC,CAAC,CAAC,WAAW,EAAE,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;IACvC,CAAC,CAAC,CAAC;IACH,OAAO,QAAQ,CAAC;AAClB,CAAC,CAAC"}
|