@hkyhy/marsun-components-core 0.1.8 → 0.1.11

package/dist/node_modules/zrender/lib/core/matrix.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"matrix.js","sources":["../../../../../node_modules/zrender/lib/core/matrix.js"],"sourcesContent":["export function create() {\n    return [1, 0, 0, 1, 0, 0];\n}\nexport function identity(out) {\n    out[0] = 1;\n    out[1] = 0;\n    out[2] = 0;\n    out[3] = 1;\n    out[4] = 0;\n    out[5] = 0;\n    return out;\n}\nexport function copy(out, m) {\n    out[0] = m[0];\n    out[1] = m[1];\n    out[2] = m[2];\n    out[3] = m[3];\n    out[4] = m[4];\n    out[5] = m[5];\n    return out;\n}\nexport function mul(out, m1, m2) {\n    var out0 = m1[0] * m2[0] + m1[2] * m2[1];\n    var out1 = m1[1] * m2[0] + m1[3] * m2[1];\n    var out2 = m1[0] * m2[2] + m1[2] * m2[3];\n    var out3 = m1[1] * m2[2] + m1[3] * m2[3];\n    var out4 = m1[0] * m2[4] + m1[2] * m2[5] + m1[4];\n    var out5 = m1[1] * m2[4] + m1[3] * m2[5] + m1[5];\n    out[0] = out0;\n    out[1] = out1;\n    out[2] = out2;\n    out[3] = out3;\n    out[4] = out4;\n    out[5] = out5;\n    return out;\n}\nexport function translate(out, a, v) {\n    out[0] = a[0];\n    out[1] = a[1];\n    out[2] = a[2];\n    out[3] = a[3];\n    out[4] = a[4] + v[0];\n    out[5] = a[5] + v[1];\n    return out;\n}\nexport function rotate(out, a, rad, pivot) {\n    if (pivot === void 0) { pivot = [0, 0]; }\n    var aa = a[0];\n    var ac = a[2];\n    var atx = a[4];\n    var ab = a[1];\n    var ad = a[3];\n    var aty = a[5];\n    var st = Math.sin(rad);\n    var ct = Math.cos(rad);\n    out[0] = aa * ct + ab * st;\n    out[1] = -aa * st + ab * ct;\n    out[2] = ac * ct + ad * st;\n    out[3] = -ac * st + ct * ad;\n    out[4] = ct * (atx - pivot[0]) + st * (aty - pivot[1]) + pivot[0];\n    out[5] = ct * (aty - pivot[1]) - st * (atx - pivot[0]) + pivot[1];\n    return out;\n}\nexport function scale(out, a, v) {\n    var vx = v[0];\n    var vy = v[1];\n    out[0] = a[0] * vx;\n    out[1] = a[1] * vy;\n    out[2] = a[2] * vx;\n    out[3] = a[3] * vy;\n    out[4] = a[4] * vx;\n    out[5] = a[5] * vy;\n    return out;\n}\nexport function invert(out, a) {\n    var aa = a[0];\n    var ac = a[2];\n    var atx = a[4];\n    var ab = a[1];\n    var ad = a[3];\n    var aty = a[5];\n    var det = aa * ad - ab * ac;\n    if (!det) {\n        return null;\n    }\n    det = 1.0 / det;\n    out[0] = ad * det;\n    out[1] = -ab * det;\n    out[2] = -ac * det;\n    out[3] = aa * det;\n    out[4] = (ac * aty - ad * atx) * det;\n    out[5] = (ab * atx - aa * aty) * det;\n    return out;\n}\nexport function clone(a) {\n    var b = create();\n    copy(b, a);\n    return b;\n}\n"],"names":["create","identity","out","copy","m","mul","m1","m2","out0","out1","out2","out3","out4","out5","translate","a","v","rotate","rad","pivot","aa","ac","atx","ab","ad","aty","st","ct","scale","vx","vy","invert","det","clone","b"],"mappings":"AAAO,SAASA,IAAS;AACrB,SAAO,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,CAAC;AAC5B;AACO,SAASC,EAASC,GAAK;AAC1B,SAAAA,EAAI,CAAC,IAAI,GACTA,EAAI,CAAC,IAAI,GACTA,EAAI,CAAC,IAAI,GACTA,EAAI,CAAC,IAAI,GACTA,EAAI,CAAC,IAAI,GACTA,EAAI,CAAC,IAAI,GACFA;AACX;AACO,SAASC,EAAKD,GAAKE,GAAG;AACzB,SAAAF,EAAI,CAAC,IAAIE,EAAE,CAAC,GACZF,EAAI,CAAC,IAAIE,EAAE,CAAC,GACZF,EAAI,CAAC,IAAIE,EAAE,CAAC,GACZF,EAAI,CAAC,IAAIE,EAAE,CAAC,GACZF,EAAI,CAAC,IAAIE,EAAE,CAAC,GACZF,EAAI,CAAC,IAAIE,EAAE,CAAC,GACLF;AACX;AACO,SAASG,EAAIH,GAAKI,GAAIC,GAAI;AAC7B,MAAIC,IAAOF,EAAG,CAAC,IAAIC,EAAG,CAAC,IAAID,EAAG,CAAC,IAAIC,EAAG,CAAC,GACnCE,IAAOH,EAAG,CAAC,IAAIC,EAAG,CAAC,IAAID,EAAG,CAAC,IAAIC,EAAG,CAAC,GACnCG,IAAOJ,EAAG,CAAC,IAAIC,EAAG,CAAC,IAAID,EAAG,CAAC,IAAIC,EAAG,CAAC,GACnCI,IAAOL,EAAG,CAAC,IAAIC,EAAG,CAAC,IAAID,EAAG,CAAC,IAAIC,EAAG,CAAC,GACnCK,IAAON,EAAG,CAAC,IAAIC,EAAG,CAAC,IAAID,EAAG,CAAC,IAAIC,EAAG,CAAC,IAAID,EAAG,CAAC,GAC3CO,IAAOP,EAAG,CAAC,IAAIC,EAAG,CAAC,IAAID,EAAG,CAAC,IAAIC,EAAG,CAAC,IAAID,EAAG,CAAC;AAC/C,SAAAJ,EAAI,CAAC,IAAIM,GACTN,EAAI,CAAC,IAAIO,GACTP,EAAI,CAAC,IAAIQ,GACTR,EAAI,CAAC,IAAIS,GACTT,EAAI,CAAC,IAAIU,GACTV,EAAI,CAAC,IAAIW,GACFX;AACX;AACO,SAASY,EAAUZ,GAAKa,GAAGC,GAAG;AACjC,SAAAd,EAAI,CAAC,IAAIa,EAAE,CAAC,GACZb,EAAI,CAAC,IAAIa,EAAE,CAAC,GACZb,EAAI,CAAC,IAAIa,EAAE,CAAC,GACZb,EAAI,CAAC,IAAIa,EAAE,CAAC,GACZb,EAAI,CAAC,IAAIa,EAAE,CAAC,IAAIC,EAAE,CAAC,GACnBd,EAAI,CAAC,IAAIa,EAAE,CAAC,IAAIC,EAAE,CAAC,GACZd;AACX;AACO,SAASe,EAAOf,GAAKa,GAAGG,GAAKC,GAAO;AACvC,EAAIA,MAAU,WAAUA,IAAQ,CAAC,GAAG,CAAC;AACrC,MAAIC,IAAKL,EAAE,CAAC,GACRM,IAAKN,EAAE,CAAC,GACRO,IAAMP,EAAE,CAAC,GACTQ,IAAKR,EAAE,CAAC,GACRS,IAAKT,EAAE,CAAC,GACRU,IAAMV,EAAE,CAAC,GACTW,IAAK,KAAK,IAAIR,CAAG,GACjBS,IAAK,KAAK,IAAIT,CAAG;AACrB,SAAAhB,EAAI,CAAC,IAAIkB,IAAKO,IAAKJ,IAAKG,GACxBxB,EAAI,CAAC,IAAI,CAACkB,IAAKM,IAAKH,IAAKI,GACzBzB,EAAI,CAAC,IAAImB,IAAKM,IAAKH,IAAKE,GACxBxB,EAAI,CAAC,IAAI,CAACmB,IAAKK,IAAKC,IAAKH,GACzBtB,EAAI,CAAC,IAAIyB,KAAML,IAAMH,EAAM,CAAC,KAAKO,KAAMD,IAAMN,EAAM,CAAC,KAAKA,EAAM,CAAC,GAChEjB,EAAI,CAAC,IAAIyB,KAAMF,IAAMN,EAAM,CAAC,KAAKO,KAAMJ,IAAMH,EAAM,CAAC,KAAKA,EAAM,CAAC,GACzDjB;AACX;AACO,SAAS0B,EAAM1B,GAAKa,GAAGC,GAAG;AAC7B,MAAIa,IAAKb,EAAE,CAAC,GACRc,IAAKd,EAAE,CAAC;AACZ,SAAAd,EAAI,CAAC,IAAIa,EAAE,CAAC,IAAIc,GAChB3B,EAAI,CAAC,IAAIa,EAAE,CAAC,IAAIe,GAChB5B,EAAI,CAAC,IAAIa,EAAE,CAAC,IAAIc,GAChB3B,EAAI,CAAC,IAAIa,EAAE,CAAC,IAAIe,GAChB5B,EAAI,CAAC,IAAIa,EAAE,CAAC,IAAIc,GAChB3B,EAAI,CAAC,IAAIa,EAAE,CAAC,IAAIe,GACT5B;AACX;AACO,SAAS6B,EAAO7B,GAAKa,GAAG;AAC3B,MAAIK,IAAKL,EAAE,CAAC,GACRM,IAAKN,EAAE,CAAC,GACRO,IAAMP,EAAE,CAAC,GACTQ,IAAKR,EAAE,CAAC,GACRS,IAAKT,EAAE,CAAC,GACRU,IAAMV,EAAE,CAAC,GACTiB,IAAMZ,IAAKI,IAAKD,IAAKF;AACzB,SAAKW,KAGLA,IAAM,IAAMA,GACZ9B,EAAI,CAAC,IAAIsB,IAAKQ,GACd9B,EAAI,CAAC,IAAI,CAACqB,IAAKS,GACf9B,EAAI,CAAC,IAAI,CAACmB,IAAKW,GACf9B,EAAI,CAAC,IAAIkB,IAAKY,GACd9B,EAAI,CAAC,KAAKmB,IAAKI,IAAMD,IAAKF,KAAOU,GACjC9B,EAAI,CAAC,KAAKqB,IAAKD,IAAMF,IAAKK,KAAOO,GAC1B9B,KATI;AAUf;AACO,SAAS+B,EAAMlB,GAAG;AACrB,MAAImB,IAAIlC,EAAM;AACd,SAAAG,EAAK+B,GAAGnB,CAAC,GACFmB;AACX;","x_google_ignoreList":[0]}

