@kong-ui-public/documentation 0.7.20 → 0.7.21

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 (47) hide show
  1. package/dist/{Tableau10-GLA_9iAD-BMurskAd.js → Tableau10-D7jGxypv-D3w6FIcJ.js} +1 -2
  2. package/dist/arc-CJ96KFKf-ZAEyyrBI.js +84 -0
  3. package/dist/{blockDiagram-6b2b5046-ZGxr7RGf-D4pbh8vR.js → blockDiagram-9f4a6865-DOUkHJlG-BPuF5-tK.js} +107 -108
  4. package/dist/{c4Diagram-b947cdbb-Bo6xALld-D8DXBmHw.js → c4Diagram-ae766693-qW59_Cjl-BSBtINzy.js} +133 -132
  5. package/dist/{channel-BX3TjCqa-Cdtt6hB1.js → channel-BkEGjNbZ-CzBFLYvk.js} +1 -1
  6. package/dist/{classDiagram-35230388-C60SAKfJ-FQHXcc4J.js → classDiagram-fb54d2a0-DaEnSnV7-BgUSoTGU.js} +8 -7
  7. package/dist/{classDiagram-v2-412acd34-CHK1KDqU-CiKmarbv.js → classDiagram-v2-a2b738ad-DVF-sdZH-lL0m0fQD.js} +8 -8
  8. package/dist/{clone-BSWoNj0I-CW2QP79u.js → clone-Bz5840kP-D3Uvm_gp.js} +1 -1
  9. package/dist/{createText-423428c9-DeHbckoy-r2CCACGx.js → createText-ca0c5216-DGjoI7Oz-8Az9WSXK.js} +14 -20
  10. package/dist/documentation.es.js +3 -3
  11. package/dist/documentation.umd.js +993 -723
  12. package/dist/{edges-d417c7a0-D7e9Y4V--DVOSTCB5.js → edges-066a5561-ByMuMaff-ipHdGCa_.js} +28 -27
  13. package/dist/{erDiagram-0ea73325-E3jchkiK-CfTqZxm6.js → erDiagram-09d1c15f-Ctl-zT4O-B9E7LRcs.js} +71 -72
  14. package/dist/{flowDb-d35e309a-Dch1VW7i-Bk557s4E.js → flowDb-c1833063-nJUM9bYy-B5f_hjwI.js} +4 -4
  15. package/dist/{flowDiagram-d949d7c1-CxjmKfBF-CuFUEya4.js → flowDiagram-b222e15a-BlrP8xne-DJ_sATm6.js} +339 -333
  16. package/dist/{flowDiagram-v2-49332944-Duf6j7PN-DgsEJ4Bo.js → flowDiagram-v2-13329dc7-DlqVPxH6-CgXruRZr.js} +5 -5
  17. package/dist/{flowchart-elk-definition-27cc417a-M-lK4i48-Bs8Ix10e.js → flowchart-elk-definition-ae0efee6-B2FZpaI4-C8o8y5J1.js} +343 -590
  18. package/dist/{ganttDiagram-5c869e3b-CgjZsm2H-Bon0v47P.js → ganttDiagram-b62c793e-BUkrtLIU-roFbcEhP.js} +513 -534
  19. package/dist/gitGraphDiagram-942e62fe-BIndO562-dNVJJzzm.js +1264 -0
  20. package/dist/{graph-Ch18bQn5-BLEKw6WT.js → graph-BN58fiEq-CyCz6HB3.js} +3 -4
  21. package/dist/{index-8fae9850-kUIz8xNo-CDn9_qZB.js → index-01f381cb-DHHDXut0-C1FToHnX.js} +11 -11
  22. package/dist/{index-CVS7cBlb.js → index-Dz46e5bv.js} +2354 -2515
  23. package/dist/{infoDiagram-db7b18fc-BpBtHVy2-DuX4gmA7.js → infoDiagram-94cd232f-CSzv-wTE-Bnonj1Cb.js} +7 -7
  24. package/dist/{journeyDiagram-d5636530-CZUFMDTA-D5VAFQAG.js → journeyDiagram-6625b456-Ca9U8tWI-DoKEPckV.js} +16 -16
  25. package/dist/katex-BXNjbZo7-CF_fuFJb.js +11637 -0
  26. package/dist/{layout-BzV691RN-Br8Ir03a.js → layout-DU4VNk5y-DEbr0_Pk.js} +112 -114
  27. package/dist/{line-JCh8JM-V-T9MVIZIE.js → line-CwSAou3c-dgS2jcU_.js} +3 -4
  28. package/dist/{linear-cwTFOJBq-B6q6qtlZ.js → linear-CngEzq0a-B6fRdJQY.js} +70 -94
  29. package/dist/{mindmap-definition-377f8f1f-BzIPdpBG-DD8FIpST.js → mindmap-definition-307c710a-CvpxqRPj-AB15RcM6.js} +343 -378
  30. package/dist/{ordinal-MUacOSdK-B1MUT0BL.js → ordinal-DfAQgscy-BEJTu10r.js} +3 -7
  31. package/dist/{path-Crsf9Nsj-SiSjwXsf.js → path-DLwuMfdd-EbErTa4c.js} +12 -19
  32. package/dist/{pieDiagram-b0208e96-BQfpnZHG-E8AMqTd3.js → pieDiagram-bb1d19e5-LP-9WGAS-DwilsWxb.js} +61 -61
  33. package/dist/{quadrantDiagram-0332be45-CNL4JCrn-BYyiYlYH.js → quadrantDiagram-c759a472-B_TsLXO0-BviiuQRe.js} +2 -2
  34. package/dist/{requirementDiagram-bf7890df-NBqqCuPF-CIHJhGNa.js → requirementDiagram-87253d64-o6jrBKBt-BDXpXGpQ.js} +30 -30
  35. package/dist/{sankeyDiagram-0acdec17-YE0ROy8d-CU1TmQZx.js → sankeyDiagram-707fac0f-BoEHDAJv-BBNylsjT.js} +44 -58
  36. package/dist/{sequenceDiagram-c18d009d-Yucxrjw7-D_cnXQcd.js → sequenceDiagram-6894f283-Dsj52Wsi-TDdIX1Wn.js} +845 -812
  37. package/dist/{stateDiagram-43596fc0-D9IY4Ssi-KJp_o1Vc.js → stateDiagram-5dee940d-COfohDXu-Dra8cHnR.js} +54 -54
  38. package/dist/{stateDiagram-v2-2ead4f9c-5IZQWbnV-Chm6qgaK.js → stateDiagram-v2-1992cada-v9z1blk7-b2WlcHGI.js} +12 -12
  39. package/dist/{styles-b2c874b6-pUAi9-OK-C7HwN-ih.js → styles-0784dbeb-DHDYpA72-BTX0XQJ5.js} +24 -24
  40. package/dist/{styles-7383a064-DLbSva3T-DWY6NPMf.js → styles-483fbfea-DUrqZeOP-BPfiLFkT.js} +140 -137
  41. package/dist/{styles-6860f46c-DHqkrPDU-JiuD19BB.js → styles-b83b31c9-R9NNyYA0-DnoGi25s.js} +29 -29
  42. package/dist/{svgDrawCommon-0ee1b4e9-rbw7BPwi-Boin581S.js → svgDrawCommon-5e1cfd1d-DeHC_PTd-44CTrnyq.js} +5 -5
  43. package/dist/{timeline-definition-d977decf-CtlVf6FF-BqqlH53Y.js → timeline-definition-bf702344-BzpRV6Z8-DHqazJ7N.js} +2 -2
  44. package/dist/{xychartDiagram-e50adddc-B9qgoJob-CqAKcFLo.js → xychartDiagram-f11f50a6-BMDfQSWf-CixUys_w.js} +40 -40
  45. package/package.json +6 -6
  46. package/dist/arc-TomPQHIy-B0wkvDWU.js +0 -86
  47. package/dist/gitGraphDiagram-b9d81de9-DhOfBQfl-BvCcUYjg.js +0 -1262
