@kong-ui-public/documentation 1.4.17-pr.2640.fb8bab909.0 → 1.4.17

package/dist/{layout-BHI4imdk-CESYC-il.js → layout-9vIfpCf3-FfABA43y.js}

@@ -1,8 +1,8 @@
-import { L as b } from "./graph-BYZMvqpu-BXRs5843.js";
-import { O as Mn, a as s, b as $, y as Tn, L as U, S as x, E as m, l as hn, c as jn, P as T, _ as R, C as Sn, d as gn, i as $n, U as nn } from "./_baseUniq-SAfYgIkf-buEvGj9H.js";
-import { d as Vn, u as C, f as N, V as Fn, o as I, g as p, m as vn, t as ln, X as V, v as Bn, h as J, r as Gn } from "./_basePickBy-zlkqRmFy-D6w9JBLu.js";
-import { o as Yn, t as A, v as z, w as qn, x as An, y as pn, z as wn, A as zn, B as Dn, k as Un, C as Jn, D as Hn, E as Kn } from "./index-CMZig9xg.js";
-function Qn(n) {
+import { L as b } from "./graph-B_1gOUDz-Dm6REFzZ.js";
+import { O as Tn, a as s, b as $, y as Mn, L as K, S as x, E as m, l as hn, c as jn, I as M, _ as R, C as Sn, d as gn, i as $n, B as nn } from "./_baseUniq-CsvgMmt0-CCBG5z_B.js";
+import { d as Vn, u as C, f as N, V as Bn, o as _, g as p, m as vn, t as ln, K as V, v as Fn, h as J, r as Gn } from "./_basePickBy-BCsiP0lE-DJBdvZNn.js";
+import { o as Yn, t as A, v as z, w as qn, x as An, y as pn, z as wn, A as zn, B as Dn, k as Kn, C as Jn, D as Hn, E as Qn } from "./index-BDD0CD9m.js";
+function Un(n) {
   return qn(An(n, void 0, N), n + "");
 }
 var Zn = 1, Wn = 4;
@@ -10,7 +10,7 @@ function Xn(n) {
   return Sn(n, Zn | Wn);
 }
 function nr(n, r) {
-  return n == null ? n : Hn(n, gn(r), Kn);
+  return n == null ? n : Hn(n, gn(r), Qn);
 }
 function rr(n, r) {
   return n && hn(n, gn(r));
@@ -20,7 +20,7 @@ function er(n, r) {
 }
 function j(n, r) {
   var e = {};
-  return r = U(r), hn(n, function(t, o, i) {
+  return r = K(r), hn(n, function(t, o, i) {
     Dn(e, o, r(t, o, i));
   }), e;
 }
@@ -28,7 +28,7 @@ function y(n) {
   return n && n.length ? ln(n, wn, er) : void 0;
 }
 function H(n, r) {
-  return n && n.length ? ln(n, U(r), Gn) : void 0;
+  return n && n.length ? ln(n, K(r), Gn) : void 0;
 }
 function tr(n, r) {
   var e = n.length;
@@ -61,12 +61,12 @@ function ir(n, r, e) {
 function ar(n, r, e) {
   r.length ? r = $(r, function(i) {
     return pn(i) ? function(a) {
-      return Tn(a, i.length === 1 ? i[0] : i);
+      return Mn(a, i.length === 1 ? i[0] : i);
     } : i;
   }) : r = [wn];
   var t = -1;
-  r = $(r, zn(U));
-  var o = Fn(n, function(i, a, u) {
+  r = $(r, zn(K));
+  var o = Bn(n, function(i, a, u) {
     var d = $(r, function(c) {
       return c(i);
     });
@@ -77,11 +77,11 @@ function ar(n, r, e) {
   });
 }
 function ur(n, r) {
-  return Bn(n, r, function(e, t) {
+  return Fn(n, r, function(e, t) {
     return $n(n, t);
   });
 }
-var M = Qn(function(n, r) {
+var T = Un(function(n, r) {
   return n == null ? {} : ur(n, r);
 }), dr = Math.ceil, cr = Math.max;
 function sr(n, r, e, t) {
@@ -98,9 +98,9 @@ var E = fr(), L = Yn(function(n, r) {
   if (n == null)
     return [];
   var e = r.length;
-  return e > 1 && A(n, r[0], r[1]) ? r = [] : e > 2 && A(r[0], r[1], r[2]) && (r = [r[0]]), ar(n, Mn(r), []);
+  return e > 1 && A(n, r[0], r[1]) ? r = [] : e > 2 && A(r[0], r[1], r[2]) && (r = [r[0]]), ar(n, Tn(r), []);
 }), hr = 0;
-function K(n) {
+function Q(n) {
   var r = ++hr;
   return jn(n) + r;
 }
@@ -141,7 +141,7 @@ function pr(n, r) {
   if (n !== "_next" && n !== "_prev")
     return r;
 }
-var wr = Un(1);
+var wr = Kn(1);
 function mr(n, r) {
   if (n.nodeCount() <= 1)
     return [];
@@ -155,20 +155,20 @@ function mr(n, r) {
 function br(n, r, e) {
   for (var t = [], o = r[r.length - 1], i = r[0], a; n.nodeCount(); ) {
     for (; a = i.dequeue(); )
-      F(n, r, e, a);
+      B(n, r, e, a);
     for (; a = o.dequeue(); )
-      F(n, r, e, a);
+      B(n, r, e, a);
     if (n.nodeCount()) {
       for (var u = r.length - 2; u > 0; --u)
         if (a = r[u].dequeue(), a) {
-          t = t.concat(F(n, r, e, a, !0));
+          t = t.concat(B(n, r, e, a, !0));
           break;
         }
     }
   }
   return t;
 }
-function F(n, r, e, t, o) {
+function B(n, r, e, t, o) {
   var i = o ? [] : void 0;
   return s(n.inEdges(t.v), function(a) {
     var u = n.edge(a), d = n.node(a.v);
@@ -200,7 +200,7 @@ function kr(n) {
   var r = n.graph().acyclicer === "greedy" ? mr(n, e(n)) : xr(n);
   s(r, function(t) {
     var o = n.edge(t);
-    n.removeEdge(t), o.forwardName = t.name, o.reversed = !0, n.setEdge(t.w, t.v, o, K("rev"));
+    n.removeEdge(t), o.forwardName = t.name, o.reversed = !0, n.setEdge(t.w, t.v, o, Q("rev"));
   });
   function e(t) {
     return function(o) {
@@ -230,7 +230,7 @@ function Er(n) {
 function O(n, r, e, t) {
   var o;
   do
-    o = K(t);
+    o = Q(t);
   while (n.hasNode(o));
   return e.dummy = r, n.setNode(o, e), o;
 }
@@ -271,7 +271,7 @@ function S(n) {
   }), r;
 }
 function Or(n) {
-  var r = I(
+  var r = _(
     p(n.nodes(), function(e) {
       return n.node(e).rank;
     })
@@ -281,8 +281,8 @@ function Or(n) {
     vn(t, "rank") && (t.rank -= r);
   });
 }
-function _r(n) {
-  var r = I(
+function Ir(n) {
+  var r = _(
     p(n.nodes(), function(i) {
       return n.node(i).rank;
     })
@@ -314,7 +314,7 @@ function bn(n) {
     })
   );
 }
-function Ir(n, r) {
+function _r(n, r) {
   var e = { lhs: [], rhs: [] };
   return s(n, function(t) {
     r(t) ? e.lhs.push(t) : e.rhs.push(t);
@@ -344,7 +344,7 @@ function Lr(n) {
 }
 function Cr(n) {
   var r = n.graph().rankdir.toLowerCase();
-  (r === "bt" || r === "rl") && Mr(n), (r === "lr" || r === "rl") && (Tr(n), yn(n));
+  (r === "bt" || r === "rl") && Tr(n), (r === "lr" || r === "rl") && (Mr(n), yn(n));
 }
 function yn(n) {
   s(n.nodes(), function(r) {
@@ -357,18 +357,18 @@ function an(n) {
   var r = n.width;
   n.width = n.height, n.height = r;
 }
-function Mr(n) {
+function Tr(n) {
   s(n.nodes(), function(r) {
-    B(n.node(r));
+    F(n.node(r));
   }), s(n.edges(), function(r) {
     var e = n.edge(r);
-    s(e.points, B), Object.prototype.hasOwnProperty.call(e, "y") && B(e);
+    s(e.points, F), Object.prototype.hasOwnProperty.call(e, "y") && F(e);
   });
 }
-function B(n) {
+function F(n) {
   n.y = -n.y;
 }
-function Tr(n) {
+function Mr(n) {
   s(n.nodes(), function(r) {
     G(n.node(r));
   }), s(n.edges(), function(r) {
@@ -408,14 +408,14 @@ function $r(n) {
       o = n.successors(r)[0], n.removeNode(r), t.points.push({ x: e.x, y: e.y }), e.dummy === "edge-label" && (t.x = e.x, t.y = e.y, t.width = e.width, t.height = e.height), r = o, e = n.node(r);
   });
 }
-function Q(n) {
+function U(n) {
   var r = {};
   function e(t) {
     var o = n.node(t);
     if (Object.prototype.hasOwnProperty.call(r, t))
       return o.rank;
     r[t] = !0;
-    var i = I(
+    var i = _(
       p(n.outEdges(t), function(a) {
         return e(a.w) - n.edge(a).minlen;
       })
@@ -433,7 +433,7 @@ function kn(n) {
   var r = new b({ directed: !1 }), e = n.nodes()[0], t = n.nodeCount();
   r.setNode(e, {});
   for (var o, i; Vr(r, n) < t; )
-    o = Fr(r, n), i = r.hasNode(o.v) ? P(n, o) : -P(n, o), Br(r, n, i);
+    o = Br(r, n), i = r.hasNode(o.v) ? P(n, o) : -P(n, o), Fr(r, n, i);
   return r;
 }
 function Vr(n, r) {
@@ -445,13 +445,13 @@ function Vr(n, r) {
   }
   return s(n.nodes(), e), n.nodeCount();
 }
-function Fr(n, r) {
+function Br(n, r) {
   return H(r.edges(), function(e) {
     if (n.hasNode(e.v) !== n.hasNode(e.w))
       return P(r, e);
   });
 }
-function Br(n, r, e) {
+function Fr(n, r, e) {
   s(n.nodes(), function(t) {
     r.node(t).rank += e;
   });
@@ -479,15 +479,15 @@ function Yr(n, r) {
 k.initLowLimValues = W;
 k.initCutValues = Z;
 k.calcCutValue = Nn;
-k.leaveEdge = _n;
-k.enterEdge = In;
+k.leaveEdge = In;
+k.enterEdge = _n;
 k.exchangeEdges = Pn;
 function k(n) {
-  n = Nr(n), Q(n);
+  n = Nr(n), U(n);
   var r = kn(n);
   W(r), Z(r, n);
-  for (var e, t; e = _n(r); )
-    t = In(r, n, e), Pn(r, n, e, t);
+  for (var e, t; e = In(r); )
+    t = _n(r, n, e), Pn(r, n, e, t);
 }
 function Z(n, r) {
   var e = Gr(n, n.nodes());
@@ -521,12 +521,12 @@ function On(n, r, e, t, o) {
     Object.prototype.hasOwnProperty.call(r, u) || (e = On(n, r, e, u, t));
   }), a.low = i, a.lim = e++, o ? a.parent = o : delete a.parent, e;
 }
-function _n(n) {
+function In(n) {
   return J(n.edges(), function(r) {
     return n.edge(r).cutvalue < 0;
   });
 }
-function In(n, r, e) {
+function _n(n, r, e) {
   var t = e.v, o = e.w;
   r.hasEdge(t, o) || (t = e.w, o = e.v);
   var i = n.node(t), a = n.node(o), u = i, d = !1;
@@ -566,25 +566,25 @@ function Dr(n) {
       Jr(n);
       break;
     case "longest-path":
-      Ur(n);
+      Kr(n);
       break;
     default:
       dn(n);
   }
 }
-var Ur = Q;
+var Kr = U;
 function Jr(n) {
-  Q(n), kn(n);
+  U(n), kn(n);
 }
 function dn(n) {
   k(n);
 }
 function Hr(n) {
-  var r = O(n, "root", {}, "_root"), e = Kr(n), t = y(x(e)) - 1, o = 2 * t + 1;
+  var r = O(n, "root", {}, "_root"), e = Qr(n), t = y(x(e)) - 1, o = 2 * t + 1;
   n.graph().nestingRoot = r, s(n.edges(), function(a) {
     n.edge(a).minlen *= o;
   });
-  var i = Qr(n) + 1;
+  var i = Ur(n) + 1;
   s(n.children(), function(a) {
     Rn(n, r, o, i, t, e, a);
   }), n.graph().nodeRankFactor = o;
@@ -598,19 +598,19 @@ function Rn(n, r, e, t, o, i, a) {
   var d = tn(n, "_bt"), c = tn(n, "_bb"), f = n.node(a);
   n.setParent(d, a), f.borderTop = d, n.setParent(c, a), f.borderBottom = c, s(u, function(h) {
     Rn(n, r, e, t, o, i, h);
-    var g = n.node(h), v = g.borderTop ? g.borderTop : h, l = g.borderBottom ? g.borderBottom : h, w = g.borderTop ? t : 2 * t, _ = v !== l ? 1 : o - i[a] + 1;
+    var g = n.node(h), v = g.borderTop ? g.borderTop : h, l = g.borderBottom ? g.borderBottom : h, w = g.borderTop ? t : 2 * t, I = v !== l ? 1 : o - i[a] + 1;
     n.setEdge(d, v, {
       weight: w,
-      minlen: _,
+      minlen: I,
       nestingEdge: !0
     }), n.setEdge(l, c, {
       weight: w,
-      minlen: _,
+      minlen: I,
       nestingEdge: !0
     });
   }), n.parent(a) || n.setEdge(r, d, { weight: 0, minlen: o + i[a] });
 }
-function Kr(n) {
+function Qr(n) {
   var r = {};
   function e(t, o) {
     var i = n.children(t);
@@ -622,8 +622,8 @@ function Kr(n) {
     e(t, 1);
   }), r;
 }
-function Qr(n) {
-  return T(
+function Ur(n) {
+  return M(
     n.edges(),
     function(r, e) {
       return r + n.edge(e).weight;
@@ -666,7 +666,7 @@ function Xr(n, r, e) {
   }), o;
 }
 function ne(n) {
-  for (var r; n.hasNode(r = K("_root")); ) ;
+  for (var r; n.hasNode(r = Q("_root")); ) ;
   return r;
 }
 function re(n, r) {
@@ -732,7 +732,7 @@ function oe(n, r) {
   return p(r, function(e) {
     var t = n.inEdges(e);
     if (t.length) {
-      var o = T(
+      var o = M(
         t,
         function(i, a) {
           var u = n.edge(a), d = n.node(a.v);
@@ -793,7 +793,7 @@ function ae(n) {
       return !i.merged;
     }),
     function(i) {
-      return M(i, ["vs", "i", "barycenter", "weight"]);
+      return T(i, ["vs", "i", "barycenter", "weight"]);
     }
   );
 }
@@ -802,7 +802,7 @@ function ue(n, r) {
   n.weight && (e += n.barycenter * n.weight, t += n.weight), r.weight && (e += r.barycenter * r.weight, t += r.weight), n.vs = r.vs.concat(n.vs), n.barycenter = e / t, n.weight = t, n.i = Math.min(r.i, n.i), r.merged = !0;
 }
 function de(n, r) {
-  var e = Ir(n, function(f) {
+  var e = _r(n, function(f) {
     return Object.prototype.hasOwnProperty.call(f, "barycenter");
   }), t = e.lhs, o = L(e.rhs, function(f) {
     return -f.i;
@@ -931,13 +931,13 @@ function we(n, r) {
       var g = be(n, f), v = g ? n.node(g).order : d;
       (g || f === c) && (s(i.slice(u, h + 1), function(l) {
         s(n.predecessors(l), function(w) {
-          var _ = n.node(w), X = _.order;
-          (X < a || v < X) && !(_.dummy && n.node(l).dummy) && Cn(e, w, l);
+          var I = n.node(w), X = I.order;
+          (X < a || v < X) && !(I.dummy && n.node(l).dummy) && Cn(e, w, l);
         });
       }), u = h + 1, a = v);
     }), i;
   }
-  return T(r, t), e;
+  return M(r, t), e;
 }
 function me(n, r) {
   var e = {};
@@ -960,7 +960,7 @@ function me(n, r) {
       t(a, c, a.length, d, i.length);
     }), a;
   }
-  return T(r, o), e;
+  return M(r, o), e;
 }
 function be(n, r) {
   if (n.node(r).dummy)
@@ -1050,20 +1050,20 @@ function Ne(n, r) {
   });
 }
 function Oe(n, r) {
-  var e = x(r), t = I(e), o = y(e);
+  var e = x(r), t = _(e), o = y(e);
   s(["u", "d"], function(i) {
     s(["l", "r"], function(a) {
       var u = i + a, d = n[u], c;
       if (d !== r) {
         var f = x(d);
-        c = a === "l" ? t - I(f) : o - y(f), c && (n[u] = j(d, function(h) {
+        c = a === "l" ? t - _(f) : o - y(f), c && (n[u] = j(d, function(h) {
           return h + c;
         }));
       }
     });
   });
 }
-function _e(n, r) {
+function Ie(n, r) {
   return j(n.ul, function(e, t) {
     if (r)
       return n[r.toLowerCase()][t];
@@ -1071,7 +1071,7 @@ function _e(n, r) {
     return (o[1] + o[2]) / 2;
   });
 }
-function Ie(n) {
+function _e(n) {
   var r = S(n), e = z(we(n, r), me(n, r)), t = {}, o;
   s(["u", "d"], function(a) {
     o = a === "u" ? r : x(r).reverse(), s(["l", "r"], function(u) {
@@ -1085,7 +1085,7 @@ function Ie(n) {
     });
   });
   var i = Ne(n, t);
-  return Oe(t, i), _e(t, n.graph().align);
+  return Oe(t, i), Ie(t, n.graph().align);
 }
 function Pe(n, r, e) {
   return function(t, o, i) {
@@ -1115,7 +1115,7 @@ function Re(n, r) {
   return n.node(r).width;
 }
 function Le(n) {
-  n = mn(n), Ce(n), rr(Ie(n), function(r, e) {
+  n = mn(n), Ce(n), rr(_e(n), function(r, e) {
     n.node(e).x = r;
   });
 }
@@ -1136,13 +1136,13 @@ function it(n, r) {
   var e = Pr;
   e("layout", () => {
     var t = e("  buildLayoutGraph", () => qe(n));
-    e("  runLayout", () => Me(t, e)), e("  updateInputGraph", () => Te(n, t));
+    e("  runLayout", () => Te(t, e)), e("  updateInputGraph", () => Me(n, t));
   });
 }
-function Me(n, r) {
-  r("    makeSpaceForEdgeLabels", () => Ae(n)), r("    removeSelfEdges", () => We(n)), r("    acyclic", () => kr(n)), r("    nestingGraph.run", () => Hr(n)), r("    rank", () => Dr(mn(n))), r("    injectEdgeLabelProxies", () => ze(n)), r("    removeEmptyRanks", () => _r(n)), r("    nestingGraph.cleanup", () => Zr(n)), r("    normalizeRanks", () => Or(n)), r("    assignRankMinMax", () => De(n)), r("    removeEdgeLabelProxies", () => Ue(n)), r("    normalize.run", () => jr(n)), r("    parentDummyChains", () => ve(n)), r("    addBorderSegments", () => Rr(n)), r("    order", () => he(n)), r("    insertSelfEdges", () => Xe(n)), r("    adjustCoordinateSystem", () => Lr(n)), r("    position", () => Le(n)), r("    positionSelfEdges", () => nt(n)), r("    removeBorderNodes", () => Ze(n)), r("    normalize.undo", () => $r(n)), r("    fixupEdgeLabelCoords", () => Ke(n)), r("    undoCoordinateSystem", () => Cr(n)), r("    translateGraph", () => Je(n)), r("    assignNodeIntersects", () => He(n)), r("    reversePoints", () => Qe(n)), r("    acyclic.undo", () => Er(n));
-}
 function Te(n, r) {
+  r("    makeSpaceForEdgeLabels", () => Ae(n)), r("    removeSelfEdges", () => We(n)), r("    acyclic", () => kr(n)), r("    nestingGraph.run", () => Hr(n)), r("    rank", () => Dr(mn(n))), r("    injectEdgeLabelProxies", () => ze(n)), r("    removeEmptyRanks", () => Ir(n)), r("    nestingGraph.cleanup", () => Zr(n)), r("    normalizeRanks", () => Or(n)), r("    assignRankMinMax", () => De(n)), r("    removeEdgeLabelProxies", () => Ke(n)), r("    normalize.run", () => jr(n)), r("    parentDummyChains", () => ve(n)), r("    addBorderSegments", () => Rr(n)), r("    order", () => he(n)), r("    insertSelfEdges", () => Xe(n)), r("    adjustCoordinateSystem", () => Lr(n)), r("    position", () => Le(n)), r("    positionSelfEdges", () => nt(n)), r("    removeBorderNodes", () => Ze(n)), r("    normalize.undo", () => $r(n)), r("    fixupEdgeLabelCoords", () => Qe(n)), r("    undoCoordinateSystem", () => Cr(n)), r("    translateGraph", () => Je(n)), r("    assignNodeIntersects", () => He(n)), r("    reversePoints", () => Ue(n)), r("    acyclic.undo", () => Er(n));
+}
+function Me(n, r) {
   s(n.nodes(), function(e) {
     var t = n.node(e), o = r.node(e);
     t && (t.x = o.x, t.y = o.y, r.children(e).length && (t.width = o.width, t.height = o.height));
@@ -1151,7 +1151,7 @@ function Te(n, r) {
     t.points = o.points, Object.prototype.hasOwnProperty.call(o, "x") && (t.x = o.x, t.y = o.y);
   }), n.graph().width = r.graph().width, n.graph().height = r.graph().height;
 }
-var je = ["nodesep", "edgesep", "ranksep", "marginx", "marginy"], Se = { ranksep: 50, edgesep: 20, nodesep: 50, rankdir: "tb" }, $e = ["acyclicer", "ranker", "rankdir", "align"], Ve = ["width", "height"], Fe = { width: 0, height: 0 }, Be = ["minlen", "weight", "width", "height", "labeloffset"], Ge = {
+var je = ["nodesep", "edgesep", "ranksep", "marginx", "marginy"], Se = { ranksep: 50, edgesep: 20, nodesep: 50, rankdir: "tb" }, $e = ["acyclicer", "ranker", "rankdir", "align"], Ve = ["width", "height"], Be = { width: 0, height: 0 }, Fe = ["minlen", "weight", "width", "height", "labeloffset"], Ge = {
   minlen: 1,
   weight: 1,
   width: 0,
@@ -1162,15 +1162,15 @@ var je = ["nodesep", "edgesep", "ranksep", "marginx", "marginy"], Se = { ranksep
 function qe(n) {
   var r = new b({ multigraph: !0, compound: !0 }), e = q(n.graph());
   return r.setGraph(
-    z({}, Se, Y(e, je), M(e, $e))
+    z({}, Se, Y(e, je), T(e, $e))
   ), s(n.nodes(), function(t) {
     var o = q(n.node(t));
-    r.setNode(t, Vn(Y(o, Ve), Fe)), r.setParent(t, n.parent(t));
+    r.setNode(t, Vn(Y(o, Ve), Be)), r.setParent(t, n.parent(t));
   }), s(n.edges(), function(t) {
     var o = q(n.edge(t));
     r.setEdge(
       t,
-      z({}, Ge, Y(o, Be), M(o, Ye))
+      z({}, Ge, Y(o, Fe), T(o, Ye))
     );
   }), r;
 }
@@ -1197,7 +1197,7 @@ function De(n) {
     t.borderTop && (t.minRank = n.node(t.borderTop).rank, t.maxRank = n.node(t.borderBottom).rank, r = y(r, t.maxRank));
   }), n.graph().maxRank = r;
 }
-function Ue(n) {
+function Ke(n) {
   s(n.nodes(), function(r) {
     var e = n.node(r);
     e.dummy === "edge-proxy" && (n.edge(e.e).labelRank = e.rank, n.removeNode(r));
@@ -1230,7 +1230,7 @@ function He(n) {
     e.points ? (i = e.points[0], a = e.points[e.points.length - 1]) : (e.points = [], i = o, a = t), e.points.unshift(en(t, i)), e.points.push(en(o, a));
   });
 }
-function Ke(n) {
+function Qe(n) {
   s(n.edges(), function(r) {
     var e = n.edge(r);
     if (Object.prototype.hasOwnProperty.call(e, "x"))
@@ -1244,7 +1244,7 @@ function Ke(n) {
       }
   });
 }
-function Qe(n) {
+function Ue(n) {
   s(n.edges(), function(r) {
     var e = n.edge(r);
     e.reversed && e.points.reverse();
@@ -1308,7 +1308,7 @@ function nt(n) {
   });
 }
 function Y(n, r) {
-  return j(M(n, r), Number);
+  return j(T(n, r), Number);
 }
 function q(n) {
   var r = {};