package/dist/node_modules/zrender/lib/core/platform.js

@@ -1,49 +0,0 @@
-var c = 12, f = "sans-serif", d = c + "px " + f, T = 20, m = 100, W = "007LLmW'55;N0500LLLLLLLLLL00NNNLzWW\\\\WQb\\0FWLg\\bWb\\WQ\\WrWWQ000CL5LLFLL0LL**F*gLLLL5F0LF\\FFF5.5N";
-function g(a) {
-  var n = {};
-  if (typeof JSON > "u")
-    return n;
-  for (var r = 0; r < a.length; r++) {
-    var e = String.fromCharCode(r + 32), L = (a.charCodeAt(r) - T) / m;
-    n[e] = L;
-  }
-  return n;
-}
-var l = g(W), i = {
-  createCanvas: function() {
-    return typeof document < "u" && document.createElement("canvas");
-  },
-  measureText: /* @__PURE__ */ (function() {
-    var a, n;
-    return function(r, e) {
-      if (!a) {
-        var L = i.createCanvas();
-        a = L && L.getContext("2d");
-      }
-      if (a)
-        return n !== e && (n = a.font = e || d), a.measureText(r);
-      r = r || "", e = e || d;
-      var o = /((?:\d+)?\.?\d*)px/.exec(e), v = o && +o[1] || c, t = 0;
-      if (e.indexOf("mono") >= 0)
-        t = v * r.length;
-      else
-        for (var u = 0; u < r.length; u++) {
-          var F = l[r[u]];
-          t += F == null ? v : F * v;
-        }
-      return { width: t };
-    };
-  })(),
-  loadImage: function(a, n, r) {
-    var e = new Image();
-    return e.onload = n, e.onerror = r, e.src = a, e;
-  }
-};
-export {
-  d as DEFAULT_FONT,
-  f as DEFAULT_FONT_FAMILY,
-  c as DEFAULT_FONT_SIZE,
-  l as DEFAULT_TEXT_WIDTH_MAP,
-  i as platformApi
-};
-//# sourceMappingURL=platform.js.map

package/dist/node_modules/zrender/lib/core/platform.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"platform.js","sources":["../../../../../node_modules/zrender/lib/core/platform.js"],"sourcesContent":["export var DEFAULT_FONT_SIZE = 12;\nexport var DEFAULT_FONT_FAMILY = 'sans-serif';\nexport var DEFAULT_FONT = DEFAULT_FONT_SIZE + \"px \" + DEFAULT_FONT_FAMILY;\nvar OFFSET = 20;\nvar SCALE = 100;\nvar defaultWidthMapStr = \"007LLmW'55;N0500LLLLLLLLLL00NNNLzWW\\\\\\\\WQb\\\\0FWLg\\\\bWb\\\\WQ\\\\WrWWQ000CL5LLFLL0LL**F*gLLLL5F0LF\\\\FFF5.5N\";\nfunction getTextWidthMap(mapStr) {\n    var map = {};\n    if (typeof JSON === 'undefined') {\n        return map;\n    }\n    for (var i = 0; i < mapStr.length; i++) {\n        var char = String.fromCharCode(i + 32);\n        var size = (mapStr.charCodeAt(i) - OFFSET) / SCALE;\n        map[char] = size;\n    }\n    return map;\n}\nexport var DEFAULT_TEXT_WIDTH_MAP = getTextWidthMap(defaultWidthMapStr);\nexport var platformApi = {\n    createCanvas: function () {\n        return typeof document !== 'undefined'\n            && document.createElement('canvas');\n    },\n    measureText: (function () {\n        var _ctx;\n        var _cachedFont;\n        return function (text, font) {\n            if (!_ctx) {\n                var canvas = platformApi.createCanvas();\n                _ctx = canvas && canvas.getContext('2d');\n            }\n            if (_ctx) {\n                if (_cachedFont !== font) {\n                    _cachedFont = _ctx.font = font || DEFAULT_FONT;\n                }\n                return _ctx.measureText(text);\n            }\n            else {\n                text = text || '';\n                font = font || DEFAULT_FONT;\n                var res = /((?:\\d+)?\\.?\\d*)px/.exec(font);\n                var fontSize = res && +res[1] || DEFAULT_FONT_SIZE;\n                var width = 0;\n                if (font.indexOf('mono') >= 0) {\n                    width = fontSize * text.length;\n                }\n                else {\n                    for (var i = 0; i < text.length; i++) {\n                        var preCalcWidth = DEFAULT_TEXT_WIDTH_MAP[text[i]];\n                        width += preCalcWidth == null ? fontSize : (preCalcWidth * fontSize);\n                    }\n                }\n                return { width: width };\n            }\n        };\n    })(),\n    loadImage: function (src, onload, onerror) {\n        var image = new Image();\n        image.onload = onload;\n        image.onerror = onerror;\n        image.src = src;\n        return image;\n    }\n};\nexport function setPlatformAPI(newPlatformApis) {\n    for (var key in platformApi) {\n        if (newPlatformApis[key]) {\n            platformApi[key] = newPlatformApis[key];\n        }\n    }\n}\n"],"names":["DEFAULT_FONT_SIZE","DEFAULT_FONT_FAMILY","DEFAULT_FONT","OFFSET","SCALE","defaultWidthMapStr","getTextWidthMap","mapStr","map","i","char","size","DEFAULT_TEXT_WIDTH_MAP","platformApi","_ctx","_cachedFont","text","font","canvas","res","fontSize","width","preCalcWidth","src","onload","onerror","image"],"mappings":"AAAU,IAACA,IAAoB,IACpBC,IAAsB,cACtBC,IAAeF,IAAoB,QAAQC,GAClDE,IAAS,IACTC,IAAQ,KACRC,IAAqB;AACzB,SAASC,EAAgBC,GAAQ;AAC7B,MAAIC,IAAM,CAAA;AACV,MAAI,OAAO,OAAS;AAChB,WAAOA;AAEX,WAASC,IAAI,GAAGA,IAAIF,EAAO,QAAQE,KAAK;AACpC,QAAIC,IAAO,OAAO,aAAaD,IAAI,EAAE,GACjCE,KAAQJ,EAAO,WAAWE,CAAC,IAAIN,KAAUC;AAC7C,IAAAI,EAAIE,CAAI,IAAIC;AAAA,EAChB;AACA,SAAOH;AACX;AACU,IAACI,IAAyBN,EAAgBD,CAAkB,GAC3DQ,IAAc;AAAA,EACrB,cAAc,WAAY;AACtB,WAAO,OAAO,WAAa,OACpB,SAAS,cAAc,QAAQ;AAAA,EAC1C;AAAA,EACA,aAAc,4BAAY;AACtB,QAAIC,GACAC;AACJ,WAAO,SAAUC,GAAMC,GAAM;AACzB,UAAI,CAACH,GAAM;AACP,YAAII,IAASL,EAAY,aAAY;AACrC,QAAAC,IAAOI,KAAUA,EAAO,WAAW,IAAI;AAAA,MAC3C;AACA,UAAIJ;AACA,eAAIC,MAAgBE,MAChBF,IAAcD,EAAK,OAAOG,KAAQf,IAE/BY,EAAK,YAAYE,CAAI;AAG5B,MAAAA,IAAOA,KAAQ,IACfC,IAAOA,KAAQf;AACf,UAAIiB,IAAM,qBAAqB,KAAKF,CAAI,GACpCG,IAAWD,KAAO,CAACA,EAAI,CAAC,KAAKnB,GAC7BqB,IAAQ;AACZ,UAAIJ,EAAK,QAAQ,MAAM,KAAK;AACxB,QAAAI,IAAQD,IAAWJ,EAAK;AAAA;AAGxB,iBAASP,IAAI,GAAGA,IAAIO,EAAK,QAAQP,KAAK;AAClC,cAAIa,IAAeV,EAAuBI,EAAKP,CAAC,CAAC;AACjD,UAAAY,KAASC,KAAgB,OAAOF,IAAYE,IAAeF;AAAA,QAC/D;AAEJ,aAAO,EAAE,OAAOC,EAAK;AAAA,IAE7B;AAAA,EACJ,GAAC;AAAA,EACD,WAAW,SAAUE,GAAKC,GAAQC,GAAS;AACvC,QAAIC,IAAQ,IAAI,MAAK;AACrB,WAAAA,EAAM,SAASF,GACfE,EAAM,UAAUD,GAChBC,EAAM,MAAMH,GACLG;AAAA,EACX;AACJ;","x_google_ignoreList":[0]}

