@antv/layout 1.2.12 → 1.2.14-beta.0
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/dist/85db61ddc757dae66e04.worker.js +2 -0
- package/dist/85db61ddc757dae66e04.worker.js.map +1 -0
- package/dist/index.min.js +1 -1
- package/dist/index.min.js.map +1 -1
- package/lib/{dagre → antv-dagre}/acyclic.d.ts +1 -1
- package/lib/antv-dagre/acyclic.js +65 -0
- package/lib/antv-dagre/acyclic.js.map +1 -0
- package/lib/antv-dagre/add-border-segments.js +41 -0
- package/lib/antv-dagre/add-border-segments.js.map +1 -0
- package/lib/{dagre → antv-dagre}/coordinate-system.d.ts +2 -1
- package/lib/antv-dagre/coordinate-system.js +69 -0
- package/lib/antv-dagre/coordinate-system.js.map +1 -0
- package/lib/{dagre → antv-dagre}/data/list.d.ts +1 -1
- package/lib/{dagre → antv-dagre}/data/list.js +23 -22
- package/lib/antv-dagre/data/list.js.map +1 -0
- package/lib/{dagre → antv-dagre}/greedy-fas.d.ts +2 -2
- package/lib/antv-dagre/greedy-fas.js +141 -0
- package/lib/antv-dagre/greedy-fas.js.map +1 -0
- package/lib/{dagre → antv-dagre}/layout.d.ts +2 -1
- package/lib/{dagre → antv-dagre}/layout.js +156 -154
- package/lib/antv-dagre/layout.js.map +1 -0
- package/lib/{dagre → antv-dagre}/nesting-graph.js +42 -39
- package/lib/antv-dagre/nesting-graph.js.map +1 -0
- package/lib/{dagre → antv-dagre}/normalize.d.ts +2 -2
- package/lib/{dagre → antv-dagre}/normalize.js +29 -25
- package/lib/antv-dagre/normalize.js.map +1 -0
- package/lib/{dagre → antv-dagre}/order/add-subgraph-constraints.js +13 -9
- package/lib/antv-dagre/order/add-subgraph-constraints.js.map +1 -0
- package/lib/{dagre → antv-dagre}/order/barycenter.d.ts +2 -2
- package/lib/antv-dagre/order/barycenter.js +27 -0
- package/lib/antv-dagre/order/barycenter.js.map +1 -0
- package/lib/{dagre → antv-dagre}/order/build-layer-graph.js +23 -23
- package/lib/antv-dagre/order/build-layer-graph.js.map +1 -0
- package/lib/antv-dagre/order/cross-count.d.ts +3 -0
- package/lib/{dagre → antv-dagre}/order/cross-count.js +21 -17
- package/lib/antv-dagre/order/cross-count.js.map +1 -0
- package/lib/{dagre → antv-dagre}/order/index.d.ts +1 -1
- package/lib/antv-dagre/order/index.js +95 -0
- package/lib/antv-dagre/order/index.js.map +1 -0
- package/lib/{dagre → antv-dagre}/order/init-data-order.js +12 -9
- package/lib/antv-dagre/order/init-data-order.js.map +1 -0
- package/lib/antv-dagre/order/init-order.js +51 -0
- package/lib/antv-dagre/order/init-order.js.map +1 -0
- package/lib/{dagre → antv-dagre}/order/resolve-conflicts.d.ts +3 -3
- package/lib/{dagre → antv-dagre}/order/resolve-conflicts.js +35 -36
- package/lib/antv-dagre/order/resolve-conflicts.js.map +1 -0
- package/lib/{dagre → antv-dagre}/order/sort-subgraph.js +28 -23
- package/lib/antv-dagre/order/sort-subgraph.js.map +1 -0
- package/lib/{dagre → antv-dagre}/order/sort.d.ts +2 -2
- package/lib/{dagre → antv-dagre}/order/sort.js +23 -19
- package/lib/antv-dagre/order/sort.js.map +1 -0
- package/lib/{dagre → antv-dagre}/parent-dummy-chains.js +32 -28
- package/lib/antv-dagre/parent-dummy-chains.js.map +1 -0
- package/lib/{dagre → antv-dagre}/position/bk.d.ts +5 -4
- package/lib/{dagre → antv-dagre}/position/bk.js +162 -148
- package/lib/antv-dagre/position/bk.js.map +1 -0
- package/lib/{dagre → antv-dagre}/position/index.d.ts +2 -1
- package/lib/antv-dagre/position/index.js +55 -0
- package/lib/antv-dagre/position/index.js.map +1 -0
- package/lib/{dagre → antv-dagre}/rank/feasible-tree.d.ts +2 -2
- package/lib/{dagre → antv-dagre}/rank/feasible-tree.js +42 -38
- package/lib/antv-dagre/rank/feasible-tree.js.map +1 -0
- package/lib/antv-dagre/rank/index.d.ts +2 -0
- package/lib/{dagre → antv-dagre}/rank/index.js +17 -13
- package/lib/antv-dagre/rank/index.js.map +1 -0
- package/lib/{dagre → antv-dagre}/rank/network-simplex.d.ts +2 -2
- package/lib/{dagre → antv-dagre}/rank/network-simplex.js +90 -81
- package/lib/antv-dagre/rank/network-simplex.js.map +1 -0
- package/lib/{dagre → antv-dagre}/rank/util.d.ts +2 -2
- package/lib/{dagre → antv-dagre}/rank/util.js +37 -32
- package/lib/antv-dagre/rank/util.js.map +1 -0
- package/lib/antv-dagre/types.d.ts +2 -0
- package/lib/antv-dagre/types.js +3 -0
- package/lib/antv-dagre/types.js.map +1 -0
- package/lib/{dagre → antv-dagre}/util.d.ts +1 -1
- package/lib/antv-dagre/util.js +299 -0
- package/lib/antv-dagre/util.js.map +1 -0
- package/lib/antv-dagre.d.ts +50 -0
- package/lib/antv-dagre.js +542 -0
- package/lib/antv-dagre.js.map +1 -0
- package/lib/bundle-entry.d.ts +2 -18
- package/lib/bundle-entry.js +5 -18
- package/lib/bundle-entry.js.map +1 -1
- package/lib/bundle-supervisor.d.ts +4 -22
- package/lib/bundle-supervisor.js +59 -54
- package/lib/bundle-supervisor.js.map +1 -1
- package/lib/bundle-worker.d.ts +1 -1
- package/lib/bundle-worker.js +38 -35
- package/lib/bundle-worker.js.map +1 -1
- package/lib/circular.d.ts +1 -1
- package/lib/circular.js +133 -145
- package/lib/circular.js.map +1 -1
- package/lib/comboCombined.d.ts +1 -1
- package/lib/comboCombined.js +273 -299
- package/lib/comboCombined.js.map +1 -1
- package/lib/concentric.d.ts +1 -1
- package/lib/concentric.js +173 -179
- package/lib/concentric.js.map +1 -1
- package/lib/d3Force/forceInBox.js +80 -78
- package/lib/d3Force/forceInBox.js.map +1 -1
- package/lib/d3Force/index.d.ts +2 -2
- package/lib/d3Force/index.js +207 -229
- package/lib/d3Force/index.js.map +1 -1
- package/lib/dagre.d.ts +13 -24
- package/lib/dagre.js +61 -541
- package/lib/dagre.js.map +1 -1
- package/lib/exports.d.ts +17 -0
- package/lib/exports.js +20 -0
- package/lib/exports.js.map +1 -0
- package/lib/force/forceNBody.js +48 -47
- package/lib/force/forceNBody.js.map +1 -1
- package/lib/force/index.d.ts +1 -1
- package/lib/force/index.js +301 -324
- package/lib/force/index.js.map +1 -1
- package/lib/force/types.d.ts +5 -5
- package/lib/force/types.js +2 -1
- package/lib/forceAtlas2/body.d.ts +1 -1
- package/lib/forceAtlas2/body.js +32 -31
- package/lib/forceAtlas2/body.js.map +1 -1
- package/lib/forceAtlas2/index.d.ts +1 -1
- package/lib/forceAtlas2/index.js +219 -227
- package/lib/forceAtlas2/index.js.map +1 -1
- package/lib/forceAtlas2/quad.d.ts +2 -2
- package/lib/forceAtlas2/quad.js +43 -42
- package/lib/forceAtlas2/quad.js.map +1 -1
- package/lib/forceAtlas2/quadTree.js +19 -17
- package/lib/forceAtlas2/quadTree.js.map +1 -1
- package/lib/fruchterman.d.ts +1 -1
- package/lib/fruchterman.js +203 -219
- package/lib/fruchterman.js.map +1 -1
- package/lib/grid.d.ts +1 -1
- package/lib/grid.js +201 -207
- package/lib/grid.js.map +1 -1
- package/lib/index.d.ts +1 -15
- package/lib/index.js +5 -16
- package/lib/index.js.map +1 -1
- package/lib/mds.d.ts +1 -1
- package/lib/mds.js +73 -79
- package/lib/mds.js.map +1 -1
- package/lib/radial/index.d.ts +1 -1
- package/lib/radial/index.js +183 -186
- package/lib/radial/index.js.map +1 -1
- package/lib/radial/mds.d.ts +1 -1
- package/lib/radial/mds.js +20 -14
- package/lib/radial/mds.js.map +1 -1
- package/lib/radial/radial-nonoverlap-force.d.ts +2 -2
- package/lib/radial/radial-nonoverlap-force.js +40 -37
- package/lib/radial/radial-nonoverlap-force.js.map +1 -1
- package/lib/random.d.ts +1 -1
- package/lib/random.js +57 -66
- package/lib/random.js.map +1 -1
- package/lib/registry.d.ts +2 -2
- package/lib/registry.js +30 -25
- package/lib/registry.js.map +1 -1
- package/lib/supervisor.d.ts +2 -3
- package/lib/supervisor.js +63 -58
- package/lib/supervisor.js.map +1 -1
- package/lib/types.d.ts +20 -74
- package/lib/types.js +5 -1
- package/lib/types.js.map +1 -1
- package/lib/util/array.js +4 -1
- package/lib/util/array.js.map +1 -1
- package/lib/util/common.d.ts +1 -1
- package/lib/util/common.js +11 -8
- package/lib/util/common.js.map +1 -1
- package/lib/util/function.js +41 -37
- package/lib/util/function.js.map +1 -1
- package/lib/util/index.d.ts +0 -2
- package/lib/util/index.js +7 -6
- package/lib/util/index.js.map +1 -1
- package/lib/util/math.d.ts +1 -26
- package/lib/util/math.js +55 -154
- package/lib/util/math.js.map +1 -1
- package/lib/util/object.d.ts +1 -1
- package/lib/util/object.js +20 -15
- package/lib/util/object.js.map +1 -1
- package/lib/util/size.d.ts +3 -0
- package/lib/util/size.js +16 -0
- package/lib/util/size.js.map +1 -0
- package/lib/worker.js +36 -35
- package/lib/worker.js.map +1 -1
- package/package.json +10 -6
- package/dist/4161e9d58bae8f39711a.worker.js +0 -2
- package/dist/4161e9d58bae8f39711a.worker.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.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.map +0 -1
- package/lib/dagre/nesting-graph.js.map +0 -1
- package/lib/dagre/normalize.js.map +0 -1
- 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.map +0 -1
- package/lib/dagre/order/cross-count.d.ts +0 -3
- 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.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.map +0 -1
- package/lib/dagre/order/sort-subgraph.js.map +0 -1
- package/lib/dagre/order/sort.js.map +0 -1
- package/lib/dagre/parent-dummy-chains.js.map +0 -1
- 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.map +0 -1
- package/lib/dagre/rank/index.d.ts +0 -2
- package/lib/dagre/rank/index.js.map +0 -1
- package/lib/dagre/rank/network-simplex.js.map +0 -1
- 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/util/gpu.d.ts +0 -45
- package/lib/util/gpu.js +0 -214
- package/lib/util/gpu.js.map +0 -1
- package/lib/util/number.d.ts +0 -1
- package/lib/util/number.js +0 -5
- package/lib/util/number.js.map +0 -1
- package/lib/util/string.d.ts +0 -1
- package/lib/util/string.js +0 -15
- package/lib/util/string.js.map +0 -1
- /package/lib/{dagre → antv-dagre}/add-border-segments.d.ts +0 -0
- /package/lib/{dagre → antv-dagre}/nesting-graph.d.ts +0 -0
- /package/lib/{dagre → antv-dagre}/order/add-subgraph-constraints.d.ts +0 -0
- /package/lib/{dagre → antv-dagre}/order/build-layer-graph.d.ts +0 -0
- /package/lib/{dagre → antv-dagre}/order/init-data-order.d.ts +0 -0
- /package/lib/{dagre → antv-dagre}/order/init-order.d.ts +0 -0
- /package/lib/{dagre → antv-dagre}/order/sort-subgraph.d.ts +0 -0
- /package/lib/{dagre → antv-dagre}/parent-dummy-chains.d.ts +0 -0
package/lib/grid.js
CHANGED
|
@@ -1,8 +1,11 @@
|
|
|
1
|
-
|
|
2
|
-
|
|
3
|
-
|
|
4
|
-
|
|
5
|
-
|
|
1
|
+
"use strict";
|
|
2
|
+
Object.defineProperty(exports, "__esModule", { value: true });
|
|
3
|
+
exports.GridLayout = void 0;
|
|
4
|
+
const tslib_1 = require("tslib");
|
|
5
|
+
const util_1 = require("@antv/util");
|
|
6
|
+
const util_2 = require("./util");
|
|
7
|
+
const common_1 = require("./util/common");
|
|
8
|
+
const DEFAULTS_LAYOUT_OPTIONS = {
|
|
6
9
|
begin: [0, 0],
|
|
7
10
|
preventOverlap: true,
|
|
8
11
|
preventOverlapPadding: 10,
|
|
@@ -10,7 +13,7 @@ var DEFAULTS_LAYOUT_OPTIONS = {
|
|
|
10
13
|
rows: undefined,
|
|
11
14
|
cols: undefined,
|
|
12
15
|
position: undefined,
|
|
13
|
-
sortBy:
|
|
16
|
+
sortBy: 'degree',
|
|
14
17
|
nodeSize: 30,
|
|
15
18
|
width: 300,
|
|
16
19
|
height: 300,
|
|
@@ -30,218 +33,213 @@ var DEFAULTS_LAYOUT_OPTIONS = {
|
|
|
30
33
|
* // If you want to assign the positions directly to the nodes, use assign method.
|
|
31
34
|
* await layout.assign(graph, { rows: 20 });
|
|
32
35
|
*/
|
|
33
|
-
|
|
34
|
-
|
|
35
|
-
if (options === void 0) { options = {}; }
|
|
36
|
+
class GridLayout {
|
|
37
|
+
constructor(options = {}) {
|
|
36
38
|
this.options = options;
|
|
37
|
-
this.id =
|
|
38
|
-
this.options =
|
|
39
|
+
this.id = 'grid';
|
|
40
|
+
this.options = Object.assign(Object.assign({}, DEFAULTS_LAYOUT_OPTIONS), options);
|
|
39
41
|
}
|
|
40
42
|
/**
|
|
41
43
|
* Return the positions of nodes and edges(if needed).
|
|
42
44
|
*/
|
|
43
|
-
|
|
44
|
-
return __awaiter(this, void 0, void 0, function () {
|
|
45
|
-
return
|
|
46
|
-
return [2 /*return*/, this.genericGridLayout(false, graph, options)];
|
|
47
|
-
});
|
|
45
|
+
execute(graph, options) {
|
|
46
|
+
return tslib_1.__awaiter(this, void 0, void 0, function* () {
|
|
47
|
+
return this.genericGridLayout(false, graph, options);
|
|
48
48
|
});
|
|
49
|
-
}
|
|
49
|
+
}
|
|
50
50
|
/**
|
|
51
51
|
* To directly assign the positions to the nodes.
|
|
52
52
|
*/
|
|
53
|
-
|
|
54
|
-
return __awaiter(this, void 0, void 0, function () {
|
|
55
|
-
|
|
56
|
-
this.genericGridLayout(true, graph, options);
|
|
57
|
-
return [2 /*return*/];
|
|
58
|
-
});
|
|
53
|
+
assign(graph, options) {
|
|
54
|
+
return tslib_1.__awaiter(this, void 0, void 0, function* () {
|
|
55
|
+
this.genericGridLayout(true, graph, options);
|
|
59
56
|
});
|
|
60
|
-
}
|
|
61
|
-
|
|
62
|
-
return __awaiter(this, void 0, void 0, function () {
|
|
63
|
-
|
|
64
|
-
|
|
65
|
-
|
|
66
|
-
|
|
67
|
-
|
|
68
|
-
|
|
69
|
-
|
|
70
|
-
|
|
71
|
-
|
|
72
|
-
|
|
73
|
-
|
|
74
|
-
|
|
75
|
-
|
|
76
|
-
|
|
77
|
-
|
|
78
|
-
sortBy
|
|
79
|
-
|
|
80
|
-
|
|
81
|
-
|
|
82
|
-
|
|
83
|
-
|
|
84
|
-
|
|
85
|
-
|
|
86
|
-
|
|
87
|
-
|
|
88
|
-
|
|
89
|
-
|
|
90
|
-
|
|
91
|
-
|
|
92
|
-
|
|
93
|
-
|
|
94
|
-
|
|
95
|
-
|
|
96
|
-
|
|
97
|
-
|
|
98
|
-
|
|
99
|
-
|
|
100
|
-
|
|
101
|
-
|
|
102
|
-
|
|
103
|
-
|
|
104
|
-
|
|
105
|
-
|
|
106
|
-
|
|
107
|
-
rcs =
|
|
108
|
-
|
|
109
|
-
|
|
110
|
-
|
|
111
|
-
|
|
112
|
-
|
|
113
|
-
|
|
114
|
-
|
|
115
|
-
|
|
116
|
-
|
|
117
|
-
|
|
118
|
-
|
|
119
|
-
|
|
57
|
+
}
|
|
58
|
+
genericGridLayout(assign, graph, options) {
|
|
59
|
+
return tslib_1.__awaiter(this, void 0, void 0, function* () {
|
|
60
|
+
const mergedOptions = Object.assign(Object.assign({}, this.options), options);
|
|
61
|
+
const { begin = [0, 0], condense, preventOverlapPadding, preventOverlap, rows: propsRows, cols: propsCols, nodeSpacing: paramNodeSpacing, nodeSize: paramNodeSize, width: propsWidth, height: propsHeight, position, } = mergedOptions;
|
|
62
|
+
let { sortBy } = mergedOptions;
|
|
63
|
+
const nodes = graph.getAllNodes();
|
|
64
|
+
const edges = graph.getAllEdges();
|
|
65
|
+
const n = nodes === null || nodes === void 0 ? void 0 : nodes.length;
|
|
66
|
+
// Need no layout if there is no node.
|
|
67
|
+
if (!n || n === 1) {
|
|
68
|
+
return (0, common_1.handleSingleNodeGraph)(graph, assign, begin);
|
|
69
|
+
}
|
|
70
|
+
const layoutNodes = nodes.map((node) => (0, util_2.cloneFormatData)(node));
|
|
71
|
+
if (
|
|
72
|
+
// `id` should be reserved keyword
|
|
73
|
+
sortBy !== 'id' &&
|
|
74
|
+
(!(0, util_1.isString)(sortBy) || layoutNodes[0].data[sortBy] === undefined)) {
|
|
75
|
+
sortBy = 'degree';
|
|
76
|
+
}
|
|
77
|
+
if (sortBy === 'degree') {
|
|
78
|
+
layoutNodes.sort((n1, n2) => graph.getDegree(n2.id, 'both') - graph.getDegree(n1.id, 'both'));
|
|
79
|
+
}
|
|
80
|
+
else if (sortBy === 'id') {
|
|
81
|
+
// sort nodes by ID
|
|
82
|
+
layoutNodes.sort((n1, n2) => {
|
|
83
|
+
if ((0, util_1.isNumber)(n2.id) && (0, util_1.isNumber)(n1.id)) {
|
|
84
|
+
return n2.id - n1.id;
|
|
85
|
+
}
|
|
86
|
+
return `${n1.id}`.localeCompare(`${n2.id}`);
|
|
87
|
+
});
|
|
88
|
+
}
|
|
89
|
+
else {
|
|
90
|
+
// sort nodes by value
|
|
91
|
+
layoutNodes.sort((n1, n2) => n2.data[sortBy] - n1.data[sortBy]);
|
|
92
|
+
}
|
|
93
|
+
const width = !propsWidth && typeof window !== 'undefined'
|
|
94
|
+
? window.innerWidth
|
|
95
|
+
: propsWidth;
|
|
96
|
+
const height = !propsHeight && typeof window !== 'undefined'
|
|
97
|
+
? window.innerHeight
|
|
98
|
+
: propsHeight;
|
|
99
|
+
const cells = n;
|
|
100
|
+
const rcs = { rows: propsRows, cols: propsCols };
|
|
101
|
+
// if rows or columns were set in self, use those values
|
|
102
|
+
if (propsRows != null && propsCols != null) {
|
|
103
|
+
rcs.rows = propsRows;
|
|
104
|
+
rcs.cols = propsCols;
|
|
105
|
+
}
|
|
106
|
+
else if (propsRows != null && propsCols == null) {
|
|
107
|
+
rcs.rows = propsRows;
|
|
108
|
+
rcs.cols = Math.ceil(cells / rcs.rows);
|
|
109
|
+
}
|
|
110
|
+
else if (propsRows == null && propsCols != null) {
|
|
111
|
+
rcs.cols = propsCols;
|
|
112
|
+
rcs.rows = Math.ceil(cells / rcs.cols);
|
|
113
|
+
}
|
|
114
|
+
else {
|
|
115
|
+
// otherwise use the automatic values and adjust accordingly // otherwise use the automatic values and adjust accordingly
|
|
116
|
+
// width/height * splits^2 = cells where splits is number of times to split width
|
|
117
|
+
const splits = Math.sqrt((cells * height) / width);
|
|
118
|
+
rcs.rows = Math.round(splits);
|
|
119
|
+
rcs.cols = Math.round((width / height) * splits);
|
|
120
|
+
}
|
|
121
|
+
rcs.rows = Math.max(rcs.rows, 1);
|
|
122
|
+
rcs.cols = Math.max(rcs.cols, 1);
|
|
123
|
+
if (rcs.cols * rcs.rows > cells) {
|
|
124
|
+
// otherwise use the automatic values and adjust accordingly
|
|
125
|
+
// if rounding was up, see if we can reduce rows or columns
|
|
126
|
+
const sm = small(rcs);
|
|
127
|
+
const lg = large(rcs);
|
|
128
|
+
// reducing the small side takes away the most cells, so try it first
|
|
129
|
+
if ((sm - 1) * lg >= cells) {
|
|
130
|
+
small(rcs, sm - 1);
|
|
120
131
|
}
|
|
121
|
-
else {
|
|
122
|
-
|
|
123
|
-
rcs.rows = Math.round(splits);
|
|
124
|
-
rcs.cols = Math.round((width / height) * splits);
|
|
132
|
+
else if ((lg - 1) * sm >= cells) {
|
|
133
|
+
large(rcs, lg - 1);
|
|
125
134
|
}
|
|
126
|
-
|
|
127
|
-
|
|
128
|
-
if
|
|
129
|
-
|
|
130
|
-
|
|
131
|
-
|
|
132
|
-
|
|
133
|
-
|
|
135
|
+
}
|
|
136
|
+
else {
|
|
137
|
+
// if rounding was too low, add rows or columns
|
|
138
|
+
while (rcs.cols * rcs.rows < cells) {
|
|
139
|
+
const sm = small(rcs);
|
|
140
|
+
const lg = large(rcs);
|
|
141
|
+
// try to add to larger side first (adds less in multiplication)
|
|
142
|
+
if ((lg + 1) * sm >= cells) {
|
|
143
|
+
large(rcs, lg + 1);
|
|
134
144
|
}
|
|
135
|
-
else
|
|
136
|
-
|
|
145
|
+
else {
|
|
146
|
+
small(rcs, sm + 1);
|
|
137
147
|
}
|
|
138
148
|
}
|
|
139
|
-
|
|
140
|
-
|
|
141
|
-
|
|
142
|
-
|
|
143
|
-
|
|
144
|
-
|
|
145
|
-
|
|
146
|
-
|
|
147
|
-
|
|
148
|
-
|
|
149
|
-
|
|
150
|
-
|
|
149
|
+
}
|
|
150
|
+
let cellWidth = condense ? 0 : width / rcs.cols;
|
|
151
|
+
let cellHeight = condense ? 0 : height / rcs.rows;
|
|
152
|
+
if (preventOverlap || paramNodeSpacing) {
|
|
153
|
+
const nodeSpacing = (0, util_2.formatNumberFn)(10, paramNodeSpacing);
|
|
154
|
+
const nodeSize = (0, util_2.formatSizeFn)(30, paramNodeSize, false);
|
|
155
|
+
layoutNodes.forEach((node) => {
|
|
156
|
+
if (!node.data.x || !node.data.y) {
|
|
157
|
+
// for bb
|
|
158
|
+
node.data.x = 0;
|
|
159
|
+
node.data.y = 0;
|
|
160
|
+
}
|
|
161
|
+
const oNode = graph.getNode(node.id);
|
|
162
|
+
const res = nodeSize(oNode) || 30;
|
|
163
|
+
let nodeW;
|
|
164
|
+
let nodeH;
|
|
165
|
+
if ((0, util_2.isArray)(res)) {
|
|
166
|
+
nodeW = res[0];
|
|
167
|
+
nodeH = res[1];
|
|
168
|
+
}
|
|
169
|
+
else {
|
|
170
|
+
nodeW = res;
|
|
171
|
+
nodeH = res;
|
|
151
172
|
}
|
|
173
|
+
const p = nodeSpacing !== undefined ? nodeSpacing(node) : preventOverlapPadding;
|
|
174
|
+
const w = nodeW + p;
|
|
175
|
+
const h = nodeH + p;
|
|
176
|
+
cellWidth = Math.max(cellWidth, w);
|
|
177
|
+
cellHeight = Math.max(cellHeight, h);
|
|
178
|
+
});
|
|
179
|
+
}
|
|
180
|
+
const cellUsed = {}; // e.g. 'c-0-2' => true
|
|
181
|
+
// to keep track of current cell position
|
|
182
|
+
const rc = { row: 0, col: 0 };
|
|
183
|
+
// get a cache of all the manual positions
|
|
184
|
+
const id2manPos = {};
|
|
185
|
+
for (let i = 0; i < layoutNodes.length; i++) {
|
|
186
|
+
const node = layoutNodes[i];
|
|
187
|
+
let rcPos;
|
|
188
|
+
if (position) {
|
|
189
|
+
// TODO: not sure the api name
|
|
190
|
+
rcPos = position(graph.getNode(node.id));
|
|
152
191
|
}
|
|
153
|
-
|
|
154
|
-
|
|
155
|
-
|
|
156
|
-
|
|
157
|
-
|
|
158
|
-
|
|
159
|
-
|
|
160
|
-
|
|
161
|
-
|
|
162
|
-
|
|
192
|
+
if (rcPos && (rcPos.row !== undefined || rcPos.col !== undefined)) {
|
|
193
|
+
// must have at least row or col def'd
|
|
194
|
+
const pos = {
|
|
195
|
+
row: rcPos.row,
|
|
196
|
+
col: rcPos.col,
|
|
197
|
+
};
|
|
198
|
+
if (pos.col === undefined) {
|
|
199
|
+
// find unused col
|
|
200
|
+
pos.col = 0;
|
|
201
|
+
while (used(cellUsed, pos)) {
|
|
202
|
+
pos.col++;
|
|
163
203
|
}
|
|
164
|
-
var oNode = graph.getNode(node.id);
|
|
165
|
-
var res = nodeSize_1(oNode) || 30;
|
|
166
|
-
var nodeW;
|
|
167
|
-
var nodeH;
|
|
168
|
-
if (isArray(res)) {
|
|
169
|
-
nodeW = res[0];
|
|
170
|
-
nodeH = res[1];
|
|
171
|
-
}
|
|
172
|
-
else {
|
|
173
|
-
nodeW = res;
|
|
174
|
-
nodeH = res;
|
|
175
|
-
}
|
|
176
|
-
var p = nodeSpacing_1 !== undefined ? nodeSpacing_1(node) : preventOverlapPadding;
|
|
177
|
-
var w = nodeW + p;
|
|
178
|
-
var h = nodeH + p;
|
|
179
|
-
cellWidth = Math.max(cellWidth, w);
|
|
180
|
-
cellHeight = Math.max(cellHeight, h);
|
|
181
|
-
});
|
|
182
|
-
}
|
|
183
|
-
cellUsed = {};
|
|
184
|
-
rc = { row: 0, col: 0 };
|
|
185
|
-
id2manPos = {};
|
|
186
|
-
for (i = 0; i < layoutNodes.length; i++) {
|
|
187
|
-
node = layoutNodes[i];
|
|
188
|
-
rcPos = void 0;
|
|
189
|
-
if (position) {
|
|
190
|
-
// TODO: not sure the api name
|
|
191
|
-
rcPos = position(graph.getNode(node.id));
|
|
192
204
|
}
|
|
193
|
-
if (
|
|
194
|
-
|
|
195
|
-
|
|
196
|
-
|
|
197
|
-
|
|
198
|
-
if (pos.col === undefined) {
|
|
199
|
-
// find unused col
|
|
200
|
-
pos.col = 0;
|
|
201
|
-
while (used(cellUsed, pos)) {
|
|
202
|
-
pos.col++;
|
|
203
|
-
}
|
|
204
|
-
}
|
|
205
|
-
else if (pos.row === undefined) {
|
|
206
|
-
// find unused row
|
|
207
|
-
pos.row = 0;
|
|
208
|
-
while (used(cellUsed, pos)) {
|
|
209
|
-
pos.row++;
|
|
210
|
-
}
|
|
205
|
+
else if (pos.row === undefined) {
|
|
206
|
+
// find unused row
|
|
207
|
+
pos.row = 0;
|
|
208
|
+
while (used(cellUsed, pos)) {
|
|
209
|
+
pos.row++;
|
|
211
210
|
}
|
|
212
|
-
id2manPos[node.id] = pos;
|
|
213
|
-
use(cellUsed, pos);
|
|
214
211
|
}
|
|
215
|
-
|
|
212
|
+
id2manPos[node.id] = pos;
|
|
213
|
+
use(cellUsed, pos);
|
|
216
214
|
}
|
|
217
|
-
|
|
218
|
-
|
|
219
|
-
|
|
220
|
-
|
|
221
|
-
|
|
222
|
-
|
|
223
|
-
|
|
224
|
-
|
|
225
|
-
|
|
226
|
-
|
|
215
|
+
getPos(node, begin, cellWidth, cellHeight, id2manPos, rcs, rc, cellUsed);
|
|
216
|
+
}
|
|
217
|
+
const result = {
|
|
218
|
+
nodes: layoutNodes,
|
|
219
|
+
edges,
|
|
220
|
+
};
|
|
221
|
+
if (assign) {
|
|
222
|
+
layoutNodes.forEach((node) => {
|
|
223
|
+
graph.mergeNodeData(node.id, {
|
|
224
|
+
x: node.data.x,
|
|
225
|
+
y: node.data.y,
|
|
227
226
|
});
|
|
228
|
-
}
|
|
229
|
-
|
|
230
|
-
|
|
227
|
+
});
|
|
228
|
+
}
|
|
229
|
+
return result;
|
|
231
230
|
});
|
|
232
|
-
}
|
|
233
|
-
|
|
234
|
-
|
|
235
|
-
|
|
236
|
-
|
|
237
|
-
|
|
238
|
-
|
|
239
|
-
var cols = rcs.cols || 5;
|
|
231
|
+
}
|
|
232
|
+
}
|
|
233
|
+
exports.GridLayout = GridLayout;
|
|
234
|
+
const small = (rcs, val) => {
|
|
235
|
+
let res;
|
|
236
|
+
const rows = rcs.rows || 5;
|
|
237
|
+
const cols = rcs.cols || 5;
|
|
240
238
|
if (val == null) {
|
|
241
239
|
res = Math.min(rows, cols);
|
|
242
240
|
}
|
|
243
241
|
else {
|
|
244
|
-
|
|
242
|
+
const min = Math.min(rows, cols);
|
|
245
243
|
if (min === rcs.rows) {
|
|
246
244
|
rcs.rows = val;
|
|
247
245
|
}
|
|
@@ -251,15 +249,15 @@ var small = function (rcs, val) {
|
|
|
251
249
|
}
|
|
252
250
|
return res;
|
|
253
251
|
};
|
|
254
|
-
|
|
255
|
-
|
|
256
|
-
|
|
257
|
-
|
|
252
|
+
const large = (rcs, val) => {
|
|
253
|
+
let result;
|
|
254
|
+
const usedRows = rcs.rows || 5;
|
|
255
|
+
const usedCols = rcs.cols || 5;
|
|
258
256
|
if (val == null) {
|
|
259
257
|
result = Math.max(usedRows, usedCols);
|
|
260
258
|
}
|
|
261
259
|
else {
|
|
262
|
-
|
|
260
|
+
const max = Math.max(usedRows, usedCols);
|
|
263
261
|
if (max === rcs.rows) {
|
|
264
262
|
rcs.rows = val;
|
|
265
263
|
}
|
|
@@ -269,25 +267,21 @@ var large = function (rcs, val) {
|
|
|
269
267
|
}
|
|
270
268
|
return result;
|
|
271
269
|
};
|
|
272
|
-
|
|
273
|
-
|
|
274
|
-
|
|
275
|
-
|
|
276
|
-
return (cellUsed["c-" + rc.row + "-" + rc.col] = true);
|
|
277
|
-
};
|
|
278
|
-
var moveToNextCell = function (rcs, rc) {
|
|
279
|
-
var cols = rcs.cols || 5;
|
|
270
|
+
const used = (cellUsed, rc) => cellUsed[`c-${rc.row}-${rc.col}`] || false;
|
|
271
|
+
const use = (cellUsed, rc) => (cellUsed[`c-${rc.row}-${rc.col}`] = true);
|
|
272
|
+
const moveToNextCell = (rcs, rc) => {
|
|
273
|
+
const cols = rcs.cols || 5;
|
|
280
274
|
rc.col++;
|
|
281
275
|
if (rc.col >= cols) {
|
|
282
276
|
rc.col = 0;
|
|
283
277
|
rc.row++;
|
|
284
278
|
}
|
|
285
279
|
};
|
|
286
|
-
|
|
287
|
-
|
|
288
|
-
|
|
280
|
+
const getPos = (node, begin, cellWidth, cellHeight, id2manPos, rcs, rc, cellUsed) => {
|
|
281
|
+
let x;
|
|
282
|
+
let y;
|
|
289
283
|
// see if we have a manual position set
|
|
290
|
-
|
|
284
|
+
const rcPos = id2manPos[node.id];
|
|
291
285
|
if (rcPos) {
|
|
292
286
|
x = rcPos.col * cellWidth + cellWidth / 2 + begin[0];
|
|
293
287
|
y = rcPos.row * cellHeight + cellHeight / 2 + begin[1];
|
package/lib/grid.js.map
CHANGED
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"grid.js","sourceRoot":"","sources":["../src/grid.ts"],"names":[],"mappings":"
|
|
1
|
+
{"version":3,"file":"grid.js","sourceRoot":"","sources":["../src/grid.ts"],"names":[],"mappings":";;;;AAAA,qCAAgD;AAWhD,iCAAgF;AAChF,0CAAsD;AAoBtD,MAAM,uBAAuB,GAA+B;IAC1D,KAAK,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC;IACb,cAAc,EAAE,IAAI;IACpB,qBAAqB,EAAE,EAAE;IACzB,QAAQ,EAAE,KAAK;IACf,IAAI,EAAE,SAAS;IACf,IAAI,EAAE,SAAS;IACf,QAAQ,EAAE,SAAS;IACnB,MAAM,EAAE,QAAQ;IAChB,QAAQ,EAAE,EAAE;IACZ,KAAK,EAAE,GAAG;IACV,MAAM,EAAE,GAAG;CACZ,CAAC;AAEF;;;;;;;;;;;;;;GAcG;AACH,MAAa,UAAU;IAGrB,YAAmB,UAA6B,EAAuB;QAApD,YAAO,GAAP,OAAO,CAA6C;QAFvE,OAAE,GAAG,MAAM,CAAC;QAGV,IAAI,CAAC,OAAO,mCACP,uBAAuB,GACvB,OAAO,CACX,CAAC;IACJ,CAAC;IAED;;OAEG;IACG,OAAO,CAAC,KAAY,EAAE,OAA2B;;YACrD,OAAO,IAAI,CAAC,iBAAiB,CAAC,KAAK,EAAE,KAAK,EAAE,OAAO,CAAC,CAAC;QACvD,CAAC;KAAA;IACD;;OAEG;IACG,MAAM,CAAC,KAAY,EAAE,OAA2B;;YACpD,IAAI,CAAC,iBAAiB,CAAC,IAAI,EAAE,KAAK,EAAE,OAAO,CAAC,CAAC;QAC/C,CAAC;KAAA;IAYa,iBAAiB,CAC7B,MAAe,EACf,KAAY,EACZ,OAA2B;;YAE3B,MAAM,aAAa,mCAAQ,IAAI,CAAC,OAAO,GAAK,OAAO,CAAE,CAAC;YACtD,MAAM,EACJ,KAAK,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,EACd,QAAQ,EACR,qBAAqB,EACrB,cAAc,EACd,IAAI,EAAE,SAAS,EACf,IAAI,EAAE,SAAS,EACf,WAAW,EAAE,gBAAgB,EAC7B,QAAQ,EAAE,aAAa,EACvB,KAAK,EAAE,UAAU,EACjB,MAAM,EAAE,WAAW,EACnB,QAAQ,GACT,GAAG,aAAa,CAAC;YAClB,IAAI,EAAE,MAAM,EAAE,GAAG,aAAa,CAAC;YAE/B,MAAM,KAAK,GAAW,KAAK,CAAC,WAAW,EAAE,CAAC;YAC1C,MAAM,KAAK,GAAW,KAAK,CAAC,WAAW,EAAE,CAAC;YAE1C,MAAM,CAAC,GAAG,KAAK,aAAL,KAAK,uBAAL,KAAK,CAAE,MAAM,CAAC;YAExB,sCAAsC;YACtC,IAAI,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE;gBACjB,OAAO,IAAA,8BAAqB,EAAC,KAAK,EAAE,MAAM,EAAE,KAAK,CAAC,CAAC;aACpD;YAED,MAAM,WAAW,GAAc,KAAK,CAAC,GAAG,CACtC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAA,sBAAe,EAAC,IAAI,CAAY,CAC3C,CAAC;YAEF;YACE,kCAAkC;YAClC,MAAM,KAAK,IAAI;gBACf,CAAC,CAAC,IAAA,eAAQ,EAAC,MAAM,CAAC,IAAK,WAAW,CAAC,CAAC,CAAS,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,SAAS,CAAC,EACzE;gBACA,MAAM,GAAG,QAAQ,CAAC;aACnB;YAED,IAAI,MAAM,KAAK,QAAQ,EAAE;gBACvB,WAAW,CAAC,IAAI,CACd,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,CACT,KAAK,CAAC,SAAS,CAAC,EAAE,CAAC,EAAE,EAAE,MAAM,CAAC,GAAG,KAAK,CAAC,SAAS,CAAC,EAAE,CAAC,EAAE,EAAE,MAAM,CAAC,CAClE,CAAC;aACH;iBAAM,IAAI,MAAM,KAAK,IAAI,EAAE;gBAC1B,mBAAmB;gBACnB,WAAW,CAAC,IAAI,CAAC,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE;oBAC1B,IAAI,IAAA,eAAQ,EAAC,EAAE,CAAC,EAAE,CAAC,IAAI,IAAA,eAAQ,EAAC,EAAE,CAAC,EAAE,CAAC,EAAE;wBACtC,OAAO,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC;qBACtB;oBACD,OAAO,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,aAAa,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC;gBAC9C,CAAC,CAAC,CAAC;aACJ;iBAAM;gBACL,sBAAsB;gBACtB,WAAW,CAAC,IAAI,CACd,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,CAAE,EAAU,CAAC,IAAI,CAAC,MAAO,CAAC,GAAI,EAAU,CAAC,IAAI,CAAC,MAAO,CAAC,CAClE,CAAC;aACH;YACD,MAAM,KAAK,GACT,CAAC,UAAU,IAAI,OAAO,MAAM,KAAK,WAAW;gBAC1C,CAAC,CAAC,MAAM,CAAC,UAAU;gBACnB,CAAC,CAAE,UAAqB,CAAC;YAC7B,MAAM,MAAM,GACV,CAAC,WAAW,IAAI,OAAO,MAAM,KAAK,WAAW;gBAC3C,CAAC,CAAC,MAAM,CAAC,WAAW;gBACpB,CAAC,CAAE,WAAsB,CAAC;YAE9B,MAAM,KAAK,GAAG,CAAC,CAAC;YAChB,MAAM,GAAG,GAAG,EAAE,IAAI,EAAE,SAAS,EAAE,IAAI,EAAE,SAAS,EAAiB,CAAC;YAEhE,wDAAwD;YACxD,IAAI,SAAS,IAAI,IAAI,IAAI,SAAS,IAAI,IAAI,EAAE;gBAC1C,GAAG,CAAC,IAAI,GAAG,SAAS,CAAC;gBACrB,GAAG,CAAC,IAAI,GAAG,SAAS,CAAC;aACtB;iBAAM,IAAI,SAAS,IAAI,IAAI,IAAI,SAAS,IAAI,IAAI,EAAE;gBACjD,GAAG,CAAC,IAAI,GAAG,SAAS,CAAC;gBACrB,GAAG,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,GAAG,GAAG,CAAC,IAAI,CAAC,CAAC;aACxC;iBAAM,IAAI,SAAS,IAAI,IAAI,IAAI,SAAS,IAAI,IAAI,EAAE;gBACjD,GAAG,CAAC,IAAI,GAAG,SAAS,CAAC;gBACrB,GAAG,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,GAAG,GAAG,CAAC,IAAI,CAAC,CAAC;aACxC;iBAAM;gBACL,+HAA+H;gBAC/H,iFAAiF;gBACjF,MAAM,MAAM,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,KAAK,GAAG,MAAM,CAAC,GAAG,KAAK,CAAC,CAAC;gBACnD,GAAG,CAAC,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;gBAC9B,GAAG,CAAC,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,KAAK,GAAG,MAAM,CAAC,GAAG,MAAM,CAAC,CAAC;aAClD;YACD,GAAG,CAAC,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;YACjC,GAAG,CAAC,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;YACjC,IAAI,GAAG,CAAC,IAAI,GAAG,GAAG,CAAC,IAAI,GAAG,KAAK,EAAE;gBAC/B,4DAA4D;gBAC5D,2DAA2D;gBAC3D,MAAM,EAAE,GAAG,KAAK,CAAC,GAAG,CAAW,CAAC;gBAChC,MAAM,EAAE,GAAG,KAAK,CAAC,GAAG,CAAW,CAAC;gBAEhC,qEAAqE;gBACrE,IAAI,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,EAAE,IAAI,KAAK,EAAE;oBAC1B,KAAK,CAAC,GAAG,EAAE,EAAE,GAAG,CAAC,CAAC,CAAC;iBACpB;qBAAM,IAAI,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,EAAE,IAAI,KAAK,EAAE;oBACjC,KAAK,CAAC,GAAG,EAAE,EAAE,GAAG,CAAC,CAAC,CAAC;iBACpB;aACF;iBAAM;gBACL,+CAA+C;gBAC/C,OAAO,GAAG,CAAC,IAAI,GAAG,GAAG,CAAC,IAAI,GAAG,KAAK,EAAE;oBAClC,MAAM,EAAE,GAAG,KAAK,CAAC,GAAG,CAAW,CAAC;oBAChC,MAAM,EAAE,GAAG,KAAK,CAAC,GAAG,CAAW,CAAC;oBAEhC,gEAAgE;oBAChE,IAAI,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,EAAE,IAAI,KAAK,EAAE;wBAC1B,KAAK,CAAC,GAAG,EAAE,EAAE,GAAG,CAAC,CAAC,CAAC;qBACpB;yBAAM;wBACL,KAAK,CAAC,GAAG,EAAE,EAAE,GAAG,CAAC,CAAC,CAAC;qBACpB;iBACF;aACF;YAED,IAAI,SAAS,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,GAAG,GAAG,CAAC,IAAI,CAAC;YAChD,IAAI,UAAU,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,GAAG,GAAG,CAAC,IAAI,CAAC;YAElD,IAAI,cAAc,IAAI,gBAAgB,EAAE;gBACtC,MAAM,WAAW,GAAa,IAAA,qBAAc,EAC1C,EAAE,EACF,gBAA0B,CAC3B,CAAC;gBACF,MAAM,QAAQ,GAAa,IAAA,mBAAY,EAAC,EAAE,EAAE,aAAa,EAAE,KAAK,CAAC,CAAC;gBAClE,WAAW,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,EAAE;oBAC3B,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,EAAE;wBAChC,SAAS;wBACT,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;wBAChB,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;qBACjB;oBAED,MAAM,KAAK,GAAG,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;oBACrC,MAAM,GAAG,GAAG,QAAQ,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC;oBAElC,IAAI,KAAK,CAAC;oBACV,IAAI,KAAK,CAAC;oBAEV,IAAI,IAAA,cAAO,EAAC,GAAG,CAAC,EAAE;wBAChB,KAAK,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;wBACf,KAAK,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;qBAChB;yBAAM;wBACL,KAAK,GAAG,GAAG,CAAC;wBACZ,KAAK,GAAG,GAAG,CAAC;qBACb;oBAED,MAAM,CAAC,GACL,WAAW,KAAK,SAAS,CAAC,CAAC,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,qBAAqB,CAAC;oBAExE,MAAM,CAAC,GAAG,KAAK,GAAG,CAAC,CAAC;oBACpB,MAAM,CAAC,GAAG,KAAK,GAAG,CAAC,CAAC;oBAEpB,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC;oBACnC,UAAU,GAAG,IAAI,CAAC,GAAG,CAAC,UAAU,EAAE,CAAC,CAAC,CAAC;gBACvC,CAAC,CAAC,CAAC;aACJ;YAED,MAAM,QAAQ,GAAa,EAAE,CAAC,CAAC,uBAAuB;YAEtD,yCAAyC;YACzC,MAAM,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC;YAE9B,0CAA0C;YAC1C,MAAM,SAAS,GAAmB,EAAE,CAAC;YACrC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,WAAW,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;gBAC3C,MAAM,IAAI,GAAG,WAAW,CAAC,CAAC,CAAC,CAAC;gBAC5B,IAAI,KAAK,CAAC;gBACV,IAAI,QAAQ,EAAE;oBACZ,8BAA8B;oBAC9B,KAAK,GAAG,QAAQ,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC;iBAC1C;gBAED,IAAI,KAAK,IAAI,CAAC,KAAK,CAAC,GAAG,KAAK,SAAS,IAAI,KAAK,CAAC,GAAG,KAAK,SAAS,CAAC,EAAE;oBACjE,sCAAsC;oBACtC,MAAM,GAAG,GAAG;wBACV,GAAG,EAAE,KAAK,CAAC,GAAG;wBACd,GAAG,EAAE,KAAK,CAAC,GAAG;qBACF,CAAC;oBAEf,IAAI,GAAG,CAAC,GAAG,KAAK,SAAS,EAAE;wBACzB,kBAAkB;wBAClB,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC;wBAEZ,OAAO,IAAI,CAAC,QAAQ,EAAE,GAAG,CAAC,EAAE;4BAC1B,GAAG,CAAC,GAAG,EAAE,CAAC;yBACX;qBACF;yBAAM,IAAI,GAAG,CAAC,GAAG,KAAK,SAAS,EAAE;wBAChC,kBAAkB;wBAClB,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC;wBAEZ,OAAO,IAAI,CAAC,QAAQ,EAAE,GAAG,CAAC,EAAE;4BAC1B,GAAG,CAAC,GAAG,EAAE,CAAC;yBACX;qBACF;oBAED,SAAS,CAAC,IAAI,CAAC,EAAE,CAAC,GAAG,GAAgB,CAAC;oBACtC,GAAG,CAAC,QAAQ,EAAE,GAAG,CAAC,CAAC;iBACpB;gBACD,MAAM,CAAC,IAAI,EAAE,KAAK,EAAE,SAAS,EAAE,UAAU,EAAE,SAAS,EAAE,GAAG,EAAE,EAAE,EAAE,QAAQ,CAAC,CAAC;aAC1E;YACD,MAAM,MAAM,GAAG;gBACb,KAAK,EAAE,WAAW;gBAClB,KAAK;aACN,CAAC;YAEF,IAAI,MAAM,EAAE;gBACV,WAAW,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,EAAE;oBAC3B,KAAK,CAAC,aAAa,CAAC,IAAI,CAAC,EAAE,EAAE;wBAC3B,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC;wBACd,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC;qBACf,CAAC,CAAC;gBACL,CAAC,CAAC,CAAC;aACJ;YACD,OAAO,MAAM,CAAC;QAChB,CAAC;KAAA;CACF;AA5PD,gCA4PC;AAED,MAAM,KAAK,GAAG,CACZ,GAAmC,EACnC,GAAY,EACQ,EAAE;IACtB,IAAI,GAAuB,CAAC;IAC5B,MAAM,IAAI,GAAG,GAAG,CAAC,IAAI,IAAI,CAAC,CAAC;IAC3B,MAAM,IAAI,GAAG,GAAG,CAAC,IAAI,IAAI,CAAC,CAAC;IAC3B,IAAI,GAAG,IAAI,IAAI,EAAE;QACf,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;KAC5B;SAAM;QACL,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;QACjC,IAAI,GAAG,KAAK,GAAG,CAAC,IAAI,EAAE;YACpB,GAAG,CAAC,IAAI,GAAG,GAAG,CAAC;SAChB;aAAM;YACL,GAAG,CAAC,IAAI,GAAG,GAAG,CAAC;SAChB;KACF;IACD,OAAO,GAAG,CAAC;AACb,CAAC,CAAC;AAEF,MAAM,KAAK,GAAG,CAAC,GAAgB,EAAE,GAAY,EAAsB,EAAE;IACnE,IAAI,MAA0B,CAAC;IAC/B,MAAM,QAAQ,GAAG,GAAG,CAAC,IAAI,IAAI,CAAC,CAAC;IAC/B,MAAM,QAAQ,GAAG,GAAG,CAAC,IAAI,IAAI,CAAC,CAAC;IAC/B,IAAI,GAAG,IAAI,IAAI,EAAE;QACf,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC;KACvC;SAAM;QACL,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC;QACzC,IAAI,GAAG,KAAK,GAAG,CAAC,IAAI,EAAE;YACpB,GAAG,CAAC,IAAI,GAAG,GAAG,CAAC;SAChB;aAAM;YACL,GAAG,CAAC,IAAI,GAAG,GAAG,CAAC;SAChB;KACF;IACD,OAAO,MAAM,CAAC;AAChB,CAAC,CAAC;AAEF,MAAM,IAAI,GAAG,CAAC,QAAkB,EAAE,EAAa,EAAE,EAAE,CACjD,QAAQ,CAAC,KAAK,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,GAAG,EAAE,CAAC,IAAI,KAAK,CAAC;AAE7C,MAAM,GAAG,GAAG,CAAC,QAAkB,EAAE,EAAa,EAAE,EAAE,CAChD,CAAC,QAAQ,CAAC,KAAK,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,GAAG,EAAE,CAAC,GAAG,IAAI,CAAC,CAAC;AAE7C,MAAM,cAAc,GAAG,CAAC,GAAgB,EAAE,EAAa,EAAE,EAAE;IACzD,MAAM,IAAI,GAAG,GAAG,CAAC,IAAI,IAAI,CAAC,CAAC;IAC3B,EAAE,CAAC,GAAG,EAAE,CAAC;IACT,IAAI,EAAE,CAAC,GAAG,IAAI,IAAI,EAAE;QAClB,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC;QACX,EAAE,CAAC,GAAG,EAAE,CAAC;KACV;AACH,CAAC,CAAC;AAEF,MAAM,MAAM,GAAG,CACb,IAAa,EACb,KAAiB,EACjB,SAAiB,EACjB,UAAkB,EAClB,SAAyB,EACzB,GAAgB,EAChB,EAAa,EACb,QAAkB,EAClB,EAAE;IACF,IAAI,CAAS,CAAC;IACd,IAAI,CAAS,CAAC;IAEd,uCAAuC;IACvC,MAAM,KAAK,GAAG,SAAS,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACjC,IAAI,KAAK,EAAE;QACT,CAAC,GAAG,KAAK,CAAC,GAAG,GAAG,SAAS,GAAG,SAAS,GAAG,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;QACrD,CAAC,GAAG,KAAK,CAAC,GAAG,GAAG,UAAU,GAAG,UAAU,GAAG,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;KACxD;SAAM;QACL,8BAA8B;QAE9B,OAAO,IAAI,CAAC,QAAQ,EAAE,EAAE,CAAC,EAAE;YACzB,cAAc,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC;SACzB;QAED,CAAC,GAAG,EAAE,CAAC,GAAG,GAAG,SAAS,GAAG,SAAS,GAAG,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;QAClD,CAAC,GAAG,EAAE,CAAC,GAAG,GAAG,UAAU,GAAG,UAAU,GAAG,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;QACpD,GAAG,CAAC,QAAQ,EAAE,EAAE,CAAC,CAAC;QAElB,cAAc,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC;KACzB;IACD,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;IAChB,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;AAClB,CAAC,CAAC"}
|
package/lib/index.d.ts
CHANGED
|
@@ -1,16 +1,2 @@
|
|
|
1
|
-
export * from './
|
|
1
|
+
export * from './exports';
|
|
2
2
|
export * from './supervisor';
|
|
3
|
-
export * from './registry';
|
|
4
|
-
export * from './grid';
|
|
5
|
-
export * from './random';
|
|
6
|
-
export * from './mds';
|
|
7
|
-
export * from './concentric';
|
|
8
|
-
export * from './radial';
|
|
9
|
-
export * from './fruchterman';
|
|
10
|
-
export * from './d3Force';
|
|
11
|
-
export * from './force';
|
|
12
|
-
export * from './forceAtlas2';
|
|
13
|
-
export * from './dagre';
|
|
14
|
-
export * from './comboCombined';
|
|
15
|
-
export * from './types';
|
|
16
|
-
export * from './util';
|
package/lib/index.js
CHANGED
|
@@ -1,17 +1,6 @@
|
|
|
1
|
-
|
|
2
|
-
|
|
3
|
-
|
|
4
|
-
|
|
5
|
-
|
|
6
|
-
export * from './mds';
|
|
7
|
-
export * from './concentric';
|
|
8
|
-
export * from './radial';
|
|
9
|
-
export * from './fruchterman';
|
|
10
|
-
export * from './d3Force';
|
|
11
|
-
export * from './force';
|
|
12
|
-
export * from './forceAtlas2';
|
|
13
|
-
export * from './dagre';
|
|
14
|
-
export * from './comboCombined';
|
|
15
|
-
export * from './types';
|
|
16
|
-
export * from './util';
|
|
1
|
+
"use strict";
|
|
2
|
+
Object.defineProperty(exports, "__esModule", { value: true });
|
|
3
|
+
const tslib_1 = require("tslib");
|
|
4
|
+
tslib_1.__exportStar(require("./exports"), exports);
|
|
5
|
+
tslib_1.__exportStar(require("./supervisor"), exports);
|
|
17
6
|
//# sourceMappingURL=index.js.map
|
package/lib/index.js.map
CHANGED
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"index.js","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA,
|
|
1
|
+
{"version":3,"file":"index.js","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":";;;AAAA,oDAA0B;AAC1B,uDAA6B"}
|
package/lib/mds.d.ts
CHANGED