@hkyhy/marsun-components-core 0.1.5 → 0.1.8

package/dist/node_modules/zrender/lib/tool/morphPath.js

@@ -0,0 +1,320 @@
+import { cubicSubdivide as P } from "../core/curve.js";
+import z from "../graphic/Path.js";
+import { defaults as Q, map as w } from "../core/util.js";
+import { lerp as vr } from "../core/vector.js";
+import { clonePath as nr } from "./path.js";
+import ar from "../core/Transformable.js";
+import { split as er } from "./dividePath.js";
+import { pathToBezierCurves as O } from "./convertPath.js";
+function fr(v, r) {
+  var a = v.length, n = r.length;
+  if (a === n)
+    return [v, r];
+  for (var o = [], i = [], l = a < n ? v : r, e = Math.min(a, n), t = Math.abs(n - a) / 6, f = (e - 2) / 6, u = Math.ceil(t / f) + 1, d = [l[0], l[1]], c = t, h = 2; h < e; ) {
+    var I = l[h - 2], M = l[h - 1], C = l[h++], _ = l[h++], D = l[h++], T = l[h++], Z = l[h++], s = l[h++];
+    if (c <= 0) {
+      d.push(C, _, D, T, Z, s);
+      continue;
+    }
+    for (var g = Math.min(c, u - 1) + 1, R = 1; R <= g; R++) {
+      var E = R / g;
+      P(I, C, D, Z, E, o), P(M, _, T, s, E, i), I = o[3], M = i[3], d.push(o[1], i[1], o[2], i[2], I, M), C = o[5], _ = i[5], D = o[6], T = i[6];
+    }
+    c -= g - 1;
+  }
+  return l === v ? [d, r] : [v, d];
+}
+function j(v, r) {
+  for (var a = v.length, n = v[a - 2], o = v[a - 1], i = [], l = 0; l < r.length; )
+    i[l++] = n, i[l++] = o;
+  return i;
+}
+function or(v, r) {
+  for (var a, n, o, i = [], l = [], e = 0; e < Math.max(v.length, r.length); e++) {
+    var t = v[e], f = r[e], u = void 0, d = void 0;
+    t ? f ? (a = fr(t, f), u = a[0], d = a[1], n = u, o = d) : (d = j(o || t, t), u = t) : (u = j(n || f, f), d = f), i.push(u), l.push(d);
+  }
+  return [i, l];
+}
+function k(v) {
+  for (var r = 0, a = 0, n = 0, o = v.length, i = 0, l = o - 2; i < o; l = i, i += 2) {
+    var e = v[l], t = v[l + 1], f = v[i], u = v[i + 1], d = e * u - f * t;
+    r += d, a += (e + f) * d, n += (t + u) * d;
+  }
+  return r === 0 ? [v[0] || 0, v[1] || 0] : [a / r / 3, n / r / 3, r];
+}
+function lr(v, r, a, n) {
+  for (var o = (v.length - 2) / 6, i = 1 / 0, l = 0, e = v.length, t = e - 2, f = 0; f < o; f++) {
+    for (var u = f * 6, d = 0, c = 0; c < e; c += 2) {
+      var h = c === 0 ? u : (u + c - 2) % t + 2, I = v[h] - a[0], M = v[h + 1] - a[1], C = r[c] - n[0], _ = r[c + 1] - n[1], D = C - I, T = _ - M;
+      d += D * D + T * T;
+    }
+    d < i && (i = d, l = f);
+  }
+  return l;
+}
+function dr(v) {
+  for (var r = [], a = v.length, n = 0; n < a; n += 2)
+    r[n] = v[a - n - 2], r[n + 1] = v[a - n - 1];
+  return r;
+}
+function ir(v, r, a, n) {
+  for (var o = [], i, l = 0; l < v.length; l++) {
+    var e = v[l], t = r[l], f = k(e), u = k(t);
+    i == null && (i = f[2] < 0 != u[2] < 0);
+    var d = [], c = [], h = 0, I = 1 / 0, M = [], C = e.length;
+    i && (e = dr(e));
+    for (var _ = lr(e, t, f, u) * 6, D = C - 2, T = 0; T < D; T += 2) {
+      var Z = (_ + T) % D + 2;
+      d[T + 2] = e[Z] - f[0], d[T + 3] = e[Z + 1] - f[1];
+    }
+    d[0] = e[_] - f[0], d[1] = e[_ + 1] - f[1];
+    for (var s = n / a, g = -n / 2; g <= n / 2; g += s) {
+      for (var R = Math.sin(g), E = Math.cos(g), p = 0, T = 0; T < e.length; T += 2) {
+        var m = d[T], N = d[T + 1], y = t[T] - u[0], U = t[T + 1] - u[1], A = y * E - U * R, F = y * R + U * E;
+        M[T] = A, M[T + 1] = F;
+        var V = A - m, q = F - N;
+        p += V * V + q * q;
+      }
+      if (p < I) {
+        I = p, h = g;
+        for (var H = 0; H < M.length; H++)
+          c[H] = M[H];
+      }
+    }
+    o.push({
+      from: d,
+      to: c,
+      fromCp: f,
+      toCp: u,
+      rotation: -h
+    });
+  }
+  return o;
+}
+function X(v) {
+  return v.__isCombineMorphing;
+}
+var S = "__mOriginal_";
+function W(v, r, a) {
+  var n = S + r, o = v[n] || v[r];
+  v[n] || (v[n] = v[r]);
+  var i = a.replace, l = a.after, e = a.before;
+  v[r] = function() {
+    var t = arguments, f;
+    return e && e.apply(this, t), i ? f = i.apply(this, t) : f = o.apply(this, t), l && l.apply(this, t), f;
+  };
+}
+function G(v, r) {
+  var a = S + r;
+  v[a] && (v[r] = v[a], v[a] = null);
+}
+function x(v, r) {
+  for (var a = 0; a < v.length; a++)
+    for (var n = v[a], o = 0; o < n.length; ) {
+      var i = n[o], l = n[o + 1];
+      n[o++] = r[0] * i + r[2] * l + r[4], n[o++] = r[1] * i + r[3] * l + r[5];
+    }
+}
+function B(v, r) {
+  var a = v.getUpdatedPathProxy(), n = r.getUpdatedPathProxy(), o = or(O(a), O(n)), i = o[0], l = o[1], e = v.getComputedTransform(), t = r.getComputedTransform();
+  function f() {
+    this.transform = null;
+  }
+  e && x(i, e), t && x(l, t), W(r, "updateTransform", { replace: f }), r.transform = null;
+  var u = ir(i, l, 10, Math.PI), d = [];
+  W(r, "buildPath", { replace: function(c) {
+    for (var h = r.__morphT, I = 1 - h, M = [], C = 0; C < u.length; C++) {
+      var _ = u[C], D = _.from, T = _.to, Z = _.rotation * h, s = _.fromCp, g = _.toCp, R = Math.sin(Z), E = Math.cos(Z);
+      vr(M, s, g, h);
+      for (var p = 0; p < D.length; p += 2) {
+        var m = D[p], N = D[p + 1], y = T[p], U = T[p + 1], A = m * I + y * h, F = N * I + U * h;
+        d[p] = A * E - F * R + M[0], d[p + 1] = A * R + F * E + M[1];
+      }
+      var V = d[0], q = d[1];
+      c.moveTo(V, q);
+      for (var p = 2; p < D.length; ) {
+        var y = d[p++], U = d[p++], H = d[p++], L = d[p++], J = d[p++], K = d[p++];
+        V === y && q === U && H === J && L === K ? c.lineTo(J, K) : c.bezierCurveTo(y, U, H, L, J, K), V = J, q = K;
+      }
+    }
+  } });
+}
+function b(v, r, a) {
+  if (!v || !r)
+    return r;
+  var n = a.done, o = a.during;
+  B(v, r), r.__morphT = 0;
+  function i() {
+    G(r, "buildPath"), G(r, "updateTransform"), r.__morphT = -1, r.createPathProxy(), r.dirtyShape();
+  }
+  return r.animateTo({
+    __morphT: 1
+  }, Q({
+    during: function(l) {
+      r.dirtyShape(), o && o(l);
+    },
+    done: function() {
+      i(), n && n();
+    }
+  }, a)), r;
+}
+function tr(v, r, a, n, o, i) {
+  var l = 16;
+  v = o === a ? 0 : Math.round(32767 * (v - a) / (o - a)), r = i === n ? 0 : Math.round(32767 * (r - n) / (i - n));
+  for (var e = 0, t, f = (1 << l) / 2; f > 0; f /= 2) {
+    var u = 0, d = 0;
+    (v & f) > 0 && (u = 1), (r & f) > 0 && (d = 1), e += f * f * (3 * u ^ d), d === 0 && (u === 1 && (v = f - 1 - v, r = f - 1 - r), t = v, v = r, r = t);
+  }
+  return e;
+}
+function $(v) {
+  var r = 1 / 0, a = 1 / 0, n = -1 / 0, o = -1 / 0, i = w(v, function(e) {
+    var t = e.getBoundingRect(), f = e.getComputedTransform(), u = t.x + t.width / 2 + (f ? f[4] : 0), d = t.y + t.height / 2 + (f ? f[5] : 0);
+    return r = Math.min(u, r), a = Math.min(d, a), n = Math.max(u, n), o = Math.max(d, o), [u, d];
+  }), l = w(i, function(e, t) {
+    return {
+      cp: e,
+      z: tr(e[0], e[1], r, a, n, o),
+      path: v[t]
+    };
+  });
+  return l.sort(function(e, t) {
+    return e.z - t.z;
+  }).map(function(e) {
+    return e.path;
+  });
+}
+function rr(v) {
+  return er(v.path, v.count);
+}
+function Y() {
+  return {
+    fromIndividuals: [],
+    toIndividuals: [],
+    count: 0
+  };
+}
+function pr(v, r, a) {
+  var n = [];
+  function o(s) {
+    for (var g = 0; g < s.length; g++) {
+      var R = s[g];
+      X(R) ? o(R.childrenRef()) : R instanceof z && n.push(R);
+    }
+  }
+  o(v);
+  var i = n.length;
+  if (!i)
+    return Y();
+  var l = a.dividePath || rr, e = l({
+    path: r,
+    count: i
+  });
+  if (e.length !== i)
+    return console.error("Invalid morphing: unmatched splitted path"), Y();
+  n = $(n), e = $(e);
+  for (var t = a.done, f = a.during, u = a.individualDelay, d = new ar(), c = 0; c < i; c++) {
+    var h = n[c], I = e[c];
+    I.parent = r, I.copyTransform(d), u || B(h, I);
+  }
+  r.__isCombineMorphing = !0, r.childrenRef = function() {
+    return e;
+  };
+  function M(s) {
+    for (var g = 0; g < e.length; g++)
+      e[g].addSelfToZr(s);
+  }
+  W(r, "addSelfToZr", {
+    after: function(s) {
+      M(s);
+    }
+  }), W(r, "removeSelfFromZr", {
+    after: function(s) {
+      for (var g = 0; g < e.length; g++)
+        e[g].removeSelfFromZr(s);
+    }
+  });
+  function C() {
+    r.__isCombineMorphing = !1, r.__morphT = -1, r.childrenRef = null, G(r, "addSelfToZr"), G(r, "removeSelfFromZr");
+  }
+  var _ = e.length;
+  if (u)
+    for (var D = _, T = function() {
+      D--, D === 0 && (C(), t && t());
+    }, c = 0; c < _; c++) {
+      var Z = u ? Q({
+        delay: (a.delay || 0) + u(c, _, n[c], e[c]),
+        done: T
+      }, a) : a;
+      b(n[c], e[c], Z);
+    }
+  else
+    r.__morphT = 0, r.animateTo({
+      __morphT: 1
+    }, Q({
+      during: function(s) {
+        for (var g = 0; g < _; g++) {
+          var R = e[g];
+          R.__morphT = r.__morphT, R.dirtyShape();
+        }
+        f && f(s);
+      },
+      done: function() {
+        C();
+        for (var s = 0; s < v.length; s++)
+          G(v[s], "updateTransform");
+        t && t();
+      }
+    }, a));
+  return r.__zr && M(r.__zr), {
+    fromIndividuals: n,
+    toIndividuals: e,
+    count: _
+  };
+}
+function Ir(v, r, a) {
+  var n = r.length, o = [], i = a.dividePath || rr;
+  function l(h) {
+    for (var I = 0; I < h.length; I++) {
+      var M = h[I];
+      X(M) ? l(M.childrenRef()) : M instanceof z && o.push(M);
+    }
+  }
+  if (X(v)) {
+    l(v.childrenRef());
+    var e = o.length;
+    if (e < n)
+      for (var t = 0, f = e; f < n; f++)
+        o.push(nr(o[t++ % e]));
+    o.length = n;
+  } else {
+    o = i({ path: v, count: n });
+    for (var u = v.getComputedTransform(), f = 0; f < o.length; f++)
+      o[f].setLocalTransform(u);
+    if (o.length !== n)
+      return console.error("Invalid morphing: unmatched splitted path"), Y();
+  }
+  o = $(o), r = $(r);
+  for (var d = a.individualDelay, f = 0; f < n; f++) {
+    var c = d ? Q({
+      delay: (a.delay || 0) + d(f, n, o[f], r[f])
+    }, a) : a;
+    b(o[f], r[f], c);
+  }
+  return {
+    fromIndividuals: o,
+    toIndividuals: r,
+    count: r.length
+  };
+}
+export {
+  or as alignBezierCurves,
+  k as centroid,
+  pr as combineMorph,
+  er as defaultDividePath,
+  X as isCombineMorphing,
+  b as morphPath,
+  Ir as separateMorph
+};
+//# sourceMappingURL=morphPath.js.map

