lowcoder-comps 0.0.26 → 0.0.28
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/000297fb.js +5 -0
- package/{92fb34a2.js → 0205ce17.js} +27 -27
- package/{3f63d12d.js → 1269154d.js} +32711 -34763
- package/{6fbc4c21.js → 1f088099.js} +18 -18
- package/{2b3b3386.js → 2ae47d58.js} +548 -548
- package/2ff7471d.js +9 -0
- package/{44cd1a62.js → 42b75267.js} +11 -11
- package/{ed8c376c.js → 45a7c119.js} +286 -293
- package/4bc5ef7f.js +881 -0
- package/{90d3581f.js → 4c822e6b.js} +133 -132
- package/5bb002c8.js +64 -0
- package/{82c8e71b.js → 6517e88b.js} +12 -10
- package/65d3daa9.js +391 -0
- package/{87b4699c.js → 6909d829.js} +1 -1
- package/{b28dda80.js → 711961f8.js} +13 -12
- package/77491f00.js +86 -0
- package/7805c934.js +455 -0
- package/7dc7ce37.js +19104 -0
- package/{c3caea77.js → 83feec48.js} +45 -43
- package/{c66d9114.js → 8c8fb30b.js} +25 -24
- package/{3220cb2e.js → 945d7302.js} +2 -1
- package/{4891fa68.js → 9a9b397d.js} +6 -5
- package/{3ebbaeae.js → a2d32dbb.js} +18 -18
- package/{2c0287e1.js → a39d3869.js} +2 -2
- package/a40faea7.js +11624 -0
- package/b7bda09a.js +237 -0
- package/{5f138044.js → b99f5b2a.js} +158 -147
- package/bcc07d29.js +1536 -0
- package/c2bf7d82.js +819 -0
- package/c4bd6ed7.js +1269 -0
- package/c4c5f13b.js +8 -0
- package/d2bae1f4.js +2284 -0
- package/d4b9d281.js +1089 -0
- package/{11b36d97.js → d4ba48b2.js} +148 -145
- package/dd0ec77a.js +48428 -0
- package/{c889073f.js → e0bacb89.js} +1 -1
- package/{b70abaaf.js → e437d53e.js} +1 -1
- package/e95fa522.js +1102 -0
- package/ed46c11a.js +1276 -0
- package/f2b8cbc8.js +25 -0
- package/index.js +2 -2
- package/package.json +1 -1
- package/33035c6f.js +0 -86
- package/3f82489c.js +0 -2396
- package/454ca826.js +0 -46724
- package/4938ecf8.js +0 -22
- package/558b96ef.js +0 -18798
- package/596b7f71.js +0 -365
- package/637a168a.js +0 -235
- package/765a2a38.js +0 -1055
- package/8ed940ee.js +0 -786
- package/9c1ceb2f.js +0 -448
- package/aad4f2fa.js +0 -1235
- package/b053e17f.js +0 -1000
- package/bed24264.js +0 -2192
- package/d3478475.js +0 -64
|
@@ -1,52 +1,47 @@
|
|
|
1
|
-
import { c as rt, g as mt, s as
|
|
1
|
+
import { c as rt, g as mt, s as kt, a as _t, b as xt, D as vt, C as bt, E as wt, j as St, aq as Lt, h as G, t as Et } from "./1269154d.js";
|
|
2
2
|
import { o as At } from "./92e85b65.js";
|
|
3
|
+
import { s as Tt } from "./2ff7471d.js";
|
|
3
4
|
import "./f9637058.js";
|
|
4
|
-
function Tt(t) {
|
|
5
|
-
for (var i = t.length / 6 | 0, s = new Array(i), a = 0; a < i; )
|
|
6
|
-
s[a] = "#" + t.slice(a * 6, ++a * 6);
|
|
7
|
-
return s;
|
|
8
|
-
}
|
|
9
|
-
const Mt = Tt("4e79a7f28e2ce1575976b7b259a14fedc949af7aa1ff9da79c755fbab0ab");
|
|
10
5
|
function ot(t, i) {
|
|
11
|
-
let
|
|
6
|
+
let r;
|
|
12
7
|
if (i === void 0)
|
|
13
|
-
for (const
|
|
14
|
-
|
|
8
|
+
for (const c of t)
|
|
9
|
+
c != null && (r < c || r === void 0 && c >= c) && (r = c);
|
|
15
10
|
else {
|
|
16
|
-
let
|
|
11
|
+
let c = -1;
|
|
17
12
|
for (let h of t)
|
|
18
|
-
(h = i(h, ++
|
|
13
|
+
(h = i(h, ++c, t)) != null && (r < h || r === void 0 && h >= h) && (r = h);
|
|
19
14
|
}
|
|
20
|
-
return
|
|
15
|
+
return r;
|
|
21
16
|
}
|
|
22
17
|
function yt(t, i) {
|
|
23
|
-
let
|
|
18
|
+
let r;
|
|
24
19
|
if (i === void 0)
|
|
25
|
-
for (const
|
|
26
|
-
|
|
20
|
+
for (const c of t)
|
|
21
|
+
c != null && (r > c || r === void 0 && c >= c) && (r = c);
|
|
27
22
|
else {
|
|
28
|
-
let
|
|
23
|
+
let c = -1;
|
|
29
24
|
for (let h of t)
|
|
30
|
-
(h = i(h, ++
|
|
25
|
+
(h = i(h, ++c, t)) != null && (r > h || r === void 0 && h >= h) && (r = h);
|
|
31
26
|
}
|
|
32
|
-
return
|
|
27
|
+
return r;
|
|
33
28
|
}
|
|
34
29
|
function Z(t, i) {
|
|
35
|
-
let
|
|
30
|
+
let r = 0;
|
|
36
31
|
if (i === void 0)
|
|
37
|
-
for (let
|
|
38
|
-
(
|
|
32
|
+
for (let c of t)
|
|
33
|
+
(c = +c) && (r += c);
|
|
39
34
|
else {
|
|
40
|
-
let
|
|
35
|
+
let c = -1;
|
|
41
36
|
for (let h of t)
|
|
42
|
-
(h = +i(h, ++
|
|
37
|
+
(h = +i(h, ++c, t)) && (r += h);
|
|
43
38
|
}
|
|
44
|
-
return
|
|
39
|
+
return r;
|
|
45
40
|
}
|
|
46
|
-
function
|
|
41
|
+
function Mt(t) {
|
|
47
42
|
return t.target.depth;
|
|
48
43
|
}
|
|
49
|
-
function
|
|
44
|
+
function Nt(t) {
|
|
50
45
|
return t.depth;
|
|
51
46
|
}
|
|
52
47
|
function Ct(t, i) {
|
|
@@ -55,93 +50,93 @@ function Ct(t, i) {
|
|
|
55
50
|
function dt(t, i) {
|
|
56
51
|
return t.sourceLinks.length ? t.depth : i - 1;
|
|
57
52
|
}
|
|
58
|
-
function
|
|
59
|
-
return t.targetLinks.length ? t.depth : t.sourceLinks.length ? yt(t.sourceLinks,
|
|
53
|
+
function Pt(t) {
|
|
54
|
+
return t.targetLinks.length ? t.depth : t.sourceLinks.length ? yt(t.sourceLinks, Mt) - 1 : 0;
|
|
60
55
|
}
|
|
61
|
-
function
|
|
56
|
+
function Y(t) {
|
|
62
57
|
return function() {
|
|
63
58
|
return t;
|
|
64
59
|
};
|
|
65
60
|
}
|
|
66
61
|
function lt(t, i) {
|
|
67
|
-
return
|
|
62
|
+
return q(t.source, i.source) || t.index - i.index;
|
|
68
63
|
}
|
|
69
64
|
function at(t, i) {
|
|
70
|
-
return
|
|
65
|
+
return q(t.target, i.target) || t.index - i.index;
|
|
71
66
|
}
|
|
72
|
-
function
|
|
67
|
+
function q(t, i) {
|
|
73
68
|
return t.y0 - i.y0;
|
|
74
69
|
}
|
|
75
70
|
function J(t) {
|
|
76
71
|
return t.value;
|
|
77
72
|
}
|
|
78
|
-
function
|
|
73
|
+
function It(t) {
|
|
79
74
|
return t.index;
|
|
80
75
|
}
|
|
81
76
|
function $t(t) {
|
|
82
77
|
return t.nodes;
|
|
83
78
|
}
|
|
84
|
-
function
|
|
79
|
+
function Ot(t) {
|
|
85
80
|
return t.links;
|
|
86
81
|
}
|
|
87
82
|
function ct(t, i) {
|
|
88
|
-
const
|
|
89
|
-
if (!
|
|
83
|
+
const r = t.get(i);
|
|
84
|
+
if (!r)
|
|
90
85
|
throw new Error("missing: " + i);
|
|
91
|
-
return
|
|
86
|
+
return r;
|
|
92
87
|
}
|
|
93
88
|
function ut({ nodes: t }) {
|
|
94
89
|
for (const i of t) {
|
|
95
|
-
let
|
|
90
|
+
let r = i.y0, c = r;
|
|
96
91
|
for (const h of i.sourceLinks)
|
|
97
|
-
h.y0 =
|
|
92
|
+
h.y0 = r + h.width / 2, r += h.width;
|
|
98
93
|
for (const h of i.targetLinks)
|
|
99
|
-
h.y1 =
|
|
94
|
+
h.y1 = c + h.width / 2, c += h.width;
|
|
100
95
|
}
|
|
101
96
|
}
|
|
102
97
|
function jt() {
|
|
103
|
-
let t = 0, i = 0,
|
|
104
|
-
function
|
|
105
|
-
const n = { nodes:
|
|
98
|
+
let t = 0, i = 0, r = 1, c = 1, h = 24, k = 8, d, g = It, s = dt, l, u, p = $t, v = Ot, y = 6;
|
|
99
|
+
function _() {
|
|
100
|
+
const n = { nodes: p.apply(null, arguments), links: v.apply(null, arguments) };
|
|
106
101
|
return E(n), L(n), A(n), N(n), b(n), ut(n), n;
|
|
107
102
|
}
|
|
108
|
-
|
|
103
|
+
_.update = function(n) {
|
|
109
104
|
return ut(n), n;
|
|
110
|
-
},
|
|
111
|
-
return arguments.length ? (
|
|
112
|
-
},
|
|
113
|
-
return arguments.length ? (
|
|
114
|
-
},
|
|
115
|
-
return arguments.length ? (l = n,
|
|
116
|
-
},
|
|
117
|
-
return arguments.length ? (h = +n,
|
|
118
|
-
},
|
|
119
|
-
return arguments.length ? (
|
|
120
|
-
},
|
|
121
|
-
return arguments.length ? (
|
|
122
|
-
},
|
|
123
|
-
return arguments.length ? (v = typeof n == "function" ? n :
|
|
124
|
-
},
|
|
125
|
-
return arguments.length ? (u = n,
|
|
126
|
-
},
|
|
127
|
-
return arguments.length ? (t = i = 0,
|
|
128
|
-
},
|
|
129
|
-
return arguments.length ? (t = +n[0][0],
|
|
130
|
-
},
|
|
131
|
-
return arguments.length ? (y = +n,
|
|
105
|
+
}, _.nodeId = function(n) {
|
|
106
|
+
return arguments.length ? (g = typeof n == "function" ? n : Y(n), _) : g;
|
|
107
|
+
}, _.nodeAlign = function(n) {
|
|
108
|
+
return arguments.length ? (s = typeof n == "function" ? n : Y(n), _) : s;
|
|
109
|
+
}, _.nodeSort = function(n) {
|
|
110
|
+
return arguments.length ? (l = n, _) : l;
|
|
111
|
+
}, _.nodeWidth = function(n) {
|
|
112
|
+
return arguments.length ? (h = +n, _) : h;
|
|
113
|
+
}, _.nodePadding = function(n) {
|
|
114
|
+
return arguments.length ? (k = d = +n, _) : k;
|
|
115
|
+
}, _.nodes = function(n) {
|
|
116
|
+
return arguments.length ? (p = typeof n == "function" ? n : Y(n), _) : p;
|
|
117
|
+
}, _.links = function(n) {
|
|
118
|
+
return arguments.length ? (v = typeof n == "function" ? n : Y(n), _) : v;
|
|
119
|
+
}, _.linkSort = function(n) {
|
|
120
|
+
return arguments.length ? (u = n, _) : u;
|
|
121
|
+
}, _.size = function(n) {
|
|
122
|
+
return arguments.length ? (t = i = 0, r = +n[0], c = +n[1], _) : [r - t, c - i];
|
|
123
|
+
}, _.extent = function(n) {
|
|
124
|
+
return arguments.length ? (t = +n[0][0], r = +n[1][0], i = +n[0][1], c = +n[1][1], _) : [[t, i], [r, c]];
|
|
125
|
+
}, _.iterations = function(n) {
|
|
126
|
+
return arguments.length ? (y = +n, _) : y;
|
|
132
127
|
};
|
|
133
128
|
function E({ nodes: n, links: f }) {
|
|
134
|
-
for (const [
|
|
135
|
-
o.index =
|
|
136
|
-
const e = new Map(n.map((
|
|
137
|
-
for (const [
|
|
138
|
-
o.index =
|
|
129
|
+
for (const [a, o] of n.entries())
|
|
130
|
+
o.index = a, o.sourceLinks = [], o.targetLinks = [];
|
|
131
|
+
const e = new Map(n.map((a, o) => [g(a, o, n), a]));
|
|
132
|
+
for (const [a, o] of f.entries()) {
|
|
133
|
+
o.index = a;
|
|
139
134
|
let { source: m, target: x } = o;
|
|
140
135
|
typeof m != "object" && (m = o.source = ct(e, m)), typeof x != "object" && (x = o.target = ct(e, x)), m.sourceLinks.push(o), x.targetLinks.push(o);
|
|
141
136
|
}
|
|
142
137
|
if (u != null)
|
|
143
|
-
for (const { sourceLinks:
|
|
144
|
-
|
|
138
|
+
for (const { sourceLinks: a, targetLinks: o } of n)
|
|
139
|
+
a.sort(u), o.sort(u);
|
|
145
140
|
}
|
|
146
141
|
function L({ nodes: n }) {
|
|
147
142
|
for (const f of n)
|
|
@@ -149,115 +144,115 @@ function jt() {
|
|
|
149
144
|
}
|
|
150
145
|
function A({ nodes: n }) {
|
|
151
146
|
const f = n.length;
|
|
152
|
-
let e = new Set(n),
|
|
147
|
+
let e = new Set(n), a = /* @__PURE__ */ new Set(), o = 0;
|
|
153
148
|
for (; e.size; ) {
|
|
154
149
|
for (const m of e) {
|
|
155
150
|
m.depth = o;
|
|
156
151
|
for (const { target: x } of m.sourceLinks)
|
|
157
|
-
|
|
152
|
+
a.add(x);
|
|
158
153
|
}
|
|
159
154
|
if (++o > f)
|
|
160
155
|
throw new Error("circular link");
|
|
161
|
-
e =
|
|
156
|
+
e = a, a = /* @__PURE__ */ new Set();
|
|
162
157
|
}
|
|
163
158
|
}
|
|
164
159
|
function N({ nodes: n }) {
|
|
165
160
|
const f = n.length;
|
|
166
|
-
let e = new Set(n),
|
|
161
|
+
let e = new Set(n), a = /* @__PURE__ */ new Set(), o = 0;
|
|
167
162
|
for (; e.size; ) {
|
|
168
163
|
for (const m of e) {
|
|
169
164
|
m.height = o;
|
|
170
165
|
for (const { source: x } of m.targetLinks)
|
|
171
|
-
|
|
166
|
+
a.add(x);
|
|
172
167
|
}
|
|
173
168
|
if (++o > f)
|
|
174
169
|
throw new Error("circular link");
|
|
175
|
-
e =
|
|
170
|
+
e = a, a = /* @__PURE__ */ new Set();
|
|
176
171
|
}
|
|
177
172
|
}
|
|
178
|
-
function
|
|
179
|
-
const f = ot(n, (o) => o.depth) + 1, e = (
|
|
173
|
+
function C({ nodes: n }) {
|
|
174
|
+
const f = ot(n, (o) => o.depth) + 1, e = (r - t - h) / (f - 1), a = new Array(f);
|
|
180
175
|
for (const o of n) {
|
|
181
|
-
const m = Math.max(0, Math.min(f - 1, Math.floor(
|
|
182
|
-
o.layer = m, o.x0 = t + m * e, o.x1 = o.x0 + h,
|
|
176
|
+
const m = Math.max(0, Math.min(f - 1, Math.floor(s.call(null, o, f))));
|
|
177
|
+
o.layer = m, o.x0 = t + m * e, o.x1 = o.x0 + h, a[m] ? a[m].push(o) : a[m] = [o];
|
|
183
178
|
}
|
|
184
179
|
if (l)
|
|
185
|
-
for (const o of
|
|
180
|
+
for (const o of a)
|
|
186
181
|
o.sort(l);
|
|
187
|
-
return
|
|
182
|
+
return a;
|
|
188
183
|
}
|
|
189
|
-
function
|
|
190
|
-
const f = yt(n, (e) => (
|
|
184
|
+
function j(n) {
|
|
185
|
+
const f = yt(n, (e) => (c - i - (e.length - 1) * d) / Z(e, J));
|
|
191
186
|
for (const e of n) {
|
|
192
|
-
let
|
|
187
|
+
let a = i;
|
|
193
188
|
for (const o of e) {
|
|
194
|
-
o.y0 =
|
|
189
|
+
o.y0 = a, o.y1 = a + o.value * f, a = o.y1 + d;
|
|
195
190
|
for (const m of o.sourceLinks)
|
|
196
191
|
m.width = m.value * f;
|
|
197
192
|
}
|
|
198
|
-
|
|
193
|
+
a = (c - a + d) / (e.length + 1);
|
|
199
194
|
for (let o = 0; o < e.length; ++o) {
|
|
200
195
|
const m = e[o];
|
|
201
|
-
m.y0 +=
|
|
196
|
+
m.y0 += a * (o + 1), m.y1 += a * (o + 1);
|
|
202
197
|
}
|
|
203
198
|
T(e);
|
|
204
199
|
}
|
|
205
200
|
}
|
|
206
201
|
function b(n) {
|
|
207
|
-
const f =
|
|
208
|
-
d = Math.min(
|
|
202
|
+
const f = C(n);
|
|
203
|
+
d = Math.min(k, (c - i) / (ot(f, (e) => e.length) - 1)), j(f);
|
|
209
204
|
for (let e = 0; e < y; ++e) {
|
|
210
|
-
const
|
|
211
|
-
|
|
205
|
+
const a = Math.pow(0.99, e), o = Math.max(1 - a, (e + 1) / y);
|
|
206
|
+
$(f, a, o), M(f, a, o);
|
|
212
207
|
}
|
|
213
208
|
}
|
|
214
209
|
function M(n, f, e) {
|
|
215
|
-
for (let
|
|
216
|
-
const m = n[
|
|
210
|
+
for (let a = 1, o = n.length; a < o; ++a) {
|
|
211
|
+
const m = n[a];
|
|
217
212
|
for (const x of m) {
|
|
218
|
-
let
|
|
213
|
+
let R = 0, D = 0;
|
|
219
214
|
for (const { source: F, value: K } of x.targetLinks) {
|
|
220
215
|
let W = K * (x.layer - F.layer);
|
|
221
|
-
|
|
216
|
+
R += S(F, x) * W, D += W;
|
|
222
217
|
}
|
|
223
218
|
if (!(D > 0))
|
|
224
219
|
continue;
|
|
225
|
-
let
|
|
226
|
-
x.y0 +=
|
|
220
|
+
let U = (R / D - x.y0) * f;
|
|
221
|
+
x.y0 += U, x.y1 += U, w(x);
|
|
227
222
|
}
|
|
228
|
-
l === void 0 && m.sort(
|
|
223
|
+
l === void 0 && m.sort(q), P(m, e);
|
|
229
224
|
}
|
|
230
225
|
}
|
|
231
|
-
function
|
|
232
|
-
for (let
|
|
226
|
+
function $(n, f, e) {
|
|
227
|
+
for (let a = n.length, o = a - 2; o >= 0; --o) {
|
|
233
228
|
const m = n[o];
|
|
234
229
|
for (const x of m) {
|
|
235
|
-
let
|
|
230
|
+
let R = 0, D = 0;
|
|
236
231
|
for (const { target: F, value: K } of x.sourceLinks) {
|
|
237
232
|
let W = K * (F.layer - x.layer);
|
|
238
|
-
|
|
233
|
+
R += O(x, F) * W, D += W;
|
|
239
234
|
}
|
|
240
235
|
if (!(D > 0))
|
|
241
236
|
continue;
|
|
242
|
-
let
|
|
243
|
-
x.y0 +=
|
|
237
|
+
let U = (R / D - x.y0) * f;
|
|
238
|
+
x.y0 += U, x.y1 += U, w(x);
|
|
244
239
|
}
|
|
245
|
-
l === void 0 && m.sort(
|
|
240
|
+
l === void 0 && m.sort(q), P(m, e);
|
|
246
241
|
}
|
|
247
242
|
}
|
|
248
|
-
function
|
|
249
|
-
const e = n.length >> 1,
|
|
250
|
-
|
|
243
|
+
function P(n, f) {
|
|
244
|
+
const e = n.length >> 1, a = n[e];
|
|
245
|
+
z(n, a.y0 - d, e - 1, f), I(n, a.y1 + d, e + 1, f), z(n, c, n.length - 1, f), I(n, i, 0, f);
|
|
251
246
|
}
|
|
252
|
-
function I(n, f, e,
|
|
247
|
+
function I(n, f, e, a) {
|
|
253
248
|
for (; e < n.length; ++e) {
|
|
254
|
-
const o = n[e], m = (f - o.y0) *
|
|
249
|
+
const o = n[e], m = (f - o.y0) * a;
|
|
255
250
|
m > 1e-6 && (o.y0 += m, o.y1 += m), f = o.y1 + d;
|
|
256
251
|
}
|
|
257
252
|
}
|
|
258
|
-
function
|
|
253
|
+
function z(n, f, e, a) {
|
|
259
254
|
for (; e >= 0; --e) {
|
|
260
|
-
const o = n[e], m = (o.y1 - f) *
|
|
255
|
+
const o = n[e], m = (o.y1 - f) * a;
|
|
261
256
|
m > 1e-6 && (o.y0 -= m, o.y1 -= m), f = o.y0 - d;
|
|
262
257
|
}
|
|
263
258
|
}
|
|
@@ -276,35 +271,35 @@ function jt() {
|
|
|
276
271
|
}
|
|
277
272
|
function S(n, f) {
|
|
278
273
|
let e = n.y0 - (n.sourceLinks.length - 1) * d / 2;
|
|
279
|
-
for (const { target:
|
|
280
|
-
if (
|
|
274
|
+
for (const { target: a, width: o } of n.sourceLinks) {
|
|
275
|
+
if (a === f)
|
|
281
276
|
break;
|
|
282
277
|
e += o + d;
|
|
283
278
|
}
|
|
284
|
-
for (const { source:
|
|
285
|
-
if (
|
|
279
|
+
for (const { source: a, width: o } of f.targetLinks) {
|
|
280
|
+
if (a === n)
|
|
286
281
|
break;
|
|
287
282
|
e -= o;
|
|
288
283
|
}
|
|
289
284
|
return e;
|
|
290
285
|
}
|
|
291
|
-
function
|
|
286
|
+
function O(n, f) {
|
|
292
287
|
let e = f.y0 - (f.targetLinks.length - 1) * d / 2;
|
|
293
|
-
for (const { source:
|
|
294
|
-
if (
|
|
288
|
+
for (const { source: a, width: o } of f.targetLinks) {
|
|
289
|
+
if (a === n)
|
|
295
290
|
break;
|
|
296
291
|
e += o + d;
|
|
297
292
|
}
|
|
298
|
-
for (const { target:
|
|
299
|
-
if (
|
|
293
|
+
for (const { target: a, width: o } of n.sourceLinks) {
|
|
294
|
+
if (a === f)
|
|
300
295
|
break;
|
|
301
296
|
e -= o;
|
|
302
297
|
}
|
|
303
298
|
return e;
|
|
304
299
|
}
|
|
305
|
-
return
|
|
300
|
+
return _;
|
|
306
301
|
}
|
|
307
|
-
var tt = Math.PI, et = 2 * tt, B = 1e-6,
|
|
302
|
+
var tt = Math.PI, et = 2 * tt, B = 1e-6, zt = et - B;
|
|
308
303
|
function nt() {
|
|
309
304
|
this._x0 = this._y0 = // start of current subpath
|
|
310
305
|
this._x1 = this._y1 = null, this._ = "";
|
|
@@ -323,36 +318,36 @@ nt.prototype = gt.prototype = {
|
|
|
323
318
|
lineTo: function(t, i) {
|
|
324
319
|
this._ += "L" + (this._x1 = +t) + "," + (this._y1 = +i);
|
|
325
320
|
},
|
|
326
|
-
quadraticCurveTo: function(t, i,
|
|
327
|
-
this._ += "Q" + +t + "," + +i + "," + (this._x1 = +
|
|
321
|
+
quadraticCurveTo: function(t, i, r, c) {
|
|
322
|
+
this._ += "Q" + +t + "," + +i + "," + (this._x1 = +r) + "," + (this._y1 = +c);
|
|
328
323
|
},
|
|
329
|
-
bezierCurveTo: function(t, i,
|
|
330
|
-
this._ += "C" + +t + "," + +i + "," + +
|
|
324
|
+
bezierCurveTo: function(t, i, r, c, h, k) {
|
|
325
|
+
this._ += "C" + +t + "," + +i + "," + +r + "," + +c + "," + (this._x1 = +h) + "," + (this._y1 = +k);
|
|
331
326
|
},
|
|
332
|
-
arcTo: function(t, i,
|
|
333
|
-
t = +t, i = +i,
|
|
334
|
-
var
|
|
327
|
+
arcTo: function(t, i, r, c, h) {
|
|
328
|
+
t = +t, i = +i, r = +r, c = +c, h = +h;
|
|
329
|
+
var k = this._x1, d = this._y1, g = r - t, s = c - i, l = k - t, u = d - i, p = l * l + u * u;
|
|
335
330
|
if (h < 0)
|
|
336
331
|
throw new Error("negative radius: " + h);
|
|
337
332
|
if (this._x1 === null)
|
|
338
333
|
this._ += "M" + (this._x1 = t) + "," + (this._y1 = i);
|
|
339
|
-
else if (
|
|
340
|
-
if (!(Math.abs(u *
|
|
334
|
+
else if (p > B)
|
|
335
|
+
if (!(Math.abs(u * g - s * l) > B) || !h)
|
|
341
336
|
this._ += "L" + (this._x1 = t) + "," + (this._y1 = i);
|
|
342
337
|
else {
|
|
343
|
-
var v =
|
|
344
|
-
Math.abs(
|
|
338
|
+
var v = r - k, y = c - d, _ = g * g + s * s, E = v * v + y * y, L = Math.sqrt(_), A = Math.sqrt(p), N = h * Math.tan((tt - Math.acos((_ + p - E) / (2 * L * A))) / 2), C = N / A, j = N / L;
|
|
339
|
+
Math.abs(C - 1) > B && (this._ += "L" + (t + C * l) + "," + (i + C * u)), this._ += "A" + h + "," + h + ",0,0," + +(u * v > l * y) + "," + (this._x1 = t + j * g) + "," + (this._y1 = i + j * s);
|
|
345
340
|
}
|
|
346
341
|
},
|
|
347
|
-
arc: function(t, i,
|
|
348
|
-
t = +t, i = +i,
|
|
349
|
-
var d =
|
|
350
|
-
if (
|
|
351
|
-
throw new Error("negative radius: " +
|
|
352
|
-
this._x1 === null ? this._ += "M" +
|
|
342
|
+
arc: function(t, i, r, c, h, k) {
|
|
343
|
+
t = +t, i = +i, r = +r, k = !!k;
|
|
344
|
+
var d = r * Math.cos(c), g = r * Math.sin(c), s = t + d, l = i + g, u = 1 ^ k, p = k ? c - h : h - c;
|
|
345
|
+
if (r < 0)
|
|
346
|
+
throw new Error("negative radius: " + r);
|
|
347
|
+
this._x1 === null ? this._ += "M" + s + "," + l : (Math.abs(this._x1 - s) > B || Math.abs(this._y1 - l) > B) && (this._ += "L" + s + "," + l), r && (p < 0 && (p = p % et + et), p > zt ? this._ += "A" + r + "," + r + ",0,1," + u + "," + (t - d) + "," + (i - g) + "A" + r + "," + r + ",0,1," + u + "," + (this._x1 = s) + "," + (this._y1 = l) : p > B && (this._ += "A" + r + "," + r + ",0," + +(p >= tt) + "," + u + "," + (this._x1 = t + r * Math.cos(h)) + "," + (this._y1 = i + r * Math.sin(h))));
|
|
353
348
|
},
|
|
354
|
-
rect: function(t, i,
|
|
355
|
-
this._ += "M" + (this._x0 = this._x1 = +t) + "," + (this._y0 = this._y1 = +i) + "h" + +
|
|
349
|
+
rect: function(t, i, r, c) {
|
|
350
|
+
this._ += "M" + (this._x0 = this._x1 = +t) + "," + (this._y0 = this._y1 = +i) + "h" + +r + "v" + +c + "h" + -r + "Z";
|
|
356
351
|
},
|
|
357
352
|
toString: function() {
|
|
358
353
|
return this._;
|
|
@@ -363,71 +358,71 @@ function ht(t) {
|
|
|
363
358
|
return t;
|
|
364
359
|
};
|
|
365
360
|
}
|
|
366
|
-
function
|
|
361
|
+
function Dt(t) {
|
|
367
362
|
return t[0];
|
|
368
363
|
}
|
|
369
|
-
function
|
|
364
|
+
function Bt(t) {
|
|
370
365
|
return t[1];
|
|
371
366
|
}
|
|
372
|
-
var
|
|
373
|
-
function
|
|
367
|
+
var Vt = Array.prototype.slice;
|
|
368
|
+
function Rt(t) {
|
|
374
369
|
return t.source;
|
|
375
370
|
}
|
|
376
|
-
function
|
|
371
|
+
function Ut(t) {
|
|
377
372
|
return t.target;
|
|
378
373
|
}
|
|
379
|
-
function
|
|
380
|
-
var i =
|
|
374
|
+
function Ft(t) {
|
|
375
|
+
var i = Rt, r = Ut, c = Dt, h = Bt, k = null;
|
|
381
376
|
function d() {
|
|
382
|
-
var
|
|
383
|
-
if (
|
|
384
|
-
return
|
|
377
|
+
var g, s = Vt.call(arguments), l = i.apply(this, s), u = r.apply(this, s);
|
|
378
|
+
if (k || (k = g = gt()), t(k, +c.apply(this, (s[0] = l, s)), +h.apply(this, s), +c.apply(this, (s[0] = u, s)), +h.apply(this, s)), g)
|
|
379
|
+
return k = null, g + "" || null;
|
|
385
380
|
}
|
|
386
|
-
return d.source = function(
|
|
387
|
-
return arguments.length ? (i =
|
|
388
|
-
}, d.target = function(
|
|
389
|
-
return arguments.length ? (
|
|
390
|
-
}, d.x = function(
|
|
391
|
-
return arguments.length ? (
|
|
392
|
-
}, d.y = function(
|
|
393
|
-
return arguments.length ? (h = typeof
|
|
394
|
-
}, d.context = function(
|
|
395
|
-
return arguments.length ? (
|
|
381
|
+
return d.source = function(g) {
|
|
382
|
+
return arguments.length ? (i = g, d) : i;
|
|
383
|
+
}, d.target = function(g) {
|
|
384
|
+
return arguments.length ? (r = g, d) : r;
|
|
385
|
+
}, d.x = function(g) {
|
|
386
|
+
return arguments.length ? (c = typeof g == "function" ? g : ht(+g), d) : c;
|
|
387
|
+
}, d.y = function(g) {
|
|
388
|
+
return arguments.length ? (h = typeof g == "function" ? g : ht(+g), d) : h;
|
|
389
|
+
}, d.context = function(g) {
|
|
390
|
+
return arguments.length ? (k = g == null ? null : g, d) : k;
|
|
396
391
|
}, d;
|
|
397
392
|
}
|
|
398
|
-
function
|
|
399
|
-
t.moveTo(i,
|
|
393
|
+
function Wt(t, i, r, c, h) {
|
|
394
|
+
t.moveTo(i, r), t.bezierCurveTo(i = (i + c) / 2, r, i, h, c, h);
|
|
400
395
|
}
|
|
401
396
|
function Gt() {
|
|
402
|
-
return Wt
|
|
397
|
+
return Ft(Wt);
|
|
403
398
|
}
|
|
404
|
-
function
|
|
399
|
+
function Yt(t) {
|
|
405
400
|
return [t.source.x1, t.y0];
|
|
406
401
|
}
|
|
407
|
-
function
|
|
402
|
+
function qt(t) {
|
|
408
403
|
return [t.target.x0, t.y1];
|
|
409
404
|
}
|
|
410
|
-
function
|
|
411
|
-
return Gt().source(
|
|
405
|
+
function Ht() {
|
|
406
|
+
return Gt().source(Yt).target(qt);
|
|
412
407
|
}
|
|
413
408
|
var it = function() {
|
|
414
|
-
var t = function(
|
|
415
|
-
for (l = l || {}, u =
|
|
409
|
+
var t = function(g, s, l, u) {
|
|
410
|
+
for (l = l || {}, u = g.length; u--; l[g[u]] = s)
|
|
416
411
|
;
|
|
417
412
|
return l;
|
|
418
|
-
}, i = [1, 9],
|
|
413
|
+
}, i = [1, 9], r = [1, 10], c = [1, 5, 10, 12], h = {
|
|
419
414
|
trace: function() {
|
|
420
415
|
},
|
|
421
416
|
yy: {},
|
|
422
417
|
symbols_: { error: 2, start: 3, SANKEY: 4, NEWLINE: 5, csv: 6, opt_eof: 7, record: 8, csv_tail: 9, EOF: 10, "field[source]": 11, COMMA: 12, "field[target]": 13, "field[value]": 14, field: 15, escaped: 16, non_escaped: 17, DQUOTE: 18, ESCAPED_TEXT: 19, NON_ESCAPED_TEXT: 20, $accept: 0, $end: 1 },
|
|
423
418
|
terminals_: { 2: "error", 4: "SANKEY", 5: "NEWLINE", 10: "EOF", 11: "field[source]", 12: "COMMA", 13: "field[target]", 14: "field[value]", 18: "DQUOTE", 19: "ESCAPED_TEXT", 20: "NON_ESCAPED_TEXT" },
|
|
424
419
|
productions_: [0, [3, 4], [6, 2], [9, 2], [9, 0], [7, 1], [7, 0], [8, 5], [15, 1], [15, 1], [16, 3], [17, 1]],
|
|
425
|
-
performAction: function(
|
|
420
|
+
performAction: function(s, l, u, p, v, y, _) {
|
|
426
421
|
var E = y.length - 1;
|
|
427
422
|
switch (v) {
|
|
428
423
|
case 7:
|
|
429
|
-
const L =
|
|
430
|
-
|
|
424
|
+
const L = p.findOrCreateNode(y[E - 4].trim().replaceAll('""', '"')), A = p.findOrCreateNode(y[E - 2].trim().replaceAll('""', '"')), N = parseFloat(y[E].trim());
|
|
425
|
+
p.addLink(L, A, N);
|
|
431
426
|
break;
|
|
432
427
|
case 8:
|
|
433
428
|
case 9:
|
|
@@ -439,42 +434,42 @@ var it = function() {
|
|
|
439
434
|
break;
|
|
440
435
|
}
|
|
441
436
|
},
|
|
442
|
-
table: [{ 3: 1, 4: [1, 2] }, { 1: [3] }, { 5: [1, 3] }, { 6: 4, 8: 5, 15: 6, 16: 7, 17: 8, 18: i, 20:
|
|
437
|
+
table: [{ 3: 1, 4: [1, 2] }, { 1: [3] }, { 5: [1, 3] }, { 6: 4, 8: 5, 15: 6, 16: 7, 17: 8, 18: i, 20: r }, { 1: [2, 6], 7: 11, 10: [1, 12] }, t(r, [2, 4], { 9: 13, 5: [1, 14] }), { 12: [1, 15] }, t(c, [2, 8]), t(c, [2, 9]), { 19: [1, 16] }, t(c, [2, 11]), { 1: [2, 1] }, { 1: [2, 5] }, t(r, [2, 2]), { 6: 17, 8: 5, 15: 6, 16: 7, 17: 8, 18: i, 20: r }, { 15: 18, 16: 7, 17: 8, 18: i, 20: r }, { 18: [1, 19] }, t(r, [2, 3]), { 12: [1, 20] }, t(c, [2, 10]), { 15: 21, 16: 7, 17: 8, 18: i, 20: r }, t([1, 5, 10], [2, 7])],
|
|
443
438
|
defaultActions: { 11: [2, 1], 12: [2, 5] },
|
|
444
|
-
parseError: function(
|
|
439
|
+
parseError: function(s, l) {
|
|
445
440
|
if (l.recoverable)
|
|
446
|
-
this.trace(
|
|
441
|
+
this.trace(s);
|
|
447
442
|
else {
|
|
448
|
-
var u = new Error(
|
|
443
|
+
var u = new Error(s);
|
|
449
444
|
throw u.hash = l, u;
|
|
450
445
|
}
|
|
451
446
|
},
|
|
452
|
-
parse: function(
|
|
453
|
-
var l = this, u = [0],
|
|
454
|
-
for (var
|
|
455
|
-
Object.prototype.hasOwnProperty.call(this.yy,
|
|
456
|
-
b.setInput(
|
|
457
|
-
var
|
|
458
|
-
y.push(
|
|
447
|
+
parse: function(s) {
|
|
448
|
+
var l = this, u = [0], p = [], v = [null], y = [], _ = this.table, E = "", L = 0, A = 0, N = 2, C = 1, j = y.slice.call(arguments, 1), b = Object.create(this.lexer), M = { yy: {} };
|
|
449
|
+
for (var $ in this.yy)
|
|
450
|
+
Object.prototype.hasOwnProperty.call(this.yy, $) && (M.yy[$] = this.yy[$]);
|
|
451
|
+
b.setInput(s, M.yy), M.yy.lexer = b, M.yy.parser = this, typeof b.yylloc == "undefined" && (b.yylloc = {});
|
|
452
|
+
var P = b.yylloc;
|
|
453
|
+
y.push(P);
|
|
459
454
|
var I = b.options && b.options.ranges;
|
|
460
455
|
typeof M.yy.parseError == "function" ? this.parseError = M.yy.parseError : this.parseError = Object.getPrototypeOf(this).parseError;
|
|
461
|
-
function
|
|
456
|
+
function z() {
|
|
462
457
|
var x;
|
|
463
|
-
return x =
|
|
458
|
+
return x = p.pop() || b.lex() || C, typeof x != "number" && (x instanceof Array && (p = x, x = p.pop()), x = l.symbols_[x] || x), x;
|
|
464
459
|
}
|
|
465
|
-
for (var w, T, S,
|
|
466
|
-
if (T = u[u.length - 1], this.defaultActions[T] ? S = this.defaultActions[T] : ((w === null || typeof w == "undefined") && (w =
|
|
460
|
+
for (var w, T, S, O, n = {}, f, e, a, o; ; ) {
|
|
461
|
+
if (T = u[u.length - 1], this.defaultActions[T] ? S = this.defaultActions[T] : ((w === null || typeof w == "undefined") && (w = z()), S = _[T] && _[T][w]), typeof S == "undefined" || !S.length || !S[0]) {
|
|
467
462
|
var m = "";
|
|
468
463
|
o = [];
|
|
469
|
-
for (f in
|
|
464
|
+
for (f in _[T])
|
|
470
465
|
this.terminals_[f] && f > N && o.push("'" + this.terminals_[f] + "'");
|
|
471
466
|
b.showPosition ? m = "Parse error on line " + (L + 1) + `:
|
|
472
467
|
` + b.showPosition() + `
|
|
473
|
-
Expecting ` + o.join(", ") + ", got '" + (this.terminals_[w] || w) + "'" : m = "Parse error on line " + (L + 1) + ": Unexpected " + (w ==
|
|
468
|
+
Expecting ` + o.join(", ") + ", got '" + (this.terminals_[w] || w) + "'" : m = "Parse error on line " + (L + 1) + ": Unexpected " + (w == C ? "end of input" : "'" + (this.terminals_[w] || w) + "'"), this.parseError(m, {
|
|
474
469
|
text: b.match,
|
|
475
470
|
token: this.terminals_[w] || w,
|
|
476
471
|
line: b.yylineno,
|
|
477
|
-
loc:
|
|
472
|
+
loc: P,
|
|
478
473
|
expected: o
|
|
479
474
|
});
|
|
480
475
|
}
|
|
@@ -482,7 +477,7 @@ Expecting ` + o.join(", ") + ", got '" + (this.terminals_[w] || w) + "'" : m = "
|
|
|
482
477
|
throw new Error("Parse Error: multiple actions possible at state: " + T + ", token: " + w);
|
|
483
478
|
switch (S[0]) {
|
|
484
479
|
case 1:
|
|
485
|
-
u.push(w), v.push(b.yytext), y.push(b.yylloc), u.push(S[1]), w = null, A = b.yyleng, E = b.yytext, L = b.yylineno,
|
|
480
|
+
u.push(w), v.push(b.yytext), y.push(b.yylloc), u.push(S[1]), w = null, A = b.yyleng, E = b.yytext, L = b.yylineno, P = b.yylloc;
|
|
486
481
|
break;
|
|
487
482
|
case 2:
|
|
488
483
|
if (e = this.productions_[S[1]][1], n.$ = v[v.length - e], n._$ = {
|
|
@@ -493,7 +488,7 @@ Expecting ` + o.join(", ") + ", got '" + (this.terminals_[w] || w) + "'" : m = "
|
|
|
493
488
|
}, I && (n._$.range = [
|
|
494
489
|
y[y.length - (e || 1)].range[0],
|
|
495
490
|
y[y.length - 1].range[1]
|
|
496
|
-
]),
|
|
491
|
+
]), O = this.performAction.apply(n, [
|
|
497
492
|
E,
|
|
498
493
|
A,
|
|
499
494
|
L,
|
|
@@ -501,9 +496,9 @@ Expecting ` + o.join(", ") + ", got '" + (this.terminals_[w] || w) + "'" : m = "
|
|
|
501
496
|
S[1],
|
|
502
497
|
v,
|
|
503
498
|
y
|
|
504
|
-
].concat(
|
|
505
|
-
return
|
|
506
|
-
e && (u = u.slice(0, -1 * e * 2), v = v.slice(0, -1 * e), y = y.slice(0, -1 * e)), u.push(this.productions_[S[1]][0]), v.push(n.$), y.push(n._$),
|
|
499
|
+
].concat(j)), typeof O != "undefined")
|
|
500
|
+
return O;
|
|
501
|
+
e && (u = u.slice(0, -1 * e * 2), v = v.slice(0, -1 * e), y = y.slice(0, -1 * e)), u.push(this.productions_[S[1]][0]), v.push(n.$), y.push(n._$), a = _[u[u.length - 2]][u[u.length - 1]], u.push(a);
|
|
507
502
|
break;
|
|
508
503
|
case 3:
|
|
509
504
|
return !0;
|
|
@@ -511,8 +506,8 @@ Expecting ` + o.join(", ") + ", got '" + (this.terminals_[w] || w) + "'" : m = "
|
|
|
511
506
|
}
|
|
512
507
|
return !0;
|
|
513
508
|
}
|
|
514
|
-
},
|
|
515
|
-
var
|
|
509
|
+
}, k = function() {
|
|
510
|
+
var g = {
|
|
516
511
|
EOF: 1,
|
|
517
512
|
parseError: function(l, u) {
|
|
518
513
|
if (this.yy.parser)
|
|
@@ -521,8 +516,8 @@ Expecting ` + o.join(", ") + ", got '" + (this.terminals_[w] || w) + "'" : m = "
|
|
|
521
516
|
throw new Error(l);
|
|
522
517
|
},
|
|
523
518
|
// resets the lexer, sets new input
|
|
524
|
-
setInput: function(
|
|
525
|
-
return this.yy = l || this.yy || {}, this._input =
|
|
519
|
+
setInput: function(s, l) {
|
|
520
|
+
return this.yy = l || this.yy || {}, this._input = s, this._more = this._backtrack = this.done = !1, this.yylineno = this.yyleng = 0, this.yytext = this.matched = this.match = "", this.conditionStack = ["INITIAL"], this.yylloc = {
|
|
526
521
|
first_line: 1,
|
|
527
522
|
first_column: 0,
|
|
528
523
|
last_line: 1,
|
|
@@ -531,23 +526,23 @@ Expecting ` + o.join(", ") + ", got '" + (this.terminals_[w] || w) + "'" : m = "
|
|
|
531
526
|
},
|
|
532
527
|
// consumes and returns one char from the input
|
|
533
528
|
input: function() {
|
|
534
|
-
var
|
|
535
|
-
this.yytext +=
|
|
536
|
-
var l =
|
|
537
|
-
return l ? (this.yylineno++, this.yylloc.last_line++) : this.yylloc.last_column++, this.options.ranges && this.yylloc.range[1]++, this._input = this._input.slice(1),
|
|
529
|
+
var s = this._input[0];
|
|
530
|
+
this.yytext += s, this.yyleng++, this.offset++, this.match += s, this.matched += s;
|
|
531
|
+
var l = s.match(/(?:\r\n?|\n).*/g);
|
|
532
|
+
return l ? (this.yylineno++, this.yylloc.last_line++) : this.yylloc.last_column++, this.options.ranges && this.yylloc.range[1]++, this._input = this._input.slice(1), s;
|
|
538
533
|
},
|
|
539
534
|
// unshifts one char (or a string) into the input
|
|
540
|
-
unput: function(
|
|
541
|
-
var l =
|
|
542
|
-
this._input =
|
|
543
|
-
var
|
|
535
|
+
unput: function(s) {
|
|
536
|
+
var l = s.length, u = s.split(/(?:\r\n?|\n)/g);
|
|
537
|
+
this._input = s + this._input, this.yytext = this.yytext.substr(0, this.yytext.length - l), this.offset -= l;
|
|
538
|
+
var p = this.match.split(/(?:\r\n?|\n)/g);
|
|
544
539
|
this.match = this.match.substr(0, this.match.length - 1), this.matched = this.matched.substr(0, this.matched.length - 1), u.length - 1 && (this.yylineno -= u.length - 1);
|
|
545
540
|
var v = this.yylloc.range;
|
|
546
541
|
return this.yylloc = {
|
|
547
542
|
first_line: this.yylloc.first_line,
|
|
548
543
|
last_line: this.yylineno + 1,
|
|
549
544
|
first_column: this.yylloc.first_column,
|
|
550
|
-
last_column: u ? (u.length ===
|
|
545
|
+
last_column: u ? (u.length === p.length ? this.yylloc.first_column : 0) + p[p.length - u.length].length - u[0].length : this.yylloc.first_column - l
|
|
551
546
|
}, this.options.ranges && (this.yylloc.range = [v[0], v[0] + this.yyleng - l]), this.yyleng = this.yytext.length, this;
|
|
552
547
|
},
|
|
553
548
|
// When called from action, caches matched text and appends it on next action
|
|
@@ -568,28 +563,28 @@ Expecting ` + o.join(", ") + ", got '" + (this.terminals_[w] || w) + "'" : m = "
|
|
|
568
563
|
return this;
|
|
569
564
|
},
|
|
570
565
|
// retain first n characters of the match
|
|
571
|
-
less: function(
|
|
572
|
-
this.unput(this.match.slice(
|
|
566
|
+
less: function(s) {
|
|
567
|
+
this.unput(this.match.slice(s));
|
|
573
568
|
},
|
|
574
569
|
// displays already matched input, i.e. for error messages
|
|
575
570
|
pastInput: function() {
|
|
576
|
-
var
|
|
577
|
-
return (
|
|
571
|
+
var s = this.matched.substr(0, this.matched.length - this.match.length);
|
|
572
|
+
return (s.length > 20 ? "..." : "") + s.substr(-20).replace(/\n/g, "");
|
|
578
573
|
},
|
|
579
574
|
// displays upcoming input, i.e. for error messages
|
|
580
575
|
upcomingInput: function() {
|
|
581
|
-
var
|
|
582
|
-
return
|
|
576
|
+
var s = this.match;
|
|
577
|
+
return s.length < 20 && (s += this._input.substr(0, 20 - s.length)), (s.substr(0, 20) + (s.length > 20 ? "..." : "")).replace(/\n/g, "");
|
|
583
578
|
},
|
|
584
579
|
// displays the character position where the lexing error occurred, i.e. for error messages
|
|
585
580
|
showPosition: function() {
|
|
586
|
-
var
|
|
587
|
-
return
|
|
581
|
+
var s = this.pastInput(), l = new Array(s.length + 1).join("-");
|
|
582
|
+
return s + this.upcomingInput() + `
|
|
588
583
|
` + l + "^";
|
|
589
584
|
},
|
|
590
585
|
// test the lexed token: return FALSE when not a match, otherwise return token
|
|
591
|
-
test_match: function(
|
|
592
|
-
var u,
|
|
586
|
+
test_match: function(s, l) {
|
|
587
|
+
var u, p, v;
|
|
593
588
|
if (this.options.backtrack_lexer && (v = {
|
|
594
589
|
yylineno: this.yylineno,
|
|
595
590
|
yylloc: {
|
|
@@ -609,12 +604,12 @@ Expecting ` + o.join(", ") + ", got '" + (this.terminals_[w] || w) + "'" : m = "
|
|
|
609
604
|
yy: this.yy,
|
|
610
605
|
conditionStack: this.conditionStack.slice(0),
|
|
611
606
|
done: this.done
|
|
612
|
-
}, this.options.ranges && (v.yylloc.range = this.yylloc.range.slice(0))),
|
|
607
|
+
}, this.options.ranges && (v.yylloc.range = this.yylloc.range.slice(0))), p = s[0].match(/(?:\r\n?|\n).*/g), p && (this.yylineno += p.length), this.yylloc = {
|
|
613
608
|
first_line: this.yylloc.last_line,
|
|
614
609
|
last_line: this.yylineno + 1,
|
|
615
610
|
first_column: this.yylloc.last_column,
|
|
616
|
-
last_column:
|
|
617
|
-
}, this.yytext +=
|
|
611
|
+
last_column: p ? p[p.length - 1].length - p[p.length - 1].match(/\r?\n?/)[0].length : this.yylloc.last_column + s[0].length
|
|
612
|
+
}, this.yytext += s[0], this.match += s[0], this.matches = s, this.yyleng = this.yytext.length, this.options.ranges && (this.yylloc.range = [this.offset, this.offset += this.yyleng]), this._more = !1, this._backtrack = !1, this._input = this._input.slice(s[0].length), this.matched += s[0], u = this.performAction.call(this, this.yy, this, l, this.conditionStack[this.conditionStack.length - 1]), this.done && this._input && (this.done = !1), u)
|
|
618
613
|
return u;
|
|
619
614
|
if (this._backtrack) {
|
|
620
615
|
for (var y in v)
|
|
@@ -628,13 +623,13 @@ Expecting ` + o.join(", ") + ", got '" + (this.terminals_[w] || w) + "'" : m = "
|
|
|
628
623
|
if (this.done)
|
|
629
624
|
return this.EOF;
|
|
630
625
|
this._input || (this.done = !0);
|
|
631
|
-
var
|
|
626
|
+
var s, l, u, p;
|
|
632
627
|
this._more || (this.yytext = "", this.match = "");
|
|
633
628
|
for (var v = this._currentRules(), y = 0; y < v.length; y++)
|
|
634
629
|
if (u = this._input.match(this.rules[v[y]]), u && (!l || u[0].length > l[0].length)) {
|
|
635
|
-
if (l = u,
|
|
636
|
-
if (
|
|
637
|
-
return
|
|
630
|
+
if (l = u, p = y, this.options.backtrack_lexer) {
|
|
631
|
+
if (s = this.test_match(u, v[y]), s !== !1)
|
|
632
|
+
return s;
|
|
638
633
|
if (this._backtrack) {
|
|
639
634
|
l = !1;
|
|
640
635
|
continue;
|
|
@@ -643,7 +638,7 @@ Expecting ` + o.join(", ") + ", got '" + (this.terminals_[w] || w) + "'" : m = "
|
|
|
643
638
|
} else if (!this.options.flex)
|
|
644
639
|
break;
|
|
645
640
|
}
|
|
646
|
-
return l ? (
|
|
641
|
+
return l ? (s = this.test_match(l, v[p]), s !== !1 ? s : !1) : this._input === "" ? this.EOF : this.parseError("Lexical error on line " + (this.yylineno + 1) + `. Unrecognized text.
|
|
647
642
|
` + this.showPosition(), {
|
|
648
643
|
text: "",
|
|
649
644
|
token: null,
|
|
@@ -680,9 +675,9 @@ Expecting ` + o.join(", ") + ", got '" + (this.terminals_[w] || w) + "'" : m = "
|
|
|
680
675
|
stateStackSize: function() {
|
|
681
676
|
return this.conditionStack.length;
|
|
682
677
|
},
|
|
683
|
-
options: {
|
|
684
|
-
performAction: function(l, u,
|
|
685
|
-
switch (
|
|
678
|
+
options: { "case-insensitive": !0 },
|
|
679
|
+
performAction: function(l, u, p, v) {
|
|
680
|
+
switch (p) {
|
|
686
681
|
case 0:
|
|
687
682
|
return this.pushState("csv"), 4;
|
|
688
683
|
case 1:
|
|
@@ -701,58 +696,58 @@ Expecting ` + o.join(", ") + ", got '" + (this.terminals_[w] || w) + "'" : m = "
|
|
|
701
696
|
return 19;
|
|
702
697
|
}
|
|
703
698
|
},
|
|
704
|
-
rules: [/^(?:sankey-beta\b)
|
|
699
|
+
rules: [/^(?:sankey-beta\b)/i, /^(?:$)/i, /^(?:((\u000D\u000A)|(\u000A)))/i, /^(?:(\u002C))/i, /^(?:(\u0022))/i, /^(?:([\u0020-\u0021\u0023-\u002B\u002D-\u007E])*)/i, /^(?:(\u0022)(?!(\u0022)))/i, /^(?:(([\u0020-\u0021\u0023-\u002B\u002D-\u007E])|(\u002C)|(\u000D)|(\u000A)|(\u0022)(\u0022))*)/i],
|
|
705
700
|
conditions: { csv: { rules: [1, 2, 3, 4, 5, 6, 7], inclusive: !1 }, escaped_text: { rules: [6, 7], inclusive: !1 }, INITIAL: { rules: [0, 1, 2, 3, 4, 5, 6, 7], inclusive: !0 } }
|
|
706
701
|
};
|
|
707
|
-
return
|
|
702
|
+
return g;
|
|
708
703
|
}();
|
|
709
|
-
h.lexer =
|
|
704
|
+
h.lexer = k;
|
|
710
705
|
function d() {
|
|
711
706
|
this.yy = {};
|
|
712
707
|
}
|
|
713
708
|
return d.prototype = h, h.Parser = d, new d();
|
|
714
709
|
}();
|
|
715
710
|
it.parser = it;
|
|
716
|
-
const
|
|
717
|
-
let
|
|
718
|
-
const
|
|
719
|
-
|
|
711
|
+
const H = it;
|
|
712
|
+
let X = [], Q = [], V = {};
|
|
713
|
+
const Xt = () => {
|
|
714
|
+
X = [], Q = [], V = {}, wt();
|
|
720
715
|
};
|
|
721
|
-
class
|
|
722
|
-
constructor(i,
|
|
723
|
-
this.source = i, this.target =
|
|
716
|
+
class Qt {
|
|
717
|
+
constructor(i, r, c = 0) {
|
|
718
|
+
this.source = i, this.target = r, this.value = c;
|
|
724
719
|
}
|
|
725
720
|
}
|
|
726
|
-
const
|
|
727
|
-
|
|
721
|
+
const Kt = (t, i, r) => {
|
|
722
|
+
X.push(new Qt(t, i, r));
|
|
728
723
|
};
|
|
729
|
-
class
|
|
724
|
+
class Zt {
|
|
730
725
|
constructor(i) {
|
|
731
726
|
this.ID = i;
|
|
732
727
|
}
|
|
733
728
|
}
|
|
734
|
-
const
|
|
729
|
+
const Jt = (t) => (t = St.sanitizeText(t, rt()), V[t] || (V[t] = new Zt(t), Q.push(V[t])), V[t]), te = () => Q, ee = () => X, ne = () => ({
|
|
735
730
|
nodes: Q.map((t) => ({ id: t.ID })),
|
|
736
|
-
links:
|
|
731
|
+
links: X.map((t) => ({
|
|
737
732
|
source: t.source.ID,
|
|
738
733
|
target: t.target.ID,
|
|
739
734
|
value: t.value
|
|
740
735
|
}))
|
|
741
|
-
}),
|
|
742
|
-
nodesMap:
|
|
736
|
+
}), ie = {
|
|
737
|
+
nodesMap: V,
|
|
743
738
|
getConfig: () => rt().sankey,
|
|
744
|
-
getNodes:
|
|
745
|
-
getLinks:
|
|
746
|
-
getGraph:
|
|
747
|
-
addLink:
|
|
748
|
-
findOrCreateNode:
|
|
739
|
+
getNodes: te,
|
|
740
|
+
getLinks: ee,
|
|
741
|
+
getGraph: ne,
|
|
742
|
+
addLink: Kt,
|
|
743
|
+
findOrCreateNode: Jt,
|
|
749
744
|
getAccTitle: mt,
|
|
750
|
-
setAccTitle:
|
|
751
|
-
getAccDescription:
|
|
745
|
+
setAccTitle: kt,
|
|
746
|
+
getAccDescription: _t,
|
|
752
747
|
setAccDescription: xt,
|
|
753
748
|
getDiagramTitle: vt,
|
|
754
749
|
setDiagramTitle: bt,
|
|
755
|
-
clear:
|
|
750
|
+
clear: Xt
|
|
756
751
|
}, pt = class st {
|
|
757
752
|
static next(i) {
|
|
758
753
|
return new st(i + ++st.count);
|
|
@@ -766,37 +761,35 @@ const te = (t) => (t = St.sanitizeText(t, rt()), R[t] || (R[t] = new Jt(t), Q.pu
|
|
|
766
761
|
};
|
|
767
762
|
pt.count = 0;
|
|
768
763
|
let ft = pt;
|
|
769
|
-
const
|
|
770
|
-
left:
|
|
764
|
+
const se = {
|
|
765
|
+
left: Nt,
|
|
771
766
|
right: Ct,
|
|
772
|
-
center:
|
|
767
|
+
center: Pt,
|
|
773
768
|
justify: dt
|
|
774
|
-
},
|
|
775
|
-
var
|
|
776
|
-
const { securityLevel: h, sankey:
|
|
777
|
-
let
|
|
778
|
-
h === "sandbox" && (
|
|
779
|
-
const
|
|
780
|
-
|
|
781
|
-
const A = a.db.getGraph(), N = re[y], P = 10;
|
|
782
|
-
jt().nodeId((e) => e.id).nodeWidth(P).nodePadding(10 + (L ? 15 : 0)).nodeAlign(N).extent([
|
|
769
|
+
}, re = function(t, i, r, c) {
|
|
770
|
+
var z, w, T, S, O, n, f;
|
|
771
|
+
const { securityLevel: h, sankey: k } = rt(), d = Lt.sankey;
|
|
772
|
+
let g;
|
|
773
|
+
h === "sandbox" && (g = G("#i" + i));
|
|
774
|
+
const s = h === "sandbox" ? G(g.nodes()[0].contentDocument.body) : G("body"), l = h === "sandbox" ? s.select(`[id="${i}"]`) : G(`[id="${i}"]`), u = (z = k == null ? void 0 : k.width) != null ? z : d.width, p = (w = k == null ? void 0 : k.height) != null ? w : d.width, v = (T = k == null ? void 0 : k.useMaxWidth) != null ? T : d.useMaxWidth, y = (S = k == null ? void 0 : k.nodeAlignment) != null ? S : d.nodeAlignment, _ = (O = k == null ? void 0 : k.prefix) != null ? O : d.prefix, E = (n = k == null ? void 0 : k.suffix) != null ? n : d.suffix, L = (f = k == null ? void 0 : k.showValues) != null ? f : d.showValues, A = c.db.getGraph(), N = se[y], C = 10;
|
|
775
|
+
jt().nodeId((e) => e.id).nodeWidth(C).nodePadding(10 + (L ? 15 : 0)).nodeAlign(N).extent([
|
|
783
776
|
[0, 0],
|
|
784
|
-
[u,
|
|
777
|
+
[u, p]
|
|
785
778
|
])(A);
|
|
786
|
-
const b = At(
|
|
779
|
+
const b = At(Tt);
|
|
787
780
|
l.append("g").attr("class", "nodes").selectAll(".node").data(A.nodes).join("g").attr("class", "node").attr("id", (e) => (e.uid = ft.next("node-")).id).attr("transform", function(e) {
|
|
788
781
|
return "translate(" + e.x0 + "," + e.y0 + ")";
|
|
789
782
|
}).attr("x", (e) => e.x0).attr("y", (e) => e.y0).append("rect").attr("height", (e) => e.y1 - e.y0).attr("width", (e) => e.x1 - e.x0).attr("fill", (e) => b(e.id));
|
|
790
|
-
const M = ({ id: e, value:
|
|
791
|
-
${
|
|
783
|
+
const M = ({ id: e, value: a }) => L ? `${e}
|
|
784
|
+
${_}${Math.round(a * 100) / 100}${E}` : e;
|
|
792
785
|
l.append("g").attr("class", "node-labels").attr("font-family", "sans-serif").attr("font-size", 14).selectAll("text").data(A.nodes).join("text").attr("x", (e) => e.x0 < u / 2 ? e.x1 + 6 : e.x0 - 6).attr("y", (e) => (e.y1 + e.y0) / 2).attr("dy", `${L ? "0" : "0.35"}em`).attr("text-anchor", (e) => e.x0 < u / 2 ? "start" : "end").text(M);
|
|
793
|
-
const
|
|
794
|
-
if (
|
|
795
|
-
const e =
|
|
796
|
-
e.append("stop").attr("offset", "0%").attr("stop-color", (
|
|
786
|
+
const $ = l.append("g").attr("class", "links").attr("fill", "none").attr("stroke-opacity", 0.5).selectAll(".link").data(A.links).join("g").attr("class", "link").style("mix-blend-mode", "multiply"), P = (k == null ? void 0 : k.linkColor) || "gradient";
|
|
787
|
+
if (P === "gradient") {
|
|
788
|
+
const e = $.append("linearGradient").attr("id", (a) => (a.uid = ft.next("linearGradient-")).id).attr("gradientUnits", "userSpaceOnUse").attr("x1", (a) => a.source.x1).attr("x2", (a) => a.target.x0);
|
|
789
|
+
e.append("stop").attr("offset", "0%").attr("stop-color", (a) => b(a.source.id)), e.append("stop").attr("offset", "100%").attr("stop-color", (a) => b(a.target.id));
|
|
797
790
|
}
|
|
798
791
|
let I;
|
|
799
|
-
switch (
|
|
792
|
+
switch (P) {
|
|
800
793
|
case "gradient":
|
|
801
794
|
I = (e) => e.uid;
|
|
802
795
|
break;
|
|
@@ -807,18 +800,18 @@ ${k}${Math.round(c * 100) / 100}${E}` : e;
|
|
|
807
800
|
I = (e) => b(e.target.id);
|
|
808
801
|
break;
|
|
809
802
|
default:
|
|
810
|
-
I =
|
|
803
|
+
I = P;
|
|
811
804
|
}
|
|
812
|
-
|
|
813
|
-
},
|
|
814
|
-
draw:
|
|
815
|
-
},
|
|
816
|
-
`).trim(),
|
|
817
|
-
|
|
805
|
+
$.append("path").attr("d", Ht()).attr("stroke", I).attr("stroke-width", (e) => Math.max(1, e.width)), Et(void 0, l, 0, v);
|
|
806
|
+
}, oe = {
|
|
807
|
+
draw: re
|
|
808
|
+
}, le = (t) => t.replaceAll(/^[^\S\n\r]+|[^\S\n\r]+$/g, "").replaceAll(/([\n\r])+/g, `
|
|
809
|
+
`).trim(), ae = H.parse.bind(H);
|
|
810
|
+
H.parse = (t) => ae(le(t));
|
|
818
811
|
const ye = {
|
|
819
|
-
parser:
|
|
820
|
-
db:
|
|
821
|
-
renderer:
|
|
812
|
+
parser: H,
|
|
813
|
+
db: ie,
|
|
814
|
+
renderer: oe
|
|
822
815
|
};
|
|
823
816
|
export {
|
|
824
817
|
ye as diagram
|