@antv/layout 1.2.13 → 1.2.14-beta.1
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 +61 -0
- package/lib/antv-dagre/acyclic.js.map +1 -0
- package/lib/{dagre → antv-dagre}/add-border-segments.js +12 -12
- 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 +65 -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 +20 -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 +136 -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 +125 -127
- package/lib/antv-dagre/layout.js.map +1 -0
- package/lib/{dagre → antv-dagre}/nesting-graph.js +36 -37
- 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 +24 -24
- package/lib/antv-dagre/normalize.js.map +1 -0
- package/lib/{dagre → antv-dagre}/order/add-subgraph-constraints.js +9 -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/{dagre → antv-dagre}/order/barycenter.js +8 -8
- package/lib/antv-dagre/order/barycenter.js.map +1 -0
- package/lib/{dagre → antv-dagre}/order/build-layer-graph.js +18 -22
- 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 +17 -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/{dagre → antv-dagre}/order/index.js +35 -35
- package/lib/antv-dagre/order/index.js.map +1 -0
- package/lib/{dagre → antv-dagre}/order/init-data-order.js +8 -9
- package/lib/antv-dagre/order/init-data-order.js.map +1 -0
- package/lib/antv-dagre/order/init-order.js +47 -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 +32 -35
- package/lib/antv-dagre/order/resolve-conflicts.js.map +1 -0
- package/lib/{dagre → antv-dagre}/order/sort-subgraph.js +20 -20
- 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 +19 -19
- package/lib/antv-dagre/order/sort.js.map +1 -0
- package/lib/{dagre → antv-dagre}/parent-dummy-chains.js +28 -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 +140 -143
- 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 +51 -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 +32 -32
- 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 +10 -10
- 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 +70 -71
- 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 +31 -31
- 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 +2 -0
- package/lib/antv-dagre/types.js.map +1 -0
- package/lib/{dagre → antv-dagre}/util.d.ts +1 -1
- package/lib/{dagre → antv-dagre}/util.js +90 -98
- package/lib/antv-dagre/util.js.map +1 -0
- package/lib/antv-dagre.d.ts +50 -0
- package/lib/antv-dagre.js +538 -0
- package/lib/antv-dagre.js.map +1 -0
- package/lib/bundle-entry.d.ts +2 -18
- package/lib/bundle-entry.js +2 -18
- package/lib/bundle-entry.js.map +1 -1
- package/lib/bundle-supervisor.d.ts +4 -22
- package/lib/bundle-supervisor.js +54 -53
- package/lib/bundle-supervisor.js.map +1 -1
- package/lib/bundle-worker.d.ts +1 -1
- package/lib/bundle-worker.js +31 -33
- package/lib/bundle-worker.js.map +1 -1
- package/lib/circular.d.ts +1 -1
- package/lib/circular.js +124 -140
- package/lib/circular.js.map +1 -1
- package/lib/comboCombined.d.ts +1 -1
- package/lib/comboCombined.js +254 -284
- package/lib/comboCombined.js.map +1 -1
- package/lib/concentric.d.ts +1 -1
- package/lib/concentric.js +166 -176
- package/lib/concentric.js.map +1 -1
- package/lib/d3Force/forceInBox.js +75 -77
- package/lib/d3Force/forceInBox.js.map +1 -1
- package/lib/d3Force/index.d.ts +2 -2
- package/lib/d3Force/index.js +196 -222
- package/lib/d3Force/index.js.map +1 -1
- package/lib/dagre.d.ts +13 -24
- package/lib/dagre.js +57 -542
- package/lib/dagre.js.map +1 -1
- package/lib/exports.d.ts +17 -0
- package/lib/exports.js +17 -0
- package/lib/exports.js.map +1 -0
- package/lib/force/forceNBody.js +42 -45
- package/lib/force/forceNBody.js.map +1 -1
- package/lib/force/index.d.ts +1 -1
- package/lib/force/index.js +282 -309
- package/lib/force/index.js.map +1 -1
- package/lib/force/types.d.ts +5 -5
- package/lib/forceAtlas2/body.d.ts +1 -1
- package/lib/forceAtlas2/body.js +29 -31
- package/lib/forceAtlas2/body.js.map +1 -1
- package/lib/forceAtlas2/index.d.ts +1 -1
- package/lib/forceAtlas2/index.js +206 -218
- package/lib/forceAtlas2/index.js.map +1 -1
- package/lib/forceAtlas2/quad.d.ts +2 -2
- package/lib/forceAtlas2/quad.js +40 -42
- package/lib/forceAtlas2/quad.js.map +1 -1
- package/lib/forceAtlas2/quadTree.js +16 -17
- package/lib/forceAtlas2/quadTree.js.map +1 -1
- package/lib/fruchterman.d.ts +1 -1
- package/lib/fruchterman.js +185 -205
- package/lib/fruchterman.js.map +1 -1
- package/lib/grid.d.ts +1 -1
- package/lib/grid.js +197 -207
- package/lib/grid.js.map +1 -1
- package/lib/index.d.ts +1 -15
- package/lib/index.js +1 -15
- package/lib/index.js.map +1 -1
- package/lib/mds.d.ts +1 -1
- package/lib/mds.js +68 -78
- package/lib/mds.js.map +1 -1
- package/lib/radial/index.d.ts +1 -1
- package/lib/radial/index.js +177 -184
- package/lib/radial/index.js.map +1 -1
- package/lib/radial/mds.d.ts +1 -1
- package/lib/radial/mds.js +15 -13
- 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 +36 -37
- package/lib/radial/radial-nonoverlap-force.js.map +1 -1
- package/lib/random.d.ts +1 -1
- package/lib/random.js +53 -66
- package/lib/random.js.map +1 -1
- package/lib/registry.d.ts +2 -2
- package/lib/registry.js +3 -1
- package/lib/registry.js.map +1 -1
- package/lib/supervisor.d.ts +2 -3
- package/lib/supervisor.js +57 -56
- package/lib/supervisor.js.map +1 -1
- package/lib/types.d.ts +20 -75
- package/lib/types.js.map +1 -1
- package/lib/util/array.js +1 -1
- package/lib/util/array.js.map +1 -1
- package/lib/util/common.d.ts +1 -1
- package/lib/util/common.js +7 -8
- package/lib/util/common.js.map +1 -1
- package/lib/util/function.js +23 -25
- package/lib/util/function.js.map +1 -1
- package/lib/util/index.d.ts +0 -2
- package/lib/util/index.js +0 -2
- package/lib/util/index.js.map +1 -1
- package/lib/util/math.d.ts +1 -26
- package/lib/util/math.js +41 -149
- package/lib/util/math.js.map +1 -1
- package/lib/util/object.d.ts +1 -1
- package/lib/util/object.js +13 -13
- package/lib/util/object.js.map +1 -1
- package/lib/util/size.d.ts +3 -0
- package/lib/util/size.js +12 -0
- package/lib/util/size.js.map +1 -0
- package/lib/worker.js +30 -31
- package/lib/worker.js.map +1 -1
- package/package.json +9 -5
- package/dist/aa1bb0ccc06b11cf79c1.worker.js +0 -2
- package/dist/aa1bb0ccc06b11cf79c1.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.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.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.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.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/types.d.ts
CHANGED
|
@@ -1,71 +1,39 @@
|
|
|
1
|
-
import {
|
|
2
|
-
export interface NodeData
|
|
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
|
-
|
|
11
|
-
|
|
12
|
-
|
|
13
|
-
|
|
14
|
-
|
|
15
|
-
|
|
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
|
|
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
|
-
|
|
44
|
-
export
|
|
45
|
-
|
|
46
|
-
export
|
|
47
|
-
|
|
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
|
|
58
|
-
export
|
|
59
|
-
export
|
|
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
|
|
66
|
-
export
|
|
33
|
+
export type Matrix = number[];
|
|
34
|
+
export type LayoutMapping = {
|
|
67
35
|
nodes: OutNode[];
|
|
68
|
-
edges:
|
|
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,26 +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
|
-
ranker?: 'network-simplex' | 'tight-tree' | 'longest-path';
|
|
188
|
-
align?: DagreAlign;
|
|
189
|
-
begin?: PointTuple;
|
|
190
|
-
nodeSize?: number | number[] | ((nodeData: Node) => number);
|
|
191
|
-
nodesep?: number;
|
|
192
|
-
ranksep?: number;
|
|
193
|
-
controlPoints?: boolean;
|
|
194
|
-
sortByCombo?: boolean;
|
|
195
|
-
edgeLabelSpace?: boolean;
|
|
196
|
-
nodeOrder?: string[];
|
|
197
|
-
radial?: boolean;
|
|
198
|
-
focusNode?: ID | Node | null;
|
|
199
|
-
preset?: OutNode[];
|
|
200
|
-
nodesepFunc?: (d?: Node) => number;
|
|
201
|
-
ranksepFunc?: (d?: Node) => number;
|
|
202
|
-
}
|
|
203
148
|
export interface D3ForceLayoutOptions {
|
|
204
149
|
center?: PointTuple;
|
|
205
150
|
linkDistance?: number | ((edge?: Edge) => number);
|
package/lib/types.js.map
CHANGED
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"types.js","sourceRoot":"","sources":["../src/types.ts"],"names":[],"mappings":"
|
|
1
|
+
{"version":3,"file":"types.js","sourceRoot":"","sources":["../src/types.ts"],"names":[],"mappings":"AA0DA,MAAM,UAAU,sBAAsB,CACpC,MAAW;IAEX,OAAO,CAAC,CAAC,MAAM,CAAC,IAAI,IAAI,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC;AACxC,CAAC"}
|
package/lib/util/array.js
CHANGED
|
@@ -1,2 +1,2 @@
|
|
|
1
|
-
export
|
|
1
|
+
export const isArray = Array.isArray;
|
|
2
2
|
//# sourceMappingURL=array.js.map
|
package/lib/util/array.js.map
CHANGED
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"array.js","sourceRoot":"","sources":["../../src/util/array.ts"],"names":[],"mappings":"AAAA,MAAM,CAAC,
|
|
1
|
+
{"version":3,"file":"array.js","sourceRoot":"","sources":["../../src/util/array.ts"],"names":[],"mappings":"AAAA,MAAM,CAAC,MAAM,OAAO,GAAG,KAAK,CAAC,OAAO,CAAC"}
|
package/lib/util/common.d.ts
CHANGED
package/lib/util/common.js
CHANGED
|
@@ -1,4 +1,3 @@
|
|
|
1
|
-
import { __assign } from "tslib";
|
|
2
1
|
/**
|
|
3
2
|
* Assign or only return the result for the graph who has no nodes or only one node.
|
|
4
3
|
* @param graph original graph
|
|
@@ -6,11 +5,11 @@ import { __assign } from "tslib";
|
|
|
6
5
|
* @param center the layout center
|
|
7
6
|
* @returns
|
|
8
7
|
*/
|
|
9
|
-
export
|
|
10
|
-
|
|
11
|
-
|
|
8
|
+
export const handleSingleNodeGraph = (graph, assign, center) => {
|
|
9
|
+
const nodes = graph.getAllNodes();
|
|
10
|
+
const edges = graph.getAllEdges();
|
|
12
11
|
if (!(nodes === null || nodes === void 0 ? void 0 : nodes.length)) {
|
|
13
|
-
|
|
12
|
+
const result = { nodes: [], edges };
|
|
14
13
|
return result;
|
|
15
14
|
}
|
|
16
15
|
if (nodes.length === 1) {
|
|
@@ -20,11 +19,11 @@ export var handleSingleNodeGraph = function (graph, assign, center) {
|
|
|
20
19
|
y: center[1],
|
|
21
20
|
});
|
|
22
21
|
}
|
|
23
|
-
|
|
22
|
+
const result = {
|
|
24
23
|
nodes: [
|
|
25
|
-
|
|
24
|
+
Object.assign(Object.assign({}, nodes[0]), { data: Object.assign(Object.assign({}, nodes[0].data), { x: center[0], y: center[1] }) }),
|
|
26
25
|
],
|
|
27
|
-
edges
|
|
26
|
+
edges,
|
|
28
27
|
};
|
|
29
28
|
return result;
|
|
30
29
|
}
|
package/lib/util/common.js.map
CHANGED
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"common.js","sourceRoot":"","sources":["../../src/util/common.ts"],"names":[],"mappings":"
|
|
1
|
+
{"version":3,"file":"common.js","sourceRoot":"","sources":["../../src/util/common.ts"],"names":[],"mappings":"AAEA;;;;;;GAMG;AACH,MAAM,CAAC,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"}
|
package/lib/util/function.js
CHANGED
|
@@ -1,4 +1,3 @@
|
|
|
1
|
-
import { __read, __spreadArray } from "tslib";
|
|
2
1
|
import { isFunction, isNumber, isObject } from '@antv/util';
|
|
3
2
|
/**
|
|
4
3
|
* Format value with multiple types into a function returns number.
|
|
@@ -7,17 +6,17 @@ import { isFunction, isNumber, isObject } from '@antv/util';
|
|
|
7
6
|
* @returns formatted result, a function returns number
|
|
8
7
|
*/
|
|
9
8
|
export function formatNumberFn(defaultValue, value) {
|
|
10
|
-
|
|
9
|
+
let resultFunc;
|
|
11
10
|
if (isFunction(value)) {
|
|
12
11
|
resultFunc = value;
|
|
13
12
|
}
|
|
14
13
|
else if (isNumber(value)) {
|
|
15
14
|
// value is number
|
|
16
|
-
resultFunc =
|
|
15
|
+
resultFunc = () => value;
|
|
17
16
|
}
|
|
18
17
|
else {
|
|
19
18
|
// value is not number and function
|
|
20
|
-
resultFunc =
|
|
19
|
+
resultFunc = () => defaultValue;
|
|
21
20
|
}
|
|
22
21
|
return resultFunc;
|
|
23
22
|
}
|
|
@@ -28,11 +27,10 @@ export function formatNumberFn(defaultValue, value) {
|
|
|
28
27
|
* @param resultIsNumber whether returns number
|
|
29
28
|
* @returns formatted result, a function returns number
|
|
30
29
|
*/
|
|
31
|
-
export function formatSizeFn(defaultValue, value, resultIsNumber) {
|
|
32
|
-
if (resultIsNumber === void 0) { resultIsNumber = true; }
|
|
30
|
+
export function formatSizeFn(defaultValue, value, resultIsNumber = true) {
|
|
33
31
|
if (!value && value !== 0) {
|
|
34
|
-
return
|
|
35
|
-
|
|
32
|
+
return (d) => {
|
|
33
|
+
const { size } = d.data || {};
|
|
36
34
|
if (size) {
|
|
37
35
|
if (Array.isArray(size)) {
|
|
38
36
|
return size[0] > size[1] ? size[0] : size[1];
|
|
@@ -49,27 +47,27 @@ export function formatSizeFn(defaultValue, value, resultIsNumber) {
|
|
|
49
47
|
return value;
|
|
50
48
|
}
|
|
51
49
|
if (isNumber(value)) {
|
|
52
|
-
return
|
|
50
|
+
return () => value;
|
|
53
51
|
}
|
|
54
52
|
if (Array.isArray(value)) {
|
|
55
|
-
return
|
|
53
|
+
return () => {
|
|
56
54
|
if (resultIsNumber) {
|
|
57
|
-
|
|
55
|
+
const max = Math.max(...value);
|
|
58
56
|
return isNaN(max) ? defaultValue : max;
|
|
59
57
|
}
|
|
60
58
|
return value;
|
|
61
59
|
};
|
|
62
60
|
}
|
|
63
61
|
if (isObject(value)) {
|
|
64
|
-
return
|
|
62
|
+
return () => {
|
|
65
63
|
if (resultIsNumber) {
|
|
66
|
-
|
|
64
|
+
const max = Math.max(value.width, value.height);
|
|
67
65
|
return isNaN(max) ? defaultValue : max;
|
|
68
66
|
}
|
|
69
67
|
return [value.width, value.height];
|
|
70
68
|
};
|
|
71
69
|
}
|
|
72
|
-
return
|
|
70
|
+
return () => defaultValue;
|
|
73
71
|
}
|
|
74
72
|
/**
|
|
75
73
|
* format the props nodeSize and nodeSpacing to a function
|
|
@@ -77,20 +75,20 @@ export function formatSizeFn(defaultValue, value, resultIsNumber) {
|
|
|
77
75
|
* @param nodeSpacing
|
|
78
76
|
* @returns
|
|
79
77
|
*/
|
|
80
|
-
export
|
|
81
|
-
|
|
82
|
-
|
|
78
|
+
export const formatNodeSize = (nodeSize, nodeSpacing) => {
|
|
79
|
+
let nodeSizeFunc;
|
|
80
|
+
let nodeSpacingFunc;
|
|
83
81
|
if (isNumber(nodeSpacing)) {
|
|
84
|
-
nodeSpacingFunc =
|
|
82
|
+
nodeSpacingFunc = () => nodeSpacing;
|
|
85
83
|
}
|
|
86
84
|
else if (isFunction(nodeSpacing)) {
|
|
87
85
|
nodeSpacingFunc = nodeSpacing;
|
|
88
86
|
}
|
|
89
87
|
else {
|
|
90
|
-
nodeSpacingFunc =
|
|
88
|
+
nodeSpacingFunc = () => 0;
|
|
91
89
|
}
|
|
92
90
|
if (!nodeSize) {
|
|
93
|
-
nodeSizeFunc =
|
|
91
|
+
nodeSizeFunc = (d) => {
|
|
94
92
|
var _a, _b;
|
|
95
93
|
if ((_a = d.data) === null || _a === void 0 ? void 0 : _a.bboxSize) {
|
|
96
94
|
return (Math.max(d.data.bboxSize[0], d.data.bboxSize[1]) + nodeSpacingFunc(d));
|
|
@@ -99,9 +97,9 @@ export var formatNodeSize = function (nodeSize, nodeSpacing) {
|
|
|
99
97
|
if (Array.isArray(d.data.size)) {
|
|
100
98
|
return Math.max(d.data.size[0], d.data.size[1]) + nodeSpacingFunc(d);
|
|
101
99
|
}
|
|
102
|
-
|
|
100
|
+
const dataSize = d.data.size;
|
|
103
101
|
if (isObject(dataSize)) {
|
|
104
|
-
|
|
102
|
+
const res = dataSize.width > dataSize.height ? dataSize.width : dataSize.height;
|
|
105
103
|
return res + nodeSpacingFunc(d);
|
|
106
104
|
}
|
|
107
105
|
return dataSize + nodeSpacingFunc(d);
|
|
@@ -110,8 +108,8 @@ export var formatNodeSize = function (nodeSize, nodeSpacing) {
|
|
|
110
108
|
};
|
|
111
109
|
}
|
|
112
110
|
else if (Array.isArray(nodeSize)) {
|
|
113
|
-
nodeSizeFunc =
|
|
114
|
-
|
|
111
|
+
nodeSizeFunc = (d) => {
|
|
112
|
+
const res = nodeSize[0] > nodeSize[1] ? nodeSize[0] : nodeSize[1];
|
|
115
113
|
return res + nodeSpacingFunc(d);
|
|
116
114
|
};
|
|
117
115
|
}
|
|
@@ -119,7 +117,7 @@ export var formatNodeSize = function (nodeSize, nodeSpacing) {
|
|
|
119
117
|
nodeSizeFunc = nodeSize;
|
|
120
118
|
}
|
|
121
119
|
else {
|
|
122
|
-
nodeSizeFunc =
|
|
120
|
+
nodeSizeFunc = (d) => nodeSize + nodeSpacingFunc(d);
|
|
123
121
|
}
|
|
124
122
|
return nodeSizeFunc;
|
|
125
123
|
};
|
package/lib/util/function.js.map
CHANGED
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"function.js","sourceRoot":"","sources":["../../src/util/function.ts"],"names":[],"mappings":"
|
|
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,GAAG,EAAE,CAAC,KAAK,CAAC;KAC1B;SAAM;QACL,mCAAmC;QACnC,UAAU,GAAG,GAAG,EAAE,CAAC,YAAY,CAAC;KACjC;IACD,OAAO,UAAU,CAAC;AACpB,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,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,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,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,QAAQ,CAAC,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;AAED;;;;;GAKG;AACH,MAAM,CAAC,MAAM,cAAc,GAAG,CAC5B,QAAsE,EACtE,WAA0C,EACZ,EAAE;IAChC,IAAI,YAAY,CAAC;IACjB,IAAI,eAAyB,CAAC;IAC9B,IAAI,QAAQ,CAAC,WAAW,CAAC,EAAE;QACzB,eAAe,GAAG,GAAG,EAAE,CAAC,WAAW,CAAC;KACrC;SAAM,IAAI,UAAU,CAAC,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,QAAQ,CAAoC,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,UAAU,CAAC,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"}
|
package/lib/util/index.d.ts
CHANGED
package/lib/util/index.js
CHANGED
package/lib/util/index.js.map
CHANGED
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/util/index.ts"],"names":[],"mappings":"AAAA,cAAc,
|
|
1
|
+
{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/util/index.ts"],"names":[],"mappings":"AAAA,cAAc,SAAS,CAAC;AACxB,cAAc,QAAQ,CAAC;AACvB,cAAc,UAAU,CAAC;AACzB,cAAc,YAAY,CAAC"}
|
package/lib/util/math.d.ts
CHANGED
|
@@ -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
|