package/dist/node_modules/zrender/lib/tool/morphPath.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"morphPath.js","sources":["../../../../../node_modules/zrender/lib/tool/morphPath.js"],"sourcesContent":["import { cubicSubdivide } from '../core/curve.js';\nimport Path from '../graphic/Path.js';\nimport { defaults, map } from '../core/util.js';\nimport { lerp } from '../core/vector.js';\nimport { clonePath } from './path.js';\nimport Transformable from '../core/Transformable.js';\nimport { split } from './dividePath.js';\nimport { pathToBezierCurves } from './convertPath.js';\nfunction alignSubpath(subpath1, subpath2) {\n    var len1 = subpath1.length;\n    var len2 = subpath2.length;\n    if (len1 === len2) {\n        return [subpath1, subpath2];\n    }\n    var tmpSegX = [];\n    var tmpSegY = [];\n    var shorterPath = len1 < len2 ? subpath1 : subpath2;\n    var shorterLen = Math.min(len1, len2);\n    var diff = Math.abs(len2 - len1) / 6;\n    var shorterBezierCount = (shorterLen - 2) / 6;\n    var eachCurveSubDivCount = Math.ceil(diff / shorterBezierCount) + 1;\n    var newSubpath = [shorterPath[0], shorterPath[1]];\n    var remained = diff;\n    for (var i = 2; i < shorterLen;) {\n        var x0 = shorterPath[i - 2];\n        var y0 = shorterPath[i - 1];\n        var x1 = shorterPath[i++];\n        var y1 = shorterPath[i++];\n        var x2 = shorterPath[i++];\n        var y2 = shorterPath[i++];\n        var x3 = shorterPath[i++];\n        var y3 = shorterPath[i++];\n        if (remained <= 0) {\n            newSubpath.push(x1, y1, x2, y2, x3, y3);\n            continue;\n        }\n        var actualSubDivCount = Math.min(remained, eachCurveSubDivCount - 1) + 1;\n        for (var k = 1; k <= actualSubDivCount; k++) {\n            var p = k / actualSubDivCount;\n            cubicSubdivide(x0, x1, x2, x3, p, tmpSegX);\n            cubicSubdivide(y0, y1, y2, y3, p, tmpSegY);\n            x0 = tmpSegX[3];\n            y0 = tmpSegY[3];\n            newSubpath.push(tmpSegX[1], tmpSegY[1], tmpSegX[2], tmpSegY[2], x0, y0);\n            x1 = tmpSegX[5];\n            y1 = tmpSegY[5];\n            x2 = tmpSegX[6];\n            y2 = tmpSegY[6];\n        }\n        remained -= actualSubDivCount - 1;\n    }\n    return shorterPath === subpath1 ? [newSubpath, subpath2] : [subpath1, newSubpath];\n}\nfunction createSubpath(lastSubpathSubpath, otherSubpath) {\n    var len = lastSubpathSubpath.length;\n    var lastX = lastSubpathSubpath[len - 2];\n    var lastY = lastSubpathSubpath[len - 1];\n    var newSubpath = [];\n    for (var i = 0; i < otherSubpath.length;) {\n        newSubpath[i++] = lastX;\n        newSubpath[i++] = lastY;\n    }\n    return newSubpath;\n}\nexport function alignBezierCurves(array1, array2) {\n    var _a;\n    var lastSubpath1;\n    var lastSubpath2;\n    var newArray1 = [];\n    var newArray2 = [];\n    for (var i = 0; i < Math.max(array1.length, array2.length); i++) {\n        var subpath1 = array1[i];\n        var subpath2 = array2[i];\n        var newSubpath1 = void 0;\n        var newSubpath2 = void 0;\n        if (!subpath1) {\n            newSubpath1 = createSubpath(lastSubpath1 || subpath2, subpath2);\n            newSubpath2 = subpath2;\n        }\n        else if (!subpath2) {\n            newSubpath2 = createSubpath(lastSubpath2 || subpath1, subpath1);\n            newSubpath1 = subpath1;\n        }\n        else {\n            _a = alignSubpath(subpath1, subpath2), newSubpath1 = _a[0], newSubpath2 = _a[1];\n            lastSubpath1 = newSubpath1;\n            lastSubpath2 = newSubpath2;\n        }\n        newArray1.push(newSubpath1);\n        newArray2.push(newSubpath2);\n    }\n    return [newArray1, newArray2];\n}\nexport function centroid(array) {\n    var signedArea = 0;\n    var cx = 0;\n    var cy = 0;\n    var len = array.length;\n    for (var i = 0, j = len - 2; i < len; j = i, i += 2) {\n        var x0 = array[j];\n        var y0 = array[j + 1];\n        var x1 = array[i];\n        var y1 = array[i + 1];\n        var a = x0 * y1 - x1 * y0;\n        signedArea += a;\n        cx += (x0 + x1) * a;\n        cy += (y0 + y1) * a;\n    }\n    if (signedArea === 0) {\n        return [array[0] || 0, array[1] || 0];\n    }\n    return [cx / signedArea / 3, cy / signedArea / 3, signedArea];\n}\nfunction findBestRingOffset(fromSubBeziers, toSubBeziers, fromCp, toCp) {\n    var bezierCount = (fromSubBeziers.length - 2) / 6;\n    var bestScore = Infinity;\n    var bestOffset = 0;\n    var len = fromSubBeziers.length;\n    var len2 = len - 2;\n    for (var offset = 0; offset < bezierCount; offset++) {\n        var cursorOffset = offset * 6;\n        var score = 0;\n        for (var k = 0; k < len; k += 2) {\n            var idx = k === 0 ? cursorOffset : ((cursorOffset + k - 2) % len2 + 2);\n            var x0 = fromSubBeziers[idx] - fromCp[0];\n            var y0 = fromSubBeziers[idx + 1] - fromCp[1];\n            var x1 = toSubBeziers[k] - toCp[0];\n            var y1 = toSubBeziers[k + 1] - toCp[1];\n            var dx = x1 - x0;\n            var dy = y1 - y0;\n            score += dx * dx + dy * dy;\n        }\n        if (score < bestScore) {\n            bestScore = score;\n            bestOffset = offset;\n        }\n    }\n    return bestOffset;\n}\nfunction reverse(array) {\n    var newArr = [];\n    var len = array.length;\n    for (var i = 0; i < len; i += 2) {\n        newArr[i] = array[len - i - 2];\n        newArr[i + 1] = array[len - i - 1];\n    }\n    return newArr;\n}\nfunction findBestMorphingRotation(fromArr, toArr, searchAngleIteration, searchAngleRange) {\n    var result = [];\n    var fromNeedsReverse;\n    for (var i = 0; i < fromArr.length; i++) {\n        var fromSubpathBezier = fromArr[i];\n        var toSubpathBezier = toArr[i];\n        var fromCp = centroid(fromSubpathBezier);\n        var toCp = centroid(toSubpathBezier);\n        if (fromNeedsReverse == null) {\n            fromNeedsReverse = fromCp[2] < 0 !== toCp[2] < 0;\n        }\n        var newFromSubpathBezier = [];\n        var newToSubpathBezier = [];\n        var bestAngle = 0;\n        var bestScore = Infinity;\n        var tmpArr = [];\n        var len = fromSubpathBezier.length;\n        if (fromNeedsReverse) {\n            fromSubpathBezier = reverse(fromSubpathBezier);\n        }\n        var offset = findBestRingOffset(fromSubpathBezier, toSubpathBezier, fromCp, toCp) * 6;\n        var len2 = len - 2;\n        for (var k = 0; k < len2; k += 2) {\n            var idx = (offset + k) % len2 + 2;\n            newFromSubpathBezier[k + 2] = fromSubpathBezier[idx] - fromCp[0];\n            newFromSubpathBezier[k + 3] = fromSubpathBezier[idx + 1] - fromCp[1];\n        }\n        newFromSubpathBezier[0] = fromSubpathBezier[offset] - fromCp[0];\n        newFromSubpathBezier[1] = fromSubpathBezier[offset + 1] - fromCp[1];\n        if (searchAngleIteration > 0) {\n            var step = searchAngleRange / searchAngleIteration;\n            for (var angle = -searchAngleRange / 2; angle <= searchAngleRange / 2; angle += step) {\n                var sa = Math.sin(angle);\n                var ca = Math.cos(angle);\n                var score = 0;\n                for (var k = 0; k < fromSubpathBezier.length; k += 2) {\n                    var x0 = newFromSubpathBezier[k];\n                    var y0 = newFromSubpathBezier[k + 1];\n                    var x1 = toSubpathBezier[k] - toCp[0];\n                    var y1 = toSubpathBezier[k + 1] - toCp[1];\n                    var newX1 = x1 * ca - y1 * sa;\n                    var newY1 = x1 * sa + y1 * ca;\n                    tmpArr[k] = newX1;\n                    tmpArr[k + 1] = newY1;\n                    var dx = newX1 - x0;\n                    var dy = newY1 - y0;\n                    score += dx * dx + dy * dy;\n                }\n                if (score < bestScore) {\n                    bestScore = score;\n                    bestAngle = angle;\n                    for (var m = 0; m < tmpArr.length; m++) {\n                        newToSubpathBezier[m] = tmpArr[m];\n                    }\n                }\n            }\n        }\n        else {\n            for (var i_1 = 0; i_1 < len; i_1 += 2) {\n                newToSubpathBezier[i_1] = toSubpathBezier[i_1] - toCp[0];\n                newToSubpathBezier[i_1 + 1] = toSubpathBezier[i_1 + 1] - toCp[1];\n            }\n        }\n        result.push({\n            from: newFromSubpathBezier,\n            to: newToSubpathBezier,\n            fromCp: fromCp,\n            toCp: toCp,\n            rotation: -bestAngle\n        });\n    }\n    return result;\n}\nexport function isCombineMorphing(path) {\n    return path.__isCombineMorphing;\n}\nexport function isMorphing(el) {\n    return el.__morphT >= 0;\n}\nvar SAVED_METHOD_PREFIX = '__mOriginal_';\nfunction saveAndModifyMethod(obj, methodName, modifiers) {\n    var savedMethodName = SAVED_METHOD_PREFIX + methodName;\n    var originalMethod = obj[savedMethodName] || obj[methodName];\n    if (!obj[savedMethodName]) {\n        obj[savedMethodName] = obj[methodName];\n    }\n    var replace = modifiers.replace;\n    var after = modifiers.after;\n    var before = modifiers.before;\n    obj[methodName] = function () {\n        var args = arguments;\n        var res;\n        before && before.apply(this, args);\n        if (replace) {\n            res = replace.apply(this, args);\n        }\n        else {\n            res = originalMethod.apply(this, args);\n        }\n        after && after.apply(this, args);\n        return res;\n    };\n}\nfunction restoreMethod(obj, methodName) {\n    var savedMethodName = SAVED_METHOD_PREFIX + methodName;\n    if (obj[savedMethodName]) {\n        obj[methodName] = obj[savedMethodName];\n        obj[savedMethodName] = null;\n    }\n}\nfunction applyTransformOnBeziers(bezierCurves, mm) {\n    for (var i = 0; i < bezierCurves.length; i++) {\n        var subBeziers = bezierCurves[i];\n        for (var k = 0; k < subBeziers.length;) {\n            var x = subBeziers[k];\n            var y = subBeziers[k + 1];\n            subBeziers[k++] = mm[0] * x + mm[2] * y + mm[4];\n            subBeziers[k++] = mm[1] * x + mm[3] * y + mm[5];\n        }\n    }\n}\nfunction prepareMorphPath(fromPath, toPath) {\n    var fromPathProxy = fromPath.getUpdatedPathProxy();\n    var toPathProxy = toPath.getUpdatedPathProxy();\n    var _a = alignBezierCurves(pathToBezierCurves(fromPathProxy), pathToBezierCurves(toPathProxy)), fromBezierCurves = _a[0], toBezierCurves = _a[1];\n    var fromPathTransform = fromPath.getComputedTransform();\n    var toPathTransform = toPath.getComputedTransform();\n    function updateIdentityTransform() {\n        this.transform = null;\n    }\n    fromPathTransform && applyTransformOnBeziers(fromBezierCurves, fromPathTransform);\n    toPathTransform && applyTransformOnBeziers(toBezierCurves, toPathTransform);\n    saveAndModifyMethod(toPath, 'updateTransform', { replace: updateIdentityTransform });\n    toPath.transform = null;\n    var morphingData = findBestMorphingRotation(fromBezierCurves, toBezierCurves, 10, Math.PI);\n    var tmpArr = [];\n    saveAndModifyMethod(toPath, 'buildPath', { replace: function (path) {\n            var t = toPath.__morphT;\n            var onet = 1 - t;\n            var newCp = [];\n            for (var i = 0; i < morphingData.length; i++) {\n                var item = morphingData[i];\n                var from = item.from;\n                var to = item.to;\n                var angle = item.rotation * t;\n                var fromCp = item.fromCp;\n                var toCp = item.toCp;\n                var sa = Math.sin(angle);\n                var ca = Math.cos(angle);\n                lerp(newCp, fromCp, toCp, t);\n                for (var m = 0; m < from.length; m += 2) {\n                    var x0_1 = from[m];\n                    var y0_1 = from[m + 1];\n                    var x1 = to[m];\n                    var y1 = to[m + 1];\n                    var x = x0_1 * onet + x1 * t;\n                    var y = y0_1 * onet + y1 * t;\n                    tmpArr[m] = (x * ca - y * sa) + newCp[0];\n                    tmpArr[m + 1] = (x * sa + y * ca) + newCp[1];\n                }\n                var x0 = tmpArr[0];\n                var y0 = tmpArr[1];\n                path.moveTo(x0, y0);\n                for (var m = 2; m < from.length;) {\n                    var x1 = tmpArr[m++];\n                    var y1 = tmpArr[m++];\n                    var x2 = tmpArr[m++];\n                    var y2 = tmpArr[m++];\n                    var x3 = tmpArr[m++];\n                    var y3 = tmpArr[m++];\n                    if (x0 === x1 && y0 === y1 && x2 === x3 && y2 === y3) {\n                        path.lineTo(x3, y3);\n                    }\n                    else {\n                        path.bezierCurveTo(x1, y1, x2, y2, x3, y3);\n                    }\n                    x0 = x3;\n                    y0 = y3;\n                }\n            }\n        } });\n}\nexport function morphPath(fromPath, toPath, animationOpts) {\n    if (!fromPath || !toPath) {\n        return toPath;\n    }\n    var oldDone = animationOpts.done;\n    var oldDuring = animationOpts.during;\n    prepareMorphPath(fromPath, toPath);\n    toPath.__morphT = 0;\n    function restoreToPath() {\n        restoreMethod(toPath, 'buildPath');\n        restoreMethod(toPath, 'updateTransform');\n        toPath.__morphT = -1;\n        toPath.createPathProxy();\n        toPath.dirtyShape();\n    }\n    toPath.animateTo({\n        __morphT: 1\n    }, defaults({\n        during: function (p) {\n            toPath.dirtyShape();\n            oldDuring && oldDuring(p);\n        },\n        done: function () {\n            restoreToPath();\n            oldDone && oldDone();\n        }\n    }, animationOpts));\n    return toPath;\n}\nfunction hilbert(x, y, minX, minY, maxX, maxY) {\n    var bits = 16;\n    x = (maxX === minX) ? 0 : Math.round(32767 * (x - minX) / (maxX - minX));\n    y = (maxY === minY) ? 0 : Math.round(32767 * (y - minY) / (maxY - minY));\n    var d = 0;\n    var tmp;\n    for (var s = (1 << bits) / 2; s > 0; s /= 2) {\n        var rx = 0;\n        var ry = 0;\n        if ((x & s) > 0) {\n            rx = 1;\n        }\n        if ((y & s) > 0) {\n            ry = 1;\n        }\n        d += s * s * ((3 * rx) ^ ry);\n        if (ry === 0) {\n            if (rx === 1) {\n                x = s - 1 - x;\n                y = s - 1 - y;\n            }\n            tmp = x;\n            x = y;\n            y = tmp;\n        }\n    }\n    return d;\n}\nfunction sortPaths(pathList) {\n    var xMin = Infinity;\n    var yMin = Infinity;\n    var xMax = -Infinity;\n    var yMax = -Infinity;\n    var cps = map(pathList, function (path) {\n        var rect = path.getBoundingRect();\n        var m = path.getComputedTransform();\n        var x = rect.x + rect.width / 2 + (m ? m[4] : 0);\n        var y = rect.y + rect.height / 2 + (m ? m[5] : 0);\n        xMin = Math.min(x, xMin);\n        yMin = Math.min(y, yMin);\n        xMax = Math.max(x, xMax);\n        yMax = Math.max(y, yMax);\n        return [x, y];\n    });\n    var items = map(cps, function (cp, idx) {\n        return {\n            cp: cp,\n            z: hilbert(cp[0], cp[1], xMin, yMin, xMax, yMax),\n            path: pathList[idx]\n        };\n    });\n    return items.sort(function (a, b) { return a.z - b.z; }).map(function (item) { return item.path; });\n}\n;\nfunction defaultDividePath(param) {\n    return split(param.path, param.count);\n}\nfunction createEmptyReturn() {\n    return {\n        fromIndividuals: [],\n        toIndividuals: [],\n        count: 0\n    };\n}\nexport function combineMorph(fromList, toPath, animationOpts) {\n    var fromPathList = [];\n    function addFromPath(fromList) {\n        for (var i = 0; i < fromList.length; i++) {\n            var from = fromList[i];\n            if (isCombineMorphing(from)) {\n                addFromPath(from.childrenRef());\n            }\n            else if (from instanceof Path) {\n                fromPathList.push(from);\n            }\n        }\n    }\n    addFromPath(fromList);\n    var separateCount = fromPathList.length;\n    if (!separateCount) {\n        return createEmptyReturn();\n    }\n    var dividePath = animationOpts.dividePath || defaultDividePath;\n    var toSubPathList = dividePath({\n        path: toPath, count: separateCount\n    });\n    if (toSubPathList.length !== separateCount) {\n        console.error('Invalid morphing: unmatched splitted path');\n        return createEmptyReturn();\n    }\n    fromPathList = sortPaths(fromPathList);\n    toSubPathList = sortPaths(toSubPathList);\n    var oldDone = animationOpts.done;\n    var oldDuring = animationOpts.during;\n    var individualDelay = animationOpts.individualDelay;\n    var identityTransform = new Transformable();\n    for (var i = 0; i < separateCount; i++) {\n        var from = fromPathList[i];\n        var to = toSubPathList[i];\n        to.parent = toPath;\n        to.copyTransform(identityTransform);\n        if (!individualDelay) {\n            prepareMorphPath(from, to);\n        }\n    }\n    toPath.__isCombineMorphing = true;\n    toPath.childrenRef = function () {\n        return toSubPathList;\n    };\n    function addToSubPathListToZr(zr) {\n        for (var i = 0; i < toSubPathList.length; i++) {\n            toSubPathList[i].addSelfToZr(zr);\n        }\n    }\n    saveAndModifyMethod(toPath, 'addSelfToZr', {\n        after: function (zr) {\n            addToSubPathListToZr(zr);\n        }\n    });\n    saveAndModifyMethod(toPath, 'removeSelfFromZr', {\n        after: function (zr) {\n            for (var i = 0; i < toSubPathList.length; i++) {\n                toSubPathList[i].removeSelfFromZr(zr);\n            }\n        }\n    });\n    function restoreToPath() {\n        toPath.__isCombineMorphing = false;\n        toPath.__morphT = -1;\n        toPath.childrenRef = null;\n        restoreMethod(toPath, 'addSelfToZr');\n        restoreMethod(toPath, 'removeSelfFromZr');\n    }\n    var toLen = toSubPathList.length;\n    if (individualDelay) {\n        var animating_1 = toLen;\n        var eachDone = function () {\n            animating_1--;\n            if (animating_1 === 0) {\n                restoreToPath();\n                oldDone && oldDone();\n            }\n        };\n        for (var i = 0; i < toLen; i++) {\n            var indivdualAnimationOpts = individualDelay ? defaults({\n                delay: (animationOpts.delay || 0) + individualDelay(i, toLen, fromPathList[i], toSubPathList[i]),\n                done: eachDone\n            }, animationOpts) : animationOpts;\n            morphPath(fromPathList[i], toSubPathList[i], indivdualAnimationOpts);\n        }\n    }\n    else {\n        toPath.__morphT = 0;\n        toPath.animateTo({\n            __morphT: 1\n        }, defaults({\n            during: function (p) {\n                for (var i = 0; i < toLen; i++) {\n                    var child = toSubPathList[i];\n                    child.__morphT = toPath.__morphT;\n                    child.dirtyShape();\n                }\n                oldDuring && oldDuring(p);\n            },\n            done: function () {\n                restoreToPath();\n                for (var i = 0; i < fromList.length; i++) {\n                    restoreMethod(fromList[i], 'updateTransform');\n                }\n                oldDone && oldDone();\n            }\n        }, animationOpts));\n    }\n    if (toPath.__zr) {\n        addToSubPathListToZr(toPath.__zr);\n    }\n    return {\n        fromIndividuals: fromPathList,\n        toIndividuals: toSubPathList,\n        count: toLen\n    };\n}\nexport function separateMorph(fromPath, toPathList, animationOpts) {\n    var toLen = toPathList.length;\n    var fromPathList = [];\n    var dividePath = animationOpts.dividePath || defaultDividePath;\n    function addFromPath(fromList) {\n        for (var i = 0; i < fromList.length; i++) {\n            var from = fromList[i];\n            if (isCombineMorphing(from)) {\n                addFromPath(from.childrenRef());\n            }\n            else if (from instanceof Path) {\n                fromPathList.push(from);\n            }\n        }\n    }\n    if (isCombineMorphing(fromPath)) {\n        addFromPath(fromPath.childrenRef());\n        var fromLen = fromPathList.length;\n        if (fromLen < toLen) {\n            var k = 0;\n            for (var i = fromLen; i < toLen; i++) {\n                fromPathList.push(clonePath(fromPathList[k++ % fromLen]));\n            }\n        }\n        fromPathList.length = toLen;\n    }\n    else {\n        fromPathList = dividePath({ path: fromPath, count: toLen });\n        var fromPathTransform = fromPath.getComputedTransform();\n        for (var i = 0; i < fromPathList.length; i++) {\n            fromPathList[i].setLocalTransform(fromPathTransform);\n        }\n        if (fromPathList.length !== toLen) {\n            console.error('Invalid morphing: unmatched splitted path');\n            return createEmptyReturn();\n        }\n    }\n    fromPathList = sortPaths(fromPathList);\n    toPathList = sortPaths(toPathList);\n    var individualDelay = animationOpts.individualDelay;\n    for (var i = 0; i < toLen; i++) {\n        var indivdualAnimationOpts = individualDelay ? defaults({\n            delay: (animationOpts.delay || 0) + individualDelay(i, toLen, fromPathList[i], toPathList[i])\n        }, animationOpts) : animationOpts;\n        morphPath(fromPathList[i], toPathList[i], indivdualAnimationOpts);\n    }\n    return {\n        fromIndividuals: fromPathList,\n        toIndividuals: toPathList,\n        count: toPathList.length\n    };\n}\nexport { split as defaultDividePath };\n"],"names":["alignSubpath","subpath1","subpath2","len1","len2","tmpSegX","tmpSegY","shorterPath","shorterLen","diff","shorterBezierCount","eachCurveSubDivCount","newSubpath","remained","i","x0","y0","x1","y1","x2","y2","x3","y3","actualSubDivCount","k","p","cubicSubdivide","createSubpath","lastSubpathSubpath","otherSubpath","len","lastX","lastY","alignBezierCurves","array1","array2","_a","lastSubpath1","lastSubpath2","newArray1","newArray2","newSubpath1","newSubpath2","centroid","array","signedArea","cx","cy","j","a","findBestRingOffset","fromSubBeziers","toSubBeziers","fromCp","toCp","bezierCount","bestScore","bestOffset","offset","cursorOffset","score","idx","dx","dy","reverse","newArr","findBestMorphingRotation","fromArr","toArr","searchAngleIteration","searchAngleRange","result","fromNeedsReverse","fromSubpathBezier","toSubpathBezier","newFromSubpathBezier","newToSubpathBezier","bestAngle","tmpArr","step","angle","sa","ca","newX1","newY1","m","isCombineMorphing","path","SAVED_METHOD_PREFIX","saveAndModifyMethod","obj","methodName","modifiers","savedMethodName","originalMethod","replace","after","before","args","res","restoreMethod","applyTransformOnBeziers","bezierCurves","mm","subBeziers","x","y","prepareMorphPath","fromPath","toPath","fromPathProxy","toPathProxy","pathToBezierCurves","fromBezierCurves","toBezierCurves","fromPathTransform","toPathTransform","updateIdentityTransform","morphingData","t","onet","newCp","item","from","to","lerp","x0_1","y0_1","morphPath","animationOpts","oldDone","oldDuring","restoreToPath","defaults","hilbert","minX","minY","maxX","maxY","bits","d","tmp","s","rx","ry","sortPaths","pathList","xMin","yMin","xMax","yMax","cps","map","rect","items","cp","b","defaultDividePath","param","split","createEmptyReturn","combineMorph","fromList","fromPathList","addFromPath","Path","separateCount","dividePath","toSubPathList","individualDelay","identityTransform","Transformable","addToSubPathListToZr","zr","toLen","animating_1","eachDone","indivdualAnimationOpts","child","separateMorph","toPathList","fromLen","clonePath"],"mappings":";;;;;;;;AAQA,SAASA,GAAaC,GAAUC,GAAU;AACtC,MAAIC,IAAOF,EAAS,QAChBG,IAAOF,EAAS;AACpB,MAAIC,MAASC;AACT,WAAO,CAACH,GAAUC,CAAQ;AAW9B,WATIG,IAAU,CAAA,GACVC,IAAU,CAAA,GACVC,IAAcJ,IAAOC,IAAOH,IAAWC,GACvCM,IAAa,KAAK,IAAIL,GAAMC,CAAI,GAChCK,IAAO,KAAK,IAAIL,IAAOD,CAAI,IAAI,GAC/BO,KAAsBF,IAAa,KAAK,GACxCG,IAAuB,KAAK,KAAKF,IAAOC,CAAkB,IAAI,GAC9DE,IAAa,CAACL,EAAY,CAAC,GAAGA,EAAY,CAAC,CAAC,GAC5CM,IAAWJ,GACNK,IAAI,GAAGA,IAAIN,KAAa;AAC7B,QAAIO,IAAKR,EAAYO,IAAI,CAAC,GACtBE,IAAKT,EAAYO,IAAI,CAAC,GACtBG,IAAKV,EAAYO,GAAG,GACpBI,IAAKX,EAAYO,GAAG,GACpBK,IAAKZ,EAAYO,GAAG,GACpBM,IAAKb,EAAYO,GAAG,GACpBO,IAAKd,EAAYO,GAAG,GACpBQ,IAAKf,EAAYO,GAAG;AACxB,QAAID,KAAY,GAAG;AACf,MAAAD,EAAW,KAAKK,GAAIC,GAAIC,GAAIC,GAAIC,GAAIC,CAAE;AACtC;AAAA,IACJ;AAEA,aADIC,IAAoB,KAAK,IAAIV,GAAUF,IAAuB,CAAC,IAAI,GAC9Da,IAAI,GAAGA,KAAKD,GAAmBC,KAAK;AACzC,UAAIC,IAAID,IAAID;AACZ,MAAAG,EAAeX,GAAIE,GAAIE,GAAIE,GAAII,GAAGpB,CAAO,GACzCqB,EAAeV,GAAIE,GAAIE,GAAIE,GAAIG,GAAGnB,CAAO,GACzCS,IAAKV,EAAQ,CAAC,GACdW,IAAKV,EAAQ,CAAC,GACdM,EAAW,KAAKP,EAAQ,CAAC,GAAGC,EAAQ,CAAC,GAAGD,EAAQ,CAAC,GAAGC,EAAQ,CAAC,GAAGS,GAAIC,CAAE,GACtEC,IAAKZ,EAAQ,CAAC,GACda,IAAKZ,EAAQ,CAAC,GACda,IAAKd,EAAQ,CAAC,GACde,IAAKd,EAAQ,CAAC;AAAA,IAClB;AACA,IAAAO,KAAYU,IAAoB;AAAA,EACpC;AACA,SAAOhB,MAAgBN,IAAW,CAACW,GAAYV,CAAQ,IAAI,CAACD,GAAUW,CAAU;AACpF;AACA,SAASe,EAAcC,GAAoBC,GAAc;AAKrD,WAJIC,IAAMF,EAAmB,QACzBG,IAAQH,EAAmBE,IAAM,CAAC,GAClCE,IAAQJ,EAAmBE,IAAM,CAAC,GAClClB,IAAa,CAAA,GACRE,IAAI,GAAGA,IAAIe,EAAa;AAC7B,IAAAjB,EAAWE,GAAG,IAAIiB,GAClBnB,EAAWE,GAAG,IAAIkB;AAEtB,SAAOpB;AACX;AACO,SAASqB,GAAkBC,GAAQC,GAAQ;AAM9C,WALIC,GACAC,GACAC,GACAC,IAAY,CAAA,GACZC,IAAY,CAAA,GACP1B,IAAI,GAAGA,IAAI,KAAK,IAAIoB,EAAO,QAAQC,EAAO,MAAM,GAAGrB,KAAK;AAC7D,QAAIb,IAAWiC,EAAOpB,CAAC,GACnBZ,IAAWiC,EAAOrB,CAAC,GACnB2B,IAAc,QACdC,IAAc;AAClB,IAAKzC,IAIKC,KAKNkC,IAAKpC,GAAaC,GAAUC,CAAQ,GAAGuC,IAAcL,EAAG,CAAC,GAAGM,IAAcN,EAAG,CAAC,GAC9EC,IAAeI,GACfH,IAAeI,MANfA,IAAcf,EAAcW,KAAgBrC,GAAUA,CAAQ,GAC9DwC,IAAcxC,MALdwC,IAAcd,EAAcU,KAAgBnC,GAAUA,CAAQ,GAC9DwC,IAAcxC,IAWlBqC,EAAU,KAAKE,CAAW,GAC1BD,EAAU,KAAKE,CAAW;AAAA,EAC9B;AACA,SAAO,CAACH,GAAWC,CAAS;AAChC;AACO,SAASG,EAASC,GAAO;AAK5B,WAJIC,IAAa,GACbC,IAAK,GACLC,IAAK,GACLjB,IAAMc,EAAM,QACP,IAAI,GAAGI,IAAIlB,IAAM,GAAG,IAAIA,GAAKkB,IAAI,GAAG,KAAK,GAAG;AACjD,QAAIjC,IAAK6B,EAAMI,CAAC,GACZhC,IAAK4B,EAAMI,IAAI,CAAC,GAChB/B,IAAK2B,EAAM,CAAC,GACZ1B,IAAK0B,EAAM,IAAI,CAAC,GAChBK,IAAIlC,IAAKG,IAAKD,IAAKD;AACvB,IAAA6B,KAAcI,GACdH,MAAO/B,IAAKE,KAAMgC,GAClBF,MAAO/B,IAAKE,KAAM+B;AAAA,EACtB;AACA,SAAIJ,MAAe,IACR,CAACD,EAAM,CAAC,KAAK,GAAGA,EAAM,CAAC,KAAK,CAAC,IAEjC,CAACE,IAAKD,IAAa,GAAGE,IAAKF,IAAa,GAAGA,CAAU;AAChE;AACA,SAASK,GAAmBC,GAAgBC,GAAcC,GAAQC,GAAM;AAMpE,WALIC,KAAeJ,EAAe,SAAS,KAAK,GAC5CK,IAAY,OACZC,IAAa,GACb3B,IAAMqB,EAAe,QACrB/C,IAAO0B,IAAM,GACR4B,IAAS,GAAGA,IAASH,GAAaG,KAAU;AAGjD,aAFIC,IAAeD,IAAS,GACxBE,IAAQ,GACHpC,IAAI,GAAGA,IAAIM,GAAKN,KAAK,GAAG;AAC7B,UAAIqC,IAAMrC,MAAM,IAAImC,KAAiBA,IAAenC,IAAI,KAAKpB,IAAO,GAChEW,IAAKoC,EAAeU,CAAG,IAAIR,EAAO,CAAC,GACnCrC,IAAKmC,EAAeU,IAAM,CAAC,IAAIR,EAAO,CAAC,GACvCpC,IAAKmC,EAAa5B,CAAC,IAAI8B,EAAK,CAAC,GAC7BpC,IAAKkC,EAAa5B,IAAI,CAAC,IAAI8B,EAAK,CAAC,GACjCQ,IAAK7C,IAAKF,GACVgD,IAAK7C,IAAKF;AACd,MAAA4C,KAASE,IAAKA,IAAKC,IAAKA;AAAA,IAC5B;AACA,IAAIH,IAAQJ,MACRA,IAAYI,GACZH,IAAaC;AAAA,EAErB;AACA,SAAOD;AACX;AACA,SAASO,GAAQpB,GAAO;AAGpB,WAFIqB,IAAS,CAAA,GACTnC,IAAMc,EAAM,QACP9B,IAAI,GAAGA,IAAIgB,GAAKhB,KAAK;AAC1B,IAAAmD,EAAOnD,CAAC,IAAI8B,EAAMd,IAAMhB,IAAI,CAAC,GAC7BmD,EAAOnD,IAAI,CAAC,IAAI8B,EAAMd,IAAMhB,IAAI,CAAC;AAErC,SAAOmD;AACX;AACA,SAASC,GAAyBC,GAASC,GAAOC,GAAsBC,GAAkB;AAGtF,WAFIC,IAAS,CAAA,GACTC,GACK1D,IAAI,GAAGA,IAAIqD,EAAQ,QAAQrD,KAAK;AACrC,QAAI2D,IAAoBN,EAAQrD,CAAC,GAC7B4D,IAAkBN,EAAMtD,CAAC,GACzBuC,IAASV,EAAS8B,CAAiB,GACnCnB,IAAOX,EAAS+B,CAAe;AACnC,IAAIF,KAAoB,SACpBA,IAAmBnB,EAAO,CAAC,IAAI,KAAMC,EAAK,CAAC,IAAI;AAEnD,QAAIqB,IAAuB,CAAA,GACvBC,IAAqB,CAAA,GACrBC,IAAY,GACZrB,IAAY,OACZsB,IAAS,CAAA,GACThD,IAAM2C,EAAkB;AAC5B,IAAID,MACAC,IAAoBT,GAAQS,CAAiB;AAIjD,aAFIf,IAASR,GAAmBuB,GAAmBC,GAAiBrB,GAAQC,CAAI,IAAI,GAChFlD,IAAO0B,IAAM,GACRN,IAAI,GAAGA,IAAIpB,GAAMoB,KAAK,GAAG;AAC9B,UAAIqC,KAAOH,IAASlC,KAAKpB,IAAO;AAChC,MAAAuE,EAAqBnD,IAAI,CAAC,IAAIiD,EAAkBZ,CAAG,IAAIR,EAAO,CAAC,GAC/DsB,EAAqBnD,IAAI,CAAC,IAAIiD,EAAkBZ,IAAM,CAAC,IAAIR,EAAO,CAAC;AAAA,IACvE;AACA,IAAAsB,EAAqB,CAAC,IAAIF,EAAkBf,CAAM,IAAIL,EAAO,CAAC,GAC9DsB,EAAqB,CAAC,IAAIF,EAAkBf,IAAS,CAAC,IAAIL,EAAO,CAAC;AAG9D,aADI0B,IAAOT,IAAmBD,GACrBW,IAAQ,CAACV,IAAmB,GAAGU,KAASV,IAAmB,GAAGU,KAASD,GAAM;AAIlF,eAHIE,IAAK,KAAK,IAAID,CAAK,GACnBE,IAAK,KAAK,IAAIF,CAAK,GACnBpB,IAAQ,GACHpC,IAAI,GAAGA,IAAIiD,EAAkB,QAAQjD,KAAK,GAAG;AAClD,YAAIT,IAAK4D,EAAqBnD,CAAC,GAC3BR,IAAK2D,EAAqBnD,IAAI,CAAC,GAC/BP,IAAKyD,EAAgBlD,CAAC,IAAI8B,EAAK,CAAC,GAChCpC,IAAKwD,EAAgBlD,IAAI,CAAC,IAAI8B,EAAK,CAAC,GACpC6B,IAAQlE,IAAKiE,IAAKhE,IAAK+D,GACvBG,IAAQnE,IAAKgE,IAAK/D,IAAKgE;AAC3B,QAAAJ,EAAOtD,CAAC,IAAI2D,GACZL,EAAOtD,IAAI,CAAC,IAAI4D;AAChB,YAAItB,IAAKqB,IAAQpE,GACbgD,IAAKqB,IAAQpE;AACjB,QAAA4C,KAASE,IAAKA,IAAKC,IAAKA;AAAA,MAC5B;AACA,UAAIH,IAAQJ,GAAW;AACnB,QAAAA,IAAYI,GACZiB,IAAYG;AACZ,iBAASK,IAAI,GAAGA,IAAIP,EAAO,QAAQO;AAC/B,UAAAT,EAAmBS,CAAC,IAAIP,EAAOO,CAAC;AAAA,MAExC;AAAA,IACJ;AAQJ,IAAAd,EAAO,KAAK;AAAA,MACR,MAAMI;AAAA,MACN,IAAIC;AAAA,MACJ,QAAQvB;AAAA,MACR,MAAMC;AAAA,MACN,UAAU,CAACuB;AAAA,IACvB,CAAS;AAAA,EACL;AACA,SAAON;AACX;AACO,SAASe,EAAkBC,GAAM;AACpC,SAAOA,EAAK;AAChB;AAIA,IAAIC,IAAsB;AAC1B,SAASC,EAAoBC,GAAKC,GAAYC,GAAW;AACrD,MAAIC,IAAkBL,IAAsBG,GACxCG,IAAiBJ,EAAIG,CAAe,KAAKH,EAAIC,CAAU;AAC3D,EAAKD,EAAIG,CAAe,MACpBH,EAAIG,CAAe,IAAIH,EAAIC,CAAU;AAEzC,MAAII,IAAUH,EAAU,SACpBI,IAAQJ,EAAU,OAClBK,IAASL,EAAU;AACvB,EAAAF,EAAIC,CAAU,IAAI,WAAY;AAC1B,QAAIO,IAAO,WACPC;AACJ,WAAAF,KAAUA,EAAO,MAAM,MAAMC,CAAI,GAC7BH,IACAI,IAAMJ,EAAQ,MAAM,MAAMG,CAAI,IAG9BC,IAAML,EAAe,MAAM,MAAMI,CAAI,GAEzCF,KAASA,EAAM,MAAM,MAAME,CAAI,GACxBC;AAAA,EACX;AACJ;AACA,SAASC,EAAcV,GAAKC,GAAY;AACpC,MAAIE,IAAkBL,IAAsBG;AAC5C,EAAID,EAAIG,CAAe,MACnBH,EAAIC,CAAU,IAAID,EAAIG,CAAe,GACrCH,EAAIG,CAAe,IAAI;AAE/B;AACA,SAASQ,EAAwBC,GAAcC,GAAI;AAC/C,WAASzF,IAAI,GAAGA,IAAIwF,EAAa,QAAQxF;AAErC,aADI0F,IAAaF,EAAaxF,CAAC,GACtBU,IAAI,GAAGA,IAAIgF,EAAW,UAAS;AACpC,UAAIC,IAAID,EAAWhF,CAAC,GAChBkF,IAAIF,EAAWhF,IAAI,CAAC;AACxB,MAAAgF,EAAWhF,GAAG,IAAI+E,EAAG,CAAC,IAAIE,IAAIF,EAAG,CAAC,IAAIG,IAAIH,EAAG,CAAC,GAC9CC,EAAWhF,GAAG,IAAI+E,EAAG,CAAC,IAAIE,IAAIF,EAAG,CAAC,IAAIG,IAAIH,EAAG,CAAC;AAAA,IAClD;AAER;AACA,SAASI,EAAiBC,GAAUC,GAAQ;AACxC,MAAIC,IAAgBF,EAAS,oBAAmB,GAC5CG,IAAcF,EAAO,oBAAmB,GACxCzE,IAAKH,GAAkB+E,EAAmBF,CAAa,GAAGE,EAAmBD,CAAW,CAAC,GAAGE,IAAmB7E,EAAG,CAAC,GAAG8E,IAAiB9E,EAAG,CAAC,GAC3I+E,IAAoBP,EAAS,qBAAoB,GACjDQ,IAAkBP,EAAO,qBAAoB;AACjD,WAASQ,IAA0B;AAC/B,SAAK,YAAY;AAAA,EACrB;AACA,EAAAF,KAAqBd,EAAwBY,GAAkBE,CAAiB,GAChFC,KAAmBf,EAAwBa,GAAgBE,CAAe,GAC1E3B,EAAoBoB,GAAQ,mBAAmB,EAAE,SAASQ,EAAuB,CAAE,GACnFR,EAAO,YAAY;AACnB,MAAIS,IAAepD,GAAyB+C,GAAkBC,GAAgB,IAAI,KAAK,EAAE,GACrFpC,IAAS,CAAA;AACb,EAAAW,EAAoBoB,GAAQ,aAAa,EAAE,SAAS,SAAUtB,GAAM;AAI5D,aAHIgC,IAAIV,EAAO,UACXW,IAAO,IAAID,GACXE,IAAQ,CAAA,GACH3G,IAAI,GAAGA,IAAIwG,EAAa,QAAQxG,KAAK;AAC1C,UAAI4G,IAAOJ,EAAaxG,CAAC,GACrB6G,IAAOD,EAAK,MACZE,IAAKF,EAAK,IACV1C,IAAQ0C,EAAK,WAAWH,GACxBlE,IAASqE,EAAK,QACdpE,IAAOoE,EAAK,MACZzC,IAAK,KAAK,IAAID,CAAK,GACnBE,IAAK,KAAK,IAAIF,CAAK;AACvB,MAAA6C,GAAKJ,GAAOpE,GAAQC,GAAMiE,CAAC;AAC3B,eAASlC,IAAI,GAAGA,IAAIsC,EAAK,QAAQtC,KAAK,GAAG;AACrC,YAAIyC,IAAOH,EAAKtC,CAAC,GACb0C,IAAOJ,EAAKtC,IAAI,CAAC,GACjBpE,IAAK2G,EAAGvC,CAAC,GACTnE,IAAK0G,EAAGvC,IAAI,CAAC,GACboB,IAAIqB,IAAON,IAAOvG,IAAKsG,GACvBb,IAAIqB,IAAOP,IAAOtG,IAAKqG;AAC3B,QAAAzC,EAAOO,CAAC,IAAKoB,IAAIvB,IAAKwB,IAAIzB,IAAMwC,EAAM,CAAC,GACvC3C,EAAOO,IAAI,CAAC,IAAKoB,IAAIxB,IAAKyB,IAAIxB,IAAMuC,EAAM,CAAC;AAAA,MAC/C;AACA,UAAI1G,IAAK+D,EAAO,CAAC,GACb9D,IAAK8D,EAAO,CAAC;AACjB,MAAAS,EAAK,OAAOxE,GAAIC,CAAE;AAClB,eAASqE,IAAI,GAAGA,IAAIsC,EAAK,UAAS;AAC9B,YAAI1G,IAAK6D,EAAOO,GAAG,GACfnE,IAAK4D,EAAOO,GAAG,GACflE,IAAK2D,EAAOO,GAAG,GACfjE,IAAK0D,EAAOO,GAAG,GACfhE,IAAKyD,EAAOO,GAAG,GACf/D,IAAKwD,EAAOO,GAAG;AACnB,QAAItE,MAAOE,KAAMD,MAAOE,KAAMC,MAAOE,KAAMD,MAAOE,IAC9CiE,EAAK,OAAOlE,GAAIC,CAAE,IAGlBiE,EAAK,cAActE,GAAIC,GAAIC,GAAIC,GAAIC,GAAIC,CAAE,GAE7CP,IAAKM,GACLL,IAAKM;AAAA,MACT;AAAA,IACJ;AAAA,EACJ,GAAG;AACX;AACO,SAAS0G,EAAUpB,GAAUC,GAAQoB,GAAe;AACvD,MAAI,CAACrB,KAAY,CAACC;AACd,WAAOA;AAEX,MAAIqB,IAAUD,EAAc,MACxBE,IAAYF,EAAc;AAC9B,EAAAtB,EAAiBC,GAAUC,CAAM,GACjCA,EAAO,WAAW;AAClB,WAASuB,IAAgB;AACrB,IAAAhC,EAAcS,GAAQ,WAAW,GACjCT,EAAcS,GAAQ,iBAAiB,GACvCA,EAAO,WAAW,IAClBA,EAAO,gBAAe,GACtBA,EAAO,WAAU;AAAA,EACrB;AACA,SAAAA,EAAO,UAAU;AAAA,IACb,UAAU;AAAA,EAClB,GAAOwB,EAAS;AAAA,IACR,QAAQ,SAAU5G,GAAG;AACjB,MAAAoF,EAAO,WAAU,GACjBsB,KAAaA,EAAU1G,CAAC;AAAA,IAC5B;AAAA,IACA,MAAM,WAAY;AACd,MAAA2G,EAAa,GACbF,KAAWA,EAAO;AAAA,IACtB;AAAA,EACR,GAAOD,CAAa,CAAC,GACVpB;AACX;AACA,SAASyB,GAAQ7B,GAAGC,GAAG6B,GAAMC,GAAMC,GAAMC,GAAM;AAC3C,MAAIC,IAAO;AACX,EAAAlC,IAAKgC,MAASF,IAAQ,IAAI,KAAK,MAAM,SAAS9B,IAAI8B,MAASE,IAAOF,EAAK,GACvE7B,IAAKgC,MAASF,IAAQ,IAAI,KAAK,MAAM,SAAS9B,IAAI8B,MAASE,IAAOF,EAAK;AAGvE,WAFII,IAAI,GACJC,GACKC,KAAK,KAAKH,KAAQ,GAAGG,IAAI,GAAGA,KAAK,GAAG;AACzC,QAAIC,IAAK,GACLC,IAAK;AACT,KAAKvC,IAAIqC,KAAK,MACVC,IAAK,KAEJrC,IAAIoC,KAAK,MACVE,IAAK,IAETJ,KAAKE,IAAIA,KAAM,IAAIC,IAAMC,IACrBA,MAAO,MACHD,MAAO,MACPtC,IAAIqC,IAAI,IAAIrC,GACZC,IAAIoC,IAAI,IAAIpC,IAEhBmC,IAAMpC,GACNA,IAAIC,GACJA,IAAImC;AAAA,EAEZ;AACA,SAAOD;AACX;AACA,SAASK,EAAUC,GAAU;AACzB,MAAIC,IAAO,OACPC,IAAO,OACPC,IAAO,QACPC,IAAO,QACPC,IAAMC,EAAIN,GAAU,SAAU3D,GAAM;AACpC,QAAIkE,IAAOlE,EAAK,gBAAe,GAC3BF,IAAIE,EAAK,qBAAoB,GAC7BkB,IAAIgD,EAAK,IAAIA,EAAK,QAAQ,KAAKpE,IAAIA,EAAE,CAAC,IAAI,IAC1CqB,IAAI+C,EAAK,IAAIA,EAAK,SAAS,KAAKpE,IAAIA,EAAE,CAAC,IAAI;AAC/C,WAAA8D,IAAO,KAAK,IAAI1C,GAAG0C,CAAI,GACvBC,IAAO,KAAK,IAAI1C,GAAG0C,CAAI,GACvBC,IAAO,KAAK,IAAI5C,GAAG4C,CAAI,GACvBC,IAAO,KAAK,IAAI5C,GAAG4C,CAAI,GAChB,CAAC7C,GAAGC,CAAC;AAAA,EAChB,CAAC,GACGgD,IAAQF,EAAID,GAAK,SAAUI,GAAI9F,GAAK;AACpC,WAAO;AAAA,MACH,IAAI8F;AAAA,MACJ,GAAGrB,GAAQqB,EAAG,CAAC,GAAGA,EAAG,CAAC,GAAGR,GAAMC,GAAMC,GAAMC,CAAI;AAAA,MAC/C,MAAMJ,EAASrF,CAAG;AAAA,IAC9B;AAAA,EACI,CAAC;AACD,SAAO6F,EAAM,KAAK,SAAUzG,GAAG2G,GAAG;AAAE,WAAO3G,EAAE,IAAI2G,EAAE;AAAA,EAAG,CAAC,EAAE,IAAI,SAAUlC,GAAM;AAAE,WAAOA,EAAK;AAAA,EAAM,CAAC;AACtG;AAEA,SAASmC,GAAkBC,GAAO;AAC9B,SAAOC,GAAMD,EAAM,MAAMA,EAAM,KAAK;AACxC;AACA,SAASE,IAAoB;AACzB,SAAO;AAAA,IACH,iBAAiB,CAAA;AAAA,IACjB,eAAe,CAAA;AAAA,IACf,OAAO;AAAA,EACf;AACA;AACO,SAASC,GAAaC,GAAUrD,GAAQoB,GAAe;AAC1D,MAAIkC,IAAe,CAAA;AACnB,WAASC,EAAYF,GAAU;AAC3B,aAASpJ,IAAI,GAAGA,IAAIoJ,EAAS,QAAQpJ,KAAK;AACtC,UAAI6G,IAAOuC,EAASpJ,CAAC;AACrB,MAAIwE,EAAkBqC,CAAI,IACtByC,EAAYzC,EAAK,aAAa,IAEzBA,aAAgB0C,KACrBF,EAAa,KAAKxC,CAAI;AAAA,IAE9B;AAAA,EACJ;AACA,EAAAyC,EAAYF,CAAQ;AACpB,MAAII,IAAgBH,EAAa;AACjC,MAAI,CAACG;AACD,WAAON,EAAiB;AAE5B,MAAIO,IAAatC,EAAc,cAAc4B,IACzCW,IAAgBD,EAAW;AAAA,IAC3B,MAAM1D;AAAA,IAAQ,OAAOyD;AAAA,EAC7B,CAAK;AACD,MAAIE,EAAc,WAAWF;AACzB,mBAAQ,MAAM,2CAA2C,GAClDN,EAAiB;AAE5B,EAAAG,IAAelB,EAAUkB,CAAY,GACrCK,IAAgBvB,EAAUuB,CAAa;AAKvC,WAJItC,IAAUD,EAAc,MACxBE,IAAYF,EAAc,QAC1BwC,IAAkBxC,EAAc,iBAChCyC,IAAoB,IAAIC,GAAa,GAChC7J,IAAI,GAAGA,IAAIwJ,GAAexJ,KAAK;AACpC,QAAI6G,IAAOwC,EAAarJ,CAAC,GACrB8G,IAAK4C,EAAc1J,CAAC;AACxB,IAAA8G,EAAG,SAASf,GACZe,EAAG,cAAc8C,CAAiB,GAC7BD,KACD9D,EAAiBgB,GAAMC,CAAE;AAAA,EAEjC;AACA,EAAAf,EAAO,sBAAsB,IAC7BA,EAAO,cAAc,WAAY;AAC7B,WAAO2D;AAAA,EACX;AACA,WAASI,EAAqBC,GAAI;AAC9B,aAAS/J,IAAI,GAAGA,IAAI0J,EAAc,QAAQ1J;AACtC,MAAA0J,EAAc1J,CAAC,EAAE,YAAY+J,CAAE;AAAA,EAEvC;AACA,EAAApF,EAAoBoB,GAAQ,eAAe;AAAA,IACvC,OAAO,SAAUgE,GAAI;AACjB,MAAAD,EAAqBC,CAAE;AAAA,IAC3B;AAAA,EACR,CAAK,GACDpF,EAAoBoB,GAAQ,oBAAoB;AAAA,IAC5C,OAAO,SAAUgE,GAAI;AACjB,eAAS/J,IAAI,GAAGA,IAAI0J,EAAc,QAAQ1J;AACtC,QAAA0J,EAAc1J,CAAC,EAAE,iBAAiB+J,CAAE;AAAA,IAE5C;AAAA,EACR,CAAK;AACD,WAASzC,IAAgB;AACrB,IAAAvB,EAAO,sBAAsB,IAC7BA,EAAO,WAAW,IAClBA,EAAO,cAAc,MACrBT,EAAcS,GAAQ,aAAa,GACnCT,EAAcS,GAAQ,kBAAkB;AAAA,EAC5C;AACA,MAAIiE,IAAQN,EAAc;AAC1B,MAAIC;AASA,aARIM,IAAcD,GACdE,IAAW,WAAY;AACvB,MAAAD,KACIA,MAAgB,MAChB3C,EAAa,GACbF,KAAWA,EAAO;AAAA,IAE1B,GACSpH,IAAI,GAAGA,IAAIgK,GAAOhK,KAAK;AAC5B,UAAImK,IAAyBR,IAAkBpC,EAAS;AAAA,QACpD,QAAQJ,EAAc,SAAS,KAAKwC,EAAgB3J,GAAGgK,GAAOX,EAAarJ,CAAC,GAAG0J,EAAc1J,CAAC,CAAC;AAAA,QAC/F,MAAMkK;AAAA,MACtB,GAAe/C,CAAa,IAAIA;AACpB,MAAAD,EAAUmC,EAAarJ,CAAC,GAAG0J,EAAc1J,CAAC,GAAGmK,CAAsB;AAAA,IACvE;AAAA;AAGA,IAAApE,EAAO,WAAW,GAClBA,EAAO,UAAU;AAAA,MACb,UAAU;AAAA,IACtB,GAAWwB,EAAS;AAAA,MACR,QAAQ,SAAU5G,GAAG;AACjB,iBAASX,IAAI,GAAGA,IAAIgK,GAAOhK,KAAK;AAC5B,cAAIoK,IAAQV,EAAc1J,CAAC;AAC3B,UAAAoK,EAAM,WAAWrE,EAAO,UACxBqE,EAAM,WAAU;AAAA,QACpB;AACA,QAAA/C,KAAaA,EAAU1G,CAAC;AAAA,MAC5B;AAAA,MACA,MAAM,WAAY;AACd,QAAA2G,EAAa;AACb,iBAAStH,IAAI,GAAGA,IAAIoJ,EAAS,QAAQpJ;AACjC,UAAAsF,EAAc8D,EAASpJ,CAAC,GAAG,iBAAiB;AAEhD,QAAAoH,KAAWA,EAAO;AAAA,MACtB;AAAA,IACZ,GAAWD,CAAa,CAAC;AAErB,SAAIpB,EAAO,QACP+D,EAAqB/D,EAAO,IAAI,GAE7B;AAAA,IACH,iBAAiBsD;AAAA,IACjB,eAAeK;AAAA,IACf,OAAOM;AAAA,EACf;AACA;AACO,SAASK,GAAcvE,GAAUwE,GAAYnD,GAAe;AAC/D,MAAI6C,IAAQM,EAAW,QACnBjB,IAAe,CAAA,GACfI,IAAatC,EAAc,cAAc4B;AAC7C,WAASO,EAAYF,GAAU;AAC3B,aAASpJ,IAAI,GAAGA,IAAIoJ,EAAS,QAAQpJ,KAAK;AACtC,UAAI6G,IAAOuC,EAASpJ,CAAC;AACrB,MAAIwE,EAAkBqC,CAAI,IACtByC,EAAYzC,EAAK,aAAa,IAEzBA,aAAgB0C,KACrBF,EAAa,KAAKxC,CAAI;AAAA,IAE9B;AAAA,EACJ;AACA,MAAIrC,EAAkBsB,CAAQ,GAAG;AAC7B,IAAAwD,EAAYxD,EAAS,aAAa;AAClC,QAAIyE,IAAUlB,EAAa;AAC3B,QAAIkB,IAAUP;AAEV,eADItJ,IAAI,GACCV,IAAIuK,GAASvK,IAAIgK,GAAOhK;AAC7B,QAAAqJ,EAAa,KAAKmB,GAAUnB,EAAa3I,MAAM6J,CAAO,CAAC,CAAC;AAGhE,IAAAlB,EAAa,SAASW;AAAA,EAC1B,OACK;AACD,IAAAX,IAAeI,EAAW,EAAE,MAAM3D,GAAU,OAAOkE,GAAO;AAE1D,aADI3D,IAAoBP,EAAS,qBAAoB,GAC5C9F,IAAI,GAAGA,IAAIqJ,EAAa,QAAQrJ;AACrC,MAAAqJ,EAAarJ,CAAC,EAAE,kBAAkBqG,CAAiB;AAEvD,QAAIgD,EAAa,WAAWW;AACxB,qBAAQ,MAAM,2CAA2C,GAClDd,EAAiB;AAAA,EAEhC;AACA,EAAAG,IAAelB,EAAUkB,CAAY,GACrCiB,IAAanC,EAAUmC,CAAU;AAEjC,WADIX,IAAkBxC,EAAc,iBAC3BnH,IAAI,GAAGA,IAAIgK,GAAOhK,KAAK;AAC5B,QAAImK,IAAyBR,IAAkBpC,EAAS;AAAA,MACpD,QAAQJ,EAAc,SAAS,KAAKwC,EAAgB3J,GAAGgK,GAAOX,EAAarJ,CAAC,GAAGsK,EAAWtK,CAAC,CAAC;AAAA,IACxG,GAAWmH,CAAa,IAAIA;AACpB,IAAAD,EAAUmC,EAAarJ,CAAC,GAAGsK,EAAWtK,CAAC,GAAGmK,CAAsB;AAAA,EACpE;AACA,SAAO;AAAA,IACH,iBAAiBd;AAAA,IACjB,eAAeiB;AAAA,IACf,OAAOA,EAAW;AAAA,EAC1B;AACA;","x_google_ignoreList":[0]}