@antv/layout 1.2.13 → 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.
Files changed (238) hide show
  1. package/dist/85db61ddc757dae66e04.worker.js +2 -0
  2. package/dist/85db61ddc757dae66e04.worker.js.map +1 -0
  3. package/dist/index.min.js +1 -1
  4. package/dist/index.min.js.map +1 -1
  5. package/lib/{dagre → antv-dagre}/acyclic.d.ts +1 -1
  6. package/lib/antv-dagre/acyclic.js +65 -0
  7. package/lib/antv-dagre/acyclic.js.map +1 -0
  8. package/lib/antv-dagre/add-border-segments.js +41 -0
  9. package/lib/antv-dagre/add-border-segments.js.map +1 -0
  10. package/lib/{dagre → antv-dagre}/coordinate-system.d.ts +2 -1
  11. package/lib/antv-dagre/coordinate-system.js +69 -0
  12. package/lib/antv-dagre/coordinate-system.js.map +1 -0
  13. package/lib/{dagre → antv-dagre}/data/list.d.ts +1 -1
  14. package/lib/{dagre → antv-dagre}/data/list.js +23 -22
  15. package/lib/antv-dagre/data/list.js.map +1 -0
  16. package/lib/{dagre → antv-dagre}/greedy-fas.d.ts +2 -2
  17. package/lib/antv-dagre/greedy-fas.js +141 -0
  18. package/lib/antv-dagre/greedy-fas.js.map +1 -0
  19. package/lib/{dagre → antv-dagre}/layout.d.ts +2 -1
  20. package/lib/{dagre → antv-dagre}/layout.js +156 -154
  21. package/lib/antv-dagre/layout.js.map +1 -0
  22. package/lib/{dagre → antv-dagre}/nesting-graph.js +42 -39
  23. package/lib/antv-dagre/nesting-graph.js.map +1 -0
  24. package/lib/{dagre → antv-dagre}/normalize.d.ts +2 -2
  25. package/lib/{dagre → antv-dagre}/normalize.js +29 -25
  26. package/lib/antv-dagre/normalize.js.map +1 -0
  27. package/lib/{dagre → antv-dagre}/order/add-subgraph-constraints.js +13 -9
  28. package/lib/antv-dagre/order/add-subgraph-constraints.js.map +1 -0
  29. package/lib/{dagre → antv-dagre}/order/barycenter.d.ts +2 -2
  30. package/lib/antv-dagre/order/barycenter.js +27 -0
  31. package/lib/antv-dagre/order/barycenter.js.map +1 -0
  32. package/lib/{dagre → antv-dagre}/order/build-layer-graph.js +23 -23
  33. package/lib/antv-dagre/order/build-layer-graph.js.map +1 -0
  34. package/lib/antv-dagre/order/cross-count.d.ts +3 -0
  35. package/lib/{dagre → antv-dagre}/order/cross-count.js +21 -17
  36. package/lib/antv-dagre/order/cross-count.js.map +1 -0
  37. package/lib/{dagre → antv-dagre}/order/index.d.ts +1 -1
  38. package/lib/antv-dagre/order/index.js +95 -0
  39. package/lib/antv-dagre/order/index.js.map +1 -0
  40. package/lib/{dagre → antv-dagre}/order/init-data-order.js +12 -9
  41. package/lib/antv-dagre/order/init-data-order.js.map +1 -0
  42. package/lib/antv-dagre/order/init-order.js +51 -0
  43. package/lib/antv-dagre/order/init-order.js.map +1 -0
  44. package/lib/{dagre → antv-dagre}/order/resolve-conflicts.d.ts +3 -3
  45. package/lib/{dagre → antv-dagre}/order/resolve-conflicts.js +35 -36
  46. package/lib/antv-dagre/order/resolve-conflicts.js.map +1 -0
  47. package/lib/{dagre → antv-dagre}/order/sort-subgraph.js +28 -23
  48. package/lib/antv-dagre/order/sort-subgraph.js.map +1 -0
  49. package/lib/{dagre → antv-dagre}/order/sort.d.ts +2 -2
  50. package/lib/{dagre → antv-dagre}/order/sort.js +23 -19
  51. package/lib/antv-dagre/order/sort.js.map +1 -0
  52. package/lib/{dagre → antv-dagre}/parent-dummy-chains.js +32 -28
  53. package/lib/antv-dagre/parent-dummy-chains.js.map +1 -0
  54. package/lib/{dagre → antv-dagre}/position/bk.d.ts +5 -4
  55. package/lib/{dagre → antv-dagre}/position/bk.js +162 -148
  56. package/lib/antv-dagre/position/bk.js.map +1 -0
  57. package/lib/{dagre → antv-dagre}/position/index.d.ts +2 -1
  58. package/lib/antv-dagre/position/index.js +55 -0
  59. package/lib/antv-dagre/position/index.js.map +1 -0
  60. package/lib/{dagre → antv-dagre}/rank/feasible-tree.d.ts +2 -2
  61. package/lib/{dagre → antv-dagre}/rank/feasible-tree.js +42 -38
  62. package/lib/antv-dagre/rank/feasible-tree.js.map +1 -0
  63. package/lib/antv-dagre/rank/index.d.ts +2 -0
  64. package/lib/{dagre → antv-dagre}/rank/index.js +17 -13
  65. package/lib/antv-dagre/rank/index.js.map +1 -0
  66. package/lib/{dagre → antv-dagre}/rank/network-simplex.d.ts +2 -2
  67. package/lib/{dagre → antv-dagre}/rank/network-simplex.js +90 -81
  68. package/lib/antv-dagre/rank/network-simplex.js.map +1 -0
  69. package/lib/{dagre → antv-dagre}/rank/util.d.ts +2 -2
  70. package/lib/{dagre → antv-dagre}/rank/util.js +37 -32
  71. package/lib/antv-dagre/rank/util.js.map +1 -0
  72. package/lib/antv-dagre/types.d.ts +2 -0
  73. package/lib/antv-dagre/types.js +3 -0
  74. package/lib/antv-dagre/types.js.map +1 -0
  75. package/lib/{dagre → antv-dagre}/util.d.ts +1 -1
  76. package/lib/antv-dagre/util.js +299 -0
  77. package/lib/antv-dagre/util.js.map +1 -0
  78. package/lib/antv-dagre.d.ts +50 -0
  79. package/lib/antv-dagre.js +542 -0
  80. package/lib/antv-dagre.js.map +1 -0
  81. package/lib/bundle-entry.d.ts +2 -18
  82. package/lib/bundle-entry.js +5 -18
  83. package/lib/bundle-entry.js.map +1 -1
  84. package/lib/bundle-supervisor.d.ts +4 -22
  85. package/lib/bundle-supervisor.js +59 -54
  86. package/lib/bundle-supervisor.js.map +1 -1
  87. package/lib/bundle-worker.d.ts +1 -1
  88. package/lib/bundle-worker.js +38 -35
  89. package/lib/bundle-worker.js.map +1 -1
  90. package/lib/circular.d.ts +1 -1
  91. package/lib/circular.js +133 -145
  92. package/lib/circular.js.map +1 -1
  93. package/lib/comboCombined.d.ts +1 -1
  94. package/lib/comboCombined.js +273 -299
  95. package/lib/comboCombined.js.map +1 -1
  96. package/lib/concentric.d.ts +1 -1
  97. package/lib/concentric.js +173 -179
  98. package/lib/concentric.js.map +1 -1
  99. package/lib/d3Force/forceInBox.js +80 -78
  100. package/lib/d3Force/forceInBox.js.map +1 -1
  101. package/lib/d3Force/index.d.ts +2 -2
  102. package/lib/d3Force/index.js +207 -229
  103. package/lib/d3Force/index.js.map +1 -1
  104. package/lib/dagre.d.ts +13 -24
  105. package/lib/dagre.js +61 -542
  106. package/lib/dagre.js.map +1 -1
  107. package/lib/exports.d.ts +17 -0
  108. package/lib/exports.js +20 -0
  109. package/lib/exports.js.map +1 -0
  110. package/lib/force/forceNBody.js +48 -47
  111. package/lib/force/forceNBody.js.map +1 -1
  112. package/lib/force/index.d.ts +1 -1
  113. package/lib/force/index.js +301 -324
  114. package/lib/force/index.js.map +1 -1
  115. package/lib/force/types.d.ts +5 -5
  116. package/lib/force/types.js +2 -1
  117. package/lib/forceAtlas2/body.d.ts +1 -1
  118. package/lib/forceAtlas2/body.js +32 -31
  119. package/lib/forceAtlas2/body.js.map +1 -1
  120. package/lib/forceAtlas2/index.d.ts +1 -1
  121. package/lib/forceAtlas2/index.js +219 -227
  122. package/lib/forceAtlas2/index.js.map +1 -1
  123. package/lib/forceAtlas2/quad.d.ts +2 -2
  124. package/lib/forceAtlas2/quad.js +43 -42
  125. package/lib/forceAtlas2/quad.js.map +1 -1
  126. package/lib/forceAtlas2/quadTree.js +19 -17
  127. package/lib/forceAtlas2/quadTree.js.map +1 -1
  128. package/lib/fruchterman.d.ts +1 -1
  129. package/lib/fruchterman.js +203 -219
  130. package/lib/fruchterman.js.map +1 -1
  131. package/lib/grid.d.ts +1 -1
  132. package/lib/grid.js +201 -207
  133. package/lib/grid.js.map +1 -1
  134. package/lib/index.d.ts +1 -15
  135. package/lib/index.js +5 -16
  136. package/lib/index.js.map +1 -1
  137. package/lib/mds.d.ts +1 -1
  138. package/lib/mds.js +73 -79
  139. package/lib/mds.js.map +1 -1
  140. package/lib/radial/index.d.ts +1 -1
  141. package/lib/radial/index.js +183 -186
  142. package/lib/radial/index.js.map +1 -1
  143. package/lib/radial/mds.d.ts +1 -1
  144. package/lib/radial/mds.js +20 -14
  145. package/lib/radial/mds.js.map +1 -1
  146. package/lib/radial/radial-nonoverlap-force.d.ts +2 -2
  147. package/lib/radial/radial-nonoverlap-force.js +40 -37
  148. package/lib/radial/radial-nonoverlap-force.js.map +1 -1
  149. package/lib/random.d.ts +1 -1
  150. package/lib/random.js +57 -66
  151. package/lib/random.js.map +1 -1
  152. package/lib/registry.d.ts +2 -2
  153. package/lib/registry.js +30 -25
  154. package/lib/registry.js.map +1 -1
  155. package/lib/supervisor.d.ts +2 -3
  156. package/lib/supervisor.js +63 -58
  157. package/lib/supervisor.js.map +1 -1
  158. package/lib/types.d.ts +20 -75
  159. package/lib/types.js +5 -1
  160. package/lib/types.js.map +1 -1
  161. package/lib/util/array.js +4 -1
  162. package/lib/util/array.js.map +1 -1
  163. package/lib/util/common.d.ts +1 -1
  164. package/lib/util/common.js +11 -8
  165. package/lib/util/common.js.map +1 -1
  166. package/lib/util/function.js +41 -37
  167. package/lib/util/function.js.map +1 -1
  168. package/lib/util/index.d.ts +0 -2
  169. package/lib/util/index.js +7 -6
  170. package/lib/util/index.js.map +1 -1
  171. package/lib/util/math.d.ts +1 -26
  172. package/lib/util/math.js +55 -154
  173. package/lib/util/math.js.map +1 -1
  174. package/lib/util/object.d.ts +1 -1
  175. package/lib/util/object.js +20 -15
  176. package/lib/util/object.js.map +1 -1
  177. package/lib/util/size.d.ts +3 -0
  178. package/lib/util/size.js +16 -0
  179. package/lib/util/size.js.map +1 -0
  180. package/lib/worker.js +36 -35
  181. package/lib/worker.js.map +1 -1
  182. package/package.json +10 -6
  183. package/dist/aa1bb0ccc06b11cf79c1.worker.js +0 -2
  184. package/dist/aa1bb0ccc06b11cf79c1.worker.js.map +0 -1
  185. package/lib/dagre/acyclic.js +0 -62
  186. package/lib/dagre/acyclic.js.map +0 -1
  187. package/lib/dagre/add-border-segments.js +0 -37
  188. package/lib/dagre/add-border-segments.js.map +0 -1
  189. package/lib/dagre/coordinate-system.js +0 -65
  190. package/lib/dagre/coordinate-system.js.map +0 -1
  191. package/lib/dagre/data/list.js.map +0 -1
  192. package/lib/dagre/greedy-fas.js +0 -147
  193. package/lib/dagre/greedy-fas.js.map +0 -1
  194. package/lib/dagre/layout.js.map +0 -1
  195. package/lib/dagre/nesting-graph.js.map +0 -1
  196. package/lib/dagre/normalize.js.map +0 -1
  197. package/lib/dagre/order/add-subgraph-constraints.js.map +0 -1
  198. package/lib/dagre/order/barycenter.js +0 -23
  199. package/lib/dagre/order/barycenter.js.map +0 -1
  200. package/lib/dagre/order/build-layer-graph.js.map +0 -1
  201. package/lib/dagre/order/cross-count.d.ts +0 -3
  202. package/lib/dagre/order/cross-count.js.map +0 -1
  203. package/lib/dagre/order/index.js +0 -91
  204. package/lib/dagre/order/index.js.map +0 -1
  205. package/lib/dagre/order/init-data-order.js.map +0 -1
  206. package/lib/dagre/order/init-order.js +0 -50
  207. package/lib/dagre/order/init-order.js.map +0 -1
  208. package/lib/dagre/order/resolve-conflicts.js.map +0 -1
  209. package/lib/dagre/order/sort-subgraph.js.map +0 -1
  210. package/lib/dagre/order/sort.js.map +0 -1
  211. package/lib/dagre/parent-dummy-chains.js.map +0 -1
  212. package/lib/dagre/position/bk.js.map +0 -1
  213. package/lib/dagre/position/index.js +0 -54
  214. package/lib/dagre/position/index.js.map +0 -1
  215. package/lib/dagre/rank/feasible-tree.js.map +0 -1
  216. package/lib/dagre/rank/index.d.ts +0 -2
  217. package/lib/dagre/rank/index.js.map +0 -1
  218. package/lib/dagre/rank/network-simplex.js.map +0 -1
  219. package/lib/dagre/rank/util.js.map +0 -1
  220. package/lib/dagre/util.js +0 -289
  221. package/lib/dagre/util.js.map +0 -1
  222. package/lib/util/gpu.d.ts +0 -45
  223. package/lib/util/gpu.js +0 -214
  224. package/lib/util/gpu.js.map +0 -1
  225. package/lib/util/number.d.ts +0 -1
  226. package/lib/util/number.js +0 -5
  227. package/lib/util/number.js.map +0 -1
  228. package/lib/util/string.d.ts +0 -1
  229. package/lib/util/string.js +0 -15
  230. package/lib/util/string.js.map +0 -1
  231. /package/lib/{dagre → antv-dagre}/add-border-segments.d.ts +0 -0
  232. /package/lib/{dagre → antv-dagre}/nesting-graph.d.ts +0 -0
  233. /package/lib/{dagre → antv-dagre}/order/add-subgraph-constraints.d.ts +0 -0
  234. /package/lib/{dagre → antv-dagre}/order/build-layer-graph.d.ts +0 -0
  235. /package/lib/{dagre → antv-dagre}/order/init-data-order.d.ts +0 -0
  236. /package/lib/{dagre → antv-dagre}/order/init-order.d.ts +0 -0
  237. /package/lib/{dagre → antv-dagre}/order/sort-subgraph.d.ts +0 -0
  238. /package/lib/{dagre → antv-dagre}/parent-dummy-chains.d.ts +0 -0