package/dist/node_modules/zrender/lib/core/timsort.js

@@ -1,287 +0,0 @@
-var j = 32, H = 7;
-function J(f) {
-  for (var w = 0; f >= j; )
-    w |= f & 1, f >>= 1;
-  return f + w;
-}
-function C(f, w, s, E) {
-  var u = w + 1;
-  if (u === s)
-    return 1;
-  if (E(f[u++], f[w]) < 0) {
-    for (; u < s && E(f[u], f[u - 1]) < 0; )
-      u++;
-    K(f, w, u);
-  } else
-    for (; u < s && E(f[u], f[u - 1]) >= 0; )
-      u++;
-  return u - w;
-}
-function K(f, w, s) {
-  for (s--; w < s; ) {
-    var E = f[w];
-    f[w++] = f[s], f[s--] = E;
-  }
-}
-function P(f, w, s, E, u) {
-  for (E === w && E++; E < s; E++) {
-    for (var d = f[E], v = w, G = E, e; v < G; )
-      e = v + G >>> 1, u(d, f[e]) < 0 ? G = e : v = e + 1;
-    var D = E - v;
-    switch (D) {
-      case 3:
-        f[v + 3] = f[v + 2];
-      case 2:
-        f[v + 2] = f[v + 1];
-      case 1:
-        f[v + 1] = f[v];
-        break;
-      default:
-        for (; D > 0; )
-          f[v + D] = f[v + D - 1], D--;
-    }
-    f[v] = d;
-  }
-}
-function U(f, w, s, E, u, d) {
-  var v = 0, G = 0, e = 1;
-  if (d(f, w[s + u]) > 0) {
-    for (G = E - u; e < G && d(f, w[s + u + e]) > 0; )
-      v = e, e = (e << 1) + 1, e <= 0 && (e = G);
-    e > G && (e = G), v += u, e += u;
-  } else {
-    for (G = u + 1; e < G && d(f, w[s + u - e]) <= 0; )
-      v = e, e = (e << 1) + 1, e <= 0 && (e = G);
-    e > G && (e = G);
-    var D = v;
-    v = u - e, e = u - D;
-  }
-  for (v++; v < e; ) {
-    var N = v + (e - v >>> 1);
-    d(f, w[s + N]) > 0 ? v = N + 1 : e = N;
-  }
-  return e;
-}
-function z(f, w, s, E, u, d) {
-  var v = 0, G = 0, e = 1;
-  if (d(f, w[s + u]) < 0) {
-    for (G = u + 1; e < G && d(f, w[s + u - e]) < 0; )
-      v = e, e = (e << 1) + 1, e <= 0 && (e = G);
-    e > G && (e = G);
-    var D = v;
-    v = u - e, e = u - D;
-  } else {
-    for (G = E - u; e < G && d(f, w[s + u + e]) >= 0; )
-      v = e, e = (e << 1) + 1, e <= 0 && (e = G);
-    e > G && (e = G), v += u, e += u;
-  }
-  for (v++; v < e; ) {
-    var N = v + (e - v >>> 1);
-    d(f, w[s + N]) < 0 ? e = N : v = N + 1;
-  }
-  return e;
-}
-function Q(f, w) {
-  var s = H, E, u, d = 0, v = [];
-  E = [], u = [];
-  function G(k, b) {
-    E[d] = k, u[d] = b, d += 1;
-  }
-  function e() {
-    for (; d > 1; ) {
-      var k = d - 2;
-      if (k >= 1 && u[k - 1] <= u[k] + u[k + 1] || k >= 2 && u[k - 2] <= u[k] + u[k - 1])
-        u[k - 1] < u[k + 1] && k--;
-      else if (u[k] > u[k + 1])
-        break;
-      N(k);
-    }
-  }
-  function D() {
-    for (; d > 1; ) {
-      var k = d - 2;
-      k > 0 && u[k - 1] < u[k + 1] && k--, N(k);
-    }
-  }
-  function N(k) {
-    var b = E[k], S = u[k], R = E[k + 1], i = u[k + 1];
-    u[k] = S + i, k === d - 3 && (E[k + 1] = E[k + 2], u[k + 1] = u[k + 2]), d--;
-    var M = z(f[R], f, b, S, 0, w);
-    b += M, S -= M, S !== 0 && (i = U(f[b + S - 1], f, R, i, i - 1, w), i !== 0 && (S <= i ? q(b, S, R, i) : B(b, S, R, i)));
-  }
-  function q(k, b, S, R) {
-    var i = 0;
-    for (i = 0; i < b; i++)
-      v[i] = f[k + i];
-    var M = 0, A = S, L = k;
-    if (f[L++] = f[A++], --R === 0) {
-      for (i = 0; i < b; i++)
-        f[L + i] = v[M + i];
-      return;
-    }
-    if (b === 1) {
-      for (i = 0; i < R; i++)
-        f[L + i] = f[A + i];
-      f[L + R] = v[M];
-      return;
-    }
-    for (var O = s, _, I, o; ; ) {
-      _ = 0, I = 0, o = !1;
-      do
-        if (w(f[A], v[M]) < 0) {
-          if (f[L++] = f[A++], I++, _ = 0, --R === 0) {
-            o = !0;
-            break;
-          }
-        } else if (f[L++] = v[M++], _++, I = 0, --b === 1) {
-          o = !0;
-          break;
-        }
-      while ((_ | I) < O);
-      if (o)
-        break;
-      do {
-        if (_ = z(f[A], v, M, b, 0, w), _ !== 0) {
-          for (i = 0; i < _; i++)
-            f[L + i] = v[M + i];
-          if (L += _, M += _, b -= _, b <= 1) {
-            o = !0;
-            break;
-          }
-        }
-        if (f[L++] = f[A++], --R === 0) {
-          o = !0;
-          break;
-        }
-        if (I = U(v[M], f, A, R, 0, w), I !== 0) {
-          for (i = 0; i < I; i++)
-            f[L + i] = f[A + i];
-          if (L += I, A += I, R -= I, R === 0) {
-            o = !0;
-            break;
-          }
-        }
-        if (f[L++] = v[M++], --b === 1) {
-          o = !0;
-          break;
-        }
-        O--;
-      } while (_ >= H || I >= H);
-      if (o)
-        break;
-      O < 0 && (O = 0), O += 2;
-    }
-    if (s = O, s < 1 && (s = 1), b === 1) {
-      for (i = 0; i < R; i++)
-        f[L + i] = f[A + i];
-      f[L + R] = v[M];
-    } else {
-      if (b === 0)
-        throw new Error();
-      for (i = 0; i < b; i++)
-        f[L + i] = v[M + i];
-    }
-  }
-  function B(k, b, S, R) {
-    var i = 0;
-    for (i = 0; i < R; i++)
-      v[i] = f[S + i];
-    var M = k + b - 1, A = R - 1, L = S + R - 1, O = 0, _ = 0;
-    if (f[L--] = f[M--], --b === 0) {
-      for (O = L - (R - 1), i = 0; i < R; i++)
-        f[O + i] = v[i];
-      return;
-    }
-    if (R === 1) {
-      for (L -= b, M -= b, _ = L + 1, O = M + 1, i = b - 1; i >= 0; i--)
-        f[_ + i] = f[O + i];
-      f[L] = v[A];
-      return;
-    }
-    for (var I = s; ; ) {
-      var o = 0, T = 0, F = !1;
-      do
-        if (w(v[A], f[M]) < 0) {
-          if (f[L--] = f[M--], o++, T = 0, --b === 0) {
-            F = !0;
-            break;
-          }
-        } else if (f[L--] = v[A--], T++, o = 0, --R === 1) {
-          F = !0;
-          break;
-        }
-      while ((o | T) < I);
-      if (F)
-        break;
-      do {
-        if (o = b - z(v[A], f, k, b, b - 1, w), o !== 0) {
-          for (L -= o, M -= o, b -= o, _ = L + 1, O = M + 1, i = o - 1; i >= 0; i--)
-            f[_ + i] = f[O + i];
-          if (b === 0) {
-            F = !0;
-            break;
-          }
-        }
-        if (f[L--] = v[A--], --R === 1) {
-          F = !0;
-          break;
-        }
-        if (T = R - U(f[M], v, 0, R, R - 1, w), T !== 0) {
-          for (L -= T, A -= T, R -= T, _ = L + 1, O = A + 1, i = 0; i < T; i++)
-            f[_ + i] = v[O + i];
-          if (R <= 1) {
-            F = !0;
-            break;
-          }
-        }
-        if (f[L--] = f[M--], --b === 0) {
-          F = !0;
-          break;
-        }
-        I--;
-      } while (o >= H || T >= H);
-      if (F)
-        break;
-      I < 0 && (I = 0), I += 2;
-    }
-    if (s = I, s < 1 && (s = 1), R === 1) {
-      for (L -= b, M -= b, _ = L + 1, O = M + 1, i = b - 1; i >= 0; i--)
-        f[_ + i] = f[O + i];
-      f[L] = v[A];
-    } else {
-      if (R === 0)
-        throw new Error();
-      for (O = L - (R - 1), i = 0; i < R; i++)
-        f[O + i] = v[i];
-    }
-  }
-  return {
-    mergeRuns: e,
-    forceMergeRuns: D,
-    pushRun: G
-  };
-}
-function V(f, w, s, E) {
-  s || (s = 0), E || (E = f.length);
-  var u = E - s;
-  if (!(u < 2)) {
-    var d = 0;
-    if (u < j) {
-      d = C(f, s, E, w), P(f, s, E, s + d, w);
-      return;
-    }
-    var v = Q(f, w), G = J(u);
-    do {
-      if (d = C(f, s, E, w), d < G) {
-        var e = u;
-        e > G && (e = G), P(f, s, s + e, s + d, w), d = e;
-      }
-      v.pushRun(s, d), v.mergeRuns(), u -= d, s += d;
-    } while (u !== 0);
-    v.forceMergeRuns();
-  }
-}
-export {
-  V as default
-};
-//# sourceMappingURL=timsort.js.map