@@ -1,5 +1,5 @@
1
- import { I as me, $ as O, e as ze, C as be, H as I, a as ye, b as De, U as He, J as P, w as Ue, v as f, E as p, Y as y, S as xe, c as b, d as E, j as q, B as We, F as ke, x as L, T as Je, l as Ke } from "./graph-Ch18bQn5-BLEKw6WT.js";
2
- import { C as Ee, aa as F, a3 as Ne, a7 as Qe, ab as Xe, ac as Ze, H as K, K as Ie, F as Q, a6 as er, T as V, V as rr, a0 as _e, ad as W, ae as tr, W as nr, I as or } from "./index-CVS7cBlb.js";
1
+ import { I as me, $ as O, e as ze, C as be, H as I, a as ye, b as De, U as Ue, Q as P, w as He, v as f, E as p, Y as y, S as xe, c as b, d as E, j as q, B as Qe, F as ke, x as C, T as We, l as Je } from "./graph-BN58fiEq-CyCz6HB3.js";
2
+ import { D as Ee, ab as F, a4 as Ne, a8 as Xe, ac as Ze, ad as Ke, I as J, L as Ie, G as X, a7 as er, U as V, W as rr, a1 as _e, ae as Q, af as tr, X as nr, J as or } from "./index-Dz46e5bv.js";
3
3
  var ir = /\s/;