package/lib/mds.js CHANGED
@@ -1,8 +1,11 @@
1
- import { __assign, __awaiter, __generator } from "tslib";
2
- import { Matrix as MLMatrix, SingularValueDecomposition } from "ml-matrix";
3
- import { cloneFormatData, floydWarshall, getAdjMatrix, scaleMatrix, } from "./util";
4
- import { handleSingleNodeGraph } from "./util/common";
5
- var DEFAULTS_LAYOUT_OPTIONS = {
1
+ "use strict";
2
+ Object.defineProperty(exports, "__esModule", { value: true });
3
+ exports.MDSLayout = void 0;
4
+ const tslib_1 = require("tslib");
5
+ const ml_matrix_1 = require("ml-matrix");
6
+ const util_1 = require("./util");
7
+ const common_1 = require("./util/common");
8
+ const DEFAULTS_LAYOUT_OPTIONS = {
6
9
  center: [0, 0],
7
10
  linkDistance: 50,
8
11
  };
@@ -21,80 +24,71 @@ var DEFAULTS_LAYOUT_OPTIONS = {
21
24
  * // If you want to assign the positions directly to the nodes, use assign method.
22
25
  * await layout.assign(graph, { center: [100, 100] });
23
26
  */
24
- var MDSLayout = /** @class */ (function () {
25
- function MDSLayout(options) {
26
- if (options === void 0) { options = {}; }
27
+ class MDSLayout {
28
+ constructor(options = {}) {
27
29
  this.options = options;
28
- this.id = "mds";
29
- this.options = __assign(__assign({}, DEFAULTS_LAYOUT_OPTIONS), options);
30
+ this.id = 'mds';
31
+ this.options = Object.assign(Object.assign({}, DEFAULTS_LAYOUT_OPTIONS), options);
30
32
  }
31
33
  /**
32
34
  * Return the positions of nodes and edges(if needed).
33
35
  */
34
- MDSLayout.prototype.execute = function (graph, options) {
35
- return __awaiter(this, void 0, void 0, function () {
36
- return __generator(this, function (_a) {
37
- return [2 /*return*/, this.genericMDSLayout(false, graph, options)];
38
- });
36
+ execute(graph, options) {
37
+ return tslib_1.__awaiter(this, void 0, void 0, function* () {
38
+ return this.genericMDSLayout(false, graph, options);
39
39
  });
40
- };
40
+ }
41
41
  /**
42
42
  * To directly assign the positions to the nodes.
43
43
  */
44
- MDSLayout.prototype.assign = function (graph, options) {
45
- return __awaiter(this, void 0, void 0, function () {
46
- return __generator(this, function (_a) {
47
- this.genericMDSLayout(true, graph, options);
48
- return [2 /*return*/];
49
- });
44
+ assign(graph, options) {
45
+ return tslib_1.__awaiter(this, void 0, void 0, function* () {
46
+ this.genericMDSLayout(true, graph, options);
50
47
  });
51
- };
52
- MDSLayout.prototype.genericMDSLayout = function (assign, graph, options) {
53
- return __awaiter(this, void 0, void 0, function () {
54
- var mergedOptions, _a, center, _b, linkDistance, nodes, edges, adjMatrix, distances, scaledD, positions, layoutNodes, result;
55
- return __generator(this, function (_c) {
56
- mergedOptions = __assign(__assign({}, this.options), options);
57
- _a = mergedOptions.center, center = _a === void 0 ? [0, 0] : _a, _b = mergedOptions.linkDistance, linkDistance = _b === void 0 ? 50 : _b;
58
- nodes = graph.getAllNodes();
59
- edges = graph.getAllEdges();
60
- if (!(nodes === null || nodes === void 0 ? void 0 : nodes.length) || nodes.length === 1) {
61
- return [2 /*return*/, handleSingleNodeGraph(graph, assign, center)];
62
- }
63
- adjMatrix = getAdjMatrix({ nodes: nodes, edges: edges }, false);
64
- distances = floydWarshall(adjMatrix);
65
- handleInfinity(distances);
66
- scaledD = scaleMatrix(distances, linkDistance);
67
- positions = runMDS(scaledD);
68
- layoutNodes = [];
69
- positions.forEach(function (p, i) {
70
- var cnode = cloneFormatData(nodes[i]);
71
- cnode.data.x = p[0] + center[0];
72
- cnode.data.y = p[1] + center[1];
73
- layoutNodes.push(cnode);
74
- });
75
- if (assign) {
76
- layoutNodes.forEach(function (node) {
77
- return graph.mergeNodeData(node.id, {
78
- x: node.data.x,
79
- y: node.data.y,
80
- });
81
- });
82
- }
83
- result = {
84
- nodes: layoutNodes,
85
- edges: edges,
86
- };
87
- return [2 /*return*/, result];
48
+ }
49
+ genericMDSLayout(assign, graph, options) {
50
+ return tslib_1.__awaiter(this, void 0, void 0, function* () {
51
+ const mergedOptions = Object.assign(Object.assign({}, this.options), options);
52
+ const { center = [0, 0], linkDistance = 50 } = mergedOptions;
53
+ const nodes = graph.getAllNodes();
54
+ const edges = graph.getAllEdges();
55
+ if (!(nodes === null || nodes === void 0 ? void 0 : nodes.length) || nodes.length === 1) {
56
+ return (0, common_1.handleSingleNodeGraph)(graph, assign, center);
57
+ }
58
+ // the graph-theoretic distance (shortest path distance) matrix
59
+ const adjMatrix = (0, util_1.getAdjMatrix)({ nodes, edges }, false);
60
+ const distances = (0, util_1.floydWarshall)(adjMatrix);
61
+ handleInfinity(distances);
62
+ // scale the ideal edge length acoording to linkDistance
63
+ const scaledD = (0, util_1.scaleMatrix)(distances, linkDistance);
64
+ // get positions by MDS
65
+ const positions = runMDS(scaledD);
66
+ const layoutNodes = [];
67
+ positions.forEach((p, i) => {
68
+ const cnode = (0, util_1.cloneFormatData)(nodes[i]);
69
+ cnode.data.x = p[0] + center[0];
70
+ cnode.data.y = p[1] + center[1];
71
+ layoutNodes.push(cnode);
88
72
  });
73
+ if (assign) {
74
+ layoutNodes.forEach((node) => graph.mergeNodeData(node.id, {
75
+ x: node.data.x,
76
+ y: node.data.y,
77
+ }));
78
+ }
79
+ const result = {
80
+ nodes: layoutNodes,
81
+ edges,
82
+ };
83
+ return result;
89
84
  });
90
- };
91
- return MDSLayout;
92
- }());
93
- export { MDSLayout };
94
- var handleInfinity = function (distances) {
95
- var maxDistance = -999999;
96
- distances.forEach(function (row) {
97
- row.forEach(function (value) {
85
+ }
86
+ }
87
+ exports.MDSLayout = MDSLayout;
88
+ const handleInfinity = (distances) => {
89
+ let maxDistance = -999999;
90
+ distances.forEach((row) => {
91
+ row.forEach((value) => {
98
92
  if (value === Infinity) {
99
93
  return;
100
94
  }
@@ -103,8 +97,8 @@ var handleInfinity = function (distances) {
103
97
  }
104
98
  });
105
99
  });
106
- distances.forEach(function (row, i) {
107
- row.forEach(function (value, j) {
100
+ distances.forEach((row, i) => {
101
+ row.forEach((value, j) => {
108
102
  if (value === Infinity) {
109
103
  distances[i][j] = maxDistance;
110
104
  }
@@ -115,21 +109,21 @@ var handleInfinity = function (distances) {
115
109
  * mds 算法
116
110
  * @return {array} positions 计算后的节点位置数组
117
111
  */
118
- var runMDS = function (distances) {
119
- var dimension = 2;
112
+ const runMDS = (distances) => {
113
+ const dimension = 2;
120
114
  // square distances
121
- var M = MLMatrix.mul(MLMatrix.pow(distances, 2), -0.5);
115
+ const M = ml_matrix_1.Matrix.mul(ml_matrix_1.Matrix.pow(distances, 2), -0.5);
122
116
  // double centre the rows/columns
123
- var rowMeans = M.mean("row");
124
- var colMeans = M.mean("column");
125
- var totalMean = M.mean();
117
+ const rowMeans = M.mean('row');
118
+ const colMeans = M.mean('column');
119
+ const totalMean = M.mean();
126
120
  M.add(totalMean).subRowVector(rowMeans).subColumnVector(colMeans);
127
121
  // take the SVD of the double centred matrix, and return the
128
122
  // points from it
129
- var ret = new SingularValueDecomposition(M);
130
- var eigenValues = MLMatrix.sqrt(ret.diagonalMatrix).diagonal();
131
- return ret.leftSingularVectors.toJSON().map(function (row) {
132
- return MLMatrix.mul([row], [eigenValues])
123
+ const ret = new ml_matrix_1.SingularValueDecomposition(M);
124
+ const eigenValues = ml_matrix_1.Matrix.sqrt(ret.diagonalMatrix).diagonal();
125
+ return ret.leftSingularVectors.toJSON().map((row) => {
126
+ return ml_matrix_1.Matrix.mul([row], [eigenValues])
133
127
  .toJSON()[0]
134
128
  .splice(0, dimension);
135
129
  });
package/lib/mds.js.map CHANGED
@@ -1 +1 @@
1
- {"version":3,"file":"mds.js","sourceRoot":"","sources":["../src/mds.ts"],"names":[],"mappings":";AAAA,OAAO,EAAE,MAAM,IAAI,QAAQ,EAAE,0BAA0B,EAAE,MAAM,WAAW,CAAC;AAU3E,OAAO,EACL,eAAe,EACf,aAAa,EACb,YAAY,EACZ,WAAW,GACZ,MAAM,QAAQ,CAAC;AAChB,OAAO,EAAE,qBAAqB,EAAE,MAAM,eAAe,CAAC;AAEtD,IAAM,uBAAuB,GAA8B;IACzD,MAAM,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC;IACd,YAAY,EAAE,EAAE;CACjB,CAAC;AAEF;;;;;;;;;;;;;;GAcG;AACH;IAGE,mBAAmB,OAAkD;QAAlD,wBAAA,EAAA,UAA4B,EAAsB;QAAlD,YAAO,GAAP,OAAO,CAA2C;QAFrE,OAAE,GAAG,KAAK,CAAC;QAGT,IAAI,CAAC,OAAO,yBACP,uBAAuB,GACvB,OAAO,CACX,CAAC;IACJ,CAAC;IAED;;OAEG;IACG,2BAAO,GAAb,UAAc,KAAY,EAAE,OAA0B;;;gBACpD,sBAAO,IAAI,CAAC,gBAAgB,CAAC,KAAK,EAAE,KAAK,EAAE,OAAO,CAAC,EAAC;;;KACrD;IACD;;OAEG;IACG,0BAAM,GAAZ,UAAa,KAAY,EAAE,OAA0B;;;gBACnD,IAAI,CAAC,gBAAgB,CAAC,IAAI,EAAE,KAAK,EAAE,OAAO,CAAC,CAAC;;;;KAC7C;IAYa,oCAAgB,GAA9B,UACE,MAAe,EACf,KAAY,EACZ,OAA0B;;;;gBAEpB,aAAa,yBAAQ,IAAI,CAAC,OAAO,GAAK,OAAO,CAAE,CAAC;gBAC9C,KAAuC,aAAa,OAArC,EAAf,MAAM,mBAAG,CAAC,CAAC,EAAE,CAAC,CAAC,KAAA,EAAE,KAAsB,aAAa,aAAlB,EAAjB,YAAY,mBAAG,EAAE,KAAA,CAAmB;gBAEvD,KAAK,GAAG,KAAK,CAAC,WAAW,EAAE,CAAC;gBAC5B,KAAK,GAAG,KAAK,CAAC,WAAW,EAAE,CAAC;gBAElC,IAAI,CAAC,CAAA,KAAK,aAAL,KAAK,uBAAL,KAAK,CAAE,MAAM,CAAA,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE;oBACxC,sBAAO,qBAAqB,CAAC,KAAK,EAAE,MAAM,EAAE,MAAM,CAAC,EAAC;iBACrD;gBAGK,SAAS,GAAG,YAAY,CAAC,EAAE,KAAK,OAAA,EAAE,KAAK,OAAA,EAAE,EAAE,KAAK,CAAC,CAAC;gBAClD,SAAS,GAAG,aAAa,CAAC,SAAS,CAAC,CAAC;gBAC3C,cAAc,CAAC,SAAS,CAAC,CAAC;gBAGpB,OAAO,GAAG,WAAW,CAAC,SAAS,EAAE,YAAY,CAAC,CAAC;gBAG/C,SAAS,GAAG,MAAM,CAAC,OAAO,CAAC,CAAC;gBAC5B,WAAW,GAAc,EAAE,CAAC;gBAClC,SAAS,CAAC,OAAO,CAAC,UAAC,CAAW,EAAE,CAAS;oBACvC,IAAM,KAAK,GAAG,eAAe,CAAC,KAAK,CAAC,CAAC,CAAC,CAAY,CAAC;oBACnD,KAAK,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;oBAChC,KAAK,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;oBAChC,WAAW,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;gBAC1B,CAAC,CAAC,CAAC;gBAEH,IAAI,MAAM,EAAE;oBACV,WAAW,CAAC,OAAO,CAAC,UAAC,IAAI;wBACvB,OAAA,KAAK,CAAC,aAAa,CAAC,IAAI,CAAC,EAAE,EAAE;4BAC3B,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC;4BACd,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC;yBACf,CAAC;oBAHF,CAGE,CACH,CAAC;iBACH;gBAEK,MAAM,GAAG;oBACb,KAAK,EAAE,WAAW;oBAClB,KAAK,OAAA;iBACN,CAAC;gBAEF,sBAAO,MAAM,EAAC;;;KACf;IACH,gBAAC;AAAD,CAAC,AAlFD,IAkFC;;AAED,IAAM,cAAc,GAAG,UAAC,SAAmB;IACzC,IAAI,WAAW,GAAG,CAAC,MAAM,CAAC;IAC1B,SAAS,CAAC,OAAO,CAAC,UAAC,GAAG;QACpB,GAAG,CAAC,OAAO,CAAC,UAAC,KAAK;YAChB,IAAI,KAAK,KAAK,QAAQ,EAAE;gBACtB,OAAO;aACR;YACD,IAAI,WAAW,GAAG,KAAK,EAAE;gBACvB,WAAW,GAAG,KAAK,CAAC;aACrB;QACH,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IACH,SAAS,CAAC,OAAO,CAAC,UAAC,GAAG,EAAE,CAAC;QACvB,GAAG,CAAC,OAAO,CAAC,UAAC,KAAK,EAAE,CAAC;YACnB,IAAI,KAAK,KAAK,QAAQ,EAAE;gBACtB,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,WAAW,CAAC;aAC/B;QACH,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;AACL,CAAC,CAAC;AAEF;;;GAGG;AACH,IAAM,MAAM,GAAG,UAAC,SAAmB;IACjC,IAAM,SAAS,GAAG,CAAC,CAAC;IAEpB,mBAAmB;IACnB,IAAM,CAAC,GAAG,QAAQ,CAAC,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,SAAS,EAAE,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC;IAEzD,iCAAiC;IACjC,IAAM,QAAQ,GAAG,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAC/B,IAAM,QAAQ,GAAG,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;IAClC,IAAM,SAAS,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC;IAC3B,CAAC,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC,YAAY,CAAC,QAAQ,CAAC,CAAC,eAAe,CAAC,QAAQ,CAAC,CAAC;IAElE,4DAA4D;IAC5D,iBAAiB;IACjB,IAAM,GAAG,GAAG,IAAI,0BAA0B,CAAC,CAAC,CAAC,CAAC;IAC9C,IAAM,WAAW,GAAG,QAAQ,CAAC,IAAI,CAAC,GAAG,CAAC,cAAc,CAAC,CAAC,QAAQ,EAAE,CAAC;IACjE,OAAO,GAAG,CAAC,mBAAmB,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,UAAC,GAAa;QACxD,OAAO,QAAQ,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,WAAW,CAAC,CAAC;aACtC,MAAM,EAAE,CAAC,CAAC,CAAC;aACX,MAAM,CAAC,CAAC,EAAE,SAAS,CAAe,CAAC;IACxC,CAAC,CAAC,CAAC;AACL,CAAC,CAAC"}
1
+ {"version":3,"file":"mds.js","sourceRoot":"","sources":["../src/mds.ts"],"names":[],"mappings":";;;;AAAA,yCAA2E;AAU3E,iCAKgB;AAChB,0CAAsD;AAEtD,MAAM,uBAAuB,GAA8B;IACzD,MAAM,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC;IACd,YAAY,EAAE,EAAE;CACjB,CAAC;AAEF;;;;;;;;;;;;;;GAcG;AACH,MAAa,SAAS;IAGpB,YAAmB,UAA4B,EAAsB;QAAlD,YAAO,GAAP,OAAO,CAA2C;QAFrE,OAAE,GAAG,KAAK,CAAC;QAGT,IAAI,CAAC,OAAO,mCACP,uBAAuB,GACvB,OAAO,CACX,CAAC;IACJ,CAAC;IAED;;OAEG;IACG,OAAO,CAAC,KAAY,EAAE,OAA0B;;YACpD,OAAO,IAAI,CAAC,gBAAgB,CAAC,KAAK,EAAE,KAAK,EAAE,OAAO,CAAC,CAAC;QACtD,CAAC;KAAA;IACD;;OAEG;IACG,MAAM,CAAC,KAAY,EAAE,OAA0B;;YACnD,IAAI,CAAC,gBAAgB,CAAC,IAAI,EAAE,KAAK,EAAE,OAAO,CAAC,CAAC;QAC9C,CAAC;KAAA;IAYa,gBAAgB,CAC5B,MAAe,EACf,KAAY,EACZ,OAA0B;;YAE1B,MAAM,aAAa,mCAAQ,IAAI,CAAC,OAAO,GAAK,OAAO,CAAE,CAAC;YACtD,MAAM,EAAE,MAAM,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,YAAY,GAAG,EAAE,EAAE,GAAG,aAAa,CAAC;YAE7D,MAAM,KAAK,GAAG,KAAK,CAAC,WAAW,EAAE,CAAC;YAClC,MAAM,KAAK,GAAG,KAAK,CAAC,WAAW,EAAE,CAAC;YAElC,IAAI,CAAC,CAAA,KAAK,aAAL,KAAK,uBAAL,KAAK,CAAE,MAAM,CAAA,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE;gBACxC,OAAO,IAAA,8BAAqB,EAAC,KAAK,EAAE,MAAM,EAAE,MAAM,CAAC,CAAC;aACrD;YAED,+DAA+D;YAC/D,MAAM,SAAS,GAAG,IAAA,mBAAY,EAAC,EAAE,KAAK,EAAE,KAAK,EAAE,EAAE,KAAK,CAAC,CAAC;YACxD,MAAM,SAAS,GAAG,IAAA,oBAAa,EAAC,SAAS,CAAC,CAAC;YAC3C,cAAc,CAAC,SAAS,CAAC,CAAC;YAE1B,wDAAwD;YACxD,MAAM,OAAO,GAAG,IAAA,kBAAW,EAAC,SAAS,EAAE,YAAY,CAAC,CAAC;YAErD,uBAAuB;YACvB,MAAM,SAAS,GAAG,MAAM,CAAC,OAAO,CAAC,CAAC;YAClC,MAAM,WAAW,GAAc,EAAE,CAAC;YAClC,SAAS,CAAC,OAAO,CAAC,CAAC,CAAW,EAAE,CAAS,EAAE,EAAE;gBAC3C,MAAM,KAAK,GAAG,IAAA,sBAAe,EAAC,KAAK,CAAC,CAAC,CAAC,CAAY,CAAC;gBACnD,KAAK,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;gBAChC,KAAK,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;gBAChC,WAAW,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YAC1B,CAAC,CAAC,CAAC;YAEH,IAAI,MAAM,EAAE;gBACV,WAAW,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,EAAE,CAC3B,KAAK,CAAC,aAAa,CAAC,IAAI,CAAC,EAAE,EAAE;oBAC3B,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC;oBACd,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC;iBACf,CAAC,CACH,CAAC;aACH;YAED,MAAM,MAAM,GAAG;gBACb,KAAK,EAAE,WAAW;gBAClB,KAAK;aACN,CAAC;YAEF,OAAO,MAAM,CAAC;QAChB,CAAC;KAAA;CACF;AAlFD,8BAkFC;AAED,MAAM,cAAc,GAAG,CAAC,SAAmB,EAAE,EAAE;IAC7C,IAAI,WAAW,GAAG,CAAC,MAAM,CAAC;IAC1B,SAAS,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,EAAE;QACxB,GAAG,CAAC,OAAO,CAAC,CAAC,KAAK,EAAE,EAAE;YACpB,IAAI,KAAK,KAAK,QAAQ,EAAE;gBACtB,OAAO;aACR;YACD,IAAI,WAAW,GAAG,KAAK,EAAE;gBACvB,WAAW,GAAG,KAAK,CAAC;aACrB;QACH,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IACH,SAAS,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE;QAC3B,GAAG,CAAC,OAAO,CAAC,CAAC,KAAK,EAAE,CAAC,EAAE,EAAE;YACvB,IAAI,KAAK,KAAK,QAAQ,EAAE;gBACtB,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,WAAW,CAAC;aAC/B;QACH,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;AACL,CAAC,CAAC;AAEF;;;GAGG;AACH,MAAM,MAAM,GAAG,CAAC,SAAmB,EAAgB,EAAE;IACnD,MAAM,SAAS,GAAG,CAAC,CAAC;IAEpB,mBAAmB;IACnB,MAAM,CAAC,GAAG,kBAAQ,CAAC,GAAG,CAAC,kBAAQ,CAAC,GAAG,CAAC,SAAS,EAAE,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC;IAEzD,iCAAiC;IACjC,MAAM,QAAQ,GAAG,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAC/B,MAAM,QAAQ,GAAG,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;IAClC,MAAM,SAAS,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC;IAC3B,CAAC,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC,YAAY,CAAC,QAAQ,CAAC,CAAC,eAAe,CAAC,QAAQ,CAAC,CAAC;IAElE,4DAA4D;IAC5D,iBAAiB;IACjB,MAAM,GAAG,GAAG,IAAI,sCAA0B,CAAC,CAAC,CAAC,CAAC;IAC9C,MAAM,WAAW,GAAG,kBAAQ,CAAC,IAAI,CAAC,GAAG,CAAC,cAAc,CAAC,CAAC,QAAQ,EAAE,CAAC;IACjE,OAAO,GAAG,CAAC,mBAAmB,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,CAAC,GAAa,EAAE,EAAE;QAC5D,OAAO,kBAAQ,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,WAAW,CAAC,CAAC;aACtC,MAAM,EAAE,CAAC,CAAC,CAAC;aACX,MAAM,CAAC,CAAC,EAAE,SAAS,CAAe,CAAC;IACxC,CAAC,CAAC,CAAC;AACL,CAAC,CAAC"}
@@ -1,4 +1,4 @@
1
- import type { Graph, LayoutMapping, RadialLayoutOptions, Layout } from "../types";
1
+ import type { Graph, Layout, LayoutMapping, RadialLayoutOptions } from '../types';
2
2
  /**
3
3
  * Layout arranging the nodes' on a radial shape
4
4
  *