package/dist/node_modules/zrender/lib/core/timsort.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"timsort.js","sources":["../../../../../node_modules/zrender/lib/core/timsort.js"],"sourcesContent":["var DEFAULT_MIN_MERGE = 32;\nvar DEFAULT_MIN_GALLOPING = 7;\nfunction minRunLength(n) {\n    var r = 0;\n    while (n >= DEFAULT_MIN_MERGE) {\n        r |= n & 1;\n        n >>= 1;\n    }\n    return n + r;\n}\nfunction makeAscendingRun(array, lo, hi, compare) {\n    var runHi = lo + 1;\n    if (runHi === hi) {\n        return 1;\n    }\n    if (compare(array[runHi++], array[lo]) < 0) {\n        while (runHi < hi && compare(array[runHi], array[runHi - 1]) < 0) {\n            runHi++;\n        }\n        reverseRun(array, lo, runHi);\n    }\n    else {\n        while (runHi < hi && compare(array[runHi], array[runHi - 1]) >= 0) {\n            runHi++;\n        }\n    }\n    return runHi - lo;\n}\nfunction reverseRun(array, lo, hi) {\n    hi--;\n    while (lo < hi) {\n        var t = array[lo];\n        array[lo++] = array[hi];\n        array[hi--] = t;\n    }\n}\nfunction binaryInsertionSort(array, lo, hi, start, compare) {\n    if (start === lo) {\n        start++;\n    }\n    for (; start < hi; start++) {\n        var pivot = array[start];\n        var left = lo;\n        var right = start;\n        var mid;\n        while (left < right) {\n            mid = left + right >>> 1;\n            if (compare(pivot, array[mid]) < 0) {\n                right = mid;\n            }\n            else {\n                left = mid + 1;\n            }\n        }\n        var n = start - left;\n        switch (n) {\n            case 3:\n                array[left + 3] = array[left + 2];\n            case 2:\n                array[left + 2] = array[left + 1];\n            case 1:\n                array[left + 1] = array[left];\n                break;\n            default:\n                while (n > 0) {\n                    array[left + n] = array[left + n - 1];\n                    n--;\n                }\n        }\n        array[left] = pivot;\n    }\n}\nfunction gallopLeft(value, array, start, length, hint, compare) {\n    var lastOffset = 0;\n    var maxOffset = 0;\n    var offset = 1;\n    if (compare(value, array[start + hint]) > 0) {\n        maxOffset = length - hint;\n        while (offset < maxOffset && compare(value, array[start + hint + offset]) > 0) {\n            lastOffset = offset;\n            offset = (offset << 1) + 1;\n            if (offset <= 0) {\n                offset = maxOffset;\n            }\n        }\n        if (offset > maxOffset) {\n            offset = maxOffset;\n        }\n        lastOffset += hint;\n        offset += hint;\n    }\n    else {\n        maxOffset = hint + 1;\n        while (offset < maxOffset && compare(value, array[start + hint - offset]) <= 0) {\n            lastOffset = offset;\n            offset = (offset << 1) + 1;\n            if (offset <= 0) {\n                offset = maxOffset;\n            }\n        }\n        if (offset > maxOffset) {\n            offset = maxOffset;\n        }\n        var tmp = lastOffset;\n        lastOffset = hint - offset;\n        offset = hint - tmp;\n    }\n    lastOffset++;\n    while (lastOffset < offset) {\n        var m = lastOffset + (offset - lastOffset >>> 1);\n        if (compare(value, array[start + m]) > 0) {\n            lastOffset = m + 1;\n        }\n        else {\n            offset = m;\n        }\n    }\n    return offset;\n}\nfunction gallopRight(value, array, start, length, hint, compare) {\n    var lastOffset = 0;\n    var maxOffset = 0;\n    var offset = 1;\n    if (compare(value, array[start + hint]) < 0) {\n        maxOffset = hint + 1;\n        while (offset < maxOffset && compare(value, array[start + hint - offset]) < 0) {\n            lastOffset = offset;\n            offset = (offset << 1) + 1;\n            if (offset <= 0) {\n                offset = maxOffset;\n            }\n        }\n        if (offset > maxOffset) {\n            offset = maxOffset;\n        }\n        var tmp = lastOffset;\n        lastOffset = hint - offset;\n        offset = hint - tmp;\n    }\n    else {\n        maxOffset = length - hint;\n        while (offset < maxOffset && compare(value, array[start + hint + offset]) >= 0) {\n            lastOffset = offset;\n            offset = (offset << 1) + 1;\n            if (offset <= 0) {\n                offset = maxOffset;\n            }\n        }\n        if (offset > maxOffset) {\n            offset = maxOffset;\n        }\n        lastOffset += hint;\n        offset += hint;\n    }\n    lastOffset++;\n    while (lastOffset < offset) {\n        var m = lastOffset + (offset - lastOffset >>> 1);\n        if (compare(value, array[start + m]) < 0) {\n            offset = m;\n        }\n        else {\n            lastOffset = m + 1;\n        }\n    }\n    return offset;\n}\nfunction TimSort(array, compare) {\n    var minGallop = DEFAULT_MIN_GALLOPING;\n    var runStart;\n    var runLength;\n    var stackSize = 0;\n    var tmp = [];\n    runStart = [];\n    runLength = [];\n    function pushRun(_runStart, _runLength) {\n        runStart[stackSize] = _runStart;\n        runLength[stackSize] = _runLength;\n        stackSize += 1;\n    }\n    function mergeRuns() {\n        while (stackSize > 1) {\n            var n = stackSize - 2;\n            if ((n >= 1 && runLength[n - 1] <= runLength[n] + runLength[n + 1])\n                || (n >= 2 && runLength[n - 2] <= runLength[n] + runLength[n - 1])) {\n                if (runLength[n - 1] < runLength[n + 1]) {\n                    n--;\n                }\n            }\n            else if (runLength[n] > runLength[n + 1]) {\n                break;\n            }\n            mergeAt(n);\n        }\n    }\n    function forceMergeRuns() {\n        while (stackSize > 1) {\n            var n = stackSize - 2;\n            if (n > 0 && runLength[n - 1] < runLength[n + 1]) {\n                n--;\n            }\n            mergeAt(n);\n        }\n    }\n    function mergeAt(i) {\n        var start1 = runStart[i];\n        var length1 = runLength[i];\n        var start2 = runStart[i + 1];\n        var length2 = runLength[i + 1];\n        runLength[i] = length1 + length2;\n        if (i === stackSize - 3) {\n            runStart[i + 1] = runStart[i + 2];\n            runLength[i + 1] = runLength[i + 2];\n        }\n        stackSize--;\n        var k = gallopRight(array[start2], array, start1, length1, 0, compare);\n        start1 += k;\n        length1 -= k;\n        if (length1 === 0) {\n            return;\n        }\n        length2 = gallopLeft(array[start1 + length1 - 1], array, start2, length2, length2 - 1, compare);\n        if (length2 === 0) {\n            return;\n        }\n        if (length1 <= length2) {\n            mergeLow(start1, length1, start2, length2);\n        }\n        else {\n            mergeHigh(start1, length1, start2, length2);\n        }\n    }\n    function mergeLow(start1, length1, start2, length2) {\n        var i = 0;\n        for (i = 0; i < length1; i++) {\n            tmp[i] = array[start1 + i];\n        }\n        var cursor1 = 0;\n        var cursor2 = start2;\n        var dest = start1;\n        array[dest++] = array[cursor2++];\n        if (--length2 === 0) {\n            for (i = 0; i < length1; i++) {\n                array[dest + i] = tmp[cursor1 + i];\n            }\n            return;\n        }\n        if (length1 === 1) {\n            for (i = 0; i < length2; i++) {\n                array[dest + i] = array[cursor2 + i];\n            }\n            array[dest + length2] = tmp[cursor1];\n            return;\n        }\n        var _minGallop = minGallop;\n        var count1;\n        var count2;\n        var exit;\n        while (1) {\n            count1 = 0;\n            count2 = 0;\n            exit = false;\n            do {\n                if (compare(array[cursor2], tmp[cursor1]) < 0) {\n                    array[dest++] = array[cursor2++];\n                    count2++;\n                    count1 = 0;\n                    if (--length2 === 0) {\n                        exit = true;\n                        break;\n                    }\n                }\n                else {\n                    array[dest++] = tmp[cursor1++];\n                    count1++;\n                    count2 = 0;\n                    if (--length1 === 1) {\n                        exit = true;\n                        break;\n                    }\n                }\n            } while ((count1 | count2) < _minGallop);\n            if (exit) {\n                break;\n            }\n            do {\n                count1 = gallopRight(array[cursor2], tmp, cursor1, length1, 0, compare);\n                if (count1 !== 0) {\n                    for (i = 0; i < count1; i++) {\n                        array[dest + i] = tmp[cursor1 + i];\n                    }\n                    dest += count1;\n                    cursor1 += count1;\n                    length1 -= count1;\n                    if (length1 <= 1) {\n                        exit = true;\n                        break;\n                    }\n                }\n                array[dest++] = array[cursor2++];\n                if (--length2 === 0) {\n                    exit = true;\n                    break;\n                }\n                count2 = gallopLeft(tmp[cursor1], array, cursor2, length2, 0, compare);\n                if (count2 !== 0) {\n                    for (i = 0; i < count2; i++) {\n                        array[dest + i] = array[cursor2 + i];\n                    }\n                    dest += count2;\n                    cursor2 += count2;\n                    length2 -= count2;\n                    if (length2 === 0) {\n                        exit = true;\n                        break;\n                    }\n                }\n                array[dest++] = tmp[cursor1++];\n                if (--length1 === 1) {\n                    exit = true;\n                    break;\n                }\n                _minGallop--;\n            } while (count1 >= DEFAULT_MIN_GALLOPING || count2 >= DEFAULT_MIN_GALLOPING);\n            if (exit) {\n                break;\n            }\n            if (_minGallop < 0) {\n                _minGallop = 0;\n            }\n            _minGallop += 2;\n        }\n        minGallop = _minGallop;\n        minGallop < 1 && (minGallop = 1);\n        if (length1 === 1) {\n            for (i = 0; i < length2; i++) {\n                array[dest + i] = array[cursor2 + i];\n            }\n            array[dest + length2] = tmp[cursor1];\n        }\n        else if (length1 === 0) {\n            throw new Error();\n        }\n        else {\n            for (i = 0; i < length1; i++) {\n                array[dest + i] = tmp[cursor1 + i];\n            }\n        }\n    }\n    function mergeHigh(start1, length1, start2, length2) {\n        var i = 0;\n        for (i = 0; i < length2; i++) {\n            tmp[i] = array[start2 + i];\n        }\n        var cursor1 = start1 + length1 - 1;\n        var cursor2 = length2 - 1;\n        var dest = start2 + length2 - 1;\n        var customCursor = 0;\n        var customDest = 0;\n        array[dest--] = array[cursor1--];\n        if (--length1 === 0) {\n            customCursor = dest - (length2 - 1);\n            for (i = 0; i < length2; i++) {\n                array[customCursor + i] = tmp[i];\n            }\n            return;\n        }\n        if (length2 === 1) {\n            dest -= length1;\n            cursor1 -= length1;\n            customDest = dest + 1;\n            customCursor = cursor1 + 1;\n            for (i = length1 - 1; i >= 0; i--) {\n                array[customDest + i] = array[customCursor + i];\n            }\n            array[dest] = tmp[cursor2];\n            return;\n        }\n        var _minGallop = minGallop;\n        while (true) {\n            var count1 = 0;\n            var count2 = 0;\n            var exit = false;\n            do {\n                if (compare(tmp[cursor2], array[cursor1]) < 0) {\n                    array[dest--] = array[cursor1--];\n                    count1++;\n                    count2 = 0;\n                    if (--length1 === 0) {\n                        exit = true;\n                        break;\n                    }\n                }\n                else {\n                    array[dest--] = tmp[cursor2--];\n                    count2++;\n                    count1 = 0;\n                    if (--length2 === 1) {\n                        exit = true;\n                        break;\n                    }\n                }\n            } while ((count1 | count2) < _minGallop);\n            if (exit) {\n                break;\n            }\n            do {\n                count1 = length1 - gallopRight(tmp[cursor2], array, start1, length1, length1 - 1, compare);\n                if (count1 !== 0) {\n                    dest -= count1;\n                    cursor1 -= count1;\n                    length1 -= count1;\n                    customDest = dest + 1;\n                    customCursor = cursor1 + 1;\n                    for (i = count1 - 1; i >= 0; i--) {\n                        array[customDest + i] = array[customCursor + i];\n                    }\n                    if (length1 === 0) {\n                        exit = true;\n                        break;\n                    }\n                }\n                array[dest--] = tmp[cursor2--];\n                if (--length2 === 1) {\n                    exit = true;\n                    break;\n                }\n                count2 = length2 - gallopLeft(array[cursor1], tmp, 0, length2, length2 - 1, compare);\n                if (count2 !== 0) {\n                    dest -= count2;\n                    cursor2 -= count2;\n                    length2 -= count2;\n                    customDest = dest + 1;\n                    customCursor = cursor2 + 1;\n                    for (i = 0; i < count2; i++) {\n                        array[customDest + i] = tmp[customCursor + i];\n                    }\n                    if (length2 <= 1) {\n                        exit = true;\n                        break;\n                    }\n                }\n                array[dest--] = array[cursor1--];\n                if (--length1 === 0) {\n                    exit = true;\n                    break;\n                }\n                _minGallop--;\n            } while (count1 >= DEFAULT_MIN_GALLOPING || count2 >= DEFAULT_MIN_GALLOPING);\n            if (exit) {\n                break;\n            }\n            if (_minGallop < 0) {\n                _minGallop = 0;\n            }\n            _minGallop += 2;\n        }\n        minGallop = _minGallop;\n        if (minGallop < 1) {\n            minGallop = 1;\n        }\n        if (length2 === 1) {\n            dest -= length1;\n            cursor1 -= length1;\n            customDest = dest + 1;\n            customCursor = cursor1 + 1;\n            for (i = length1 - 1; i >= 0; i--) {\n                array[customDest + i] = array[customCursor + i];\n            }\n            array[dest] = tmp[cursor2];\n        }\n        else if (length2 === 0) {\n            throw new Error();\n        }\n        else {\n            customCursor = dest - (length2 - 1);\n            for (i = 0; i < length2; i++) {\n                array[customCursor + i] = tmp[i];\n            }\n        }\n    }\n    return {\n        mergeRuns: mergeRuns,\n        forceMergeRuns: forceMergeRuns,\n        pushRun: pushRun\n    };\n}\nexport default function sort(array, compare, lo, hi) {\n    if (!lo) {\n        lo = 0;\n    }\n    if (!hi) {\n        hi = array.length;\n    }\n    var remaining = hi - lo;\n    if (remaining < 2) {\n        return;\n    }\n    var runLength = 0;\n    if (remaining < DEFAULT_MIN_MERGE) {\n        runLength = makeAscendingRun(array, lo, hi, compare);\n        binaryInsertionSort(array, lo, hi, lo + runLength, compare);\n        return;\n    }\n    var ts = TimSort(array, compare);\n    var minRun = minRunLength(remaining);\n    do {\n        runLength = makeAscendingRun(array, lo, hi, compare);\n        if (runLength < minRun) {\n            var force = remaining;\n            if (force > minRun) {\n                force = minRun;\n            }\n            binaryInsertionSort(array, lo, lo + force, lo + runLength, compare);\n            runLength = force;\n        }\n        ts.pushRun(lo, runLength);\n        ts.mergeRuns();\n        remaining -= runLength;\n        lo += runLength;\n    } while (remaining !== 0);\n    ts.forceMergeRuns();\n}\n"],"names":["DEFAULT_MIN_MERGE","DEFAULT_MIN_GALLOPING","minRunLength","n","r","makeAscendingRun","array","lo","hi","compare","runHi","reverseRun","t","binaryInsertionSort","start","pivot","left","right","mid","gallopLeft","value","length","hint","lastOffset","maxOffset","offset","tmp","m","gallopRight","TimSort","minGallop","runStart","runLength","stackSize","pushRun","_runStart","_runLength","mergeRuns","mergeAt","forceMergeRuns","i","start1","length1","start2","length2","k","mergeLow","mergeHigh","cursor1","cursor2","dest","_minGallop","count1","count2","exit","customCursor","customDest","sort","remaining","ts","minRun","force"],"mappings":"AAAA,IAAIA,IAAoB,IACpBC,IAAwB;AAC5B,SAASC,EAAaC,GAAG;AAErB,WADIC,IAAI,GACDD,KAAKH;AACR,IAAAI,KAAKD,IAAI,GACTA,MAAM;AAEV,SAAOA,IAAIC;AACf;AACA,SAASC,EAAiBC,GAAOC,GAAIC,GAAIC,GAAS;AAC9C,MAAIC,IAAQH,IAAK;AACjB,MAAIG,MAAUF;AACV,WAAO;AAEX,MAAIC,EAAQH,EAAMI,GAAO,GAAGJ,EAAMC,CAAE,CAAC,IAAI,GAAG;AACxC,WAAOG,IAAQF,KAAMC,EAAQH,EAAMI,CAAK,GAAGJ,EAAMI,IAAQ,CAAC,CAAC,IAAI;AAC3D,MAAAA;AAEJ,IAAAC,EAAWL,GAAOC,GAAIG,CAAK;AAAA,EAC/B;AAEI,WAAOA,IAAQF,KAAMC,EAAQH,EAAMI,CAAK,GAAGJ,EAAMI,IAAQ,CAAC,CAAC,KAAK;AAC5D,MAAAA;AAGR,SAAOA,IAAQH;AACnB;AACA,SAASI,EAAWL,GAAOC,GAAIC,GAAI;AAE/B,OADAA,KACOD,IAAKC,KAAI;AACZ,QAAII,IAAIN,EAAMC,CAAE;AAChB,IAAAD,EAAMC,GAAI,IAAID,EAAME,CAAE,GACtBF,EAAME,GAAI,IAAII;AAAA,EAClB;AACJ;AACA,SAASC,EAAoBP,GAAOC,GAAIC,GAAIM,GAAOL,GAAS;AAIxD,OAHIK,MAAUP,KACVO,KAEGA,IAAQN,GAAIM,KAAS;AAKxB,aAJIC,IAAQT,EAAMQ,CAAK,GACnBE,IAAOT,GACPU,IAAQH,GACRI,GACGF,IAAOC;AACV,MAAAC,IAAMF,IAAOC,MAAU,GACnBR,EAAQM,GAAOT,EAAMY,CAAG,CAAC,IAAI,IAC7BD,IAAQC,IAGRF,IAAOE,IAAM;AAGrB,QAAIf,IAAIW,IAAQE;AAChB,YAAQb,GAAC;AAAA,MACL,KAAK;AACD,QAAAG,EAAMU,IAAO,CAAC,IAAIV,EAAMU,IAAO,CAAC;AAAA,MACpC,KAAK;AACD,QAAAV,EAAMU,IAAO,CAAC,IAAIV,EAAMU,IAAO,CAAC;AAAA,MACpC,KAAK;AACD,QAAAV,EAAMU,IAAO,CAAC,IAAIV,EAAMU,CAAI;AAC5B;AAAA,MACJ;AACI,eAAOb,IAAI;AACP,UAAAG,EAAMU,IAAOb,CAAC,IAAIG,EAAMU,IAAOb,IAAI,CAAC,GACpCA;AAAA,IAEpB;AACQ,IAAAG,EAAMU,CAAI,IAAID;AAAA,EAClB;AACJ;AACA,SAASI,EAAWC,GAAOd,GAAOQ,GAAOO,GAAQC,GAAMb,GAAS;AAC5D,MAAIc,IAAa,GACbC,IAAY,GACZC,IAAS;AACb,MAAIhB,EAAQW,GAAOd,EAAMQ,IAAQQ,CAAI,CAAC,IAAI,GAAG;AAEzC,SADAE,IAAYH,IAASC,GACdG,IAASD,KAAaf,EAAQW,GAAOd,EAAMQ,IAAQQ,IAAOG,CAAM,CAAC,IAAI;AACxE,MAAAF,IAAaE,GACbA,KAAUA,KAAU,KAAK,GACrBA,KAAU,MACVA,IAASD;AAGjB,IAAIC,IAASD,MACTC,IAASD,IAEbD,KAAcD,GACdG,KAAUH;AAAA,EACd,OACK;AAED,SADAE,IAAYF,IAAO,GACZG,IAASD,KAAaf,EAAQW,GAAOd,EAAMQ,IAAQQ,IAAOG,CAAM,CAAC,KAAK;AACzE,MAAAF,IAAaE,GACbA,KAAUA,KAAU,KAAK,GACrBA,KAAU,MACVA,IAASD;AAGjB,IAAIC,IAASD,MACTC,IAASD;AAEb,QAAIE,IAAMH;AACV,IAAAA,IAAaD,IAAOG,GACpBA,IAASH,IAAOI;AAAA,EACpB;AAEA,OADAH,KACOA,IAAaE,KAAQ;AACxB,QAAIE,IAAIJ,KAAcE,IAASF,MAAe;AAC9C,IAAId,EAAQW,GAAOd,EAAMQ,IAAQa,CAAC,CAAC,IAAI,IACnCJ,IAAaI,IAAI,IAGjBF,IAASE;AAAA,EAEjB;AACA,SAAOF;AACX;AACA,SAASG,EAAYR,GAAOd,GAAOQ,GAAOO,GAAQC,GAAMb,GAAS;AAC7D,MAAIc,IAAa,GACbC,IAAY,GACZC,IAAS;AACb,MAAIhB,EAAQW,GAAOd,EAAMQ,IAAQQ,CAAI,CAAC,IAAI,GAAG;AAEzC,SADAE,IAAYF,IAAO,GACZG,IAASD,KAAaf,EAAQW,GAAOd,EAAMQ,IAAQQ,IAAOG,CAAM,CAAC,IAAI;AACxE,MAAAF,IAAaE,GACbA,KAAUA,KAAU,KAAK,GACrBA,KAAU,MACVA,IAASD;AAGjB,IAAIC,IAASD,MACTC,IAASD;AAEb,QAAIE,IAAMH;AACV,IAAAA,IAAaD,IAAOG,GACpBA,IAASH,IAAOI;AAAA,EACpB,OACK;AAED,SADAF,IAAYH,IAASC,GACdG,IAASD,KAAaf,EAAQW,GAAOd,EAAMQ,IAAQQ,IAAOG,CAAM,CAAC,KAAK;AACzE,MAAAF,IAAaE,GACbA,KAAUA,KAAU,KAAK,GACrBA,KAAU,MACVA,IAASD;AAGjB,IAAIC,IAASD,MACTC,IAASD,IAEbD,KAAcD,GACdG,KAAUH;AAAA,EACd;AAEA,OADAC,KACOA,IAAaE,KAAQ;AACxB,QAAIE,IAAIJ,KAAcE,IAASF,MAAe;AAC9C,IAAId,EAAQW,GAAOd,EAAMQ,IAAQa,CAAC,CAAC,IAAI,IACnCF,IAASE,IAGTJ,IAAaI,IAAI;AAAA,EAEzB;AACA,SAAOF;AACX;AACA,SAASI,EAAQvB,GAAOG,GAAS;AAC7B,MAAIqB,IAAY7B,GACZ8B,GACAC,GACAC,IAAY,GACZP,IAAM,CAAA;AACV,EAAAK,IAAW,CAAA,GACXC,IAAY,CAAA;AACZ,WAASE,EAAQC,GAAWC,GAAY;AACpC,IAAAL,EAASE,CAAS,IAAIE,GACtBH,EAAUC,CAAS,IAAIG,GACvBH,KAAa;AAAA,EACjB;AACA,WAASI,IAAY;AACjB,WAAOJ,IAAY,KAAG;AAClB,UAAI9B,IAAI8B,IAAY;AACpB,UAAK9B,KAAK,KAAK6B,EAAU7B,IAAI,CAAC,KAAK6B,EAAU7B,CAAC,IAAI6B,EAAU7B,IAAI,CAAC,KACzDA,KAAK,KAAK6B,EAAU7B,IAAI,CAAC,KAAK6B,EAAU7B,CAAC,IAAI6B,EAAU7B,IAAI,CAAC;AAChE,QAAI6B,EAAU7B,IAAI,CAAC,IAAI6B,EAAU7B,IAAI,CAAC,KAClCA;AAAA,eAGC6B,EAAU7B,CAAC,IAAI6B,EAAU7B,IAAI,CAAC;AACnC;AAEJ,MAAAmC,EAAQnC,CAAC;AAAA,IACb;AAAA,EACJ;AACA,WAASoC,IAAiB;AACtB,WAAON,IAAY,KAAG;AAClB,UAAI9B,IAAI8B,IAAY;AACpB,MAAI9B,IAAI,KAAK6B,EAAU7B,IAAI,CAAC,IAAI6B,EAAU7B,IAAI,CAAC,KAC3CA,KAEJmC,EAAQnC,CAAC;AAAA,IACb;AAAA,EACJ;AACA,WAASmC,EAAQE,GAAG;AAChB,QAAIC,IAASV,EAASS,CAAC,GACnBE,IAAUV,EAAUQ,CAAC,GACrBG,IAASZ,EAASS,IAAI,CAAC,GACvBI,IAAUZ,EAAUQ,IAAI,CAAC;AAC7B,IAAAR,EAAUQ,CAAC,IAAIE,IAAUE,GACrBJ,MAAMP,IAAY,MAClBF,EAASS,IAAI,CAAC,IAAIT,EAASS,IAAI,CAAC,GAChCR,EAAUQ,IAAI,CAAC,IAAIR,EAAUQ,IAAI,CAAC,IAEtCP;AACA,QAAIY,IAAIjB,EAAYtB,EAAMqC,CAAM,GAAGrC,GAAOmC,GAAQC,GAAS,GAAGjC,CAAO;AAGrE,IAFAgC,KAAUI,GACVH,KAAWG,GACPH,MAAY,MAGhBE,IAAUzB,EAAWb,EAAMmC,IAASC,IAAU,CAAC,GAAGpC,GAAOqC,GAAQC,GAASA,IAAU,GAAGnC,CAAO,GAC1FmC,MAAY,MAGZF,KAAWE,IACXE,EAASL,GAAQC,GAASC,GAAQC,CAAO,IAGzCG,EAAUN,GAAQC,GAASC,GAAQC,CAAO;AAAA,EAElD;AACA,WAASE,EAASL,GAAQC,GAASC,GAAQC,GAAS;AAChD,QAAI,IAAI;AACR,SAAK,IAAI,GAAG,IAAIF,GAAS;AACrB,MAAAhB,EAAI,CAAC,IAAIpB,EAAMmC,IAAS,CAAC;AAE7B,QAAIO,IAAU,GACVC,IAAUN,GACVO,IAAOT;AAEX,QADAnC,EAAM4C,GAAM,IAAI5C,EAAM2C,GAAS,GAC3B,EAAEL,MAAY,GAAG;AACjB,WAAK,IAAI,GAAG,IAAIF,GAAS;AACrB,QAAApC,EAAM4C,IAAO,CAAC,IAAIxB,EAAIsB,IAAU,CAAC;AAErC;AAAA,IACJ;AACA,QAAIN,MAAY,GAAG;AACf,WAAK,IAAI,GAAG,IAAIE,GAAS;AACrB,QAAAtC,EAAM4C,IAAO,CAAC,IAAI5C,EAAM2C,IAAU,CAAC;AAEvC,MAAA3C,EAAM4C,IAAON,CAAO,IAAIlB,EAAIsB,CAAO;AACnC;AAAA,IACJ;AAKA,aAJIG,IAAarB,GACbsB,GACAC,GACAC,OACM;AACN,MAAAF,IAAS,GACTC,IAAS,GACTC,IAAO;AACP;AACI,YAAI7C,EAAQH,EAAM2C,CAAO,GAAGvB,EAAIsB,CAAO,CAAC,IAAI;AAIxC,cAHA1C,EAAM4C,GAAM,IAAI5C,EAAM2C,GAAS,GAC/BI,KACAD,IAAS,GACL,EAAER,MAAY,GAAG;AACjB,YAAAU,IAAO;AACP;AAAA,UACJ;AAAA,mBAGAhD,EAAM4C,GAAM,IAAIxB,EAAIsB,GAAS,GAC7BI,KACAC,IAAS,GACL,EAAEX,MAAY,GAAG;AACjB,UAAAY,IAAO;AACP;AAAA,QACJ;AAAA,cAEEF,IAASC,KAAUF;AAC7B,UAAIG;AACA;AAEJ,SAAG;AAEC,YADAF,IAASxB,EAAYtB,EAAM2C,CAAO,GAAGvB,GAAKsB,GAASN,GAAS,GAAGjC,CAAO,GAClE2C,MAAW,GAAG;AACd,eAAK,IAAI,GAAG,IAAIA,GAAQ;AACpB,YAAA9C,EAAM4C,IAAO,CAAC,IAAIxB,EAAIsB,IAAU,CAAC;AAKrC,cAHAE,KAAQE,GACRJ,KAAWI,GACXV,KAAWU,GACPV,KAAW,GAAG;AACd,YAAAY,IAAO;AACP;AAAA,UACJ;AAAA,QACJ;AAEA,YADAhD,EAAM4C,GAAM,IAAI5C,EAAM2C,GAAS,GAC3B,EAAEL,MAAY,GAAG;AACjB,UAAAU,IAAO;AACP;AAAA,QACJ;AAEA,YADAD,IAASlC,EAAWO,EAAIsB,CAAO,GAAG1C,GAAO2C,GAASL,GAAS,GAAGnC,CAAO,GACjE4C,MAAW,GAAG;AACd,eAAK,IAAI,GAAG,IAAIA,GAAQ;AACpB,YAAA/C,EAAM4C,IAAO,CAAC,IAAI5C,EAAM2C,IAAU,CAAC;AAKvC,cAHAC,KAAQG,GACRJ,KAAWI,GACXT,KAAWS,GACPT,MAAY,GAAG;AACf,YAAAU,IAAO;AACP;AAAA,UACJ;AAAA,QACJ;AAEA,YADAhD,EAAM4C,GAAM,IAAIxB,EAAIsB,GAAS,GACzB,EAAEN,MAAY,GAAG;AACjB,UAAAY,IAAO;AACP;AAAA,QACJ;AACA,QAAAH;AAAA,MACJ,SAASC,KAAUnD,KAAyBoD,KAAUpD;AACtD,UAAIqD;AACA;AAEJ,MAAIH,IAAa,MACbA,IAAa,IAEjBA,KAAc;AAAA,IAClB;AAGA,QAFArB,IAAYqB,GACZrB,IAAY,MAAMA,IAAY,IAC1BY,MAAY,GAAG;AACf,WAAK,IAAI,GAAG,IAAIE,GAAS;AACrB,QAAAtC,EAAM4C,IAAO,CAAC,IAAI5C,EAAM2C,IAAU,CAAC;AAEvC,MAAA3C,EAAM4C,IAAON,CAAO,IAAIlB,EAAIsB,CAAO;AAAA,IACvC,OACK;AAAA,UAAIN,MAAY;AACjB,cAAM,IAAI,MAAK;AAGf,WAAK,IAAI,GAAG,IAAIA,GAAS;AACrB,QAAApC,EAAM4C,IAAO,CAAC,IAAIxB,EAAIsB,IAAU,CAAC;AAAA;AAAA,EAG7C;AACA,WAASD,EAAUN,GAAQC,GAASC,GAAQC,GAAS;AACjD,QAAI,IAAI;AACR,SAAK,IAAI,GAAG,IAAIA,GAAS;AACrB,MAAAlB,EAAI,CAAC,IAAIpB,EAAMqC,IAAS,CAAC;AAE7B,QAAIK,IAAUP,IAASC,IAAU,GAC7BO,IAAUL,IAAU,GACpBM,IAAOP,IAASC,IAAU,GAC1BW,IAAe,GACfC,IAAa;AAEjB,QADAlD,EAAM4C,GAAM,IAAI5C,EAAM0C,GAAS,GAC3B,EAAEN,MAAY,GAAG;AAEjB,WADAa,IAAeL,KAAQN,IAAU,IAC5B,IAAI,GAAG,IAAIA,GAAS;AACrB,QAAAtC,EAAMiD,IAAe,CAAC,IAAI7B,EAAI,CAAC;AAEnC;AAAA,IACJ;AACA,QAAIkB,MAAY,GAAG;AAKf,WAJAM,KAAQR,GACRM,KAAWN,GACXc,IAAaN,IAAO,GACpBK,IAAeP,IAAU,GACpB,IAAIN,IAAU,GAAG,KAAK,GAAG;AAC1B,QAAApC,EAAMkD,IAAa,CAAC,IAAIlD,EAAMiD,IAAe,CAAC;AAElD,MAAAjD,EAAM4C,CAAI,IAAIxB,EAAIuB,CAAO;AACzB;AAAA,IACJ;AAEA,aADIE,IAAarB,OACJ;AACT,UAAIsB,IAAS,GACTC,IAAS,GACTC,IAAO;AACX;AACI,YAAI7C,EAAQiB,EAAIuB,CAAO,GAAG3C,EAAM0C,CAAO,CAAC,IAAI;AAIxC,cAHA1C,EAAM4C,GAAM,IAAI5C,EAAM0C,GAAS,GAC/BI,KACAC,IAAS,GACL,EAAEX,MAAY,GAAG;AACjB,YAAAY,IAAO;AACP;AAAA,UACJ;AAAA,mBAGAhD,EAAM4C,GAAM,IAAIxB,EAAIuB,GAAS,GAC7BI,KACAD,IAAS,GACL,EAAER,MAAY,GAAG;AACjB,UAAAU,IAAO;AACP;AAAA,QACJ;AAAA,cAEEF,IAASC,KAAUF;AAC7B,UAAIG;AACA;AAEJ,SAAG;AAEC,YADAF,IAASV,IAAUd,EAAYF,EAAIuB,CAAO,GAAG3C,GAAOmC,GAAQC,GAASA,IAAU,GAAGjC,CAAO,GACrF2C,MAAW,GAAG;AAMd,eALAF,KAAQE,GACRJ,KAAWI,GACXV,KAAWU,GACXI,IAAaN,IAAO,GACpBK,IAAeP,IAAU,GACpB,IAAII,IAAS,GAAG,KAAK,GAAG;AACzB,YAAA9C,EAAMkD,IAAa,CAAC,IAAIlD,EAAMiD,IAAe,CAAC;AAElD,cAAIb,MAAY,GAAG;AACf,YAAAY,IAAO;AACP;AAAA,UACJ;AAAA,QACJ;AAEA,YADAhD,EAAM4C,GAAM,IAAIxB,EAAIuB,GAAS,GACzB,EAAEL,MAAY,GAAG;AACjB,UAAAU,IAAO;AACP;AAAA,QACJ;AAEA,YADAD,IAAST,IAAUzB,EAAWb,EAAM0C,CAAO,GAAGtB,GAAK,GAAGkB,GAASA,IAAU,GAAGnC,CAAO,GAC/E4C,MAAW,GAAG;AAMd,eALAH,KAAQG,GACRJ,KAAWI,GACXT,KAAWS,GACXG,IAAaN,IAAO,GACpBK,IAAeN,IAAU,GACpB,IAAI,GAAG,IAAII,GAAQ;AACpB,YAAA/C,EAAMkD,IAAa,CAAC,IAAI9B,EAAI6B,IAAe,CAAC;AAEhD,cAAIX,KAAW,GAAG;AACd,YAAAU,IAAO;AACP;AAAA,UACJ;AAAA,QACJ;AAEA,YADAhD,EAAM4C,GAAM,IAAI5C,EAAM0C,GAAS,GAC3B,EAAEN,MAAY,GAAG;AACjB,UAAAY,IAAO;AACP;AAAA,QACJ;AACA,QAAAH;AAAA,MACJ,SAASC,KAAUnD,KAAyBoD,KAAUpD;AACtD,UAAIqD;AACA;AAEJ,MAAIH,IAAa,MACbA,IAAa,IAEjBA,KAAc;AAAA,IAClB;AAKA,QAJArB,IAAYqB,GACRrB,IAAY,MACZA,IAAY,IAEZc,MAAY,GAAG;AAKf,WAJAM,KAAQR,GACRM,KAAWN,GACXc,IAAaN,IAAO,GACpBK,IAAeP,IAAU,GACpB,IAAIN,IAAU,GAAG,KAAK,GAAG;AAC1B,QAAApC,EAAMkD,IAAa,CAAC,IAAIlD,EAAMiD,IAAe,CAAC;AAElD,MAAAjD,EAAM4C,CAAI,IAAIxB,EAAIuB,CAAO;AAAA,IAC7B,OACK;AAAA,UAAIL,MAAY;AACjB,cAAM,IAAI,MAAK;AAIf,WADAW,IAAeL,KAAQN,IAAU,IAC5B,IAAI,GAAG,IAAIA,GAAS;AACrB,QAAAtC,EAAMiD,IAAe,CAAC,IAAI7B,EAAI,CAAC;AAAA;AAAA,EAG3C;AACA,SAAO;AAAA,IACH,WAAWW;AAAA,IACX,gBAAgBE;AAAA,IAChB,SAASL;AAAA,EACjB;AACA;AACe,SAASuB,EAAKnD,GAAOG,GAASF,GAAIC,GAAI;AACjD,EAAKD,MACDA,IAAK,IAEJC,MACDA,IAAKF,EAAM;AAEf,MAAIoD,IAAYlD,IAAKD;AACrB,MAAI,EAAAmD,IAAY,IAGhB;AAAA,QAAI1B,IAAY;AAChB,QAAI0B,IAAY1D,GAAmB;AAC/B,MAAAgC,IAAY3B,EAAiBC,GAAOC,GAAIC,GAAIC,CAAO,GACnDI,EAAoBP,GAAOC,GAAIC,GAAID,IAAKyB,GAAWvB,CAAO;AAC1D;AAAA,IACJ;AACA,QAAIkD,IAAK9B,EAAQvB,GAAOG,CAAO,GAC3BmD,IAAS1D,EAAawD,CAAS;AACnC,OAAG;AAEC,UADA1B,IAAY3B,EAAiBC,GAAOC,GAAIC,GAAIC,CAAO,GAC/CuB,IAAY4B,GAAQ;AACpB,YAAIC,IAAQH;AACZ,QAAIG,IAAQD,MACRC,IAAQD,IAEZ/C,EAAoBP,GAAOC,GAAIA,IAAKsD,GAAOtD,IAAKyB,GAAWvB,CAAO,GAClEuB,IAAY6B;AAAA,MAChB;AACA,MAAAF,EAAG,QAAQpD,GAAIyB,CAAS,GACxB2B,EAAG,UAAS,GACZD,KAAa1B,GACbzB,KAAMyB;AAAA,IACV,SAAS0B,MAAc;AACvB,IAAAC,EAAG,eAAc;AAAA;AACrB;","x_google_ignoreList":[0]}