4
4
  function ur(e) {
5
5
  for (var r = e.length; r-- && ir.test(e.charAt(r)); )
@@ -45,11 +45,11 @@ function _(e) {
45
45
  return r ? me(e) : [];
46
46
  }
47
47
  function pr(e) {
48
- return Xe(Ze(e, void 0, _), e + "");
48
+ return Ze(Ke(e, void 0, _), e + "");
49
49
  }
50
50
  var wr = 1, mr = 4;
51
51
  function br(e) {
52
- return We(e, wr | mr);
52
+ return Qe(e, wr | mr);
53
53
  }
54
54
  var Re = Object.prototype, yr = Re.hasOwnProperty, xr = Ee(function(e, r) {
55
55
  e = Object(e);
@@ -57,11 +57,11 @@ var Re = Object.prototype, yr = Re.hasOwnProperty, xr = Ee(function(e, r) {
57
57
  for (o && F(r[0], r[1], o) && (n = 1); ++t < n; )
58
58
  for (var u = r[t], i = Ne(u), a = -1, d = i.length; ++a < d; ) {
59
59
  var c = i[a], s = e[c];
60
- (s === void 0 || Qe(s, Re[c]) && !yr.call(e, c)) && (e[c] = u[c]);
60
+ (s === void 0 || Xe(s, Re[c]) && !yr.call(e, c)) && (e[c] = u[c]);
61
61
  }
62
62
  return e;
63
63
  });
64
- function j(e) {
64
+ function G(e) {
65
65
  var r = e == null ? 0 : e.length;
66
66
  return r ? e[r - 1] : void 0;
67
67
  }
@@ -70,7 +70,7 @@ function kr(e) {
70
70
  var o = Object(r);
71
71
  if (!Ie(r)) {
72
72
  var u = I(t);
73
- r = Je(r), t = function(a) {
73
+ r = We(r), t = function(a) {
74
74
  return u(o[a], a, o);
75
75
  };
76
76
  }
@@ -84,9 +84,9 @@ function Nr(e, r, t) {
84
84
  if (!n)
85
85
  return -1;
86
86
  var o = t == null ? 0 : lr(t);
87
- return o < 0 && (o = Er(n + o, 0)), Ke(e, I(r), o);
87
+ return o < 0 && (o = Er(n + o, 0)), Je(e, I(r), o);
88
88
  }
89
- var X = kr(Nr);
89
+ var Z = kr(Nr);
90
90
  function Te(e, r) {
91
91
  var t = -1, n = Ie(e) ? Array(e.length) : [];
92
92
  return ze(e, function(o, u, i) {
@@ -94,7 +94,7 @@ function Te(e, r) {
94
94
  }), n;
95
95
  }
96
96
  function w(e, r) {
97
- var t = Q(e) ? O : Te;
97
+ var t = X(e) ? O : Te;
98
98
  return t(e, I(r));
99
99
  }
100
100
  function Ir(e, r) {
@@ -115,7 +115,7 @@ function B(e, r) {
115
115
  tr(t, o, r(n, o, u));
116
116
  }), t;
117
117
  }
118
- function Z(e, r, t) {
118
+ function K(e, r, t) {
119
119
  for (var n = -1, o = e.length; ++n < o; ) {
120
120
  var u = e[n], i = r(u);
121
121
  if (i != null && (a === void 0 ? i === i && !P(i) : t(i, a)))
@@ -124,20 +124,20 @@ function Z(e, r, t) {
124
124
  return d;
125
125
  }
126
126
  function x(e) {
127
- return e && e.length ? Z(e, K, Rr) : void 0;
127
+ return e && e.length ? K(e, J, Rr) : void 0;
128
128
  }
129
129
  function M(e) {
130
- return e && e.length ? Z(e, K, Me) : void 0;
130
+ return e && e.length ? K(e, J, Me) : void 0;
131
131
  }
132
132
  function ee(e, r) {
133
- return e && e.length ? Z(e, I(r), Me) : void 0;
133
+ return e && e.length ? K(e, I(r), Me) : void 0;
134
134
  }
135
135
  function Tr(e, r, t, n) {
136
136
  if (!V(e))
137
137
  return e;
138
138
  r = ye(r, e);
139
139
  for (var o = -1, u = r.length, i = u - 1, a = e; a != null && ++o < u; ) {
140
- var d = He(r[o]), c = t;
140
+ var d = Ue(r[o]), c = t;
141
141
  if (d === "__proto__" || d === "constructor" || d === "prototype")
142
142
  return e;
143
143
  if (o != i) {
@@ -155,13 +155,13 @@ function Mr(e, r, t) {
155
155
  }
156
156
  return u;
157
157
  }
158
- function Cr(e, r) {
158
+ function Lr(e, r) {
159
159
  var t = e.length;
160
160
  for (e.sort(r); t--; )
161
161
  e[t] = e[t].value;
162
162
  return e;
163
163
  }
164
- function Lr(e, r) {
164
+ function Cr(e, r) {
165
165
  if (e !== r) {
166
166
  var t = e !== void 0, n = e === null, o = e === e, u = P(e), i = r !== void 0, a = r === null, d = r === r, c = P(r);
167
167
  if (!a && !c && !u && e > r || u && i && d && !a && !c || n && i && d || !t && d || !o)
@@ -173,7 +173,7 @@ function Lr(e, r) {
173
173
  }
174
174
  function $r(e, r, t) {
175
175
  for (var n = -1, o = e.criteria, u = r.criteria, i = o.length, a = t.length; ++n < i; ) {
176
- var d = Lr(o[n], u[n]);
176
+ var d = Cr(o[n], u[n]);
177
177
  if (d) {
178
178
  if (n >= a)
179
179
  return d;
@@ -185,10 +185,10 @@ function $r(e, r, t) {
185
185
  }
186
186
  function Or(e, r, t) {
187
187
  r.length ? r = O(r, function(u) {
188
- return Q(u) ? function(i) {
188
+ return X(u) ? function(i) {
189
189
  return be(i, u.length === 1 ? u[0] : u);
190
190
  } : u;
191
- }) : r = [K];
191
+ }) : r = [J];
192
192
  var n = -1;
193
193
  r = O(r, er(I));
194
194
  var o = Te(e, function(u, i, a) {
@@ -197,7 +197,7 @@ function Or(e, r, t) {
197
197
  });
198
198
  return { criteria: d, index: ++n, value: u };
199
199
  });
200
- return Cr(o, function(u, i) {
200
+ return Lr(o, function(u, i) {
201
201
  return $r(u, i, t);
202
202
  });
203
203
  }
@@ -206,7 +206,7 @@ function Sr(e, r) {
206
206
  return De(e, n);
207
207
  });
208
208
  }
209
- var G = pr(function(e, r) {
209
+ var j = pr(function(e, r) {
210
210
  return e == null ? {} : Sr(e, r);
211
211
  }), Pr = Math.ceil, Fr = Math.max;
212
212
  function Vr(e, r, t, n) {
@@ -214,20 +214,20 @@ function Vr(e, r, t, n) {
214
214
  i[++o] = e, e += t;
215
215
  return i;
216
216
  }
217
- function jr(e) {
217
+ function Gr(e) {
218
218
  return function(r, t, n) {
219
219
  return n && typeof n != "number" && F(r, t, n) && (t = n = void 0), r = S(r), t === void 0 ? (t = r, r = 0) : t = S(t), n = n === void 0 ? r < t ? 1 : -1 : S(n), Vr(r, t, n);
220
220
  };
221
221
  }
222
- var N = jr(), $ = Ee(function(e, r) {
222
+ var N = Gr(), $ = Ee(function(e, r) {
223
223
  if (e == null)
224
224
  return [];
225
225
  var t = r.length;
226
226
  return t > 1 && F(e, r[0], r[1]) ? r = [] : t > 2 && F(r[0], r[1], r[2]) && (r = [r[0]]), Or(e, me(r), []);
227
- }), Gr = 0;
227
+ }), jr = 0;
228
228
  function re(e) {
229
- var r = ++Gr;
230
- return Ue(e) + r;
229
+ var r = ++jr;
230
+ return He(e) + r;
231
231
  }
232
232
  function qr(e, r, t) {
233
233
  for (var n = -1, o = e.length, u = r.length, i = {}; ++n < o; ) {
@@ -270,14 +270,14 @@ var zr = or(1);
270
270
  function Dr(e, r) {
271
271
  if (e.nodeCount() <= 1)
272
272
  return [];
273
- var t = Ur(e, r || zr), n = Hr(t.graph, t.buckets, t.zeroIdx);
273
+ var t = Hr(e, r || zr), n = Ur(t.graph, t.buckets, t.zeroIdx);
274
274
  return _(
275
275
  w(n, function(o) {
276
276
  return e.outEdges(o.v, o.w);
277
277
  })
278
278
  );
279
279
  }
280
- function Hr(e, r, t) {
280
+ function Ur(e, r, t) {
281
281
  for (var n = [], o = r[r.length - 1], u = r[0], i; e.nodeCount(); ) {
282
282
  for (; i = u.dequeue(); )
283
283
  A(e, r, t, i);
@@ -297,13 +297,13 @@ function A(e, r, t, n, o) {
297
297
  var u = o ? [] : void 0;
298
298
  return f(e.inEdges(n.v), function(i) {
299
299
  var a = e.edge(i), d = e.node(i.v);
300
- o && u.push({ v: i.v, w: i.w }), d.out -= a, J(r, t, d);
300
+ o && u.push({ v: i.v, w: i.w }), d.out -= a, W(r, t, d);
301
301
  }), f(e.outEdges(n.v), function(i) {
302
302
  var a = e.edge(i), d = i.w, c = e.node(d);
303
- c.in -= a, J(r, t, c);
303
+ c.in -= a, W(r, t, c);
304
304
  }), e.removeNode(n.v), u;
305
305
  }
306
- function Ur(e, r) {
306
+ function Hr(e, r) {
307
307
  var t = new y(), n = 0, o = 0;
308
308
  f(e.nodes(), function(a) {
309
309
  t.setNode(a, { v: a, in: 0, out: 0 });
@@ -315,14 +315,14 @@ function Ur(e, r) {
315
315
  return new Yr();
316
316
  }), i = n + 1;
317
317
  return f(t.nodes(), function(a) {
318
- J(u, i, t.node(a));
318
+ W(u, i, t.node(a));
319
319
  }), { graph: t, buckets: u, zeroIdx: i };
320
320
  }
321
- function J(e, r, t) {
321
+ function W(e, r, t) {
322
322
  t.out ? t.in ? e[t.out - t.in + r].enqueue(t) : e[e.length - 1].enqueue(t) : e[0].enqueue(t);
323
323
  }
324
- function Wr(e) {
325
- var r = e.graph().acyclicer === "greedy" ? Dr(e, t(e)) : Jr(e);
324
+ function Qr(e) {
325
+ var r = e.graph().acyclicer === "greedy" ? Dr(e, t(e)) : Wr(e);
326
326
  f(r, function(n) {
327
327
  var o = e.edge(n);
328
328
  e.removeEdge(n), o.forwardName = n.name, o.reversed = !0, e.setEdge(n.w, n.v, o, re("rev"));
@@ -333,7 +333,7 @@ function Wr(e) {
333
333
  };
334
334
  }
335
335
  }
336
- function Jr(e) {
336
+ function Wr(e) {
337
337
  var r = [], t = {}, n = {};
338
338
  function o(u) {
339
339
  p(n, u) || (n[u] = !0, t[u] = !0, f(e.outEdges(u), function(i) {
@@ -342,7 +342,7 @@ function Jr(e) {
342
342
  }
343
343
  return f(e.nodes(), o), r;
344
344
  }
345
- function Kr(e) {
345
+ function Jr(e) {
346
346
  f(e.edges(), function(r) {
347
347
  var t = e.edge(r);
348
348
  if (t.reversed) {
@@ -359,7 +359,7 @@ function R(e, r, t, n) {
359
359
  while (e.hasNode(o));
360
360
  return t.dummy = r, e.setNode(o, t), o;
361
361
  }
362
- function Qr(e) {
362
+ function Xr(e) {
363
363
  var r = new y().setGraph(e.graph());
364
364
  return f(e.nodes(), function(t) {
365
365
  r.setNode(t, e.node(t));
@@ -371,7 +371,7 @@ function Qr(e) {
371
371
  });
372
372
  }), r;
373
373
  }
374
- function Ce(e) {
374
+ function Le(e) {
375
375
  var r = new y({ multigraph: e.isMultigraph() }).setGraph(e.graph());
376
376
  return f(e.nodes(), function(t) {
377
377
  e.children(t).length || r.setNode(t, e.node(t));
@@ -387,7 +387,7 @@ function ce(e, r) {
387
387
  return Math.abs(u) * i > Math.abs(o) * a ? (u < 0 && (a = -a), d = a * o / u, c = a) : (o < 0 && (i = -i), d = i, c = i * u / o), { x: t + d, y: n + c };
388
388
  }
389
389
  function Y(e) {
390
- var r = w(N(Le(e) + 1), function() {
390
+ var r = w(N(Ce(e) + 1), function() {
391
391
  return [];
392
392
  });
393
393
  return f(e.nodes(), function(t) {
@@ -395,7 +395,7 @@ function Y(e) {
395
395
  b(o) || (r[o][n.order] = t);
396
396
  }), r;
397
397
  }
398
- function Xr(e) {
398
+ function Zr(e) {
399
399
  var r = M(
400
400
  w(e.nodes(), function(t) {
401
401
  return e.node(t).rank;
@@ -406,7 +406,7 @@ function Xr(e) {
406
406
  p(n, "rank") && (n.rank -= r);
407
407
  });
408
408
  }
409
- function Zr(e) {
409
+ function Kr(e) {
410
410
  var r = M(
411
411
  w(e.nodes(), function(u) {
412
412
  return e.node(u).rank;
@@ -430,7 +430,7 @@ function fe(e, r, t, n) {
430
430
  };
431
431
  return arguments.length >= 4 && (o.rank = t, o.order = n), R(e, "border", o, r);
432
432
  }
433
- function Le(e) {
433
+ function Ce(e) {
434
434
  return x(
435
435
  w(e.nodes(), function(r) {
436
436
  var t = e.node(r).rank;
@@ -551,21 +551,21 @@ function te(e) {
551
551
  }
552
552
  f(e.sources(), t);
553
553
  }
554
- function C(e, r) {
554
+ function L(e, r) {
555
555
  return e.node(r.w).rank - e.node(r.v).rank - e.edge(r).minlen;
556
556
  }
557
557
  function Oe(e) {
558
558
  var r = new y({ directed: !1 }), t = e.nodes()[0], n = e.nodeCount();
559
559
  r.setNode(t, {});
560
560
  for (var o, u; ft(r, e) < n; )
561
- o = st(r, e), u = r.hasNode(o.v) ? C(e, o) : -C(e, o), vt(r, e, u);
561
+ o = st(r, e), u = r.hasNode(o.v) ? L(e, o) : -L(e, o), vt(r, e, u);
562
562
  return r;
563
563
  }
564
564
  function ft(e, r) {
565
565
  function t(n) {
566
566
  f(r.nodeEdges(n), function(o) {
567
567
  var u = o.v, i = n === u ? o.w : u;
568
- !e.hasNode(i) && !C(r, o) && (e.setNode(i, {}), e.setEdge(n, i, {}), t(i));
568
+ !e.hasNode(i) && !L(r, o) && (e.setNode(i, {}), e.setEdge(n, i, {}), t(i));
569
569
  });
570
570
  }
571
571
  return f(e.nodes(), t), e.nodeCount();
@@ -573,7 +573,7 @@ function ft(e, r) {
573
573
  function st(e, r) {
574
574
  return ee(r.edges(), function(t) {
575
575
  if (e.hasNode(t.v) !== e.hasNode(t.w))
576
- return C(r, t);
576
+ return L(r, t);
577
577
  });
578
578
  }
579
579
  function vt(e, r, t) {
@@ -582,7 +582,7 @@ function vt(e, r, t) {
582
582
  });
583
583
  }
584
584
  function Se(e, r, t) {
585
- Q(r) || (r = [r]);
585
+ X(r) || (r = [r]);
586
586
  var n = (e.isDirected() ? e.successors : e.neighbors).bind(e), o = [], u = {};
587
587
  return f(r, function(i) {
588
588
  if (!e.hasNode(i))
@@ -604,15 +604,15 @@ function ht(e, r) {
604
604
  k.initLowLimValues = oe;
605
605
  k.initCutValues = ne;
606
606
  k.calcCutValue = Fe;
607
- k.leaveEdge = je;
608
- k.enterEdge = Ge;
607
+ k.leaveEdge = Ge;
608
+ k.enterEdge = je;
609
609
  k.exchangeEdges = qe;
610
610
  function k(e) {
611
- e = Qr(e), te(e);
611
+ e = Xr(e), te(e);
612
612
  var r = Oe(e);
613
613
  oe(r), ne(r, e);
614
- for (var t, n; t = je(r); )
615
- n = Ge(r, e, t), qe(r, e, t, n);
614
+ for (var t, n; t = Ge(r); )
615
+ n = je(r, e, t), qe(r, e, t, n);
616
616
  }
617
617
  function ne(e, r) {
618
618
  var t = gt(e, e.nodes());
@@ -646,21 +646,21 @@ function Ve(e, r, t, n, o) {
646
646
  p(r, a) || (t = Ve(e, r, t, a, n));
647
647
  }), i.low = u, i.lim = t++, o ? i.parent = o : delete i.parent, t;
648
648
  }
649
- function je(e) {
650
- return X(e.edges(), function(r) {
649
+ function Ge(e) {
650
+ return Z(e.edges(), function(r) {
651
651
  return e.edge(r).cutvalue < 0;
652
652
  });
653
653
  }
654
- function Ge(e, r, t) {
654
+ function je(e, r, t) {
655
655
  var n = t.v, o = t.w;
656
656
  r.hasEdge(n, o) || (n = t.w, o = t.v);
657
657
  var u = e.node(n), i = e.node(o), a = u, d = !1;
658
658
  u.lim > i.lim && (a = i, d = !0);
659
- var c = L(r.edges(), function(s) {
659
+ var c = C(r.edges(), function(s) {
660
660
  return d === ge(e, e.node(s.v), a) && d !== ge(e, e.node(s.w), a);
661
661
  });
662
662
  return ee(c, function(s) {
663
- return C(r, s);
663
+ return L(r, s);
664
664
  });
665
665
  }
666
666
  function qe(e, r, t, n) {
@@ -668,7 +668,7 @@ function qe(e, r, t, n) {
668
668
  e.removeEdge(o, u), e.setEdge(n.v, n.w, {}), oe(e), ne(e, r), pt(e, r);
669
669
  }
670
670
  function pt(e, r) {
671
- var t = X(e.nodes(), function(o) {
671
+ var t = Z(e.nodes(), function(o) {
672
672
  return !r.node(o).parent;
673
673
  }), n = ht(e, t);
674
674
  n = n.slice(1), f(n, function(o) {
@@ -791,8 +791,7 @@ function _t(e, r, t) {
791
791
  }), o;
792
792
  }
793
793
  function Rt(e) {
794
- for (var r; e.hasNode(r = re("_root")); )
795
- ;
794
+ for (var r; e.hasNode(r = re("_root")); ) ;
796
795
  return r;
797
796
  }
798
797
  function Tt(e, r) {
@@ -815,8 +814,7 @@ function Mt(e, r, t) {
815
814
  "pos"
816
815
  );
817
816
  })
818
- ), u = 1; u < t.length; )
819
- u <<= 1;
817
+ ), u = 1; u < t.length; ) u <<= 1;
820
818
  var i = 2 * u - 1;
821
819
  u -= 1;
822
820
  var a = w(new Array(i), function() {
@@ -833,8 +831,8 @@ function Mt(e, r, t) {
833
831
  })
834
832
  ), d;
835
833
  }
836
- function Ct(e) {
837
- var r = {}, t = L(e.nodes(), function(a) {
834
+ function Lt(e) {
835
+ var r = {}, t = C(e.nodes(), function(a) {
838
836
  return !e.children(a).length;
839
837
  }), n = x(
840
838
  w(t, function(a) {
@@ -855,7 +853,7 @@ function Ct(e) {
855
853
  });
856
854
  return f(i, u), o;
857
855
  }
858
- function Lt(e, r) {
856
+ function Ct(e, r) {
859
857
  return w(r, function(t) {
860
858
  var n = e.inEdges(t);
861
859
  if (n.length) {
@@ -894,7 +892,7 @@ function $t(e, r) {
894
892
  var u = t[o.v], i = t[o.w];
895
893
  !b(u) && !b(i) && (i.indegree++, u.out.push(t[o.w]));
896
894
  });
897
- var n = L(t, function(o) {
895
+ var n = C(t, function(o) {
898
896
  return !o.indegree;
899
897
  });
900
898
  return Ot(n);
@@ -916,11 +914,11 @@ function Ot(e) {
916
914
  r.push(o), f(o.in.reverse(), t(o)), f(o.out, n(o));
917
915
  }
918
916
  return w(
919
- L(r, function(u) {
917
+ C(r, function(u) {
920
918
  return !u.merged;
921
919
  }),
922
920
  function(u) {
923
- return G(u, ["vs", "i", "barycenter", "weight"]);
921
+ return j(u, ["vs", "i", "barycenter", "weight"]);
924
922
  }
925
923
  );
926
924
  }
@@ -941,7 +939,7 @@ function Pt(e, r) {
941
939
  return a && (c.barycenter = i / a, c.weight = a), c;
942
940
  }
943
941
  function le(e, r, t) {
944
- for (var n; r.length && (n = j(r)).i <= t; )
942
+ for (var n; r.length && (n = G(r)).i <= t; )
945
943
  r.pop(), e.push(n.vs), t++;
946
944
  return t;
947
945
  }
@@ -952,14 +950,14 @@ function Ft(e) {
952
950
  }
953
951
  function Ye(e, r, t, n) {
954
952
  var o = e.children(r), u = e.node(r), i = u ? u.borderLeft : void 0, a = u ? u.borderRight : void 0, d = {};
955
- i && (o = L(o, function(l) {
953
+ i && (o = C(o, function(l) {
956
954
  return l !== i && l !== a;
957
955
  }));
958
- var c = Lt(e, o);
956
+ var c = Ct(e, o);
959
957
  f(c, function(l) {
960
958
  if (e.children(l.v).length) {
961
959
  var m = Ye(e, l.v, t, n);
962
- d[l.v] = m, p(m, "barycenter") && jt(l, m);
960
+ d[l.v] = m, p(m, "barycenter") && Gt(l, m);
963
961
  }
964
962
  });
965
963
  var s = $t(c, t);
@@ -980,11 +978,11 @@ function Vt(e, r) {
980
978
  );
981
979
  });
982
980
  }
983
- function jt(e, r) {
981
+ function Gt(e, r) {
984
982
  b(e.barycenter) ? (e.barycenter = r.barycenter, e.weight = r.weight) : (e.barycenter = (e.barycenter * e.weight + r.barycenter * r.weight) / (e.weight + r.weight), e.weight += r.weight);
985
983
  }
986
- function Gt(e) {
987
- var r = Le(e), t = pe(e, N(1, r + 1), "inEdges"), n = pe(e, N(r - 1, -1, -1), "outEdges"), o = Ct(e);
984
+ function jt(e) {
985
+ var r = Ce(e), t = pe(e, N(1, r + 1), "inEdges"), n = pe(e, N(r - 1, -1, -1), "outEdges"), o = Lt(e);
988
986
  we(e, o);
989
987
  for (var u = Number.POSITIVE_INFINITY, i, a = 0, d = 0; d < 4; ++a, ++d) {
990
988
  qt(a % 2 ? t : n, a % 4 >= 2), o = Y(e);
@@ -1053,9 +1051,9 @@ function At(e) {
1053
1051
  function zt(e, r) {
1054
1052
  var t = {};
1055
1053
  function n(o, u) {
1056
- var i = 0, a = 0, d = o.length, c = j(u);
1054
+ var i = 0, a = 0, d = o.length, c = G(u);
1057
1055
  return f(u, function(s, v) {
1058
- var g = Ht(e, s), h = g ? e.node(g).order : d;
1056
+ var g = Ut(e, s), h = g ? e.node(g).order : d;
1059
1057
  (g || s === c) && (f(u.slice(a, v + 1), function(l) {
1060
1058
  f(e.predecessors(l), function(m) {
1061
1059
  var T = e.node(m), ie = T.order;
@@ -1089,9 +1087,9 @@ function Dt(e, r) {
1089
1087
  }
1090
1088
  return q(r, o), t;
1091
1089
  }
1092
- function Ht(e, r) {
1090
+ function Ut(e, r) {
1093
1091
  if (e.node(r).dummy)
1094
- return X(e.predecessors(r), function(t) {
1092
+ return Z(e.predecessors(r), function(t) {
1095
1093
  return e.node(t).dummy;
1096
1094
  });
1097
1095
  }
@@ -1103,14 +1101,14 @@ function Ae(e, r, t) {
1103
1101
  var o = e[r];
1104
1102
  o || (e[r] = o = {}), o[t] = !0;
1105
1103
  }
1106
- function Ut(e, r, t) {
1104
+ function Ht(e, r, t) {
1107
1105
  if (r > t) {
1108
1106
  var n = r;
1109
1107
  r = t, t = n;
1110
1108
  }
1111
1109
  return p(e[r], t);
1112
1110
  }
1113
- function Wt(e, r, t, n) {
1111
+ function Qt(e, r, t, n) {
1114
1112
  var o = {}, u = {}, i = {};
1115
1113
  return f(r, function(a) {
1116
1114
  f(a, function(d, c) {
@@ -1126,14 +1124,14 @@ function Wt(e, r, t, n) {
1126
1124
  });
1127
1125
  for (var v = (s.length - 1) / 2, g = Math.floor(v), h = Math.ceil(v); g <= h; ++g) {
1128
1126
  var l = s[g];
1129
- u[c] === c && d < i[l] && !Ut(t, c, l) && (u[l] = c, u[c] = o[c] = o[l], d = i[l]);
1127
+ u[c] === c && d < i[l] && !Ht(t, c, l) && (u[l] = c, u[c] = o[c] = o[l], d = i[l]);
1130
1128
  }
1131
1129
  }
1132
1130
  });
1133
1131
  }), { root: o, align: u };
1134
1132
  }
1135
- function Jt(e, r, t, n, o) {
1136
- var u = {}, i = Kt(e, r, t, o), a = o ? "borderLeft" : "borderRight";
1133
+ function Wt(e, r, t, n, o) {
1134
+ var u = {}, i = Jt(e, r, t, o), a = o ? "borderLeft" : "borderRight";
1137
1135
  function d(v, g) {
1138
1136
  for (var h = i.nodes(), l = h.pop(), m = {}; l; )
1139
1137
  m[l] ? v(l) : (m[l] = !0, h.push(l), h = h.concat(g(l))), l = h.pop();
@@ -1153,7 +1151,7 @@ function Jt(e, r, t, n, o) {
1153
1151
  u[v] = u[t[v]];
1154
1152
  }), u;
1155
1153
  }
1156
- function Kt(e, r, t, n) {
1154
+ function Jt(e, r, t, n) {
1157
1155
  var o = new y(), u = e.graph(), i = rn(u.nodesep, u.edgesep, n);
1158
1156
  return f(r, function(a) {
1159
1157
  var d;
@@ -1167,7 +1165,7 @@ function Kt(e, r, t, n) {
1167
1165
  });
1168
1166
  }), o;
1169
1167
  }
1170
- function Qt(e, r) {
1168
+ function Xt(e, r) {
1171
1169
  return ee(E(r), function(t) {
1172
1170
  var n = Number.NEGATIVE_INFINITY, o = Number.POSITIVE_INFINITY;
1173
1171
  return Ir(t, function(u, i) {
@@ -1176,7 +1174,7 @@ function Qt(e, r) {
1176
1174
  }), n - o;
1177
1175
  });
1178
1176
  }
1179
- function Xt(e, r) {
1177
+ function Zt(e, r) {
1180
1178
  var t = E(r), n = M(t), o = x(t);
1181
1179
  f(["u", "d"], function(u) {
1182
1180
  f(["l", "r"], function(i) {
@@ -1190,7 +1188,7 @@ function Xt(e, r) {
1190
1188
  });
1191
1189
  });
1192
1190
  }
1193
- function Zt(e, r) {
1191
+ function Kt(e, r) {
1194
1192
  return B(e.ul, function(t, n) {
1195
1193
  if (r)
1196
1194
  return e[r.toLowerCase()][n];
@@ -1199,20 +1197,20 @@ function Zt(e, r) {
1199
1197
  });
1200
1198
  }
1201
1199
  function en(e) {
1202
- var r = Y(e), t = W(zt(e, r), Dt(e, r)), n = {}, o;
1200
+ var r = Y(e), t = Q(zt(e, r), Dt(e, r)), n = {}, o;
1203
1201
  f(["u", "d"], function(i) {
1204
1202
  o = i === "u" ? r : E(r).reverse(), f(["l", "r"], function(a) {
1205
1203
  a === "r" && (o = w(o, function(v) {
1206
1204
  return E(v).reverse();
1207
1205
  }));
1208
- var d = (i === "u" ? e.predecessors : e.successors).bind(e), c = Wt(e, o, t, d), s = Jt(e, o, c.root, c.align, a === "r");
1206
+ var d = (i === "u" ? e.predecessors : e.successors).bind(e), c = Qt(e, o, t, d), s = Wt(e, o, c.root, c.align, a === "r");
1209
1207
  a === "r" && (s = B(s, function(v) {
1210
1208
  return -v;
1211
1209
  })), n[i + a] = s;
1212
1210
  });
1213
1211
  });
1214
- var u = Qt(e, n);
1215
- return Xt(n, u), Zt(n, e.graph().align);
1212
+ var u = Xt(e, n);
1213
+ return Zt(n, u), Kt(n, e.graph().align);
1216
1214
  }
1217
1215
  function rn(e, r, t) {
1218
1216
  return function(n, o, u) {
@@ -1242,7 +1240,7 @@ function tn(e, r) {
1242
1240
  return e.node(r).width;
1243
1241
  }
1244
1242
  function nn(e) {
1245
- e = Ce(e), on(e), _r(en(e), function(r, t) {
1243
+ e = Le(e), on(e), _r(en(e), function(r, t) {
1246
1244
  e.node(t).x = r;
1247
1245
  });
1248
1246
  }
@@ -1259,7 +1257,7 @@ function on(e) {
1259
1257
  }), n += u + t;
1260
1258
  });
1261
1259
  }
1262
- function Ln(e, r) {
1260
+ function Cn(e, r) {
1263
1261
  var t = rt;
1264
1262
  t("layout", function() {
1265
1263
  var n = t(" buildLayoutGraph", function() {
@@ -1278,19 +1276,19 @@ function un(e, r) {
1278
1276
  }), r(" removeSelfEdges", function() {
1279
1277
  _n(e);
1280
1278
  }), r(" acyclic", function() {
1281
- Wr(e);
1279
+ Qr(e);
1282
1280
  }), r(" nestingGraph.run", function() {
1283
1281
  xt(e);
1284
1282
  }), r(" rank", function() {
1285
- mt(Ce(e));
1283
+ mt(Le(e));
1286
1284
  }), r(" injectEdgeLabelProxies", function() {
1287
1285
  mn(e);
1288
1286
  }), r(" removeEmptyRanks", function() {
1289
- Zr(e);
1287
+ Kr(e);
1290
1288
  }), r(" nestingGraph.cleanup", function() {
1291
1289
  Nt(e);
1292
1290
  }), r(" normalizeRanks", function() {
1293
- Xr(e);
1291
+ Zr(e);
1294
1292
  }), r(" assignRankMinMax", function() {
1295
1293
  bn(e);
1296
1294
  }), r(" removeEdgeLabelProxies", function() {
@@ -1302,7 +1300,7 @@ function un(e, r) {
1302
1300
  }), r(" addBorderSegments", function() {
1303
1301
  tt(e);
1304
1302
  }), r(" order", function() {
1305
- Gt(e);
1303
+ jt(e);
1306
1304
  }), r(" insertSelfEdges", function() {
1307
1305
  Rn(e);
1308
1306
  }), r(" adjustCoordinateSystem", function() {
@@ -1326,7 +1324,7 @@ function un(e, r) {
1326
1324
  }), r(" reversePoints", function() {
1327
1325
  Nn(e);
1328
1326
  }), r(" acyclic.undo", function() {
1329
- Kr(e);
1327
+ Jr(e);
1330
1328
  });
1331
1329
  }
1332
1330
  function an(e, r) {
@@ -1347,17 +1345,17 @@ var dn = ["nodesep", "edgesep", "ranksep", "marginx", "marginy"], cn = { ranksep
1347
1345
  labelpos: "r"
1348
1346
  }, ln = ["labelpos"];
1349
1347
  function pn(e) {
1350
- var r = new y({ multigraph: !0, compound: !0 }), t = U(e.graph());
1348
+ var r = new y({ multigraph: !0, compound: !0 }), t = H(e.graph());
1351
1349
  return r.setGraph(
1352
- W({}, cn, H(t, dn), G(t, fn))
1350
+ Q({}, cn, U(t, dn), j(t, fn))
1353
1351
  ), f(e.nodes(), function(n) {
1354
- var o = U(e.node(n));
1355
- r.setNode(n, xr(H(o, sn), vn)), r.setParent(n, e.parent(n));
1352
+ var o = H(e.node(n));
1353
+ r.setNode(n, xr(U(o, sn), vn)), r.setParent(n, e.parent(n));
1356
1354
  }), f(e.edges(), function(n) {
1357
- var o = U(e.edge(n));
1355
+ var o = H(e.edge(n));
1358
1356
  r.setEdge(
1359
1357
  n,
1360
- W({}, hn, H(o, gn), G(o, ln))
1358
+ Q({}, hn, U(o, gn), j(o, ln))
1361
1359
  );
1362
1360
  }), r;
1363
1361
  }
@@ -1440,7 +1438,7 @@ function Nn(e) {
1440
1438
  function In(e) {
1441
1439
  f(e.nodes(), function(r) {
1442
1440
  if (e.children(r).length) {
1443
- var t = e.node(r), n = e.node(t.borderTop), o = e.node(t.borderBottom), u = e.node(j(t.borderLeft)), i = e.node(j(t.borderRight));
1441
+ var t = e.node(r), n = e.node(t.borderTop), o = e.node(t.borderBottom), u = e.node(G(t.borderLeft)), i = e.node(G(t.borderRight));
1444
1442
  t.width = Math.abs(i.x - u.x), t.height = Math.abs(o.y - n.y), t.x = u.x + t.width / 2, t.y = n.y + t.height / 2;
1445
1443
  }
1446
1444
  }), f(e.nodes(), function(r) {
@@ -1494,10 +1492,10 @@ function Tn(e) {
1494
1492
  }
1495
1493
  });
1496
1494
  }
1497
- function H(e, r) {
1498
- return B(G(e, r), Number);
1495
+ function U(e, r) {
1496
+ return B(j(e, r), Number);
1499
1497
  }
1500
- function U(e) {
1498
+ function H(e) {
1501
1499
  var r = {};
1502
1500
  return f(e, function(t, n) {
1503
1501
  r[n.toLowerCase()] = t;
@@ -1505,8 +1503,8 @@ function U(e) {
1505
1503
  }
1506
1504
  export {
1507
1505
  N,
1508
- Ln as O,
1509
- G as V,
1506
+ Cn as O,
1507
+ j as V,
1510
1508
  re as e,
1511
1509
  xr as k,
1512
1510
  w as m