@digipair/skill-web-chatbot 0.114.2 → 0.114.3

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
Files changed (49) hide show
  1. package/dist/index.cjs.js +2118 -8
  2. package/dist/index.esm2.js +5 -5
  3. package/package.json +6 -2
  4. package/dist/SAP-icons.cjs.js +0 -2489
  5. package/dist/SAP-icons.cjs2.js +0 -2489
  6. package/dist/Tableau10-558cc280.cjs.js +0 -9
  7. package/dist/arc-d1f6357e.cjs.js +0 -88
  8. package/dist/array-2ff2c7a6.cjs.js +0 -11
  9. package/dist/blockDiagram-5dc23a45.cjs.js +0 -2916
  10. package/dist/c4Diagram-1e775db3.cjs.js +0 -4386
  11. package/dist/channel-ebbc4130.cjs.js +0 -9
  12. package/dist/classDiagram-f52caa06.cjs.js +0 -209
  13. package/dist/classDiagram-v2-640c694e.cjs.js +0 -401
  14. package/dist/clone-afc2f047.cjs.js +0 -10
  15. package/dist/createText-03b82060.cjs.js +0 -2940
  16. package/dist/edges-16357fde.cjs.js +0 -2002
  17. package/dist/erDiagram-c7ff1bec.cjs.js +0 -1807
  18. package/dist/flowDb-9a89ea33.cjs.js +0 -5542
  19. package/dist/flowDiagram-aadb13b0.cjs.js +0 -1351
  20. package/dist/flowDiagram-v2-f2119625.cjs.js +0 -31
  21. package/dist/flowchart-elk-definition-cf813a97.cjs.js +0 -50248
  22. package/dist/ganttDiagram-3c2fde2b.cjs.js +0 -3710
  23. package/dist/gitGraphDiagram-c3a0619c.cjs.js +0 -3815
  24. package/dist/graph-0ee63739.cjs.js +0 -954
  25. package/dist/index-bb6d8841.cjs.js +0 -648
  26. package/dist/index.cjs2.js +0 -76743
  27. package/dist/infoDiagram-2f5c50c0.cjs.js +0 -460
  28. package/dist/init-f9637058.cjs.js +0 -17
  29. package/dist/journeyDiagram-14fe341a.cjs.js +0 -1061
  30. package/dist/katex-d90b6d29.cjs.js +0 -25690
  31. package/dist/layout-fd473db2.cjs.js +0 -1613
  32. package/dist/line-24d93f1b.cjs.js +0 -34
  33. package/dist/linear-9bcf74c4.cjs.js +0 -537
  34. package/dist/mindmap-definition-9399c7e6.cjs.js +0 -20488
  35. package/dist/ordinal-5695958c.cjs.js +0 -330
  36. package/dist/path-428ebac9.cjs.js +0 -316
  37. package/dist/pieDiagram-828dae43.cjs.js +0 -949
  38. package/dist/quadrantDiagram-5fa00455.cjs.js +0 -2409
  39. package/dist/requirementDiagram-03163dc4.cjs.js +0 -2267
  40. package/dist/sankeyDiagram-52ec8976.cjs.js +0 -1848
  41. package/dist/sequenceDiagram-b517d154.cjs.js +0 -5948
  42. package/dist/stateDiagram-fca82b5b.cjs.js +0 -283
  43. package/dist/stateDiagram-v2-ed04200a.cjs.js +0 -373
  44. package/dist/styles-11e81fdd.cjs.js +0 -3943
  45. package/dist/styles-cacbff60.cjs.js +0 -2120
  46. package/dist/styles-e75131e4.cjs.js +0 -671
  47. package/dist/svgDrawCommon-ecc5f780.cjs.js +0 -68
  48. package/dist/timeline-definition-4ee9bff4.cjs.js +0 -1161
  49. package/dist/xychartDiagram-e5e6b652.cjs.js +0 -3150
