@floegence/floe-webapp-core 0.86.15 → 0.86.18
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/assets/layout-worker-BK6m515B.js +1875 -0
- package/dist/components/graph/GraphCanvas.d.ts +4 -0
- package/dist/components/graph/GraphCanvas.js +153 -95
- package/dist/components/graph/GraphMinimap.d.ts +14 -0
- package/dist/components/graph/GraphMinimap.js +88 -0
- package/dist/components/graph/engine.js +27 -21
- package/dist/components/graph/layout-worker.d.ts +1 -0
- package/dist/graph.css +66 -0
- package/dist/graph.d.ts +1 -0
- package/dist/graph.js +7 -5
- package/package.json +10 -4
- package/scripts/graph-assets.d.mts +7 -0
- package/scripts/graph-assets.mjs +64 -0
- package/dist/_virtual/_commonjs-dynamic-modules.js +0 -6
- package/dist/_virtual/_commonjsHelpers.js +0 -6
- package/dist/_virtual/elk-api.js +0 -7
- package/dist/_virtual/elk-api2.js +0 -4
- package/dist/components/graph/layout.js +0 -160
- package/dist/components/graph/packing.js +0 -158
- package/dist/components/graph/positions.js +0 -76
- package/dist/components/graph/routing.js +0 -280
- package/dist/node_modules/.pnpm/elkjs@0.12.0/node_modules/elkjs/lib/elk-api.js +0 -186
- package/dist/node_modules/.pnpm/libavoid-js@0.5.0-beta.5/node_modules/libavoid-js/dist/index.js +0 -1005
- package/dist/node_modules/.pnpm/libavoid-js@0.5.0-beta.5/node_modules/libavoid-js/dist/libavoid.wasm.js +0 -4
|
@@ -1,280 +0,0 @@
|
|
|
1
|
-
import { AvoidLib as X } from "../../node_modules/.pnpm/libavoid-js@0.5.0-beta.5/node_modules/libavoid-js/dist/index.js";
|
|
2
|
-
import I from "../../node_modules/.pnpm/libavoid-js@0.5.0-beta.5/node_modules/libavoid-js/dist/libavoid.wasm.js";
|
|
3
|
-
let Y;
|
|
4
|
-
const _ = { NORTH: 1, SOUTH: 2, WEST: 4, EAST: 8 }, v = ["NORTH", "EAST", "SOUTH", "WEST"], T = (i) => i.delete();
|
|
5
|
-
async function st(i, o = {}) {
|
|
6
|
-
const a = o.edgeClearance ?? 4;
|
|
7
|
-
if (!Number.isFinite(a) || a < 0)
|
|
8
|
-
throw new Error("Graph edge clearance must be finite and nonnegative");
|
|
9
|
-
if (!i.nodes.length) return i;
|
|
10
|
-
if (!i.edges.length) return L(i);
|
|
11
|
-
await (Y ??= X.load(I).catch((r) => {
|
|
12
|
-
throw Y = void 0, r;
|
|
13
|
-
}));
|
|
14
|
-
const n = X.getInstance(), c = new Map(i.nodes.map((r) => [r.id, r])), l = (r) => {
|
|
15
|
-
const h = [];
|
|
16
|
-
for (let s = c.get(r).parentId; s; s = c.get(s).parentId)
|
|
17
|
-
h.push(s);
|
|
18
|
-
return h;
|
|
19
|
-
}, f = /* @__PURE__ */ new Map();
|
|
20
|
-
for (const r of i.edges) {
|
|
21
|
-
const h = /* @__PURE__ */ new Set([...l(r.source), ...l(r.target)]), s = JSON.stringify([...h].sort()), M = f.get(s) ?? { open: h, edges: [] };
|
|
22
|
-
M.edges.push(r), f.set(s, M);
|
|
23
|
-
}
|
|
24
|
-
const P = /* @__PURE__ */ new Map();
|
|
25
|
-
for (const { open: r, edges: h } of f.values()) {
|
|
26
|
-
const s = new n.Router(2);
|
|
27
|
-
try {
|
|
28
|
-
s.setRoutingParameter(n.RoutingParameter.shapeBufferDistance, a), s.setRoutingParameter(n.RoutingParameter.idealNudgingDistance, 8), s.setRoutingParameter(n.RoutingParameter.crossingPenalty, 80), s.setRoutingParameter(n.RoutingParameter.fixedSharedPathPenalty, 120), s.setRoutingParameter(n.RoutingParameter.portDirectionPenalty, 0), s.setRoutingOption(
|
|
29
|
-
n.RoutingOption.nudgeOrthogonalSegmentsConnectedToShapes,
|
|
30
|
-
!h.some((t) => t.sourcePort || t.targetPort || t.source === t.target)
|
|
31
|
-
), s.setRoutingOption(n.RoutingOption.nudgeSharedPathsWithCommonEndPoint, !0);
|
|
32
|
-
const M = new Map(
|
|
33
|
-
i.nodes.filter((t) => !r.has(t.id) && l(t.id).every((e) => r.has(e))).map((t) => {
|
|
34
|
-
const e = new n.Point(t.x, t.y), g = new n.Point(t.x + t.width, t.y + t.height), p = new n.Rectangle(e, g), x = new n.ShapeRef(s, p);
|
|
35
|
-
return T(e), T(g), T(p), [t.id, x];
|
|
36
|
-
})
|
|
37
|
-
), O = /* @__PURE__ */ new Map(), C = /* @__PURE__ */ new Map();
|
|
38
|
-
for (const t of h) {
|
|
39
|
-
const e = [t.source, t.target].sort().join("\0"), g = O.get(e) ?? 0;
|
|
40
|
-
O.set(e, g + 1), C.set(t.id, g % 2 === 0 ? -6 : 6);
|
|
41
|
-
}
|
|
42
|
-
let K = v.length + 2;
|
|
43
|
-
const W = /* @__PURE__ */ new Map(), b = (t, e) => Math.max(0, Math.min(1, t / e));
|
|
44
|
-
for (const t of i.nodes) {
|
|
45
|
-
const e = M.get(t.id);
|
|
46
|
-
if (!e) continue;
|
|
47
|
-
const g = (p, x, w, y, u) => {
|
|
48
|
-
const N = new n.ShapeConnectionPin(
|
|
49
|
-
e,
|
|
50
|
-
p,
|
|
51
|
-
b(x, t.width),
|
|
52
|
-
b(w, t.height),
|
|
53
|
-
!0,
|
|
54
|
-
0,
|
|
55
|
-
y
|
|
56
|
-
);
|
|
57
|
-
N.setExclusive(u), N.setConnectionCost(
|
|
58
|
-
t.width / 2 + t.height / 2 - Math.abs(x - t.width / 2) - Math.abs(w - t.height / 2)
|
|
59
|
-
);
|
|
60
|
-
};
|
|
61
|
-
for (const p of new Set(t.ports?.map((x) => x.side))) {
|
|
62
|
-
const { x, y: w } = $(t, p), y = v.indexOf(p) + 2;
|
|
63
|
-
g(y, x - t.x, w - t.y, _[p], !1), W.set(
|
|
64
|
-
JSON.stringify([
|
|
65
|
-
t.id,
|
|
66
|
-
b(x - t.x, t.width),
|
|
67
|
-
b(w - t.y, t.height),
|
|
68
|
-
p
|
|
69
|
-
]),
|
|
70
|
-
y
|
|
71
|
-
);
|
|
72
|
-
}
|
|
73
|
-
}
|
|
74
|
-
const Q = i.nodes.filter((t) => M.has(t.id)), F = (t, e, g, p, x, w = !1) => {
|
|
75
|
-
const y = M.get(t.id);
|
|
76
|
-
if (y && g)
|
|
77
|
-
return new n.ConnEnd(
|
|
78
|
-
y,
|
|
79
|
-
v.indexOf(t.ports.find((d) => d.id === g).side) + 2
|
|
80
|
-
);
|
|
81
|
-
const u = g ? [
|
|
82
|
-
{
|
|
83
|
-
side: t.ports.find((d) => d.id === g).side,
|
|
84
|
-
position: $(t, t.ports.find((d) => d.id === g).side)
|
|
85
|
-
}
|
|
86
|
-
] : x ? [{ side: "EAST", position: x }] : (w ? [q(t, e).source] : v).flatMap((d) => {
|
|
87
|
-
const H = tt(t, d, e, p);
|
|
88
|
-
if (w) return [{ side: d, position: H }];
|
|
89
|
-
const R = d === "NORTH" || d === "SOUTH", A = R ? t.x : t.y, S = R ? t.width : t.height, E = A + Math.min(8, S / 4), B = A + S - Math.min(8, S / 4);
|
|
90
|
-
return [
|
|
91
|
-
R ? H.x : H.y,
|
|
92
|
-
E,
|
|
93
|
-
B,
|
|
94
|
-
...Q.flatMap((m) => {
|
|
95
|
-
const k = R ? m.x : m.y, V = k + (R ? m.width : m.height);
|
|
96
|
-
return [k - a, V + a, k - a - 8, V + a + 8];
|
|
97
|
-
}).filter((m) => m >= E && m <= B)
|
|
98
|
-
].map((m) => ({
|
|
99
|
-
side: d,
|
|
100
|
-
position: R ? { x: m, y: H.y } : { x: H.x, y: m }
|
|
101
|
-
}));
|
|
102
|
-
});
|
|
103
|
-
if (y) {
|
|
104
|
-
const d = (S, E) => JSON.stringify([
|
|
105
|
-
t.id,
|
|
106
|
-
b(E.x - t.x, t.width),
|
|
107
|
-
b(E.y - t.y, t.height),
|
|
108
|
-
S
|
|
109
|
-
]), R = !!(g || x || w) || u.every(
|
|
110
|
-
(S) => W.has(d(S.side, S.position))
|
|
111
|
-
) ? W.get(d(u[0].side, u[0].position)) : void 0;
|
|
112
|
-
if (R !== void 0) return new n.ConnEnd(y, R);
|
|
113
|
-
const A = R ?? K++;
|
|
114
|
-
for (const { side: S, position: E } of u) {
|
|
115
|
-
const B = d(S, E);
|
|
116
|
-
if (W.has(B)) continue;
|
|
117
|
-
W.set(B, A);
|
|
118
|
-
const D = E.x - t.x, m = E.y - t.y, k = new n.ShapeConnectionPin(
|
|
119
|
-
y,
|
|
120
|
-
A,
|
|
121
|
-
b(D, t.width),
|
|
122
|
-
b(m, t.height),
|
|
123
|
-
!0,
|
|
124
|
-
0,
|
|
125
|
-
_[S]
|
|
126
|
-
);
|
|
127
|
-
k.setExclusive(!1), k.setConnectionCost(
|
|
128
|
-
t.width / 2 + t.height / 2 - Math.abs(D - t.width / 2) - Math.abs(m - t.height / 2)
|
|
129
|
-
);
|
|
130
|
-
}
|
|
131
|
-
return new n.ConnEnd(y, A);
|
|
132
|
-
}
|
|
133
|
-
const N = q(t, e).source, G = u.find((d) => d.side === N)?.position ?? u[0].position, j = new n.Point(G.x, G.y), z = new n.ConnEnd(j);
|
|
134
|
-
return T(j), z;
|
|
135
|
-
}, J = (t) => +!!(t.sourcePort || t.targetPort || t.source === t.target || O.get([t.source, t.target].sort().join("\0")) > 1), Z = [...h].sort((t, e) => J(e) - J(t)).map((t) => {
|
|
136
|
-
const e = c.get(t.source), g = c.get(t.target), p = t.source === t.target, x = O.get([t.source, t.target].sort().join("\0")) > 1, w = F(
|
|
137
|
-
e,
|
|
138
|
-
g,
|
|
139
|
-
t.sourcePort,
|
|
140
|
-
C.get(t.id),
|
|
141
|
-
p ? { x: e.x + e.width, y: e.y + e.height / 3 } : void 0,
|
|
142
|
-
x
|
|
143
|
-
), y = F(
|
|
144
|
-
g,
|
|
145
|
-
e,
|
|
146
|
-
t.targetPort,
|
|
147
|
-
C.get(t.id),
|
|
148
|
-
p ? {
|
|
149
|
-
x: g.x + g.width,
|
|
150
|
-
y: g.y + g.height * 2 / 3
|
|
151
|
-
} : void 0,
|
|
152
|
-
x
|
|
153
|
-
), u = new n.ConnRef(s, w, y);
|
|
154
|
-
if (T(w), T(y), p) {
|
|
155
|
-
const N = new n.CheckpointVector();
|
|
156
|
-
for (const G of [
|
|
157
|
-
e.y + e.height / 3,
|
|
158
|
-
e.y + e.height * 2 / 3
|
|
159
|
-
]) {
|
|
160
|
-
const j = new n.Point(
|
|
161
|
-
e.x + e.width + Math.max(24, a + 4),
|
|
162
|
-
G
|
|
163
|
-
), z = new n.Checkpoint(j);
|
|
164
|
-
N.push_back(z), T(j), T(z);
|
|
165
|
-
}
|
|
166
|
-
u.setRoutingCheckpoints(N), T(N);
|
|
167
|
-
}
|
|
168
|
-
return { edge: t, connection: u };
|
|
169
|
-
});
|
|
170
|
-
s.processTransaction();
|
|
171
|
-
for (const { edge: t, connection: e } of Z) {
|
|
172
|
-
const g = e.displayRoute(), p = Array.from({ length: g.size() }, (x, w) => {
|
|
173
|
-
const y = g.at(w), u = { x: y.x, y: y.y };
|
|
174
|
-
return T(y), u;
|
|
175
|
-
});
|
|
176
|
-
if (T(g), !e.hasValidRoute() || p.length < 2 || p.some((x) => !Number.isFinite(x.x) || !Number.isFinite(x.y)) || p.some((x, w) => w > 0 && x.x !== p[w - 1].x && x.y !== p[w - 1].y))
|
|
177
|
-
throw new Error(`Graph edge cannot be routed: ${t.id}`);
|
|
178
|
-
P.set(t.id, p);
|
|
179
|
-
}
|
|
180
|
-
} finally {
|
|
181
|
-
s.delete();
|
|
182
|
-
}
|
|
183
|
-
}
|
|
184
|
-
const U = i.edges.map((r) => ({ ...r, sections: [P.get(r.id)] }));
|
|
185
|
-
return L({
|
|
186
|
-
nodes: i.nodes,
|
|
187
|
-
edges: U,
|
|
188
|
-
bounds: i.bounds
|
|
189
|
-
});
|
|
190
|
-
}
|
|
191
|
-
function L(i) {
|
|
192
|
-
const o = [
|
|
193
|
-
...i.nodes.flatMap((c) => [
|
|
194
|
-
{ x: c.x, y: c.y },
|
|
195
|
-
{ x: c.x + c.width, y: c.y + c.height }
|
|
196
|
-
]),
|
|
197
|
-
...i.edges.flatMap((c) => c.sections.flat())
|
|
198
|
-
], a = Math.min(...o.map((c) => c.x)), n = Math.min(...o.map((c) => c.y));
|
|
199
|
-
return {
|
|
200
|
-
nodes: i.nodes,
|
|
201
|
-
edges: i.edges,
|
|
202
|
-
bounds: {
|
|
203
|
-
x: a,
|
|
204
|
-
y: n,
|
|
205
|
-
width: Math.max(...o.map((c) => c.x)) - a,
|
|
206
|
-
height: Math.max(...o.map((c) => c.y)) - n
|
|
207
|
-
}
|
|
208
|
-
};
|
|
209
|
-
}
|
|
210
|
-
function $(i, o) {
|
|
211
|
-
return {
|
|
212
|
-
x: o === "WEST" ? i.x : o === "EAST" ? i.x + i.width : i.x + i.width / 2,
|
|
213
|
-
y: o === "NORTH" ? i.y : o === "SOUTH" ? i.y + i.height : i.y + i.height / 2
|
|
214
|
-
};
|
|
215
|
-
}
|
|
216
|
-
function q(i, o) {
|
|
217
|
-
const a = (h, s) => s.x >= h.x && s.y >= h.y && s.x + s.width <= h.x + h.width && s.y + s.height <= h.y + h.height, n = a(i, o) ? i : a(o, i) ? o : void 0;
|
|
218
|
-
if (n) {
|
|
219
|
-
const h = n === i ? o : i, s = {
|
|
220
|
-
NORTH: h.y - n.y,
|
|
221
|
-
EAST: n.x + n.width - h.x - h.width,
|
|
222
|
-
SOUTH: n.y + n.height - h.y - h.height,
|
|
223
|
-
WEST: h.x - n.x
|
|
224
|
-
}, M = [...v].sort((O, C) => s[O] - s[C])[0];
|
|
225
|
-
return { source: M, target: M };
|
|
226
|
-
}
|
|
227
|
-
const c = o.x + o.width / 2 - (i.x + i.width / 2), l = o.y + o.height / 2 - (i.y + i.height / 2), f = Math.max(i.x - (o.x + o.width), o.x - (i.x + i.width), 0), P = Math.max(
|
|
228
|
-
i.y - (o.y + o.height),
|
|
229
|
-
o.y - (i.y + i.height),
|
|
230
|
-
0
|
|
231
|
-
), r = (P === 0 && f > 0 ? !0 : f === 0 && P > 0 ? !1 : f === 0 && P === 0 ? Math.abs(c) >= Math.abs(l) : f <= P) ? c >= 0 ? "EAST" : "WEST" : l >= 0 ? "SOUTH" : "NORTH";
|
|
232
|
-
return { source: r, target: v[(v.indexOf(r) + 2) % 4] };
|
|
233
|
-
}
|
|
234
|
-
function tt(i, o, a, n = 0) {
|
|
235
|
-
const c = (r) => Math.min(8, r / 4), l = (r, h, s) => Math.max(h + c(s), Math.min(h + s - c(s), r)), f = (r, h, s, M) => {
|
|
236
|
-
const O = Math.max(r, s), C = Math.min(r + h, s + M);
|
|
237
|
-
return O < C ? (O + C) / 2 + n : void 0;
|
|
238
|
-
}, P = a.x + a.width / 2, U = a.y + a.height / 2;
|
|
239
|
-
switch (o) {
|
|
240
|
-
case "NORTH":
|
|
241
|
-
return {
|
|
242
|
-
x: l(
|
|
243
|
-
f(i.x, i.width, a.x, a.width) ?? P + n,
|
|
244
|
-
i.x,
|
|
245
|
-
i.width
|
|
246
|
-
),
|
|
247
|
-
y: i.y
|
|
248
|
-
};
|
|
249
|
-
case "EAST":
|
|
250
|
-
return {
|
|
251
|
-
x: i.x + i.width,
|
|
252
|
-
y: l(
|
|
253
|
-
f(i.y, i.height, a.y, a.height) ?? U + n,
|
|
254
|
-
i.y,
|
|
255
|
-
i.height
|
|
256
|
-
)
|
|
257
|
-
};
|
|
258
|
-
case "SOUTH":
|
|
259
|
-
return {
|
|
260
|
-
x: l(
|
|
261
|
-
f(i.x, i.width, a.x, a.width) ?? P + n,
|
|
262
|
-
i.x,
|
|
263
|
-
i.width
|
|
264
|
-
),
|
|
265
|
-
y: i.y + i.height
|
|
266
|
-
};
|
|
267
|
-
case "WEST":
|
|
268
|
-
return {
|
|
269
|
-
x: i.x,
|
|
270
|
-
y: l(
|
|
271
|
-
f(i.y, i.height, a.y, a.height) ?? U + n,
|
|
272
|
-
i.y,
|
|
273
|
-
i.height
|
|
274
|
-
)
|
|
275
|
-
};
|
|
276
|
-
}
|
|
277
|
-
}
|
|
278
|
-
export {
|
|
279
|
-
st as routeGraphGeometry
|
|
280
|
-
};
|
|
@@ -1,186 +0,0 @@
|
|
|
1
|
-
import { commonjsRequire as k } from "../../../../../../_virtual/_commonjs-dynamic-modules.js";
|
|
2
|
-
import { __module as _ } from "../../../../../../_virtual/elk-api2.js";
|
|
3
|
-
var E;
|
|
4
|
-
function S() {
|
|
5
|
-
return E ? _.exports : (E = 1, (function(O, L) {
|
|
6
|
-
(function(p) {
|
|
7
|
-
O.exports = p();
|
|
8
|
-
})(function() {
|
|
9
|
-
return (/* @__PURE__ */ (function() {
|
|
10
|
-
function p(l, u, i) {
|
|
11
|
-
function y(a, w) {
|
|
12
|
-
if (!u[a]) {
|
|
13
|
-
if (!l[a]) {
|
|
14
|
-
var g = typeof k == "function" && k;
|
|
15
|
-
if (!w && g) return g(a, !0);
|
|
16
|
-
if (v) return v(a, !0);
|
|
17
|
-
var o = new Error("Cannot find module '" + a + "'");
|
|
18
|
-
throw o.code = "MODULE_NOT_FOUND", o;
|
|
19
|
-
}
|
|
20
|
-
var e = u[a] = { exports: {} };
|
|
21
|
-
l[a][0].call(e.exports, function(r) {
|
|
22
|
-
var t = l[a][1][r];
|
|
23
|
-
return y(t || r);
|
|
24
|
-
}, e, e.exports, p, l, u, i);
|
|
25
|
-
}
|
|
26
|
-
return u[a].exports;
|
|
27
|
-
}
|
|
28
|
-
for (var v = typeof k == "function" && k, d = 0; d < i.length; d++) y(i[d]);
|
|
29
|
-
return y;
|
|
30
|
-
}
|
|
31
|
-
return p;
|
|
32
|
-
})())({ 1: [function(p, l, u) {
|
|
33
|
-
Object.defineProperty(u, "__esModule", {
|
|
34
|
-
value: !0
|
|
35
|
-
}), u.default = void 0;
|
|
36
|
-
function i(o) {
|
|
37
|
-
"@babel/helpers - typeof";
|
|
38
|
-
return i = typeof Symbol == "function" && typeof Symbol.iterator == "symbol" ? function(e) {
|
|
39
|
-
return typeof e;
|
|
40
|
-
} : function(e) {
|
|
41
|
-
return e && typeof Symbol == "function" && e.constructor === Symbol && e !== Symbol.prototype ? "symbol" : typeof e;
|
|
42
|
-
}, i(o);
|
|
43
|
-
}
|
|
44
|
-
function y(o, e) {
|
|
45
|
-
if (!(o instanceof e)) throw new TypeError("Cannot call a class as a function");
|
|
46
|
-
}
|
|
47
|
-
function v(o, e) {
|
|
48
|
-
for (var r = 0; r < e.length; r++) {
|
|
49
|
-
var t = e[r];
|
|
50
|
-
t.enumerable = t.enumerable || !1, t.configurable = !0, "value" in t && (t.writable = !0), Object.defineProperty(o, a(t.key), t);
|
|
51
|
-
}
|
|
52
|
-
}
|
|
53
|
-
function d(o, e, r) {
|
|
54
|
-
return e && v(o.prototype, e), Object.defineProperty(o, "prototype", { writable: !1 }), o;
|
|
55
|
-
}
|
|
56
|
-
function a(o) {
|
|
57
|
-
var e = w(o, "string");
|
|
58
|
-
return i(e) == "symbol" ? e : e + "";
|
|
59
|
-
}
|
|
60
|
-
function w(o, e) {
|
|
61
|
-
if (i(o) != "object" || !o) return o;
|
|
62
|
-
var r = o[Symbol.toPrimitive];
|
|
63
|
-
if (r !== void 0) {
|
|
64
|
-
var t = r.call(o, e);
|
|
65
|
-
if (i(t) != "object") return t;
|
|
66
|
-
throw new TypeError("@@toPrimitive must return a primitive value.");
|
|
67
|
-
}
|
|
68
|
-
return String(o);
|
|
69
|
-
}
|
|
70
|
-
u.default = /* @__PURE__ */ (function() {
|
|
71
|
-
function o() {
|
|
72
|
-
var e = this, r = arguments.length > 0 && arguments[0] !== void 0 ? arguments[0] : {}, t = r.defaultLayoutOptions, n = t === void 0 ? {} : t, s = r.algorithms, m = s === void 0 ? ["layered", "stress", "mrtree", "radial", "force", "disco", "sporeOverlap", "sporeCompaction", "rectpacking"] : s, f = r.workerFactory, c = r.workerUrl;
|
|
73
|
-
if (y(this, o), this.defaultLayoutOptions = n, this.initialized = !1, typeof c > "u" && typeof f > "u")
|
|
74
|
-
throw new Error("Cannot construct an ELK without both 'workerUrl' and 'workerFactory'.");
|
|
75
|
-
var h = f;
|
|
76
|
-
typeof c < "u" && typeof f > "u" && (h = function(j) {
|
|
77
|
-
return new Worker(j);
|
|
78
|
-
});
|
|
79
|
-
var b = h(c);
|
|
80
|
-
if (typeof b.postMessage != "function")
|
|
81
|
-
throw new TypeError("Created worker does not provide the required 'postMessage' function.");
|
|
82
|
-
this.worker = new g(b), this.worker.postMessage({
|
|
83
|
-
cmd: "register",
|
|
84
|
-
algorithms: m
|
|
85
|
-
}).then(function(x) {
|
|
86
|
-
return e.initialized = !0;
|
|
87
|
-
}).catch(console.err);
|
|
88
|
-
}
|
|
89
|
-
return d(o, [{
|
|
90
|
-
key: "layout",
|
|
91
|
-
value: function(r) {
|
|
92
|
-
var t = arguments.length > 1 && arguments[1] !== void 0 ? arguments[1] : {}, n = t.layoutOptions, s = n === void 0 ? this.defaultLayoutOptions : n, m = t.logging, f = m === void 0 ? !1 : m, c = t.measureExecutionTime, h = c === void 0 ? !1 : c;
|
|
93
|
-
return r ? this.worker.postMessage({
|
|
94
|
-
cmd: "layout",
|
|
95
|
-
graph: r,
|
|
96
|
-
layoutOptions: s,
|
|
97
|
-
options: {
|
|
98
|
-
logging: f,
|
|
99
|
-
measureExecutionTime: h
|
|
100
|
-
}
|
|
101
|
-
}) : Promise.reject(new Error("Missing mandatory parameter 'graph'."));
|
|
102
|
-
}
|
|
103
|
-
}, {
|
|
104
|
-
key: "knownLayoutAlgorithms",
|
|
105
|
-
value: function() {
|
|
106
|
-
return this.worker.postMessage({
|
|
107
|
-
cmd: "algorithms"
|
|
108
|
-
});
|
|
109
|
-
}
|
|
110
|
-
}, {
|
|
111
|
-
key: "knownLayoutOptions",
|
|
112
|
-
value: function() {
|
|
113
|
-
return this.worker.postMessage({
|
|
114
|
-
cmd: "options"
|
|
115
|
-
});
|
|
116
|
-
}
|
|
117
|
-
}, {
|
|
118
|
-
key: "knownLayoutCategories",
|
|
119
|
-
value: function() {
|
|
120
|
-
return this.worker.postMessage({
|
|
121
|
-
cmd: "categories"
|
|
122
|
-
});
|
|
123
|
-
}
|
|
124
|
-
}, {
|
|
125
|
-
key: "terminateWorker",
|
|
126
|
-
value: function() {
|
|
127
|
-
this.worker && this.worker.terminate();
|
|
128
|
-
}
|
|
129
|
-
}]);
|
|
130
|
-
})();
|
|
131
|
-
var g = /* @__PURE__ */ (function() {
|
|
132
|
-
function o(e) {
|
|
133
|
-
var r = this;
|
|
134
|
-
if (y(this, o), e === void 0)
|
|
135
|
-
throw new Error("Missing mandatory parameter 'worker'.");
|
|
136
|
-
this.resolvers = {}, this.worker = e, this.worker.onmessage = function(t) {
|
|
137
|
-
setTimeout(function() {
|
|
138
|
-
r.receive(r, t);
|
|
139
|
-
}, 0);
|
|
140
|
-
};
|
|
141
|
-
}
|
|
142
|
-
return d(o, [{
|
|
143
|
-
key: "postMessage",
|
|
144
|
-
value: function(r) {
|
|
145
|
-
var t = this.id || 0;
|
|
146
|
-
this.id = t + 1, r.id = t;
|
|
147
|
-
var n = this;
|
|
148
|
-
return new Promise(function(s, m) {
|
|
149
|
-
n.resolvers[t] = function(f, c) {
|
|
150
|
-
f ? (n.convertGwtStyleError(f), m(f)) : s(c);
|
|
151
|
-
}, n.worker.postMessage(r);
|
|
152
|
-
});
|
|
153
|
-
}
|
|
154
|
-
}, {
|
|
155
|
-
key: "receive",
|
|
156
|
-
value: function(r, t) {
|
|
157
|
-
var n = t.data, s = r.resolvers[n.id];
|
|
158
|
-
s && (delete r.resolvers[n.id], n.error ? s(n.error) : s(null, n.data));
|
|
159
|
-
}
|
|
160
|
-
}, {
|
|
161
|
-
key: "terminate",
|
|
162
|
-
value: function() {
|
|
163
|
-
this.worker && this.worker.terminate();
|
|
164
|
-
}
|
|
165
|
-
}, {
|
|
166
|
-
key: "convertGwtStyleError",
|
|
167
|
-
value: function(r) {
|
|
168
|
-
if (r) {
|
|
169
|
-
var t = r.__java$exception;
|
|
170
|
-
t && (t.cause && t.cause.backingJsObject && (r.cause = t.cause.backingJsObject, this.convertGwtStyleError(r.cause)), delete r.__java$exception);
|
|
171
|
-
}
|
|
172
|
-
}
|
|
173
|
-
}]);
|
|
174
|
-
})();
|
|
175
|
-
}, {}], 2: [function(p, l, u) {
|
|
176
|
-
var i = p("./elk-api.js").default;
|
|
177
|
-
Object.defineProperty(l.exports, "__esModule", {
|
|
178
|
-
value: !0
|
|
179
|
-
}), l.exports = i, i.default = i;
|
|
180
|
-
}, { "./elk-api.js": 1 }] }, {}, [2])(2);
|
|
181
|
-
});
|
|
182
|
-
})(_), _.exports);
|
|
183
|
-
}
|
|
184
|
-
export {
|
|
185
|
-
S as __require
|
|
186
|
-
};
|