@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.
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 -541
  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 -74
  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/4161e9d58bae8f39711a.worker.js +0 -2
  184. package/dist/4161e9d58bae8f39711a.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/types.d.ts CHANGED
@@ -1,71 +1,39 @@
1
- import { Graph as IGraph, Node as INode, Edge as IEdge, PlainObject, GraphView as IGraphView, ID } from '@antv/graphlib';
2
- export interface NodeData extends PlainObject {
3
- size?: number | number[];
4
- bboxSize?: number[];
5
- borderLeft?: ID | ID[];
6
- borderRight?: ID | ID[];
1
+ import { Edge as IEdge, Graph as IGraph, Node as INode } from '@antv/graphlib';
2
+ export interface NodeData {
7
3
  x?: number;
8
4
  y?: number;
9
5
  z?: number;
10
- height?: number;
11
- width?: number;
12
- e?: IEdge<EdgeData>;
13
- selfEdges?: IEdge<EdgeData>[];
14
- rank?: number;
15
- _rank?: number;
16
- order?: number;
17
- fixorder?: number;
18
- minRank?: number;
19
- maxRank?: number;
20
- layout?: boolean;
21
- layer?: number;
22
- low?: number;
23
- lim?: number;
6
+ size?: number | number[];
7
+ [key: string]: any;
8
+ }
9
+ export interface EdgeData {
10
+ weight?: number;
11
+ [keys: string]: any;
24
12
  }
25
13
  export interface OutNodeData extends NodeData {
26
14
  x: number;
27
15
  y: number;
28
- z?: number;
29
16
  }
30
- export interface EdgeData extends PlainObject {
31
- virtual?: boolean;
32
- weight?: number;
33
- x?: number;
34
- y?: number;
35
- height?: number;
36
- width?: number;
37
- points?: Point[];
38
- controlPoints?: Point[];
39
- minlen?: number;
40
- cutvalue?: number;
41
- labeloffset?: number;
17
+ export interface OutEdgeData extends EdgeData {
42
18
  }
43
- /** input node */
44
- export declare type Node = INode<NodeData>;
45
- /** output node */
46
- export declare type OutNode = INode<OutNodeData>;
47
- /** input and output edge */
48
- export declare type Edge = IEdge<EdgeData>;
49
- export declare type Degree = {
50
- in: number;
51
- out: number;
52
- all: number;
53
- };
54
- export declare type IndexMap = {
19
+ export type Node = INode<NodeData>;
20
+ export type Edge = IEdge<EdgeData>;
21
+ export type OutNode = INode<OutNodeData>;
22
+ export type OutEdge = IEdge<OutEdgeData>;
23
+ export type IndexMap = {
55
24
  [nodeId: string]: number;
56
25
  };
57
- export declare type Graph = IGraph<NodeData, EdgeData>;
58
- export declare type GraphView = IGraphView<NodeData, EdgeData>;
59
- export declare type PointTuple = [number, number] | [number, number, number];
60
- export declare type Point = {
26
+ export type Graph = IGraph<NodeData, EdgeData>;
27
+ export type PointTuple = [number, number] | [number, number, number];
28
+ export type Point = {
61
29
  x: number;
62
30
  y: number;
63
31
  z?: number;
64
32
  };
65
- export declare type Matrix = number[];
66
- export declare type LayoutMapping = {
33
+ export type Matrix = number[];
34
+ export type LayoutMapping = {
67
35
  nodes: OutNode[];
68
- edges: Edge[];
36
+ edges: OutEdge[];
69
37
  };
70
38
  export interface Layout<LayoutOptions> {
71
39
  /**
@@ -99,9 +67,6 @@ export interface LayoutWithIterations<LayoutOptions> extends Layout<LayoutOption
99
67
  */
100
68
  tick: (iterations?: number) => LayoutMapping;
101
69
  }
102
- export interface LayoutConstructor<LayoutOptions> {
103
- new (options?: LayoutOptions): Layout<LayoutOptions>;
104
- }
105
70
  export interface LayoutSupervisor {
106
71
  execute(): Promise<LayoutMapping>;
107
72
  stop(): void;
@@ -180,25 +145,6 @@ export interface RadialLayoutOptions {
180
145
  sortBy?: string;
181
146
  sortStrength?: number;
182
147
  }
183
- export declare type DagreRankdir = 'TB' | 'BT' | 'LR' | 'RL' | 'tb' | 'lr' | 'rl' | 'bt';
184
- export declare type DagreAlign = 'UL' | 'UR' | 'DL' | 'DR';
185
- export interface DagreLayoutOptions {
186
- rankdir?: DagreRankdir;
187
- align?: DagreAlign;
188
- begin?: PointTuple;
189
- nodeSize?: number | number[] | ((nodeData: Node) => number);
190
- nodesep?: number;
191
- ranksep?: number;
192
- controlPoints?: boolean;
193
- sortByCombo?: boolean;
194
- edgeLabelSpace?: boolean;
195
- nodeOrder?: string[];
196
- radial?: boolean;
197
- focusNode?: ID | Node | null;
198
- preset?: OutNode[];
199
- nodesepFunc?: (d?: Node) => number;
200
- ranksepFunc?: (d?: Node) => number;
201
- }
202
148
  export interface D3ForceLayoutOptions {
203
149
  center?: PointTuple;
204
150
  linkDistance?: number | ((edge?: Edge) => number);
package/lib/types.js CHANGED
@@ -1,4 +1,8 @@
1
- export function isLayoutWithIterations(layout) {
1
+ "use strict";
2
+ Object.defineProperty(exports, "__esModule", { value: true });
3
+ exports.isLayoutWithIterations = void 0;
4
+ function isLayoutWithIterations(layout) {
2
5
  return !!layout.tick && !!layout.stop;
3
6
  }
7
+ exports.isLayoutWithIterations = isLayoutWithIterations;
4
8
  //# sourceMappingURL=types.js.map
package/lib/types.js.map CHANGED
@@ -1 +1 @@
1
- {"version":3,"file":"types.js","sourceRoot":"","sources":["../src/types.ts"],"names":[],"mappings":"AAmGA,MAAM,UAAU,sBAAsB,CACpC,MAAW;IAEX,OAAO,CAAC,CAAC,MAAM,CAAC,IAAI,IAAI,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC;AACxC,CAAC"}
1
+ {"version":3,"file":"types.js","sourceRoot":"","sources":["../src/types.ts"],"names":[],"mappings":";;;AA0DA,SAAgB,sBAAsB,CACpC,MAAW;IAEX,OAAO,CAAC,CAAC,MAAM,CAAC,IAAI,IAAI,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC;AACxC,CAAC;AAJD,wDAIC"}
package/lib/util/array.js CHANGED
@@ -1,2 +1,5 @@
1
- export var isArray = Array.isArray;
1
+ "use strict";
2
+ Object.defineProperty(exports, "__esModule", { value: true });
3
+ exports.isArray = void 0;
4
+ exports.isArray = Array.isArray;
2
5
  //# sourceMappingURL=array.js.map
@@ -1 +1 @@
1
- {"version":3,"file":"array.js","sourceRoot":"","sources":["../../src/util/array.ts"],"names":[],"mappings":"AAAA,MAAM,CAAC,IAAM,OAAO,GAAG,KAAK,CAAC,OAAO,CAAC"}
1
+ {"version":3,"file":"array.js","sourceRoot":"","sources":["../../src/util/array.ts"],"names":[],"mappings":";;;AAAa,QAAA,OAAO,GAAG,KAAK,CAAC,OAAO,CAAC"}
@@ -1,4 +1,4 @@
1
- import { PointTuple, Graph } from "../types";
1
+ import { Graph, PointTuple } from '../types';
2
2
  /**
3
3
  * Assign or only return the result for the graph who has no nodes or only one node.
4
4
  * @param graph original graph
@@ -1,4 +1,6 @@
1
- import { __assign } from "tslib";
1
+ "use strict";
2
+ Object.defineProperty(exports, "__esModule", { value: true });
3
+ exports.handleSingleNodeGraph = void 0;
2
4
  /**
3
5
  * Assign or only return the result for the graph who has no nodes or only one node.
4
6
  * @param graph original graph
@@ -6,11 +8,11 @@ import { __assign } from "tslib";
6
8
  * @param center the layout center
7
9
  * @returns
8
10
  */
9
- export var handleSingleNodeGraph = function (graph, assign, center) {
10
- var nodes = graph.getAllNodes();
11
- var edges = graph.getAllEdges();
11
+ const handleSingleNodeGraph = (graph, assign, center) => {
12
+ const nodes = graph.getAllNodes();
13
+ const edges = graph.getAllEdges();
12
14
  if (!(nodes === null || nodes === void 0 ? void 0 : nodes.length)) {
13
- var result = { nodes: [], edges: edges };
15
+ const result = { nodes: [], edges };
14
16
  return result;
15
17
  }
16
18
  if (nodes.length === 1) {
@@ -20,13 +22,14 @@ export var handleSingleNodeGraph = function (graph, assign, center) {
20
22
  y: center[1],
21
23
  });
22
24
  }
23
- var result = {
25
+ const result = {
24
26
  nodes: [
25
- __assign(__assign({}, nodes[0]), { data: __assign(__assign({}, nodes[0].data), { x: center[0], y: center[1] }) }),
27
+ Object.assign(Object.assign({}, nodes[0]), { data: Object.assign(Object.assign({}, nodes[0].data), { x: center[0], y: center[1] }) }),
26
28
  ],
27
- edges: edges,
29
+ edges,
28
30
  };
29
31
  return result;
30
32
  }
31
33
  };
34
+ exports.handleSingleNodeGraph = handleSingleNodeGraph;
32
35
  //# sourceMappingURL=common.js.map
@@ -1 +1 @@
1
- {"version":3,"file":"common.js","sourceRoot":"","sources":["../../src/util/common.ts"],"names":[],"mappings":";AAEA;;;;;;GAMG;AACH,MAAM,CAAC,IAAM,qBAAqB,GAAG,UACnC,KAAY,EACZ,MAAe,EACf,MAAkB;IAElB,IAAM,KAAK,GAAG,KAAK,CAAC,WAAW,EAAE,CAAC;IAClC,IAAM,KAAK,GAAG,KAAK,CAAC,WAAW,EAAE,CAAC;IAClC,IAAI,CAAC,CAAA,KAAK,aAAL,KAAK,uBAAL,KAAK,CAAE,MAAM,CAAA,EAAE;QAClB,IAAM,MAAM,GAAG,EAAE,KAAK,EAAE,EAAW,EAAE,KAAK,OAAA,EAAE,CAAC;QAC7C,OAAO,MAAM,CAAC;KACf;IACD,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE;QACtB,IAAI,MAAM,EAAE;YACV,KAAK,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE;gBAC/B,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC;gBACZ,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC;aACb,CAAC,CAAC;SACJ;QACD,IAAM,MAAM,GAAG;YACb,KAAK,EAAE;sCAEA,KAAK,CAAC,CAAC,CAAC,KACX,IAAI,wBACC,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,KAChB,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,EACZ,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC;aAGjB;YACD,KAAK,OAAA;SACN,CAAC;QACF,OAAO,MAAM,CAAC;KACf;AACH,CAAC,CAAC"}
1
+ {"version":3,"file":"common.js","sourceRoot":"","sources":["../../src/util/common.ts"],"names":[],"mappings":";;;AAEA;;;;;;GAMG;AACI,MAAM,qBAAqB,GAAG,CACnC,KAAY,EACZ,MAAe,EACf,MAAkB,EAClB,EAAE;IACF,MAAM,KAAK,GAAG,KAAK,CAAC,WAAW,EAAE,CAAC;IAClC,MAAM,KAAK,GAAG,KAAK,CAAC,WAAW,EAAE,CAAC;IAClC,IAAI,CAAC,CAAA,KAAK,aAAL,KAAK,uBAAL,KAAK,CAAE,MAAM,CAAA,EAAE;QAClB,MAAM,MAAM,GAAG,EAAE,KAAK,EAAE,EAAW,EAAE,KAAK,EAAE,CAAC;QAC7C,OAAO,MAAM,CAAC;KACf;IACD,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE;QACtB,IAAI,MAAM,EAAE;YACV,KAAK,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE;gBAC/B,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC;gBACZ,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC;aACb,CAAC,CAAC;SACJ;QACD,MAAM,MAAM,GAAG;YACb,KAAK,EAAE;gDAEA,KAAK,CAAC,CAAC,CAAC,KACX,IAAI,kCACC,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,KAChB,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,EACZ,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC;aAGjB;YACD,KAAK;SACN,CAAC;QACF,OAAO,MAAM,CAAC;KACf;AACH,CAAC,CAAC;AAjCW,QAAA,qBAAqB,yBAiChC"}
@@ -1,26 +1,29 @@
1
- import { __read, __spreadArray } from "tslib";
2
- import { isFunction, isNumber, isObject } from '@antv/util';
1
+ "use strict";
2
+ Object.defineProperty(exports, "__esModule", { value: true });
3
+ exports.formatNodeSize = exports.formatSizeFn = exports.formatNumberFn = void 0;
4
+ const util_1 = require("@antv/util");
3
5
  /**
4
6
  * Format value with multiple types into a function returns number.
5
7
  * @param defaultValue default value when value is invalid
6
8
  * @param value value to be formatted
7
9
  * @returns formatted result, a function returns number
8
10
  */
9
- export function formatNumberFn(defaultValue, value) {
10
- var resultFunc;
11
- if (isFunction(value)) {
11
+ function formatNumberFn(defaultValue, value) {
12
+ let resultFunc;
13
+ if ((0, util_1.isFunction)(value)) {
12
14
  resultFunc = value;
13
15
  }
14
- else if (isNumber(value)) {
16
+ else if ((0, util_1.isNumber)(value)) {
15
17
  // value is number
16
- resultFunc = function () { return value; };
18
+ resultFunc = () => value;
17
19
  }
18
20
  else {
19
21
  // value is not number and function
20
- resultFunc = function () { return defaultValue; };
22
+ resultFunc = () => defaultValue;
21
23
  }
22
24
  return resultFunc;
23
25
  }
26
+ exports.formatNumberFn = formatNumberFn;
24
27
  /**
25
28
  * Format size config with multiple types into a function returns number
26
29
  * @param defaultValue default value when value is invalid
@@ -28,16 +31,15 @@ export function formatNumberFn(defaultValue, value) {
28
31
  * @param resultIsNumber whether returns number
29
32
  * @returns formatted result, a function returns number
30
33
  */
31
- export function formatSizeFn(defaultValue, value, resultIsNumber) {
32
- if (resultIsNumber === void 0) { resultIsNumber = true; }
34
+ function formatSizeFn(defaultValue, value, resultIsNumber = true) {
33
35
  if (!value && value !== 0) {
34
- return function (d) {
35
- var size = (d.data || {}).size;
36
+ return (d) => {
37
+ const { size } = d.data || {};
36
38
  if (size) {
37
39
  if (Array.isArray(size)) {
38
40
  return size[0] > size[1] ? size[0] : size[1];
39
41
  }
40
- if (isObject(size)) {
42
+ if ((0, util_1.isObject)(size)) {
41
43
  return size.width > size.height ? size.width : size.height;
42
44
  }
43
45
  return size;
@@ -45,52 +47,53 @@ export function formatSizeFn(defaultValue, value, resultIsNumber) {
45
47
  return defaultValue;
46
48
  };
47
49
  }
48
- if (isFunction(value)) {
50
+ if ((0, util_1.isFunction)(value)) {
49
51
  return value;
50
52
  }
51
- if (isNumber(value)) {
52
- return function () { return value; };
53
+ if ((0, util_1.isNumber)(value)) {
54
+ return () => value;
53
55
  }
54
56
  if (Array.isArray(value)) {
55
- return function () {
57
+ return () => {
56
58
  if (resultIsNumber) {
57
- var max = Math.max.apply(Math, __spreadArray([], __read(value)));
59
+ const max = Math.max(...value);
58
60
  return isNaN(max) ? defaultValue : max;
59
61
  }
60
62
  return value;
61
63
  };
62
64
  }
63
- if (isObject(value)) {
64
- return function () {
65
+ if ((0, util_1.isObject)(value)) {
66
+ return () => {
65
67
  if (resultIsNumber) {
66
- var max = Math.max(value.width, value.height);
68
+ const max = Math.max(value.width, value.height);
67
69
  return isNaN(max) ? defaultValue : max;
68
70
  }
69
71
  return [value.width, value.height];
70
72
  };
71
73
  }
72
- return function () { return defaultValue; };
74
+ return () => defaultValue;
73
75
  }
76
+ exports.formatSizeFn = formatSizeFn;
74
77
  /**
75
78
  * format the props nodeSize and nodeSpacing to a function
76
79
  * @param nodeSize
77
80
  * @param nodeSpacing
78
81
  * @returns
79
82
  */
80
- export var formatNodeSize = function (nodeSize, nodeSpacing) {
81
- var nodeSizeFunc;
82
- var nodeSpacingFunc;
83
- if (isNumber(nodeSpacing)) {
84
- nodeSpacingFunc = function () { return nodeSpacing; };
83
+ const formatNodeSize = (nodeSize, nodeSpacing) => {
84
+ let nodeSizeFunc;
85
+ let nodeSpacingFunc;
86
+ if ((0, util_1.isNumber)(nodeSpacing)) {
87
+ nodeSpacingFunc = () => nodeSpacing;
85
88
  }
86
- else if (isFunction(nodeSpacing)) {
89
+ else if ((0, util_1.isFunction)(nodeSpacing)) {
87
90
  nodeSpacingFunc = nodeSpacing;
88
91
  }
89
92
  else {
90
- nodeSpacingFunc = function () { return 0; };
93
+ nodeSpacingFunc = () => 0;
91
94
  }
92
95
  if (!nodeSize) {
93
- nodeSizeFunc = function (d) {
96
+ nodeSizeFunc = (d) => {
94
97
  var _a, _b;
95
98
  if ((_a = d.data) === null || _a === void 0 ? void 0 : _a.bboxSize) {
96
99
  return (Math.max(d.data.bboxSize[0], d.data.bboxSize[1]) + nodeSpacingFunc(d));
@@ -99,9 +102,9 @@ export var formatNodeSize = function (nodeSize, nodeSpacing) {
99
102
  if (Array.isArray(d.data.size)) {
100
103
  return Math.max(d.data.size[0], d.data.size[1]) + nodeSpacingFunc(d);
101
104
  }
102
- var dataSize = d.data.size;
103
- if (isObject(dataSize)) {
104
- var res = dataSize.width > dataSize.height ? dataSize.width : dataSize.height;
105
+ const dataSize = d.data.size;
106
+ if ((0, util_1.isObject)(dataSize)) {
107
+ const res = dataSize.width > dataSize.height ? dataSize.width : dataSize.height;
105
108
  return res + nodeSpacingFunc(d);
106
109
  }
107
110
  return dataSize + nodeSpacingFunc(d);
@@ -110,17 +113,18 @@ export var formatNodeSize = function (nodeSize, nodeSpacing) {
110
113
  };
111
114
  }
112
115
  else if (Array.isArray(nodeSize)) {
113
- nodeSizeFunc = function (d) {
114
- var res = nodeSize[0] > nodeSize[1] ? nodeSize[0] : nodeSize[1];
116
+ nodeSizeFunc = (d) => {
117
+ const res = nodeSize[0] > nodeSize[1] ? nodeSize[0] : nodeSize[1];
115
118
  return res + nodeSpacingFunc(d);
116
119
  };
117
120
  }
118
- else if (isFunction(nodeSize)) {
121
+ else if ((0, util_1.isFunction)(nodeSize)) {
119
122
  nodeSizeFunc = nodeSize;
120
123
  }
121
124
  else {
122
- nodeSizeFunc = function (d) { return nodeSize + nodeSpacingFunc(d); };
125
+ nodeSizeFunc = (d) => nodeSize + nodeSpacingFunc(d);
123
126
  }
124
127
  return nodeSizeFunc;
125
128
  };
129
+ exports.formatNodeSize = formatNodeSize;
126
130
  //# sourceMappingURL=function.js.map
@@ -1 +1 @@
1
- {"version":3,"file":"function.js","sourceRoot":"","sources":["../../src/util/function.ts"],"names":[],"mappings":";AAAA,OAAO,EAAE,UAAU,EAAE,QAAQ,EAAE,QAAQ,EAAE,MAAM,YAAY,CAAC;AAG5D;;;;;GAKG;AACH,MAAM,UAAU,cAAc,CAC5B,YAAoB,EACpB,KAA+C;IAE/C,IAAI,UAAU,CAAC;IACf,IAAI,UAAU,CAAC,KAAK,CAAC,EAAE;QACrB,UAAU,GAAG,KAAK,CAAC;KACpB;SAAM,IAAI,QAAQ,CAAC,KAAK,CAAC,EAAE;QAC1B,kBAAkB;QAClB,UAAU,GAAG,cAAM,OAAA,KAAK,EAAL,CAAK,CAAC;KAC1B;SAAM;QACL,mCAAmC;QACnC,UAAU,GAAG,cAAM,OAAA,YAAY,EAAZ,CAAY,CAAC;KACjC;IACD,OAAO,UAAU,CAAC;AACpB,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,YAAY,CAC1B,YAAoB,EACpB,KAKa,EACb,cAA8B;IAA9B,+BAAA,EAAA,qBAA8B;IAE9B,IAAI,CAAC,KAAK,IAAI,KAAK,KAAK,CAAC,EAAE;QACzB,OAAO,UAAC,CAAC;YACC,IAAA,IAAI,GAAK,CAAA,CAAC,CAAC,IAAI,IAAI,EAAE,CAAA,KAAjB,CAAkB;YAC9B,IAAI,IAAI,EAAE;gBACR,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE;oBACvB,OAAO,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;iBAC9C;gBACD,IAAI,QAAQ,CAAoC,IAAI,CAAC,EAAE;oBACrD,OAAO,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC;iBAC5D;gBACD,OAAO,IAAI,CAAC;aACb;YACD,OAAO,YAAY,CAAC;QACtB,CAAC,CAAC;KACH;IACD,IAAI,UAAU,CAAC,KAAK,CAAC,EAAE;QACrB,OAAO,KAAK,CAAC;KACd;IACD,IAAI,QAAQ,CAAC,KAAK,CAAC,EAAE;QACnB,OAAO,cAAM,OAAA,KAAK,EAAL,CAAK,CAAC;KACpB;IACD,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE;QACxB,OAAO;YACL,IAAI,cAAc,EAAE;gBAClB,IAAM,GAAG,GAAG,IAAI,CAAC,GAAG,OAAR,IAAI,2BAAQ,KAAK,GAAC,CAAC;gBAC/B,OAAO,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,GAAG,CAAC;aACxC;YACD,OAAO,KAAK,CAAC;QACf,CAAC,CAAC;KACH;IACD,IAAI,QAAQ,CAAC,KAAK,CAAC,EAAE;QACnB,OAAO;YACL,IAAI,cAAc,EAAE;gBAClB,IAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,KAAK,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC;gBAChD,OAAO,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,GAAG,CAAC;aACxC;YACD,OAAO,CAAC,KAAK,CAAC,KAAK,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC;QACrC,CAAC,CAAC;KACH;IACD,OAAO,cAAM,OAAA,YAAY,EAAZ,CAAY,CAAC;AAC5B,CAAC;AAED;;;;;GAKG;AACH,MAAM,CAAC,IAAM,cAAc,GAAG,UAC5B,QAAsE,EACtE,WAA0C;IAE1C,IAAI,YAAY,CAAC;IACjB,IAAI,eAAyB,CAAC;IAC9B,IAAI,QAAQ,CAAC,WAAW,CAAC,EAAE;QACzB,eAAe,GAAG,cAAM,OAAA,WAAW,EAAX,CAAW,CAAC;KACrC;SAAM,IAAI,UAAU,CAAC,WAAW,CAAC,EAAE;QAClC,eAAe,GAAG,WAAW,CAAC;KAC/B;SAAM;QACL,eAAe,GAAG,cAAM,OAAA,CAAC,EAAD,CAAC,CAAC;KAC3B;IAED,IAAI,CAAC,QAAQ,EAAE;QACb,YAAY,GAAG,UAAC,CAAO;;YACrB,IAAI,MAAA,CAAC,CAAC,IAAI,0CAAE,QAAQ,EAAE;gBACpB,OAAO,CACL,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,GAAG,eAAe,CAAC,CAAC,CAAC,CACtE,CAAC;aACH;YACD,IAAI,MAAA,CAAC,CAAC,IAAI,0CAAE,IAAI,EAAE;gBAChB,IAAI,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE;oBAC9B,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,eAAe,CAAC,CAAC,CAAC,CAAC;iBACtE;gBACD,IAAM,QAAQ,GAAG,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC;gBAC7B,IAAI,QAAQ,CAAoC,QAAQ,CAAC,EAAE;oBACzD,IAAM,GAAG,GACP,QAAQ,CAAC,KAAK,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,QAAQ,CAAC,MAAM,CAAC;oBACtE,OAAO,GAAG,GAAG,eAAe,CAAC,CAAC,CAAC,CAAC;iBACjC;gBACD,OAAO,QAAQ,GAAG,eAAe,CAAC,CAAC,CAAC,CAAC;aACtC;YACD,OAAO,EAAE,GAAG,eAAe,CAAC,CAAC,CAAC,CAAC;QACjC,CAAC,CAAC;KACH;SAAM,IAAI,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,EAAE;QAClC,YAAY,GAAG,UAAC,CAAO;YACrB,IAAM,GAAG,GAAG,QAAQ,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;YAClE,OAAO,GAAG,GAAG,eAAe,CAAC,CAAC,CAAC,CAAC;QAClC,CAAC,CAAC;KACH;SAAM,IAAI,UAAU,CAAC,QAAQ,CAAC,EAAE;QAC/B,YAAY,GAAG,QAAsC,CAAC;KACvD;SAAM;QACL,YAAY,GAAG,UAAC,CAAO,IAAK,OAAA,QAAQ,GAAG,eAAe,CAAC,CAAC,CAAC,EAA7B,CAA6B,CAAC;KAC3D;IACD,OAAO,YAAY,CAAC;AACtB,CAAC,CAAC"}
1
+ {"version":3,"file":"function.js","sourceRoot":"","sources":["../../src/util/function.ts"],"names":[],"mappings":";;;AAAA,qCAA4D;AAG5D;;;;;GAKG;AACH,SAAgB,cAAc,CAC5B,YAAoB,EACpB,KAA+C;IAE/C,IAAI,UAAU,CAAC;IACf,IAAI,IAAA,iBAAU,EAAC,KAAK,CAAC,EAAE;QACrB,UAAU,GAAG,KAAK,CAAC;KACpB;SAAM,IAAI,IAAA,eAAQ,EAAC,KAAK,CAAC,EAAE;QAC1B,kBAAkB;QAClB,UAAU,GAAG,GAAG,EAAE,CAAC,KAAK,CAAC;KAC1B;SAAM;QACL,mCAAmC;QACnC,UAAU,GAAG,GAAG,EAAE,CAAC,YAAY,CAAC;KACjC;IACD,OAAO,UAAU,CAAC;AACpB,CAAC;AAfD,wCAeC;AAED;;;;;;GAMG;AACH,SAAgB,YAAY,CAC1B,YAAoB,EACpB,KAKa,EACb,iBAA0B,IAAI;IAE9B,IAAI,CAAC,KAAK,IAAI,KAAK,KAAK,CAAC,EAAE;QACzB,OAAO,CAAC,CAAC,EAAE,EAAE;YACX,MAAM,EAAE,IAAI,EAAE,GAAG,CAAC,CAAC,IAAI,IAAI,EAAE,CAAC;YAC9B,IAAI,IAAI,EAAE;gBACR,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE;oBACvB,OAAO,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;iBAC9C;gBACD,IAAI,IAAA,eAAQ,EAAoC,IAAI,CAAC,EAAE;oBACrD,OAAO,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC;iBAC5D;gBACD,OAAO,IAAI,CAAC;aACb;YACD,OAAO,YAAY,CAAC;QACtB,CAAC,CAAC;KACH;IACD,IAAI,IAAA,iBAAU,EAAC,KAAK,CAAC,EAAE;QACrB,OAAO,KAAK,CAAC;KACd;IACD,IAAI,IAAA,eAAQ,EAAC,KAAK,CAAC,EAAE;QACnB,OAAO,GAAG,EAAE,CAAC,KAAK,CAAC;KACpB;IACD,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE;QACxB,OAAO,GAAG,EAAE;YACV,IAAI,cAAc,EAAE;gBAClB,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC,CAAC;gBAC/B,OAAO,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,GAAG,CAAC;aACxC;YACD,OAAO,KAAK,CAAC;QACf,CAAC,CAAC;KACH;IACD,IAAI,IAAA,eAAQ,EAAC,KAAK,CAAC,EAAE;QACnB,OAAO,GAAG,EAAE;YACV,IAAI,cAAc,EAAE;gBAClB,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,KAAK,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC;gBAChD,OAAO,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,GAAG,CAAC;aACxC;YACD,OAAO,CAAC,KAAK,CAAC,KAAK,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC;QACrC,CAAC,CAAC;KACH;IACD,OAAO,GAAG,EAAE,CAAC,YAAY,CAAC;AAC5B,CAAC;AAlDD,oCAkDC;AAED;;;;;GAKG;AACI,MAAM,cAAc,GAAG,CAC5B,QAAsE,EACtE,WAA0C,EACZ,EAAE;IAChC,IAAI,YAAY,CAAC;IACjB,IAAI,eAAyB,CAAC;IAC9B,IAAI,IAAA,eAAQ,EAAC,WAAW,CAAC,EAAE;QACzB,eAAe,GAAG,GAAG,EAAE,CAAC,WAAW,CAAC;KACrC;SAAM,IAAI,IAAA,iBAAU,EAAC,WAAW,CAAC,EAAE;QAClC,eAAe,GAAG,WAAW,CAAC;KAC/B;SAAM;QACL,eAAe,GAAG,GAAG,EAAE,CAAC,CAAC,CAAC;KAC3B;IAED,IAAI,CAAC,QAAQ,EAAE;QACb,YAAY,GAAG,CAAC,CAAO,EAAE,EAAE;;YACzB,IAAI,MAAA,CAAC,CAAC,IAAI,0CAAE,QAAQ,EAAE;gBACpB,OAAO,CACL,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,GAAG,eAAe,CAAC,CAAC,CAAC,CACtE,CAAC;aACH;YACD,IAAI,MAAA,CAAC,CAAC,IAAI,0CAAE,IAAI,EAAE;gBAChB,IAAI,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE;oBAC9B,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,eAAe,CAAC,CAAC,CAAC,CAAC;iBACtE;gBACD,MAAM,QAAQ,GAAG,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC;gBAC7B,IAAI,IAAA,eAAQ,EAAoC,QAAQ,CAAC,EAAE;oBACzD,MAAM,GAAG,GACP,QAAQ,CAAC,KAAK,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,QAAQ,CAAC,MAAM,CAAC;oBACtE,OAAO,GAAG,GAAG,eAAe,CAAC,CAAC,CAAC,CAAC;iBACjC;gBACD,OAAO,QAAQ,GAAG,eAAe,CAAC,CAAC,CAAC,CAAC;aACtC;YACD,OAAO,EAAE,GAAG,eAAe,CAAC,CAAC,CAAC,CAAC;QACjC,CAAC,CAAC;KACH;SAAM,IAAI,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,EAAE;QAClC,YAAY,GAAG,CAAC,CAAO,EAAE,EAAE;YACzB,MAAM,GAAG,GAAG,QAAQ,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;YAClE,OAAO,GAAG,GAAG,eAAe,CAAC,CAAC,CAAC,CAAC;QAClC,CAAC,CAAC;KACH;SAAM,IAAI,IAAA,iBAAU,EAAC,QAAQ,CAAC,EAAE;QAC/B,YAAY,GAAG,QAAsC,CAAC;KACvD;SAAM;QACL,YAAY,GAAG,CAAC,CAAO,EAAE,EAAE,CAAC,QAAQ,GAAG,eAAe,CAAC,CAAC,CAAC,CAAC;KAC3D;IACD,OAAO,YAAY,CAAC;AACtB,CAAC,CAAC;AA9CW,QAAA,cAAc,kBA8CzB"}
@@ -1,6 +1,4 @@
1
- export * from "./string";
2
1
  export * from "./array";
3
- export * from "./number";
4
2
  export * from "./math";
5
3
  export * from "./object";
6
4
  export * from "./function";
package/lib/util/index.js CHANGED
@@ -1,7 +1,8 @@
1
- export * from "./string";
2
- export * from "./array";
3
- export * from "./number";
4
- export * from "./math";
5
- export * from "./object";
6
- export * from "./function";
1
+ "use strict";
2
+ Object.defineProperty(exports, "__esModule", { value: true });
3
+ const tslib_1 = require("tslib");
4
+ tslib_1.__exportStar(require("./array"), exports);
5
+ tslib_1.__exportStar(require("./math"), exports);
6
+ tslib_1.__exportStar(require("./object"), exports);
7
+ tslib_1.__exportStar(require("./function"), exports);
7
8
  //# sourceMappingURL=index.js.map
@@ -1 +1 @@
1
- {"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/util/index.ts"],"names":[],"mappings":"AAAA,cAAc,UAAU,CAAC;AACzB,cAAc,SAAS,CAAC;AACxB,cAAc,UAAU,CAAC;AACzB,cAAc,QAAQ,CAAC;AACvB,cAAc,UAAU,CAAC;AACzB,cAAc,YAAY,CAAC"}
1
+ {"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/util/index.ts"],"names":[],"mappings":";;;AAAA,kDAAwB;AACxB,iDAAuB;AACvB,mDAAyB;AACzB,qDAA2B"}
@@ -1,5 +1,5 @@
1
- import type { Matrix, Edge, Node, OutNode, Degree, Point } from '../types';
2
1
  import { Graph } from '@antv/graphlib';
2
+ import type { Matrix, Edge, Node, OutNode, Point } from '../types';
3
3
  export declare const floydWarshall: (adjMatrix: Matrix[]) => Matrix[];
4
4
  export declare const getAdjMatrix: (data: {
5
5
  nodes: Node[];
@@ -11,13 +11,6 @@ export declare const getAdjMatrix: (data: {
11
11
  * @param ratio
12
12
  */
13
13
  export declare const scaleMatrix: (matrix: Matrix[], ratio: number) => Matrix[];
14
- /**
15
- * depth first traverse, from leaves to root, children in inverse order
16
- * if the fn returns false, terminate the traverse
17
- */
18
- export declare const traverseTreeUp: <T extends {
19
- children?: T[];
20
- }>(data: T, fn: (param: T) => boolean) => void;
21
14
  /**
22
15
  * calculate the bounding box for the nodes according to their x, y, and size
23
16
  * @param nodes nodes in the layout
@@ -29,24 +22,6 @@ export declare const getLayoutBBox: (nodes: OutNode[]) => {
29
22
  maxX: number;
30
23
  maxY: number;
31
24
  };
32
- /**
33
- * 获取节点集合的平均位置信息
34
- * @param nodes 节点集合
35
- * @returns 平局内置
36
- */
37
- export declare const getAvgNodePosition: (nodes: OutNode[]) => {
38
- x: number;
39
- y: number;
40
- };
41
- export declare const getCoreNodeAndRelativeLeafNodes: (type: 'leaf' | 'all', node: Node, edges: Edge[], nodeClusterBy: string, degreesMap: {
42
- [id: string]: Degree;
43
- }, nodeMap: {
44
- [id: string]: Node;
45
- }) => {
46
- coreNode: Node;
47
- relativeLeafNodes: Node[];
48
- sameTypeLeafNodes: Node[];
49
- };
50
25
  /**
51
26
  * calculate the euclidean distance form p1 to p2
52
27
  * @param p1