@@ -1,954 +0,0 @@
1
- 'use strict';
2
-
3
- var index = require('./index.cjs2.js');
4
-
5
- function _class_call_check(instance, Constructor) {
6
- if (!(instance instanceof Constructor)) {
7
- throw new TypeError("Cannot call a class as a function");
8
- }
9
- }
10
- function _defineProperties(target, props) {
11
- for(var i = 0; i < props.length; i++){
12
- var descriptor = props[i];
13
- descriptor.enumerable = descriptor.enumerable || false;
14
- descriptor.configurable = true;
15
- if ("value" in descriptor) descriptor.writable = true;
16
- Object.defineProperty(target, descriptor.key, descriptor);
17
- }
18
- }
19
- function _create_class(Constructor, protoProps, staticProps) {
20
- if (protoProps) _defineProperties(Constructor.prototype, protoProps);
21
- return Constructor;
22
- }
23
- function _instanceof(left, right) {
24
- if (right != null && typeof Symbol !== "undefined" && right[Symbol.hasInstance]) {
25
- return !!right[Symbol.hasInstance](left);
26
- } else {
27
- return left instanceof right;
28
- }
29
- }
30
- function _type_of(obj) {
31
- "@swc/helpers - typeof";
32
- return obj && typeof Symbol !== "undefined" && obj.constructor === Symbol ? "symbol" : typeof obj;
33
- }
34
- var hn = "[object Symbol]";
35
- function Q(e) {
36
- return (typeof e === "undefined" ? "undefined" : _type_of(e)) == "symbol" || index._i(e) && index.Ne(e) == hn;
37
- }
38
- function ve(e, n) {
39
- for(var r = -1, t = e == null ? 0 : e.length, i = Array(t); ++r < t;)i[r] = n(e[r], r, e);
40
- return i;
41
- }
42
- var se = index.tr ? index.tr.prototype : void 0, ae = se ? se.toString : void 0;
43
- function Pe(e) {
44
- if (typeof e == "string") return e;
45
- if (index.rr(e)) return ve(e, Pe) + "";
46
- if (Q(e)) return ae ? ae.call(e) : "";
47
- var n = e + "";
48
- return n == "0" && 1 / e == -Infinity ? "-0" : n;
49
- }
50
- function gn() {}
51
- function Le(e, n) {
52
- for(var r = -1, t = e == null ? 0 : e.length; ++r < t && n(e[r], r, e) !== false;);
53
- return e;
54
- }
55
- function cn(e, n, r, t) {
56
- for(var i = e.length, s = r + (-1); ++s < i;)if (n(e[s], s, e)) return s;
57
- return -1;
58
- }
59
- function _n(e) {
60
- return e !== e;
61
- }
62
- function pn(e, n, r) {
63
- for(var t = r - 1, i = e.length; ++t < i;)if (e[t] === n) return t;
64
- return -1;
65
- }
66
- function bn(e, n, r) {
67
- return n === n ? pn(e, n, r) : cn(e, _n, r);
68
- }
69
- function yn(e, n) {
70
- var r = e == null ? 0 : e.length;
71
- return !!r && bn(e, n, 0) > -1;
72
- }
73
- function T(e) {
74
- return index.vr(e) ? index.Um(e) : index._C(e);
75
- }
76
- var An = /\.|\[(?:[^[\]]*|(["'])(?:(?!\1)[^\\]|\\.)*?\1)\]/, Tn = /^\w*$/;
77
- function W(e, n) {
78
- if (index.rr(e)) return false;
79
- var r = typeof e === "undefined" ? "undefined" : _type_of(e);
80
- return r == "number" || r == "symbol" || r == "boolean" || e == null || Q(e) ? true : Tn.test(e) || !An.test(e) || n != null && e in Object(n);
81
- }
82
- var En = 500;
83
- function On(e) {
84
- var n = index.yi(e, function(t) {
85
- return r.size === En && r.clear(), t;
86
- }), r = n.cache;
87
- return n;
88
- }
89
- var $n = /[^.[\]]+|\[(?:(-?\d+(?:\.\d+)?)|(["'])((?:(?!\2)[^\\]|\\.)*?)\2)\]|(?=(?:\.|\[\])(?:\.|\[\]|$))/g, mn = /\\(\\)?/g, wn = On(function(e) {
90
- var n = [];
91
- return e.charCodeAt(0) === 46 && n.push(""), e.replace($n, function(r, t, i, s) {
92
- n.push(i ? s.replace(mn, "$1") : t || r);
93
- }), n;
94
- });
95
- var vn = wn;
96
- function Pn(e) {
97
- return e == null ? "" : Pe(e);
98
- }
99
- function Ie(e, n) {
100
- return index.rr(e) ? e : W(e, n) ? [
101
- e
102
- ] : vn(Pn(e));
103
- }
104
- function U(e) {
105
- if (typeof e == "string" || Q(e)) return e;
106
- var n = e + "";
107
- return n == "0" && 1 / e == -Infinity ? "-0" : n;
108
- }
109
- function Ce(e, n) {
110
- n = Ie(n, e);
111
- for(var r = 0, t = n.length; e != null && r < t;)e = e[U(n[r++])];
112
- return r && r == t ? e : void 0;
113
- }
114
- function In(e, n, r) {
115
- var t = e == null ? void 0 : Ce(e, n);
116
- return t === void 0 ? r : t;
117
- }
118
- function J(e, n) {
119
- for(var r = -1, t = n.length, i = e.length; ++r < t;)e[i + r] = n[r];
120
- return e;
121
- }
122
- var ue = index.tr ? index.tr.isConcatSpreadable : void 0;
123
- function Cn(e) {
124
- return index.rr(e) || index.ir(e) || !!(ue && e && e[ue]);
125
- }
126
- function Se(e, n, r, t, i) {
127
- var s = -1, a = e.length;
128
- for(r || (r = Cn), i || (i = []); ++s < a;){
129
- var u = e[s];
130
- r(u) ? J(i, u) : t || (i[i.length] = u);
131
- }
132
- return i;
133
- }
134
- function Sn(e, n, r, t) {
135
- var i = -1, s = e == null ? 0 : e.length;
136
- for(t && s && (r = e[++i]); ++i < s;)r = n(r, e[i], i, e);
137
- return r;
138
- }
139
- function Nn(e, n) {
140
- return e && index.Pm(n, T(n), e);
141
- }
142
- function Fn(e, n) {
143
- return e && index.Pm(n, index.Ja(n), e);
144
- }
145
- function Ne(e, n) {
146
- for(var r = -1, t = e == null ? 0 : e.length, i = 0, s = []; ++r < t;){
147
- var a = e[r];
148
- n(a, r, e) && (s[i++] = a);
149
- }
150
- return s;
151
- }
152
- function Fe() {
153
- return [];
154
- }
155
- var Mn = Object.prototype, xn = Mn.propertyIsEnumerable, fe = Object.getOwnPropertySymbols, Dn = fe ? function Dn(e) {
156
- return e == null ? [] : (e = Object(e), Ne(fe(e), function(n) {
157
- return xn.call(e, n);
158
- }));
159
- } : Fe;
160
- var z = Dn;
161
- function Rn(e, n) {
162
- return index.Pm(e, z(e), n);
163
- }
164
- var Gn = Object.getOwnPropertySymbols, Un = Gn ? function Un(e) {
165
- for(var n = []; e;)J(n, z(e)), e = index.Ua(e);
166
- return n;
167
- } : Fe;
168
- var Me = Un;
169
- function Bn(e, n) {
170
- return index.Pm(e, Me(e), n);
171
- }
172
- function xe(e, n, r) {
173
- var t = n(e);
174
- return index.rr(e) ? t : J(t, r(e));
175
- }
176
- function q(e) {
177
- return xe(e, T, z);
178
- }
179
- function jn(e) {
180
- return xe(e, index.Ja, Me);
181
- }
182
- var Kn = Object.prototype, Hn = Kn.hasOwnProperty;
183
- function Yn(e) {
184
- var n = e.length, r = new e.constructor(n);
185
- return n && typeof e[0] == "string" && Hn.call(e, "index") && (r.index = e.index, r.input = e.input), r;
186
- }
187
- function Zn(e, n) {
188
- var r = n ? index.Dg(e.buffer) : e.buffer;
189
- return new e.constructor(r, e.byteOffset, e.byteLength);
190
- }
191
- var qn = /\w*$/;
192
- function Xn(e) {
193
- var n = new e.constructor(e.source, qn.exec(e));
194
- return n.lastIndex = e.lastIndex, n;
195
- }
196
- var oe = index.tr ? index.tr.prototype : void 0, de = oe ? oe.valueOf : void 0;
197
- function Qn(e) {
198
- return de ? Object(de.call(e)) : {};
199
- }
200
- var Wn = "[object Boolean]", Jn = "[object Date]", zn = "[object Map]", Vn = "[object Number]", kn = "[object RegExp]", er = "[object Set]", nr = "[object String]", rr = "[object Symbol]", tr = "[object ArrayBuffer]", ir = "[object DataView]", sr = "[object Float32Array]", ar = "[object Float64Array]", ur = "[object Int8Array]", fr = "[object Int16Array]", or = "[object Int32Array]", dr = "[object Uint8Array]", hr = "[object Uint8ClampedArray]", lr = "[object Uint16Array]", gr = "[object Uint32Array]";
201
- function cr(e, n, r) {
202
- var t = e.constructor;
203
- switch(n){
204
- case tr:
205
- return index.Dg(e);
206
- case Wn:
207
- case Jn:
208
- return new t(+e);
209
- case ir:
210
- return Zn(e, r);
211
- case sr:
212
- case ar:
213
- case ur:
214
- case fr:
215
- case or:
216
- case dr:
217
- case hr:
218
- case lr:
219
- case gr:
220
- return index.Ng(e, r);
221
- case zn:
222
- return new t();
223
- case Vn:
224
- case nr:
225
- return new t(e);
226
- case kn:
227
- return Xn(e);
228
- case er:
229
- return new t();
230
- case rr:
231
- return Qn(e);
232
- }
233
- }
234
- var _r = "[object Map]";
235
- function pr(e) {
236
- return index._i(e) && index.AC(e) == _r;
237
- }
238
- var he = index.us && index.us.isMap, br = he ? index.Mm(he) : pr;
239
- var yr = br;
240
- var Ar = "[object Set]";
241
- function Tr(e) {
242
- return index._i(e) && index.AC(e) == Ar;
243
- }
244
- var le = index.us && index.us.isSet, Er = le ? index.Mm(le) : Tr;
245
- var Or = Er;
246
- var $r = 1, mr = 2, wr = 4, De = "[object Arguments]", vr = "[object Array]", Pr = "[object Boolean]", Lr = "[object Date]", Ir = "[object Error]", Re = "[object Function]", Cr = "[object GeneratorFunction]", Sr = "[object Map]", Nr = "[object Number]", Ge = "[object Object]", Fr = "[object RegExp]", Mr = "[object Set]", xr = "[object String]", Dr = "[object Symbol]", Rr = "[object WeakMap]", Gr = "[object ArrayBuffer]", Ur = "[object DataView]", Br = "[object Float32Array]", jr = "[object Float64Array]", Kr = "[object Int8Array]", Hr = "[object Int16Array]", Yr = "[object Int32Array]", Zr = "[object Uint8Array]", qr = "[object Uint8ClampedArray]", Xr = "[object Uint16Array]", Qr = "[object Uint32Array]", h = {};
247
- h[De] = h[vr] = h[Gr] = h[Ur] = h[Pr] = h[Lr] = h[Br] = h[jr] = h[Kr] = h[Hr] = h[Yr] = h[Sr] = h[Nr] = h[Ge] = h[Fr] = h[Mr] = h[xr] = h[Dr] = h[Zr] = h[qr] = h[Xr] = h[Qr] = true;
248
- h[Ir] = h[Re] = h[Rr] = false;
249
- function j(e, n, r, t, i, s) {
250
- var a, u = n & $r, f = n & mr, g = n & wr;
251
- if (a !== void 0) return a;
252
- if (!index.ye(e)) return e;
253
- var l = index.rr(e);
254
- if (l) {
255
- if (a = Yn(e), !u) return index.Rg(e, a);
256
- } else {
257
- var o = index.AC(e), d = o == Re || o == Cr;
258
- if (index.Nn(e)) return index.$g(e, u);
259
- if (o == Ge || o == De || d && !i) {
260
- if (a = f || d ? {} : index.Hg(e), !u) return f ? Bn(e, Fn(a, e)) : Rn(e, Nn(a, e));
261
- } else {
262
- if (!h[o]) return i ? e : {};
263
- a = cr(e, o, u);
264
- }
265
- }
266
- s || (s = new index.Re());
267
- var A = s.get(e);
268
- if (A) return A;
269
- s.set(e, a), Or(e) ? e.forEach(function(c) {
270
- a.add(j(c, n, r, c, e, s));
271
- }) : yr(e) && e.forEach(function(c, _) {
272
- a.set(_, j(c, n, r, _, e, s));
273
- });
274
- var p = g ? f ? jn : q : f ? index.Ja : T, b = l ? void 0 : p(e);
275
- return Le(b || e, function(c, _) {
276
- b && (_ = c, c = e[_]), index.Rm(a, _, j(c, n, r, _, e, s));
277
- }), a;
278
- }
279
- var Wr = "__lodash_hash_undefined__";
280
- function Jr(e) {
281
- return this.__data__.set(e, Wr), this;
282
- }
283
- function zr(e) {
284
- return this.__data__.has(e);
285
- }
286
- function S(e) {
287
- var n = -1, r = e == null ? 0 : e.length;
288
- for(this.__data__ = new index.ne(); ++n < r;)this.add(e[n]);
289
- }
290
- S.prototype.add = S.prototype.push = Jr;
291
- S.prototype.has = zr;
292
- function Vr(e, n) {
293
- for(var r = -1, t = e == null ? 0 : e.length; ++r < t;)if (n(e[r], r, e)) return true;
294
- return false;
295
- }
296
- function Ue(e, n) {
297
- return e.has(n);
298
- }
299
- var kr = 1, et = 2;
300
- function Be(e, n, r, t, i, s) {
301
- var a = r & kr, u = e.length, f = n.length;
302
- if (u != f && !(a && f > u)) return false;
303
- var g = s.get(e), l = s.get(n);
304
- if (g && l) return g == n && l == e;
305
- var o = -1, d = true, A = r & et ? new S() : void 0;
306
- for(s.set(e, n), s.set(n, e); ++o < u;){
307
- var p = e[o], b = n[o];
308
- if (t) var c = a ? t(b, p, o, n, e, s) : t(p, b, o, e, n, s);
309
- if (c !== void 0) {
310
- if (c) continue;
311
- d = false;
312
- break;
313
- }
314
- if (A) {
315
- if (!Vr(n, function(_, $) {
316
- if (!Ue(A, $) && (p === _ || i(p, _, r, t, s))) return A.push($);
317
- })) {
318
- d = false;
319
- break;
320
- }
321
- } else if (!(p === b || i(p, b, r, t, s))) {
322
- d = false;
323
- break;
324
- }
325
- }
326
- return s.delete(e), s.delete(n), d;
327
- }
328
- function nt(e) {
329
- var n = -1, r = Array(e.size);
330
- return e.forEach(function(t, i) {
331
- r[++n] = [
332
- i,
333
- t
334
- ];
335
- }), r;
336
- }
337
- function V(e) {
338
- var n = -1, r = Array(e.size);
339
- return e.forEach(function(t) {
340
- r[++n] = t;
341
- }), r;
342
- }
343
- var rt = 1, tt = 2, it = "[object Boolean]", st = "[object Date]", at = "[object Error]", ut = "[object Map]", ft = "[object Number]", ot = "[object RegExp]", dt = "[object Set]", ht = "[object String]", lt = "[object Symbol]", gt = "[object ArrayBuffer]", ct = "[object DataView]", ge = index.tr ? index.tr.prototype : void 0, K = ge ? ge.valueOf : void 0;
344
- function _t(e, n, r, t, i, s, a) {
345
- switch(r){
346
- case ct:
347
- if (e.byteLength != n.byteLength || e.byteOffset != n.byteOffset) return false;
348
- e = e.buffer, n = n.buffer;
349
- case gt:
350
- return !(e.byteLength != n.byteLength || !s(new index.ss(e), new index.ss(n)));
351
- case it:
352
- case st:
353
- case ft:
354
- return index.br(+e, +n);
355
- case at:
356
- return e.name == n.name && e.message == n.message;
357
- case ot:
358
- case ht:
359
- return e == n + "";
360
- case ut:
361
- var u = nt;
362
- case dt:
363
- var f = t & rt;
364
- if (u || (u = V), e.size != n.size && !f) return false;
365
- var g = a.get(e);
366
- if (g) return g == n;
367
- t |= tt, a.set(e, n);
368
- var l = Be(u(e), u(n), t, i, s, a);
369
- return a.delete(e), l;
370
- case lt:
371
- if (K) return K.call(e) == K.call(n);
372
- }
373
- return false;
374
- }
375
- var pt = 1, bt = Object.prototype, yt = bt.hasOwnProperty;
376
- function At(e, n, r, t, i, s) {
377
- var a = r & pt, u = q(e), f = u.length, g = q(n), l = g.length;
378
- if (f != l && !a) return false;
379
- for(var o = f; o--;){
380
- var d = u[o];
381
- if (!(a ? d in n : yt.call(n, d))) return false;
382
- }
383
- var A = s.get(e), p = s.get(n);
384
- if (A && p) return A == n && p == e;
385
- var b = true;
386
- s.set(e, n), s.set(n, e);
387
- for(var c = a; ++o < f;){
388
- d = u[o];
389
- var _ = e[d], $ = n[d];
390
- if (t) var ne = a ? t($, _, d, n, e, s) : t(_, $, d, e, n, s);
391
- if (!(ne === void 0 ? _ === $ || i(_, $, r, t, s) : ne)) {
392
- b = false;
393
- break;
394
- }
395
- c || (c = d == "constructor");
396
- }
397
- if (b && !c) {
398
- var N = e.constructor, F = n.constructor;
399
- N != F && "constructor" in e && "constructor" in n && !(typeof N == "function" && _instanceof(N, N) && typeof F == "function" && _instanceof(F, F)) && (b = false);
400
- }
401
- return s.delete(e), s.delete(n), b;
402
- }
403
- var Tt = 1, ce = "[object Arguments]", _e = "[object Array]", x = "[object Object]", Et = Object.prototype, pe = Et.hasOwnProperty;
404
- function Ot(e, n, r, t, i, s) {
405
- var a = index.rr(e), u = index.rr(n), f = a ? _e : index.AC(e), g = u ? _e : index.AC(n);
406
- f = f == ce ? x : f, g = g == ce ? x : g;
407
- var l = f == x, o = g == x, d = f == g;
408
- if (d && index.Nn(e)) {
409
- if (!index.Nn(n)) return false;
410
- a = true, l = false;
411
- }
412
- if (d && !l) return s || (s = new index.Re()), a || index.Rn(e) ? Be(e, n, r, t, i, s) : _t(e, n, f, r, t, i, s);
413
- if (!(r & Tt)) {
414
- var A = l && pe.call(e, "__wrapped__"), p = o && pe.call(n, "__wrapped__");
415
- if (A || p) {
416
- var b = A ? e.value() : e, c = p ? n.value() : n;
417
- return s || (s = new index.Re()), i(b, c, r, t, s);
418
- }
419
- }
420
- return d ? (s || (s = new index.Re()), At(e, n, r, t, i, s)) : false;
421
- }
422
- function k(e, n, r, t, i) {
423
- return e === n ? true : e == null || n == null || !index._i(e) && !index._i(n) ? e !== e && n !== n : Ot(e, n, r, t, k, i);
424
- }
425
- var $t = 1, mt = 2;
426
- function wt(e, n, r, t) {
427
- var i = r.length, s = i;
428
- if (e == null) return !s;
429
- for(e = Object(e); i--;){
430
- var u = r[i];
431
- if (u[2] ? u[1] !== e[u[0]] : !(u[0] in e)) return false;
432
- }
433
- for(; ++i < s;){
434
- u = r[i];
435
- var f = u[0], g = e[f], l = u[1];
436
- if (u[2]) {
437
- if (g === void 0 && !(f in e)) return false;
438
- } else {
439
- var o = new index.Re();
440
- var d;
441
- if (!(d === void 0 ? k(l, g, $t | mt, t, o) : d)) return false;
442
- }
443
- }
444
- return true;
445
- }
446
- function je(e) {
447
- return e === e && !index.ye(e);
448
- }
449
- function vt(e) {
450
- for(var n = T(e), r = n.length; r--;){
451
- var t = n[r], i = e[t];
452
- n[r] = [
453
- t,
454
- i,
455
- je(i)
456
- ];
457
- }
458
- return n;
459
- }
460
- function Ke(e, n) {
461
- return function(r) {
462
- return r == null ? false : r[e] === n && (n !== void 0 || e in Object(r));
463
- };
464
- }
465
- function Pt(e) {
466
- var n = vt(e);
467
- return n.length == 1 && n[0][2] ? Ke(n[0][0], n[0][1]) : function(r) {
468
- return r === e || wt(r, e, n);
469
- };
470
- }
471
- function Lt(e, n) {
472
- return e != null && n in Object(e);
473
- }
474
- function He(e, n, r) {
475
- n = Ie(n, e);
476
- for(var t = -1, i = n.length, s = false; ++t < i;){
477
- var a = U(n[t]);
478
- if (!(s = e != null && r(e, a))) break;
479
- e = e[a];
480
- }
481
- return s || ++t != i ? s : (i = e == null ? 0 : e.length, !!i && index.Ga(i) && index.Za(a, i) && (index.rr(e) || index.ir(e)));
482
- }
483
- function It(e, n) {
484
- return e != null && He(e, n, Lt);
485
- }
486
- var Ct = 1, St = 2;
487
- function Nt(e, n) {
488
- return W(e) && je(n) ? Ke(U(e), n) : function(r) {
489
- var t = In(r, e);
490
- return t === void 0 && t === n ? It(r, e) : k(n, t, Ct | St);
491
- };
492
- }
493
- function Ft(e) {
494
- return function(n) {
495
- return n == null ? void 0 : n[e];
496
- };
497
- }
498
- function Mt(e) {
499
- return function(n) {
500
- return Ce(n, e);
501
- };
502
- }
503
- function xt(e) {
504
- return W(e) ? Ft(U(e)) : Mt(e);
505
- }
506
- function Ye(e) {
507
- return typeof e == "function" ? e : e == null ? index.tl : (typeof e === "undefined" ? "undefined" : _type_of(e)) == "object" ? index.rr(e) ? Nt(e[0], e[1]) : Pt(e) : xt(e);
508
- }
509
- function Dt(e, n) {
510
- return e && index.Mg(e, n, T);
511
- }
512
- function Rt(e, n) {
513
- return function(r, t) {
514
- if (r == null) return r;
515
- if (!index.vr(r)) return e(r, t);
516
- for(var i = r.length, s = -1, a = Object(r); (++s < i) && t(a[s], s, a) !== false;);
517
- return r;
518
- };
519
- }
520
- var Gt = Rt(Dt);
521
- var ee = Gt;
522
- function Bt(e) {
523
- return typeof e == "function" ? e : index.tl;
524
- }
525
- function m(e, n) {
526
- var r = index.rr(e) ? Le : ee;
527
- return r(e, Bt(n));
528
- }
529
- function jt(e, n) {
530
- var r = [];
531
- return ee(e, function(t, i, s) {
532
- n(t, i, s) && r.push(t);
533
- }), r;
534
- }
535
- function D(e, n) {
536
- var r = index.rr(e) ? Ne : jt;
537
- return r(e, Ye(n));
538
- }
539
- var Kt = Object.prototype, Ht = Kt.hasOwnProperty;
540
- function Yt(e, n) {
541
- return e != null && Ht.call(e, n);
542
- }
543
- function E(e, n) {
544
- return e != null && He(e, n, Yt);
545
- }
546
- function Zt(e, n) {
547
- return ve(n, function(r) {
548
- return e[r];
549
- });
550
- }
551
- function H(e) {
552
- return e == null ? [] : Zt(e, T(e));
553
- }
554
- function v(e) {
555
- return e === void 0;
556
- }
557
- function qt(e, n, r, t, i) {
558
- return i(e, function(s, a, u) {
559
- r = t ? (t = false, s) : n(r, s, a, u);
560
- }), r;
561
- }
562
- function Xt(e, n, r) {
563
- var t = index.rr(e) ? Sn : qt, i = arguments.length < 3;
564
- return t(e, Ye(n), r, i, ee);
565
- }
566
- var Qt = 1 / 0, Wt = index._n && 1 / V(new index._n([
567
- ,
568
- -0
569
- ]))[1] == Qt ? function Wt(e) {
570
- return new index._n(e);
571
- } : gn;
572
- var Jt = Wt;
573
- var zt = 200;
574
- function Vt(e, n, r) {
575
- var t = -1, i = yn, s = e.length, a = true, u = [], f = u;
576
- if (s >= zt) {
577
- var g = Jt(e);
578
- if (g) return V(g);
579
- a = false, i = Ue, f = new S();
580
- } else f = u;
581
- e: for(; ++t < s;){
582
- var l = e[t], o = l;
583
- if (l = l !== 0 ? l : 0, a && o === o) {
584
- for(var d = f.length; d--;)if (f[d] === o) continue e;
585
- u.push(l);
586
- } else i(f, o, r) || (f !== u && f.push(o), u.push(l));
587
- }
588
- return u;
589
- }
590
- var kt = index.h0(function(e) {
591
- return Vt(Se(e, 1, index.Kg, true));
592
- });
593
- var ei = kt;
594
- var ni = "\0", w = "\0", be = "";
595
- var Ze = /*#__PURE__*/ function() {
596
- function Ze() {
597
- var n = arguments.length > 0 && arguments[0] !== void 0 ? arguments[0] : {};
598
- _class_call_check(this, Ze);
599
- this._isDirected = E(n, "directed") ? n.directed : true, this._isMultigraph = E(n, "multigraph") ? n.multigraph : false, this._isCompound = E(n, "compound") ? n.compound : false, this._label = void 0, this._defaultNodeLabelFn = index.t0(void 0), this._defaultEdgeLabelFn = index.t0(void 0), this._nodes = {}, this._isCompound && (this._parent = {}, this._children = {}, this._children[w] = {}), this._in = {}, this._preds = {}, this._out = {}, this._sucs = {}, this._edgeObjs = {}, this._edgeLabels = {};
600
- }
601
- _create_class(Ze, [
602
- {
603
- /* === Graph functions ========= */ key: "isDirected",
604
- value: function isDirected() {
605
- return this._isDirected;
606
- }
607
- },
608
- {
609
- key: "isMultigraph",
610
- value: function isMultigraph() {
611
- return this._isMultigraph;
612
- }
613
- },
614
- {
615
- key: "isCompound",
616
- value: function isCompound() {
617
- return this._isCompound;
618
- }
619
- },
620
- {
621
- key: "setGraph",
622
- value: function setGraph(n) {
623
- return this._label = n, this;
624
- }
625
- },
626
- {
627
- key: "graph",
628
- value: function graph() {
629
- return this._label;
630
- }
631
- },
632
- {
633
- /* === Node functions ========== */ key: "setDefaultNodeLabel",
634
- value: function setDefaultNodeLabel(n) {
635
- return index.In(n) || (n = index.t0(n)), this._defaultNodeLabelFn = n, this;
636
- }
637
- },
638
- {
639
- key: "nodeCount",
640
- value: function nodeCount() {
641
- return this._nodeCount;
642
- }
643
- },
644
- {
645
- key: "nodes",
646
- value: function nodes() {
647
- return T(this._nodes);
648
- }
649
- },
650
- {
651
- key: "sources",
652
- value: function sources() {
653
- var n = this;
654
- return D(this.nodes(), function(r) {
655
- return index.Gr(n._in[r]);
656
- });
657
- }
658
- },
659
- {
660
- key: "sinks",
661
- value: function sinks() {
662
- var n = this;
663
- return D(this.nodes(), function(r) {
664
- return index.Gr(n._out[r]);
665
- });
666
- }
667
- },
668
- {
669
- key: "setNodes",
670
- value: function setNodes(n, r) {
671
- var t = arguments, i = this;
672
- return m(n, function(s) {
673
- t.length > 1 ? i.setNode(s, r) : i.setNode(s);
674
- }), this;
675
- }
676
- },
677
- {
678
- key: "setNode",
679
- value: function setNode(n, r) {
680
- return E(this._nodes, n) ? (arguments.length > 1 && (this._nodes[n] = r), this) : (this._nodes[n] = arguments.length > 1 ? r : this._defaultNodeLabelFn(n), this._isCompound && (this._parent[n] = w, this._children[n] = {}, this._children[w][n] = true), this._in[n] = {}, this._preds[n] = {}, this._out[n] = {}, this._sucs[n] = {}, ++this._nodeCount, this);
681
- }
682
- },
683
- {
684
- key: "node",
685
- value: function node(n) {
686
- return this._nodes[n];
687
- }
688
- },
689
- {
690
- key: "hasNode",
691
- value: function hasNode(n) {
692
- return E(this._nodes, n);
693
- }
694
- },
695
- {
696
- key: "removeNode",
697
- value: function removeNode(n) {
698
- var r = this;
699
- if (E(this._nodes, n)) {
700
- var t = function t(i) {
701
- r.removeEdge(r._edgeObjs[i]);
702
- };
703
- delete this._nodes[n], this._isCompound && (this._removeFromParentsChildList(n), delete this._parent[n], m(this.children(n), function(i) {
704
- r.setParent(i);
705
- }), delete this._children[n]), m(T(this._in[n]), t), delete this._in[n], delete this._preds[n], m(T(this._out[n]), t), delete this._out[n], delete this._sucs[n], --this._nodeCount;
706
- }
707
- return this;
708
- }
709
- },
710
- {
711
- key: "setParent",
712
- value: function setParent(n, r) {
713
- if (!this._isCompound) throw new Error("Cannot set parent in a non-compound graph");
714
- if (v(r)) r = w;
715
- else {
716
- r += "";
717
- for(var t = r; !v(t); t = this.parent(t))if (t === n) throw new Error("Setting " + r + " as parent of " + n + " would create a cycle");
718
- this.setNode(r);
719
- }
720
- return this.setNode(n), this._removeFromParentsChildList(n), this._parent[n] = r, this._children[r][n] = true, this;
721
- }
722
- },
723
- {
724
- key: "_removeFromParentsChildList",
725
- value: function _removeFromParentsChildList(n) {
726
- delete this._children[this._parent[n]][n];
727
- }
728
- },
729
- {
730
- key: "parent",
731
- value: function parent(n) {
732
- if (this._isCompound) {
733
- var r = this._parent[n];
734
- if (r !== w) return r;
735
- }
736
- }
737
- },
738
- {
739
- key: "children",
740
- value: function children(n) {
741
- if (v(n) && (n = w), this._isCompound) {
742
- var r = this._children[n];
743
- if (r) return T(r);
744
- } else {
745
- if (n === w) return this.nodes();
746
- if (this.hasNode(n)) return [];
747
- }
748
- }
749
- },
750
- {
751
- key: "predecessors",
752
- value: function predecessors(n) {
753
- var r = this._preds[n];
754
- if (r) return T(r);
755
- }
756
- },
757
- {
758
- key: "successors",
759
- value: function successors(n) {
760
- var r = this._sucs[n];
761
- if (r) return T(r);
762
- }
763
- },
764
- {
765
- key: "neighbors",
766
- value: function neighbors(n) {
767
- var r = this.predecessors(n);
768
- if (r) return ei(r, this.successors(n));
769
- }
770
- },
771
- {
772
- key: "isLeaf",
773
- value: function isLeaf(n) {
774
- var r;
775
- return this.isDirected() ? r = this.successors(n) : r = this.neighbors(n), r.length === 0;
776
- }
777
- },
778
- {
779
- key: "filterNodes",
780
- value: function filterNodes(n) {
781
- var r = new this.constructor({
782
- directed: this._isDirected,
783
- multigraph: this._isMultigraph,
784
- compound: this._isCompound
785
- });
786
- r.setGraph(this.graph());
787
- var t = this;
788
- m(this._nodes, function(a, u) {
789
- n(u) && r.setNode(u, a);
790
- }), m(this._edgeObjs, function(a) {
791
- r.hasNode(a.v) && r.hasNode(a.w) && r.setEdge(a, t.edge(a));
792
- });
793
- var i = {};
794
- function s(a) {
795
- var u = t.parent(a);
796
- return u === void 0 || r.hasNode(u) ? (i[a] = u, u) : u in i ? i[u] : s(u);
797
- }
798
- return this._isCompound && m(r.nodes(), function(a) {
799
- r.setParent(a, s(a));
800
- }), r;
801
- }
802
- },
803
- {
804
- /* === Edge functions ========== */ key: "setDefaultEdgeLabel",
805
- value: function setDefaultEdgeLabel(n) {
806
- return index.In(n) || (n = index.t0(n)), this._defaultEdgeLabelFn = n, this;
807
- }
808
- },
809
- {
810
- key: "edgeCount",
811
- value: function edgeCount() {
812
- return this._edgeCount;
813
- }
814
- },
815
- {
816
- key: "edges",
817
- value: function edges() {
818
- return H(this._edgeObjs);
819
- }
820
- },
821
- {
822
- key: "setPath",
823
- value: function setPath(n, r) {
824
- var t = this, i = arguments;
825
- return Xt(n, function(s, a) {
826
- return i.length > 1 ? t.setEdge(s, a, r) : t.setEdge(s, a), a;
827
- }), this;
828
- }
829
- },
830
- {
831
- /*
832
- * setEdge(v, w, [value, [name]])
833
- * setEdge({ v, w, [name] }, [value])
834
- */ key: "setEdge",
835
- value: function setEdge() {
836
- var n, r, t, i, s = false, a = arguments[0];
837
- (typeof a === "undefined" ? "undefined" : _type_of(a)) == "object" && a !== null && "v" in a ? (n = a.v, r = a.w, t = a.name, arguments.length === 2 && (i = arguments[1], s = true)) : (n = a, r = arguments[1], t = arguments[3], arguments.length > 2 && (i = arguments[2], s = true)), n = "" + n, r = "" + r, v(t) || (t = "" + t);
838
- var u = P(this._isDirected, n, r, t);
839
- if (E(this._edgeLabels, u)) return s && (this._edgeLabels[u] = i), this;
840
- if (!v(t) && !this._isMultigraph) throw new Error("Cannot set a named edge when isMultigraph = false");
841
- this.setNode(n), this.setNode(r), this._edgeLabels[u] = s ? i : this._defaultEdgeLabelFn(n, r, t);
842
- var f = ri(this._isDirected, n, r, t);
843
- return n = f.v, r = f.w, Object.freeze(f), this._edgeObjs[u] = f, ye(this._preds[r], n), ye(this._sucs[n], r), this._in[r][u] = f, this._out[n][u] = f, this._edgeCount++, this;
844
- }
845
- },
846
- {
847
- key: "edge",
848
- value: function edge(n, r, t) {
849
- var i = arguments.length === 1 ? Y(this._isDirected, arguments[0]) : P(this._isDirected, n, r, t);
850
- return this._edgeLabels[i];
851
- }
852
- },
853
- {
854
- key: "hasEdge",
855
- value: function hasEdge(n, r, t) {
856
- var i = arguments.length === 1 ? Y(this._isDirected, arguments[0]) : P(this._isDirected, n, r, t);
857
- return E(this._edgeLabels, i);
858
- }
859
- },
860
- {
861
- key: "removeEdge",
862
- value: function removeEdge(n, r, t) {
863
- var i = arguments.length === 1 ? Y(this._isDirected, arguments[0]) : P(this._isDirected, n, r, t), s = this._edgeObjs[i];
864
- return s && (n = s.v, r = s.w, delete this._edgeLabels[i], delete this._edgeObjs[i], Ae(this._preds[r], n), Ae(this._sucs[n], r), delete this._in[r][i], delete this._out[n][i], this._edgeCount--), this;
865
- }
866
- },
867
- {
868
- key: "inEdges",
869
- value: function inEdges(n, r) {
870
- var t = this._in[n];
871
- if (t) {
872
- var i = H(t);
873
- return r ? D(i, function(s) {
874
- return s.v === r;
875
- }) : i;
876
- }
877
- }
878
- },
879
- {
880
- key: "outEdges",
881
- value: function outEdges(n, r) {
882
- var t = this._out[n];
883
- if (t) {
884
- var i = H(t);
885
- return r ? D(i, function(s) {
886
- return s.w === r;
887
- }) : i;
888
- }
889
- }
890
- },
891
- {
892
- key: "nodeEdges",
893
- value: function nodeEdges(n, r) {
894
- var t = this.inEdges(n, r);
895
- if (t) return t.concat(this.outEdges(n, r));
896
- }
897
- }
898
- ]);
899
- return Ze;
900
- }();
901
- Ze.prototype._nodeCount = 0;
902
- Ze.prototype._edgeCount = 0;
903
- function ye(e, n) {
904
- e[n] ? e[n]++ : e[n] = 1;
905
- }
906
- function Ae(e, n) {
907
- --e[n] || delete e[n];
908
- }
909
- function P(e, n, r, t) {
910
- var i = "" + n, s = "" + r;
911
- if (!e && i > s) {
912
- var a = i;
913
- i = s, s = a;
914
- }
915
- return i + be + s + be + (v(t) ? ni : t);
916
- }
917
- function ri(e, n, r, t) {
918
- var i = "" + n, s = "" + r;
919
- if (!e && i > s) {
920
- var a = i;
921
- i = s, s = a;
922
- }
923
- var u = {
924
- v: i,
925
- w: s
926
- };
927
- return t && (u.name = t), u;
928
- }
929
- function Y(e, n) {
930
- return P(e, n.v, n.w, n.name);
931
- }
932
-
933
- exports.Bt = Bt;
934
- exports.Ce = Ce;
935
- exports.D = D;
936
- exports.Dt = Dt;
937
- exports.E = E;
938
- exports.H = H;
939
- exports.Ie = Ie;
940
- exports.It = It;
941
- exports.Pn = Pn;
942
- exports.Q = Q;
943
- exports.Se = Se;
944
- exports.T = T;
945
- exports.U = U;
946
- exports.Xt = Xt;
947
- exports.Ye = Ye;
948
- exports.Ze = Ze;
949
- exports.cn = cn;
950
- exports.ee = ee;
951
- exports.j = j;
952
- exports.m = m;
953
- exports.v = v;
954
- exports.ve = ve;