@visactor/vrender-core 0.16.0-alpha.0

package/es/common/shape/arc.js

@@ -0,0 +1,40 @@
+import { degreeToRadian, halfPi, tau } from "@visactor/vutils";
+
+export function segments(x, y, rx, ry, large, sweep, rotateX, ox, oy) {
+    const th = degreeToRadian(rotateX), sin_th = Math.sin(th), cos_th = Math.cos(th), px = cos_th * (ox - x) * .5 + sin_th * (oy - y) * .5, py = cos_th * (oy - y) * .5 - sin_th * (ox - x) * .5;
+    let pl = px * px / ((rx = Math.abs(rx)) * rx) + py * py / ((ry = Math.abs(ry)) * ry);
+    pl > 1 && (pl = Math.sqrt(pl), rx *= pl, ry *= pl);
+    const a00 = cos_th / rx, a01 = sin_th / rx, a10 = -sin_th / ry, a11 = cos_th / ry, x0 = a00 * ox + a01 * oy, y0 = a10 * ox + a11 * oy, x1 = a00 * x + a01 * y, y1 = a10 * x + a11 * y;
+    let sfactor_sq = 1 / ((x1 - x0) * (x1 - x0) + (y1 - y0) * (y1 - y0)) - .25;
+    sfactor_sq < 0 && (sfactor_sq = 0);
+    let sfactor = Math.sqrt(sfactor_sq);
+    sweep === large && (sfactor = -sfactor);
+    const xc = .5 * (x0 + x1) - sfactor * (y1 - y0), yc = .5 * (y0 + y1) + sfactor * (x1 - x0), th0 = Math.atan2(y0 - yc, x0 - xc);
+    let th_arc = Math.atan2(y1 - yc, x1 - xc) - th0;
+    th_arc < 0 && 1 === sweep ? th_arc += tau : th_arc > 0 && 0 === sweep && (th_arc -= tau);
+    const segs = Math.ceil(Math.abs(th_arc / (halfPi + .001))), result = [];
+    for (let i = 0; i < segs; ++i) {
+        const th2 = th0 + i * th_arc / segs, th3 = th0 + (i + 1) * th_arc / segs;
+        result[i] = [ xc, yc, th2, th3, rx, ry, sin_th, cos_th ];
+    }
+    return result;
+}
+
+export function bezier(params) {
+    const cx = params[0], cy = params[1], th0 = params[2], th1 = params[3], rx = params[4], ry = params[5], sin_th = params[6], cos_th = params[7], a00 = cos_th * rx, a01 = -sin_th * ry, a10 = sin_th * rx, a11 = cos_th * ry, cos_th0 = Math.cos(th0), sin_th0 = Math.sin(th0), cos_th1 = Math.cos(th1), sin_th1 = Math.sin(th1), th_half = .5 * (th1 - th0), sin_th_h2 = Math.sin(.5 * th_half), t = 8 / 3 * sin_th_h2 * sin_th_h2 / Math.sin(th_half), x1 = cx + cos_th0 - t * sin_th0, y1 = cy + sin_th0 + t * cos_th0, x3 = cx + cos_th1, y3 = cy + sin_th1, x2 = x3 + t * sin_th1, y2 = y3 - t * cos_th1;
+    return [ a00 * x1 + a01 * y1, a10 * x1 + a11 * y1, a00 * x2 + a01 * y2, a10 * x2 + a11 * y2, a00 * x3 + a01 * y3, a10 * x3 + a11 * y3 ];
+}
+
+export function drawArc(context, x, y, coords) {
+    const seg = segments(coords[5], coords[6], coords[0], coords[1], coords[3], coords[4], coords[2], x, y);
+    for (let i = 0; i < seg.length; ++i) {
+        const bez = bezier(seg[i]);
+        context.bezierCurveTo(bez[0], bez[1], bez[2], bez[3], bez[4], bez[5]);
+    }
+}
+
+export const addArcToBezierPath = (bezierPath, startAngle, endAngle, cx, cy, rx, ry) => {
+    const delta = Math.abs(endAngle - startAngle), len = 4 * Math.tan(delta / 4) / 3, dir = endAngle < startAngle ? -1 : 1, c1 = Math.cos(startAngle), s1 = Math.sin(startAngle), c2 = Math.cos(endAngle), s2 = Math.sin(endAngle), x1 = c1 * rx + cx, y1 = s1 * ry + cy, x4 = c2 * rx + cx, y4 = s2 * ry + cy, hx = rx * len * dir, hy = ry * len * dir;
+    bezierPath.push(x1 - hx * s1, y1 + hy * c1, x4 + hx * s2, y4 - hy * c2, x4, y4);
+};
+//# sourceMappingURL=arc.js.map

package/es/common/shape/arc.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/common/shape/arc.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,cAAc,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,kBAAkB,CAAC;AA0B/D,MAAM,UAAU,QAAQ,CACtB,CAAS,EACT,CAAS,EACT,EAAU,EACV,EAAU,EACV,KAAa,EACb,KAAa,EACb,OAAe,EACf,EAAU,EACV,EAAU;IAOV,MAAM,EAAE,GAAG,cAAc,CAAC,OAAO,CAAC,CAAC;IACnC,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;IAC5B,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;IAC5B,EAAE,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;IAClB,EAAE,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;IAClB,MAAM,EAAE,GAAG,MAAM,GAAG,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,GAAG,GAAG,MAAM,GAAG,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC;IAC7D,MAAM,EAAE,GAAG,MAAM,GAAG,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,GAAG,GAAG,MAAM,GAAG,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC;IAC7D,IAAI,EAAE,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC;IACvD,IAAI,EAAE,GAAG,CAAC,EAAE;QACV,EAAE,GAAG,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACnB,EAAE,IAAI,EAAE,CAAC;QACT,EAAE,IAAI,EAAE,CAAC;KACV;IAED,MAAM,GAAG,GAAG,MAAM,GAAG,EAAE,CAAC;IACxB,MAAM,GAAG,GAAG,MAAM,GAAG,EAAE,CAAC;IACxB,MAAM,GAAG,GAAG,CAAC,MAAM,GAAG,EAAE,CAAC;IACzB,MAAM,GAAG,GAAG,MAAM,GAAG,EAAE,CAAC;IACxB,MAAM,EAAE,GAAG,GAAG,GAAG,EAAE,GAAG,GAAG,GAAG,EAAE,CAAC;IAC/B,MAAM,EAAE,GAAG,GAAG,GAAG,EAAE,GAAG,GAAG,GAAG,EAAE,CAAC;IAC/B,MAAM,EAAE,GAAG,GAAG,GAAG,CAAC,GAAG,GAAG,GAAG,CAAC,CAAC;IAC7B,MAAM,EAAE,GAAG,GAAG,GAAG,CAAC,GAAG,GAAG,GAAG,CAAC,CAAC;IAE7B,MAAM,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC;IACxD,IAAI,UAAU,GAAG,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC;IAC9B,IAAI,UAAU,GAAG,CAAC,EAAE;QAClB,UAAU,GAAG,CAAC,CAAC;KAChB;IACD,IAAI,OAAO,GAAG,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;IACpC,IAAI,KAAK,KAAK,KAAK,EAAE;QACnB,OAAO,GAAG,CAAC,OAAO,CAAC;KACpB;IACD,MAAM,EAAE,GAAG,GAAG,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,GAAG,OAAO,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC;IACjD,MAAM,EAAE,GAAG,GAAG,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,GAAG,OAAO,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC;IAEjD,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,EAAE,GAAG,EAAE,EAAE,EAAE,GAAG,EAAE,CAAC,CAAC;IACzC,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,EAAE,GAAG,EAAE,EAAE,EAAE,GAAG,EAAE,CAAC,CAAC;IAEzC,IAAI,MAAM,GAAG,GAAG,GAAG,GAAG,CAAC;IACvB,IAAI,MAAM,GAAG,CAAC,IAAI,KAAK,KAAK,CAAC,EAAE;QAC7B,MAAM,IAAI,GAAG,CAAC;KACf;SAAM,IAAI,MAAM,GAAG,CAAC,IAAI,KAAK,KAAK,CAAC,EAAE;QACpC,MAAM,IAAI,GAAG,CAAC;KACf;IAED,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,GAAG,CAAC,MAAM,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;IAC5D,MAAM,MAAM,GAAG,EAAE,CAAC;IAClB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,EAAE,EAAE,CAAC,EAAE;QAC7B,MAAM,GAAG,GAAG,GAAG,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC,GAAG,IAAI,CAAC;QACtC,MAAM,GAAG,GAAG,GAAG,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC,GAAG,IAAI,CAAC;QAC5C,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE,EAAE,EAAE,EAAE,MAAM,EAAE,MAAM,CAAC,CAAC;KACxD;IAED,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,MAAM,UAAU,MAAM,CAAC,MAAgB;IAMrC,MAAM,EAAE,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;IACrB,MAAM,EAAE,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;IACrB,MAAM,GAAG,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;IACtB,MAAM,GAAG,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;IACtB,MAAM,EAAE,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;IACrB,MAAM,EAAE,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;IACrB,MAAM,MAAM,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;IACzB,MAAM,MAAM,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;IAEzB,MAAM,GAAG,GAAG,MAAM,GAAG,EAAE,CAAC;IACxB,MAAM,GAAG,GAAG,CAAC,MAAM,GAAG,EAAE,CAAC;IACzB,MAAM,GAAG,GAAG,MAAM,GAAG,EAAE,CAAC;IACxB,MAAM,GAAG,GAAG,MAAM,GAAG,EAAE,CAAC;IAExB,MAAM,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IAC9B,MAAM,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IAC9B,MAAM,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IAC9B,MAAM,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IAE9B,MAAM,OAAO,GAAG,GAAG,GAAG,CAAC,GAAG,GAAG,GAAG,CAAC,CAAC;IAClC,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,OAAO,GAAG,GAAG,CAAC,CAAC;IAC1C,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,SAAS,GAAG,SAAS,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;IAChE,MAAM,EAAE,GAAG,EAAE,GAAG,OAAO,GAAG,CAAC,GAAG,OAAO,CAAC;IACtC,MAAM,EAAE,GAAG,EAAE,GAAG,OAAO,GAAG,CAAC,GAAG,OAAO,CAAC;IACtC,MAAM,EAAE,GAAG,EAAE,GAAG,OAAO,CAAC;IACxB,MAAM,EAAE,GAAG,EAAE,GAAG,OAAO,CAAC;IACxB,MAAM,EAAE,GAAG,EAAE,GAAG,CAAC,GAAG,OAAO,CAAC;IAC5B,MAAM,EAAE,GAAG,EAAE,GAAG,CAAC,GAAG,OAAO,CAAC;IAE5B,OAAO;QACL,GAAG,GAAG,EAAE,GAAG,GAAG,GAAG,EAAE;QACnB,GAAG,GAAG,EAAE,GAAG,GAAG,GAAG,EAAE;QACnB,GAAG,GAAG,EAAE,GAAG,GAAG,GAAG,EAAE;QACnB,GAAG,GAAG,EAAE,GAAG,GAAG,GAAG,EAAE;QACnB,GAAG,GAAG,EAAE,GAAG,GAAG,GAAG,EAAE;QACnB,GAAG,GAAG,EAAE,GAAG,GAAG,GAAG,EAAE;KACpB,CAAC;AACJ,CAAC;AAED,MAAM,UAAU,OAAO,CACrB,OAAsB,EACtB,CAAS,EACT,CAAS,EACT,MAAgE;IAEhE,MAAM,GAAG,GAAG,QAAQ,CAClB,MAAM,CAAC,CAAC,CAAC,EACT,MAAM,CAAC,CAAC,CAAC,EACT,MAAM,CAAC,CAAC,CAAC,EACT,MAAM,CAAC,CAAC,CAAC,EACT,MAAM,CAAC,CAAC,CAAC,EACT,MAAM,CAAC,CAAC,CAAC,EACT,MAAM,CAAC,CAAC,CAAC,EACT,CAAC,EACD,CAAC,CACF,CAAC;IACF,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,EAAE,CAAC,EAAE;QACnC,MAAM,GAAG,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QAC3B,OAAO,CAAC,aAAa,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;KACvE;AACH,CAAC;AAWD,MAAM,CAAC,MAAM,kBAAkB,GAAG,CAChC,UAAoB,EACpB,UAAkB,EAClB,QAAgB,EAChB,EAAU,EACV,EAAU,EACV,EAAU,EACV,EAAU,EACV,EAAE;IAEF,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,QAAQ,GAAG,UAAU,CAAC,CAAC;IAC9C,MAAM,GAAG,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;IAC1C,MAAM,GAAG,GAAG,QAAQ,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAE3C,MAAM,EAAE,GAAG,IAAI,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;IAChC,MAAM,EAAE,GAAG,IAAI,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;IAChC,MAAM,EAAE,GAAG,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;IAC9B,MAAM,EAAE,GAAG,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;IAE9B,MAAM,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC;IACxB,MAAM,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC;IAExB,MAAM,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC;IACxB,MAAM,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC;IAExB,MAAM,EAAE,GAAG,EAAE,GAAG,GAAG,GAAG,GAAG,CAAC;IAC1B,MAAM,EAAE,GAAG,EAAE,GAAG,GAAG,GAAG,GAAG,CAAC;IAE1B,UAAU,CAAC,IAAI,CAEb,EAAE,GAAG,EAAE,GAAG,EAAE,EACZ,EAAE,GAAG,EAAE,GAAG,EAAE,EACZ,EAAE,GAAG,EAAE,GAAG,EAAE,EACZ,EAAE,GAAG,EAAE,GAAG,EAAE,EACZ,EAAE,EACF,EAAE,CACH,CAAC;AACJ,CAAC,CAAC","file":"arc.js","sourcesContent":["import { degreeToRadian, halfPi, tau } from '@visactor/vutils';\nimport type { ICustomPath2D } from '../../interface';\n\n// const segmentCache: Record<string, number[][]> = {};\n// const bezierCache: Record<string, [number, number, number, number, number, number]> = {};\n\n/**\n * 部分源码参考 https://github.com/d3/d3-shape/\n * Copyright 2010-2022 Mike Bostock\n\n  Permission to use, copy, modify, and/or distribute this software for any purpose\n  with or without fee is hereby granted, provided that the above copyright notice\n  and this permission notice appear in all copies.\n\n  THE SOFTWARE IS PROVIDED \"AS IS\" AND THE AUTHOR DISCLAIMS ALL WARRANTIES WITH\n  REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND\n  FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT,\n  INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS\n  OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER\n  TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF\n  THIS SOFTWARE.\n */\n// 基于d3-shape重构\n// const join = [].join;\n\n// Copied from Inkscape svgtopdf, thanks!\nexport function segments(\n  x: number,\n  y: number,\n  rx: number,\n  ry: number,\n  large: number,\n  sweep: number,\n  rotateX: number,\n  ox: number,\n  oy: number\n) {\n  // const key = join.call([x, y, rx, ry, large, sweep, rotateX, ox, oy]);\n  // if (segmentCache[key]) {\n  //   return segmentCache[key];\n  // }\n\n  const th = degreeToRadian(rotateX);\n  const sin_th = Math.sin(th);\n  const cos_th = Math.cos(th);\n  rx = Math.abs(rx);\n  ry = Math.abs(ry);\n  const px = cos_th * (ox - x) * 0.5 + sin_th * (oy - y) * 0.5;\n  const py = cos_th * (oy - y) * 0.5 - sin_th * (ox - x) * 0.5;\n  let pl = (px * px) / (rx * rx) + (py * py) / (ry * ry);\n  if (pl > 1) {\n    pl = Math.sqrt(pl);\n    rx *= pl;\n    ry *= pl;\n  }\n\n  const a00 = cos_th / rx;\n  const a01 = sin_th / rx;\n  const a10 = -sin_th / ry;\n  const a11 = cos_th / ry;\n  const x0 = a00 * ox + a01 * oy;\n  const y0 = a10 * ox + a11 * oy;\n  const x1 = a00 * x + a01 * y;\n  const y1 = a10 * x + a11 * y;\n\n  const d = (x1 - x0) * (x1 - x0) + (y1 - y0) * (y1 - y0);\n  let sfactor_sq = 1 / d - 0.25;\n  if (sfactor_sq < 0) {\n    sfactor_sq = 0;\n  }\n  let sfactor = Math.sqrt(sfactor_sq);\n  if (sweep === large) {\n    sfactor = -sfactor;\n  }\n  const xc = 0.5 * (x0 + x1) - sfactor * (y1 - y0);\n  const yc = 0.5 * (y0 + y1) + sfactor * (x1 - x0);\n\n  const th0 = Math.atan2(y0 - yc, x0 - xc);\n  const th1 = Math.atan2(y1 - yc, x1 - xc);\n\n  let th_arc = th1 - th0;\n  if (th_arc < 0 && sweep === 1) {\n    th_arc += tau;\n  } else if (th_arc > 0 && sweep === 0) {\n    th_arc -= tau;\n  }\n\n  const segs = Math.ceil(Math.abs(th_arc / (halfPi + 0.001)));\n  const result = [];\n  for (let i = 0; i < segs; ++i) {\n    const th2 = th0 + (i * th_arc) / segs;\n    const th3 = th0 + ((i + 1) * th_arc) / segs;\n    result[i] = [xc, yc, th2, th3, rx, ry, sin_th, cos_th];\n  }\n\n  return result;\n}\n\nexport function bezier(params: number[]) {\n  // const key = join.call(params);\n  // if (bezierCache[key]) {\n  //   return bezierCache[key];\n  // }\n\n  const cx = params[0];\n  const cy = params[1];\n  const th0 = params[2];\n  const th1 = params[3];\n  const rx = params[4];\n  const ry = params[5];\n  const sin_th = params[6];\n  const cos_th = params[7];\n\n  const a00 = cos_th * rx;\n  const a01 = -sin_th * ry;\n  const a10 = sin_th * rx;\n  const a11 = cos_th * ry;\n\n  const cos_th0 = Math.cos(th0);\n  const sin_th0 = Math.sin(th0);\n  const cos_th1 = Math.cos(th1);\n  const sin_th1 = Math.sin(th1);\n\n  const th_half = 0.5 * (th1 - th0);\n  const sin_th_h2 = Math.sin(th_half * 0.5);\n  const t = ((8 / 3) * sin_th_h2 * sin_th_h2) / Math.sin(th_half);\n  const x1 = cx + cos_th0 - t * sin_th0;\n  const y1 = cy + sin_th0 + t * cos_th0;\n  const x3 = cx + cos_th1;\n  const y3 = cy + sin_th1;\n  const x2 = x3 + t * sin_th1;\n  const y2 = y3 - t * cos_th1;\n\n  return [\n    a00 * x1 + a01 * y1,\n    a10 * x1 + a11 * y1,\n    a00 * x2 + a01 * y2,\n    a10 * x2 + a11 * y2,\n    a00 * x3 + a01 * y3,\n    a10 * x3 + a11 * y3\n  ];\n}\n\nexport function drawArc(\n  context: ICustomPath2D,\n  x: number,\n  y: number,\n  coords: [number, number, number, number, number, number, number]\n) {\n  const seg = segments(\n    coords[5], // end x\n    coords[6], // end y\n    coords[0], // radius x\n    coords[1], // radius y\n    coords[3], // large flag\n    coords[4], // sweep flag\n    coords[2], // rotation\n    x,\n    y\n  );\n  for (let i = 0; i < seg.length; ++i) {\n    const bez = bezier(seg[i]);\n    context.bezierCurveTo(bez[0], bez[1], bez[2], bez[3], bez[4], bez[5]);\n  }\n}\n\n/* Adapted from zrender by ecomfe\n * https://github.com/ecomfe/zrender\n * Licensed under the BSD-3-Clause\n\n * url: https://github.com/ecomfe/zrender/blob/master/src/tool/morphPath.ts\n * License: https://github.com/ecomfe/zrender/blob/master/LICENSE\n * @license\n */\n\nexport const addArcToBezierPath = (\n  bezierPath: number[],\n  startAngle: number,\n  endAngle: number,\n  cx: number,\n  cy: number,\n  rx: number,\n  ry: number\n) => {\n  // https://stackoverflow.com/questions/1734745/how-to-create-circle-with-b%C3%A9zier-curves\n  const delta = Math.abs(endAngle - startAngle);\n  const len = (Math.tan(delta / 4) * 4) / 3;\n  const dir = endAngle < startAngle ? -1 : 1;\n\n  const c1 = Math.cos(startAngle);\n  const s1 = Math.sin(startAngle);\n  const c2 = Math.cos(endAngle);\n  const s2 = Math.sin(endAngle);\n\n  const x1 = c1 * rx + cx;\n  const y1 = s1 * ry + cy;\n\n  const x4 = c2 * rx + cx;\n  const y4 = s2 * ry + cy;\n\n  const hx = rx * len * dir;\n  const hy = ry * len * dir;\n\n  bezierPath.push(\n    // Move control points on tangent.\n    x1 - hx * s1,\n    y1 + hy * c1,\n    x4 + hx * s2,\n    y4 - hy * c2,\n    x4,\n    y4\n  );\n};\n"]}

package/es/common/shape/rect.d.ts

@@ -0,0 +1,2 @@
+import type { IContext2d, ICustomPath2D } from '../../interface';
+export declare function createRectPath(path: ICustomPath2D | IContext2d, x: number, y: number, width: number, height: number, rectCornerRadius: number | number[]): void | ICustomPath2D | IContext2d;

package/es/common/shape/rect.js

@@ -0,0 +1,48 @@
+import { isNumber, arrayEqual, pi } from "@visactor/vutils";
+
+const halfPi = pi / 2;
+
+export function createRectPath(path, x, y, width, height, rectCornerRadius) {
+    let cornerRadius;
+    if (isNumber(rectCornerRadius, !0)) cornerRadius = [ rectCornerRadius, rectCornerRadius, rectCornerRadius, rectCornerRadius ]; else if (Array.isArray(rectCornerRadius)) {
+        const cornerRadiusArr = rectCornerRadius;
+        switch (cornerRadiusArr.length) {
+          case 0:
+            cornerRadius = [ 0, 0, 0, 0 ];
+            break;
+
+          case 1:
+            cornerRadius = [ cornerRadiusArr[0], cornerRadiusArr[0], cornerRadiusArr[0], cornerRadiusArr[0] ];
+            break;
+
+          case 2:
+          case 3:
+            cornerRadius = [ cornerRadiusArr[0], cornerRadiusArr[1], cornerRadiusArr[0], cornerRadiusArr[1] ];
+            break;
+
+          default:
+            cornerRadius = cornerRadiusArr.slice(0, 5);
+        }
+    } else cornerRadius = [ 0, 0, 0, 0 ];
+    if (width < 0 || Math.abs(cornerRadius[0]) + Math.abs(cornerRadius[1]) + Math.abs(cornerRadius[2]) + Math.abs(cornerRadius[3]) < 1e-12) return path.rect(x, y, width, height);
+    const [leftTop, rightTop, rightBottom, leftBottom] = [ [ x, y ], [ x + width, y ], [ x + width, y + height ], [ x, y + height ] ], maxCornerRadius = Math.min(width / 2, height / 2), _cornerRadius = [ Math.min(maxCornerRadius, cornerRadius[0]), Math.min(maxCornerRadius, cornerRadius[1]), Math.min(maxCornerRadius, cornerRadius[2]), Math.min(maxCornerRadius, cornerRadius[3]) ], leftTopPoint1 = [ leftTop[0] + _cornerRadius[0], leftTop[1] ], leftTopPoint2 = [ leftTop[0], leftTop[1] + _cornerRadius[0] ], rightTopPoint1 = [ rightTop[0] - _cornerRadius[1], rightTop[1] ], rightTopPoint2 = [ rightTop[0], rightTop[1] + _cornerRadius[1] ], rightBottomPoint1 = [ rightBottom[0] - _cornerRadius[2], rightBottom[1] ], rightBottomPoint2 = [ rightBottom[0], rightBottom[1] - _cornerRadius[2] ], leftBottomPoint1 = [ leftBottom[0] + _cornerRadius[3], leftBottom[1] ], leftBottomPoint2 = [ leftBottom[0], leftBottom[1] - _cornerRadius[3] ];
+    if (path.moveTo(leftTopPoint1[0], leftTopPoint1[1]), path.lineTo(rightTopPoint1[0], rightTopPoint1[1]), 
+    !arrayEqual(rightTopPoint1, rightTopPoint2)) {
+        const centerX = rightTopPoint1[0], centerY = rightTopPoint1[1] + _cornerRadius[1];
+        path.arc(centerX, centerY, _cornerRadius[1], -halfPi, 0, !1);
+    }
+    if (path.lineTo(rightBottomPoint2[0], rightBottomPoint2[1]), !arrayEqual(rightBottomPoint1, rightBottomPoint2)) {
+        const centerX = rightBottomPoint2[0] - _cornerRadius[2], centerY = rightBottomPoint2[1];
+        path.arc(centerX, centerY, _cornerRadius[2], 0, halfPi, !1);
+    }
+    if (path.lineTo(leftBottomPoint1[0], leftBottomPoint1[1]), !arrayEqual(leftBottomPoint1, leftBottomPoint2)) {
+        const centerX = leftBottomPoint1[0], centerY = leftBottomPoint1[1] - _cornerRadius[3];
+        path.arc(centerX, centerY, _cornerRadius[3], halfPi, pi, !1);
+    }
+    if (path.lineTo(leftTopPoint2[0], leftTopPoint2[1]), !arrayEqual(leftTopPoint1, leftTopPoint2)) {
+        const centerX = leftTopPoint1[0], centerY = leftTopPoint1[1] + _cornerRadius[0];
+        path.arc(centerX, centerY, _cornerRadius[0], pi, pi + halfPi, !1);
+    }
+    return path.closePath(), path;
+}
+//# sourceMappingURL=rect.js.map

package/es/common/shape/rect.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/common/shape/rect.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,QAAQ,EAAE,UAAU,EAAE,EAAE,EAAE,MAAM,kBAAkB,CAAC;AAG5D,MAAM,MAAM,GAAG,EAAE,GAAG,CAAC,CAAC;AAEtB,MAAM,UAAU,cAAc,CAC5B,IAAgC,EAChC,CAAS,EACT,CAAS,EACT,KAAa,EACb,MAAc,EACd,gBAAmC;IAGnC,IAAI,YAAkB,CAAC;IACvB,IAAI,QAAQ,CAAC,gBAAgB,EAAE,IAAI,CAAC,EAAE;QACpC,YAAY,GAAG;YACL,gBAAgB;YAChB,gBAAgB;YAChB,gBAAgB;YAChB,gBAAgB;SACzB,CAAC;KACH;SAAM,IAAI,KAAK,CAAC,OAAO,CAAC,gBAAgB,CAAC,EAAE;QAC1C,MAAM,eAAe,GAAa,gBAA4B,CAAC;QAC/D,QAAQ,eAAe,CAAC,MAAM,EAAE;YAC9B,KAAK,CAAC;gBACJ,YAAY,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;gBAC5B,MAAM;YACR,KAAK,CAAC;gBACJ,YAAY,GAAG,CAAC,eAAe,CAAC,CAAC,CAAC,EAAE,eAAe,CAAC,CAAC,CAAC,EAAE,eAAe,CAAC,CAAC,CAAC,EAAE,eAAe,CAAC,CAAC,CAAC,CAAC,CAAC;gBAChG,MAAM;YACR,KAAK,CAAC,CAAC;YACP,KAAK,CAAC;gBACJ,YAAY,GAAG,CAAC,eAAe,CAAC,CAAC,CAAC,EAAE,eAAe,CAAC,CAAC,CAAC,EAAE,eAAe,CAAC,CAAC,CAAC,EAAE,eAAe,CAAC,CAAC,CAAC,CAAC,CAAC;gBAChG,MAAM;YACR;gBACE,YAAY,GAAG,eAAe,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAqC,CAAC;gBAC/E,MAAM;SACT;KACF;SAAM;QACL,YAAY,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;KAC7B;IAGD,IACE,KAAK,GAAG,CAAC;QACT,IAAI,CAAC,GAAG,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;YAC3G,KAAK,EACP;QACA,OAAO,IAAI,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC;KACvC;IAED,MAAM,CAAC,OAAO,EAAE,QAAQ,EAAE,WAAW,EAAE,UAAU,CAAC,GAA6B;QAC7E,CAAC,CAAC,EAAE,CAAC,CAAC;QACN,CAAC,CAAC,GAAG,KAAK,EAAE,CAAC,CAAC;QACd,CAAC,CAAC,GAAG,KAAK,EAAE,CAAC,GAAG,MAAM,CAAC;QACvB,CAAC,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC;KAChB,CAAC;IASF,MAAM,eAAe,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,GAAG,CAAC,EAAE,MAAM,GAAG,CAAC,CAAC,CAAC;IACxD,MAAM,aAAa,GAAS;QAC1B,IAAI,CAAC,GAAG,CAAC,eAAe,EAAE,YAAY,CAAC,CAAC,CAAC,CAAC;QAC1C,IAAI,CAAC,GAAG,CAAC,eAAe,EAAE,YAAY,CAAC,CAAC,CAAC,CAAC;QAC1C,IAAI,CAAC,GAAG,CAAC,eAAe,EAAE,YAAY,CAAC,CAAC,CAAC,CAAC;QAC1C,IAAI,CAAC,GAAG,CAAC,eAAe,EAAE,YAAY,CAAC,CAAC,CAAC,CAAC;KAC3C,CAAC;IACF,MAAM,aAAa,GAAS,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,aAAa,CAAC,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;IACxE,MAAM,aAAa,GAAS,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,CAAC,GAAG,aAAa,CAAC,CAAC,CAAC,CAAC,CAAC;IACxE,MAAM,cAAc,GAAS,CAAC,QAAQ,CAAC,CAAC,CAAC,GAAG,aAAa,CAAC,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;IAC3E,MAAM,cAAc,GAAS,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC,CAAC,GAAG,aAAa,CAAC,CAAC,CAAC,CAAC,CAAC;IAC3E,MAAM,iBAAiB,GAAS,CAAC,WAAW,CAAC,CAAC,CAAC,GAAG,aAAa,CAAC,CAAC,CAAC,EAAE,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC;IACpF,MAAM,iBAAiB,GAAS,CAAC,WAAW,CAAC,CAAC,CAAC,EAAE,WAAW,CAAC,CAAC,CAAC,GAAG,aAAa,CAAC,CAAC,CAAC,CAAC,CAAC;IACpF,MAAM,gBAAgB,GAAS,CAAC,UAAU,CAAC,CAAC,CAAC,GAAG,aAAa,CAAC,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC;IACjF,MAAM,gBAAgB,GAAS,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC,CAAC,GAAG,aAAa,CAAC,CAAC,CAAC,CAAC,CAAC;IAEjF,IAAI,CAAC,MAAM,CAAC,aAAa,CAAC,CAAC,CAAC,EAAE,aAAa,CAAC,CAAC,CAAC,CAAC,CAAC;IAChD,IAAI,CAAC,MAAM,CAAC,cAAc,CAAC,CAAC,CAAC,EAAE,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC;IAClD,IAAI,CAAC,UAAU,CAAC,cAAc,EAAE,cAAc,CAAC,EAAE;QAC/C,MAAM,OAAO,GAAG,cAAc,CAAC,CAAC,CAAC,CAAC;QAClC,MAAM,OAAO,GAAG,cAAc,CAAC,CAAC,CAAC,GAAG,aAAa,CAAC,CAAC,CAAC,CAAC;QACrD,IAAI,CAAC,GAAG,CACN,OAAO,EACP,OAAO,EACP,aAAa,CAAC,CAAC,CAAC,EAChB,CAAC,MAAM,EACP,CAAC,EAGD,KAAK,CACN,CAAC;KAEH;IAED,IAAI,CAAC,MAAM,CAAC,iBAAiB,CAAC,CAAC,CAAC,EAAE,iBAAiB,CAAC,CAAC,CAAC,CAAC,CAAC;IACxD,IAAI,CAAC,UAAU,CAAC,iBAAiB,EAAE,iBAAiB,CAAC,EAAE;QACrD,MAAM,OAAO,GAAG,iBAAiB,CAAC,CAAC,CAAC,GAAG,aAAa,CAAC,CAAC,CAAC,CAAC;QACxD,MAAM,OAAO,GAAG,iBAAiB,CAAC,CAAC,CAAC,CAAC;QACrC,IAAI,CAAC,GAAG,CACN,OAAO,EACP,OAAO,EACP,aAAa,CAAC,CAAC,CAAC,EAChB,CAAC,EACD,MAAM,EAGN,KAAK,CACN,CAAC;KAEH;IAED,IAAI,CAAC,MAAM,CAAC,gBAAgB,CAAC,CAAC,CAAC,EAAE,gBAAgB,CAAC,CAAC,CAAC,CAAC,CAAC;IACtD,IAAI,CAAC,UAAU,CAAC,gBAAgB,EAAE,gBAAgB,CAAC,EAAE;QACnD,MAAM,OAAO,GAAG,gBAAgB,CAAC,CAAC,CAAC,CAAC;QACpC,MAAM,OAAO,GAAG,gBAAgB,CAAC,CAAC,CAAC,GAAG,aAAa,CAAC,CAAC,CAAC,CAAC;QACvD,IAAI,CAAC,GAAG,CACN,OAAO,EACP,OAAO,EACP,aAAa,CAAC,CAAC,CAAC,EAChB,MAAM,EACN,EAAE,EAGF,KAAK,CACN,CAAC;KAEH;IAED,IAAI,CAAC,MAAM,CAAC,aAAa,CAAC,CAAC,CAAC,EAAE,aAAa,CAAC,CAAC,CAAC,CAAC,CAAC;IAChD,IAAI,CAAC,UAAU,CAAC,aAAa,EAAE,aAAa,CAAC,EAAE;QAC7C,MAAM,OAAO,GAAG,aAAa,CAAC,CAAC,CAAC,CAAC;QACjC,MAAM,OAAO,GAAG,aAAa,CAAC,CAAC,CAAC,GAAG,aAAa,CAAC,CAAC,CAAC,CAAC;QACpD,IAAI,CAAC,GAAG,CACN,OAAO,EACP,OAAO,EACP,aAAa,CAAC,CAAC,CAAC,EAChB,EAAE,EACF,EAAE,GAAG,MAAM,EAGX,KAAK,CACN,CAAC;KAEH;IACD,IAAI,CAAC,SAAS,EAAE,CAAC;IACjB,OAAO,IAAI,CAAC;AACd,CAAC","file":"rect.js","sourcesContent":["import type { vec2, vec4 } from '@visactor/vutils';\nimport { isNumber, arrayEqual, pi } from '@visactor/vutils';\nimport type { IContext2d, ICustomPath2D } from '../../interface';\n\nconst halfPi = pi / 2;\n\nexport function createRectPath(\n  path: ICustomPath2D | IContext2d,\n  x: number,\n  y: number,\n  width: number,\n  height: number,\n  rectCornerRadius: number | number[]\n) {\n  // 匹配cornerRadius\n  let cornerRadius: vec4;\n  if (isNumber(rectCornerRadius, true)) {\n    cornerRadius = [\n      <number>rectCornerRadius,\n      <number>rectCornerRadius,\n      <number>rectCornerRadius,\n      <number>rectCornerRadius\n    ];\n  } else if (Array.isArray(rectCornerRadius)) {\n    const cornerRadiusArr: number[] = rectCornerRadius as number[];\n    switch (cornerRadiusArr.length) {\n      case 0:\n        cornerRadius = [0, 0, 0, 0];\n        break;\n      case 1:\n        cornerRadius = [cornerRadiusArr[0], cornerRadiusArr[0], cornerRadiusArr[0], cornerRadiusArr[0]];\n        break;\n      case 2:\n      case 3:\n        cornerRadius = [cornerRadiusArr[0], cornerRadiusArr[1], cornerRadiusArr[0], cornerRadiusArr[1]];\n        break;\n      default:\n        cornerRadius = cornerRadiusArr.slice(0, 5) as [number, number, number, number];\n        break;\n    }\n  } else {\n    cornerRadius = [0, 0, 0, 0];\n  }\n\n  // 当宽度小于0 或者 cornerRadius 极小时，不绘制 cornerRadius\n  if (\n    width < 0 ||\n    Math.abs(cornerRadius[0]) + Math.abs(cornerRadius[1]) + Math.abs(cornerRadius[2]) + Math.abs(cornerRadius[3]) <\n      1e-12\n  ) {\n    return path.rect(x, y, width, height);\n  }\n\n  const [leftTop, rightTop, rightBottom, leftBottom]: [vec2, vec2, vec2, vec2] = [\n    [x, y],\n    [x + width, y],\n    [x + width, y + height],\n    [x, y + height]\n  ];\n  //\n  // *(leftTopPoint1)******************(rightTopPoint1)\n  // (leftTopPoint2)                  (rightTopPoint2)\n  // *                                *\n  // *                                *\n  // (leftBottomPoint2)               (rightBottomPoint2)\n  // *(leftBottomPoint1)***************(rightBottomPoint1)\n  //\n  const maxCornerRadius = Math.min(width / 2, height / 2);\n  const _cornerRadius: vec4 = [\n    Math.min(maxCornerRadius, cornerRadius[0]),\n    Math.min(maxCornerRadius, cornerRadius[1]),\n    Math.min(maxCornerRadius, cornerRadius[2]),\n    Math.min(maxCornerRadius, cornerRadius[3])\n  ];\n  const leftTopPoint1: vec2 = [leftTop[0] + _cornerRadius[0], leftTop[1]];\n  const leftTopPoint2: vec2 = [leftTop[0], leftTop[1] + _cornerRadius[0]];\n  const rightTopPoint1: vec2 = [rightTop[0] - _cornerRadius[1], rightTop[1]];\n  const rightTopPoint2: vec2 = [rightTop[0], rightTop[1] + _cornerRadius[1]];\n  const rightBottomPoint1: vec2 = [rightBottom[0] - _cornerRadius[2], rightBottom[1]];\n  const rightBottomPoint2: vec2 = [rightBottom[0], rightBottom[1] - _cornerRadius[2]];\n  const leftBottomPoint1: vec2 = [leftBottom[0] + _cornerRadius[3], leftBottom[1]];\n  const leftBottomPoint2: vec2 = [leftBottom[0], leftBottom[1] - _cornerRadius[3]];\n\n  path.moveTo(leftTopPoint1[0], leftTopPoint1[1]);\n  path.lineTo(rightTopPoint1[0], rightTopPoint1[1]);\n  if (!arrayEqual(rightTopPoint1, rightTopPoint2)) {\n    const centerX = rightTopPoint1[0];\n    const centerY = rightTopPoint1[1] + _cornerRadius[1];\n    path.arc(\n      centerX,\n      centerY,\n      _cornerRadius[1],\n      -halfPi,\n      0,\n      // Math.atan2(rightTopPoint1[1] - centerY, rightTopPoint1[0] - centerX),\n      // Math.atan2(rightTopPoint2[1] - centerY, rightTopPoint2[0] - centerX),\n      false\n    );\n    // path.arcTo(rightTop[0], rightTop[1], rightTopPoint2[0], rightTopPoint2[1], _cornerRadius[1]);\n  }\n\n  path.lineTo(rightBottomPoint2[0], rightBottomPoint2[1]);\n  if (!arrayEqual(rightBottomPoint1, rightBottomPoint2)) {\n    const centerX = rightBottomPoint2[0] - _cornerRadius[2];\n    const centerY = rightBottomPoint2[1];\n    path.arc(\n      centerX,\n      centerY,\n      _cornerRadius[2],\n      0,\n      halfPi,\n      // Math.atan2(rightBottomPoint2[1] - centerY, rightBottomPoint2[0] - centerX),\n      // Math.atan2(rightBottomPoint1[1] - centerY, rightBottomPoint1[0] - centerX),\n      false\n    );\n    // path.arcTo(rightBottom[0], rightBottom[1], rightBottomPoint1[0], rightBottomPoint1[1], _cornerRadius[2]);\n  }\n\n  path.lineTo(leftBottomPoint1[0], leftBottomPoint1[1]);\n  if (!arrayEqual(leftBottomPoint1, leftBottomPoint2)) {\n    const centerX = leftBottomPoint1[0];\n    const centerY = leftBottomPoint1[1] - _cornerRadius[3];\n    path.arc(\n      centerX,\n      centerY,\n      _cornerRadius[3],\n      halfPi,\n      pi,\n      // Math.atan2(leftBottomPoint1[1] - centerY, leftBottomPoint1[0] - centerX),\n      // Math.atan2(leftBottomPoint2[1] - centerY, leftBottomPoint2[0] - centerX),\n      false\n    );\n    // path.arcTo(leftBottom[0], leftBottom[1], leftBottomPoint2[0], leftBottomPoint2[1], _cornerRadius[3]);\n  }\n\n  path.lineTo(leftTopPoint2[0], leftTopPoint2[1]);\n  if (!arrayEqual(leftTopPoint1, leftTopPoint2)) {\n    const centerX = leftTopPoint1[0];\n    const centerY = leftTopPoint1[1] + _cornerRadius[0];\n    path.arc(\n      centerX,\n      centerY,\n      _cornerRadius[0],\n      pi,\n      pi + halfPi,\n      // Math.atan2(leftTopPoint2[1] - centerY, leftTopPoint2[0] - centerX),\n      // Math.atan2(leftTopPoint1[1] - centerY, leftTopPoint1[0] - centerX) + Math.PI * 2,\n      false\n    );\n    // path.arcTo(leftTop[0], leftTop[1], leftTopPoint1[0], leftTopPoint1[1], _cornerRadius[0]);\n  }\n  path.closePath();\n  return path;\n}\n"]}

package/es/common/sort.d.ts

@@ -0,0 +1,4 @@
+import type { IGraphic } from '../interface';
+export declare function foreach(graphic: IGraphic, defaultZIndex: number, cb: (...data: any) => boolean | void, reverse?: boolean, sort3d?: boolean): void;
+export declare function foreachAsync(graphic: IGraphic, defaultZIndex: number, cb: (data: any, i: number) => boolean | void | Promise<boolean | void>, reverse?: boolean): Promise<void>;
+export declare function findNextGraphic(graphic: IGraphic, id: number, defaultZIndex: number, reverse?: boolean): IGraphic<Partial<import("../interface").IGraphicAttribute>>;

package/es/common/sort.js

@@ -0,0 +1,94 @@
+var __awaiter = this && this.__awaiter || function(thisArg, _arguments, P, generator) {
+    return new (P || (P = Promise))((function(resolve, reject) {
+        function fulfilled(value) {
+            try {
+                step(generator.next(value));
+            } catch (e) {
+                reject(e);
+            }
+        }
+        function rejected(value) {
+            try {
+                step(generator.throw(value));
+            } catch (e) {
+                reject(e);
+            }
+        }
+        function step(result) {
+            var value;
+            result.done ? resolve(result.value) : (value = result.value, value instanceof P ? value : new P((function(resolve) {
+                resolve(value);
+            }))).then(fulfilled, rejected);
+        }
+        step((generator = generator.apply(thisArg, _arguments || [])).next());
+    }));
+};
+
+export function foreach(graphic, defaultZIndex, cb, reverse = !1, sort3d = !1) {
+    const childMap = {}, zIdxArray = [];
+    let needSort = !1;
+    if (sort3d) needSort = !0; else {
+        let lastZIndex;
+        graphic.forEachChildren(((item, i) => {
+            const {zIndex: zIndex = defaultZIndex} = item.attribute;
+            if (0 === i) lastZIndex = zIndex; else if (lastZIndex !== zIndex) return needSort = !0, 
+            !0;
+            return !1;
+        }), reverse);
+    }
+    if (needSort) {
+        graphic.forEachChildren((item => {
+            const {zIndex: zIndex = defaultZIndex} = item.attribute;
+            childMap[zIndex] ? childMap[zIndex].push(item) : (childMap[zIndex] = [ item ], zIdxArray.push(zIndex));
+        }), reverse), zIdxArray.sort(((a, b) => reverse ? b - a : a - b));
+        let skip = !1;
+        for (let i = 0; i < zIdxArray.length && !skip; i++) {
+            const idx = zIdxArray[i], children = childMap[idx];
+            sort3d && children.sort(((a, b) => {
+                var _a, _b;
+                return (reverse ? -1 : 1) * ((null !== (_a = b.attribute.z) && void 0 !== _a ? _a : 0) - (null !== (_b = a.attribute.z) && void 0 !== _b ? _b : 0));
+            }));
+            for (let i = 0; i < children.length; i++) if (cb(children[i], i)) {
+                skip = !0;
+                break;
+            }
+        }
+    } else graphic.forEachChildren(cb, reverse);
+}
+
+export function foreachAsync(graphic, defaultZIndex, cb, reverse = !1) {
+    return __awaiter(this, void 0, void 0, (function*() {
+        yield graphic.forEachChildrenAsync(cb, reverse);
+    }));
+}
+
+export function findNextGraphic(graphic, id, defaultZIndex, reverse = !1) {
+    const childMap = {}, zIdxArray = [];
+    let needSort = !1;
+    graphic.forEachChildren(((item, i) => {
+        const {zIndex: zIndex = defaultZIndex} = item.attribute;
+        if (0 === i) ; else if (undefined !== zIndex) return needSort = !0, !0;
+        return !1;
+    }), reverse);
+    let result = null, next = !1;
+    if (needSort) {
+        graphic.forEachChildren((item => {
+            const {zIndex: zIndex = defaultZIndex} = item.attribute;
+            childMap[zIndex] ? childMap[zIndex].push(item) : (childMap[zIndex] = [ item ], zIdxArray.push(zIndex));
+        }), reverse), zIdxArray.sort(((a, b) => reverse ? b - a : a - b));
+        let skip = !1;
+        for (let i = 0; i < zIdxArray.length && !skip; i++) {
+            const idx = zIdxArray[i], children = childMap[idx];
+            for (let i = 0; i < children.length; i++) {
+                if (next) {
+                    skip = !0, result = children[i];
+                    break;
+                }
+                children[i]._uid !== id || (next = !0);
+            }
+        }
+    } else graphic.forEachChildren((item => next ? (result = item, !0) : (item._uid === id && (next = !0), 
+    !1)), reverse);
+    return result;
+}
+//# sourceMappingURL=sort.js.map

package/es/common/sort.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/common/sort.ts"],"names":[],"mappings":";;;;;;;;;AAEA,MAAM,UAAU,OAAO,CACrB,OAAiB,EACjB,aAAqB,EACrB,EAAoC,EACpC,UAAmB,KAAK,EACxB,SAAkB,KAAK;IAEvB,MAAM,QAAQ,GAAiC,EAAE,CAAC;IAClD,MAAM,SAAS,GAAa,EAAE,CAAC;IAE/B,IAAI,QAAQ,GAAG,KAAK,CAAC;IACrB,IAAI,MAAM,EAAE;QACV,QAAQ,GAAG,IAAI,CAAC;KACjB;SAAM;QACL,IAAI,UAAkB,CAAC;QACvB,OAAO,CAAC,eAAe,CAAC,CAAC,IAAc,EAAE,CAAS,EAAE,EAAE;YACpD,MAAM,EAAE,MAAM,GAAG,aAAa,EAAE,GAAG,IAAI,CAAC,SAAS,CAAC;YAClD,IAAI,CAAC,KAAK,CAAC,EAAE;gBACX,UAAU,GAAG,MAAM,CAAC;aACrB;iBAAM,IAAI,UAAU,KAAK,MAAM,EAAE;gBAChC,QAAQ,GAAG,IAAI,CAAC;gBAChB,OAAO,IAAI,CAAC;aACb;YACD,OAAO,KAAK,CAAC;QACf,CAAC,EAAE,OAAO,CAAC,CAAC;KACb;IACD,IAAI,QAAQ,EAAE;QACZ,OAAO,CAAC,eAAe,CAAC,CAAC,IAAc,EAAE,EAAE;YACzC,MAAM,EAAE,MAAM,GAAG,aAAa,EAAE,GAAG,IAAI,CAAC,SAAS,CAAC;YAClD,IAAI,QAAQ,CAAC,MAAM,CAAC,EAAE;gBACpB,QAAQ,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;aAC7B;iBAAM;gBACL,QAAQ,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;gBAC1B,SAAS,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;aACxB;QACH,CAAC,EAAE,OAAO,CAAC,CAAC;QACZ,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACpD,IAAI,IAAI,GAAG,KAAK,CAAC;QACjB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;YACzC,IAAI,IAAI,EAAE;gBACR,MAAM;aACP;YACD,MAAM,GAAG,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC;YACzB,MAAM,QAAQ,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC;YAE/B,IAAI,MAAM,EAAE;gBACV,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;;oBACrB,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,MAAA,CAAC,CAAC,SAAS,CAAC,CAAC,mCAAI,CAAC,CAAC,GAAG,CAAC,MAAA,CAAC,CAAC,SAAS,CAAC,CAAC,mCAAI,CAAC,CAAC,CAAC,CAAC;gBAC5E,CAAC,CAAC,CAAC;aACJ;YACD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;gBACxC,IAAI,EAAE,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE;oBACtB,IAAI,GAAG,IAAI,CAAC;oBACZ,MAAM;iBACP;aACF;SACF;KACF;SAAM;QACL,OAAO,CAAC,eAAe,CAAC,EAAE,EAAE,OAAO,CAAC,CAAC;KACtC;AACH,CAAC;AAED,MAAM,UAAgB,YAAY,CAChC,OAAiB,EACjB,aAAqB,EACrB,EAAsE,EACtE,UAAmB,KAAK;;QAGxB,MAAM,OAAO,CAAC,oBAAoB,CAAC,EAAE,EAAE,OAAO,CAAC,CAAC;IAgDlD,CAAC;CAAA;AAED,MAAM,UAAU,eAAe,CAAC,OAAiB,EAAE,EAAU,EAAE,aAAqB,EAAE,UAAmB,KAAK;IAC5G,MAAM,QAAQ,GAAiC,EAAE,CAAC;IAClD,MAAM,SAAS,GAAa,EAAE,CAAC;IAE/B,IAAI,QAAQ,GAAG,KAAK,CAAC;IACrB,IAAI,UAAkB,CAAC;IACvB,OAAO,CAAC,eAAe,CAAC,CAAC,IAAc,EAAE,CAAS,EAAE,EAAE;QACpD,MAAM,EAAE,MAAM,GAAG,aAAa,EAAE,GAAG,IAAI,CAAC,SAAS,CAAC;QAClD,IAAI,CAAC,KAAK,CAAC,EAAE;YACX,UAAU,KAAK,MAAM,CAAC;SACvB;aAAM,IAAI,UAAU,KAAK,MAAM,EAAE;YAChC,QAAQ,GAAG,IAAI,CAAC;YAChB,OAAO,IAAI,CAAC;SACb;QACD,OAAO,KAAK,CAAC;IACf,CAAC,EAAE,OAAO,CAAC,CAAC;IACZ,IAAI,MAAM,GAAoB,IAAI,CAAC;IACnC,IAAI,IAAI,GAAY,KAAK,CAAC;IAC1B,IAAI,QAAQ,EAAE;QACZ,OAAO,CAAC,eAAe,CAAC,CAAC,IAAc,EAAE,EAAE;YACzC,MAAM,EAAE,MAAM,GAAG,aAAa,EAAE,GAAG,IAAI,CAAC,SAAS,CAAC;YAClD,IAAI,QAAQ,CAAC,MAAM,CAAC,EAAE;gBACpB,QAAQ,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;aAC7B;iBAAM;gBACL,QAAQ,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;gBAC1B,SAAS,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;aACxB;QACH,CAAC,EAAE,OAAO,CAAC,CAAC;QACZ,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACpD,IAAI,IAAI,GAAG,KAAK,CAAC;QACjB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;YACzC,IAAI,IAAI,EAAE;gBACR,MAAM;aACP;YACD,MAAM,GAAG,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC;YACzB,MAAM,QAAQ,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC;YAC/B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;gBACxC,IAAI,IAAI,EAAE;oBACR,IAAI,GAAG,IAAI,CAAC;oBACZ,MAAM,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;oBACrB,MAAM;iBACP;gBACD,IAAI,QAAQ,CAAC,CAAC,CAAC,CAAC,IAAI,KAAK,EAAE,EAAE;oBAC3B,IAAI,GAAG,IAAI,CAAC;oBACZ,SAAS;iBACV;aACF;SACF;KACF;SAAM;QACL,OAAO,CAAC,eAAe,CAAC,IAAI,CAAC,EAAE;YAC7B,IAAI,IAAI,EAAE;gBACR,MAAM,GAAG,IAAgB,CAAC;gBAC1B,OAAO,IAAI,CAAC;aACb;YACD,IAAI,IAAI,CAAC,IAAI,KAAK,EAAE,EAAE;gBACpB,IAAI,GAAG,IAAI,CAAC;aACb;YACD,OAAO,KAAK,CAAC;QACf,CAAC,EAAE,OAAO,CAAC,CAAC;KACb;IAED,OAAO,MAAM,CAAC;AAChB,CAAC","file":"sort.js","sourcesContent":["import type { IGraphic } from '../interface';\n\nexport function foreach(\n  graphic: IGraphic,\n  defaultZIndex: number,\n  cb: (...data: any) => boolean | void,\n  reverse: boolean = false,\n  sort3d: boolean = false\n) {\n  const childMap: { [id: number]: IGraphic[] } = {};\n  const zIdxArray: number[] = [];\n  // 遍历一遍查看是否有zIndex不同的\n  let needSort = false;\n  if (sort3d) {\n    needSort = true;\n  } else {\n    let lastZIndex: number;\n    graphic.forEachChildren((item: IGraphic, i: number) => {\n      const { zIndex = defaultZIndex } = item.attribute;\n      if (i === 0) {\n        lastZIndex = zIndex;\n      } else if (lastZIndex !== zIndex) {\n        needSort = true;\n        return true;\n      }\n      return false;\n    }, reverse);\n  }\n  if (needSort) {\n    graphic.forEachChildren((item: IGraphic) => {\n      const { zIndex = defaultZIndex } = item.attribute;\n      if (childMap[zIndex]) {\n        childMap[zIndex].push(item);\n      } else {\n        childMap[zIndex] = [item];\n        zIdxArray.push(zIndex);\n      }\n    }, reverse);\n    zIdxArray.sort((a, b) => (reverse ? b - a : a - b));\n    let skip = false;\n    for (let i = 0; i < zIdxArray.length; i++) {\n      if (skip) {\n        break;\n      }\n      const idx = zIdxArray[i];\n      const children = childMap[idx];\n      // 根据z进行排序\n      if (sort3d) {\n        children.sort((a, b) => {\n          return (reverse ? -1 : 1) * ((b.attribute.z ?? 0) - (a.attribute.z ?? 0));\n        });\n      }\n      for (let i = 0; i < children.length; i++) {\n        if (cb(children[i], i)) {\n          skip = true;\n          break;\n        }\n      }\n    }\n  } else {\n    graphic.forEachChildren(cb, reverse);\n  }\n}\n\nexport async function foreachAsync(\n  graphic: IGraphic,\n  defaultZIndex: number,\n  cb: (data: any, i: number) => boolean | void | Promise<boolean | void>,\n  reverse: boolean = false\n) {\n  // 不支持zIndex\n  await graphic.forEachChildrenAsync(cb, reverse);\n  // const childMap: { [id: number]: IGraphic[] } = {};\n  // const zIdxArray: number[] = [];\n  // // 遍历一遍查看是否有zIndex不同的\n  // let needSort = false;\n  // let lastZIndex: number;\n  // graphic.forEachChildren((item: IGraphic, i: number) => {\n  //   const { zIndex = defaultZIndex } = item.attribute;\n  //   if (i === 0) {\n  //     lastZIndex === zIndex;\n  //   } else if (lastZIndex !== zIndex) {\n  //     needSort = true;\n  //     return true;\n  //   }\n  //   return false;\n  // }, reverse);\n  // if (needSort) {\n  //   graphic.forEachChildren((item: IGraphic) => {\n  //     const { zIndex = defaultZIndex } = item.attribute;\n  //     if (childMap[zIndex]) {\n  //       childMap[zIndex].push(item);\n  //     } else {\n  //       childMap[zIndex] = [item];\n  //       zIdxArray.push(zIndex);\n  //     }\n  //   }, reverse);\n  //   zIdxArray.sort((a, b) => (reverse ? b - a : a - b));\n  //   let skip = false;\n  //   for (let i = 0; i < zIdxArray.length; i++) {\n  //     if (skip) {\n  //       break;\n  //     }\n  //     const idx = zIdxArray[i];\n  //     const children = childMap[idx];\n  //     for (let i = 0; i < children.length; i++) {\n  //       let d = cb(children[i], i);\n  //       if ((d as any).then) {\n  //         d = await d;\n  //       }\n  //       if (d) {\n  //         skip = true;\n  //         break;\n  //       }\n  //     }\n  //   }\n  // } else {\n  //   await graphic.forEachChildrenAsync(cb, reverse);\n  // }\n}\n\nexport function findNextGraphic(graphic: IGraphic, id: number, defaultZIndex: number, reverse: boolean = false) {\n  const childMap: { [id: number]: IGraphic[] } = {};\n  const zIdxArray: number[] = [];\n  // 遍历一遍查看是否有zIndex不同的\n  let needSort = false;\n  let lastZIndex: number;\n  graphic.forEachChildren((item: IGraphic, i: number) => {\n    const { zIndex = defaultZIndex } = item.attribute;\n    if (i === 0) {\n      lastZIndex === zIndex;\n    } else if (lastZIndex !== zIndex) {\n      needSort = true;\n      return true;\n    }\n    return false;\n  }, reverse);\n  let result: IGraphic | null = null;\n  let next: boolean = false;\n  if (needSort) {\n    graphic.forEachChildren((item: IGraphic) => {\n      const { zIndex = defaultZIndex } = item.attribute;\n      if (childMap[zIndex]) {\n        childMap[zIndex].push(item);\n      } else {\n        childMap[zIndex] = [item];\n        zIdxArray.push(zIndex);\n      }\n    }, reverse);\n    zIdxArray.sort((a, b) => (reverse ? b - a : a - b));\n    let skip = false;\n    for (let i = 0; i < zIdxArray.length; i++) {\n      if (skip) {\n        break;\n      }\n      const idx = zIdxArray[i];\n      const children = childMap[idx];\n      for (let i = 0; i < children.length; i++) {\n        if (next) {\n          skip = true;\n          result = children[i];\n          break;\n        }\n        if (children[i]._uid === id) {\n          next = true;\n          continue;\n        }\n      }\n    }\n  } else {\n    graphic.forEachChildren(item => {\n      if (next) {\n        result = item as IGraphic;\n        return true;\n      }\n      if (item._uid === id) {\n        next = true;\n      }\n      return false;\n    }, reverse);\n  }\n\n  return result;\n}\n"]}

package/es/common/split-path.d.ts

@@ -0,0 +1,44 @@
+import type { ICustomPath2D } from './../interface/path';
+import type { IPointLike } from '@visactor/vutils';
+import type { ILine, IRect, IArc, ICircle, IArea, IPolygon, IPath } from '../interface';
+export declare function splitToGrids(width: number, height: number, count: number): number[];
+export declare const splitRect: (rect: IRect, count: number) => {
+    x: number;
+    y: number;
+    width: number;
+    height: number;
+}[];
+export declare const splitArc: (arc: IArc, count: number) => {
+    innerRadius: number;
+    outerRadius: number;
+    startAngle: number;
+    endAngle: number;
+}[];
+export declare const splitCircle: (arc: ICircle, count: number) => {
+    innerRadius: number;
+    outerRadius: number;
+    startAngle: any;
+    endAngle: any;
+}[];
+export declare const splitArea: (area: IArea, count: number) => {
+    points: IPointLike[];
+}[];
+export declare const splitLine: (line: ILine, count: number) => IPointLike[];
+export declare const binarySplitPolygon: (points: IPointLike[]) => {
+    x: number;
+    y: number;
+}[][];
+export declare const recursiveCallBinarySplit: (points: IPointLike[], count: number, out: {
+    points: IPointLike[];
+}[]) => void;
+export declare const splitPolygon: (polygon: IPolygon, count: number) => {
+    points: {
+        x: number;
+        y: number;
+    }[];
+}[];
+export declare const splitPath: (path: IPath, count: number) => {
+    path: ICustomPath2D;
+}[] | {
+    points: IPointLike[];
+}[];

package/es/common/split-path.js

@@ -0,0 +1,249 @@
+import { isNumber, Bounds, getIntersectPoint } from "@visactor/vutils";
+
+import { bezierCurversToPath, pathToBezierCurves } from "./morphing-utils";
+
+export function splitToGrids(width, height, count) {
+    const ratio = width / height;
+    let rowCount, columnCount;
+    width >= height ? (columnCount = Math.ceil(Math.sqrt(count * ratio)), rowCount = Math.floor(count / columnCount), 
+    0 === rowCount && (rowCount = 1, columnCount = count)) : (rowCount = Math.ceil(Math.sqrt(count / ratio)), 
+    columnCount = Math.floor(count / rowCount), 0 === columnCount && (columnCount = 1, 
+    rowCount = count));
+    const grids = [];
+    for (let i = 0; i < rowCount; i++) grids.push(columnCount);
+    const remained = count - rowCount * columnCount;
+    if (remained > 0) for (let i = 0; i < remained; i += columnCount) i + columnCount < remained ? grids.push(columnCount) : grids.push(remained - i);
+    return grids;
+}
+
+export const splitRect = (rect, count) => {
+    const width = rect.getComputedAttribute("width"), height = rect.getComputedAttribute("height"), grids = splitToGrids(width, height, count), res = [], gridHeight = height / grids.length;
+    for (let i = 0, rowCount = grids.length; i < rowCount; i++) {
+        const columnCount = grids[i], gridWidth = width / columnCount;
+        for (let j = 0; j < columnCount; j++) res.push({
+            x: 0 + j * gridWidth,
+            y: 0 + i * gridHeight,
+            width: gridWidth,
+            height: gridHeight
+        });
+    }
+    return res;
+};
+
+export const splitArc = (arc, count) => {
+    const angles = arc.getParsedAngle(), startAngle = angles.startAngle, endAngle = angles.endAngle, innerRadius = arc.getComputedAttribute("innerRadius"), outerRadius = arc.getComputedAttribute("outerRadius"), angleDelta = Math.abs(startAngle - endAngle), radiusDelta = Math.abs(outerRadius - innerRadius), grids = splitToGrids(angleDelta * (innerRadius + outerRadius) / 2, radiusDelta, count), res = [], gridRadius = radiusDelta / grids.length, radiusSign = outerRadius >= innerRadius ? 1 : -1, angleSign = endAngle >= startAngle ? 1 : -1;
+    for (let i = 0, rowCount = grids.length; i < rowCount; i++) {
+        const columnCount = grids[i], gridAngle = angleDelta / columnCount;
+        for (let j = 0; j < columnCount; j++) res.push({
+            innerRadius: outerRadius - gridRadius * i * radiusSign,
+            outerRadius: outerRadius - gridRadius * (i + 1) * radiusSign,
+            startAngle: startAngle + gridAngle * j * angleSign,
+            endAngle: startAngle + gridAngle * (j + 1) * angleSign
+        });
+    }
+    return res;
+};
+
+export const splitCircle = (arc, count) => {
+    const startAngle = arc.getComputedAttribute("startAngle"), endAngle = arc.getComputedAttribute("endAngle"), radius = arc.getComputedAttribute("radius"), angleDelta = Math.abs(startAngle - endAngle), grids = splitToGrids(angleDelta * radius, radius, count), res = [], gridAngle = angleDelta / grids[0], gridRadius = radius / grids.length, angleSign = endAngle >= startAngle ? 1 : -1;
+    for (let i = 0, rowCount = grids.length; i < rowCount; i++) for (let j = 0, columnCount = grids[i]; j < columnCount; j++) res.push({
+        innerRadius: gridRadius * i,
+        outerRadius: gridRadius * (i + 1),
+        startAngle: startAngle + gridAngle * j * angleSign,
+        endAngle: startAngle + gridAngle * (j + 1) * angleSign
+    });
+    return res;
+};
+
+const samplingPoints = (points, count) => {
+    const validatePoints = points.filter((point => !1 !== point.defined && isNumber(point.x) && isNumber(point.y)));
+    if (0 === validatePoints.length) return [];
+    if (1 === validatePoints.length) return new Array(count).fill(0).map((i => validatePoints[0]));
+    const res = [];
+    if (count <= validatePoints.length) {
+        const step = validatePoints.length / count;
+        let i = 0, cur = 0;
+        for (;i < count; ) res.push(validatePoints[Math.floor(cur)]), cur += step, i++;
+        return res;
+    }
+    const insertCount = count - validatePoints.length, insetRatio = 1 / (insertCount / (validatePoints.length - 1) + 1);
+    let curCount = 0;
+    for (let i = 0, len = points.length; i < len; i++) if (res.push(points[i]), i < len - 1) {
+        let cur = insetRatio;
+        const xCur = points[i].x, yCur = points[i].y, xNext = points[i + 1].x, yNext = points[i + 1].y;
+        for (;cur < 1 && curCount < insertCount; ) res.push({
+            x: xCur + (xNext - xCur) * cur,
+            y: yCur + (yNext - yCur) * cur
+        }), cur += insetRatio, curCount += 1;
+    }
+    return res;
+};
+
+export const splitArea = (area, count) => {
+    var _a, _b;
+    const attribute = area.attribute;
+    let points = attribute.points;
+    const segements = attribute.segments;
+    points || (points = segements.reduce(((res, seg) => {
+        var _a;
+        return res.concat(null !== (_a = seg.points) && void 0 !== _a ? _a : []);
+    }), []));
+    const validatePoints = points.filter((point => !1 !== point.defined && isNumber(point.x) && isNumber(point.y)));
+    if (!validatePoints.length) return [];
+    const allPoints = [];
+    validatePoints.forEach((point => {
+        allPoints.push({
+            x: point.x,
+            y: point.y
+        });
+    }));
+    for (let i = validatePoints.length - 1; i >= 0; i--) {
+        const point = validatePoints[i];
+        allPoints.push({
+            x: null !== (_a = point.x1) && void 0 !== _a ? _a : point.x,
+            y: null !== (_b = point.y1) && void 0 !== _b ? _b : point.y
+        });
+    }
+    const res = [];
+    return recursiveCallBinarySplit(points, count, res), res;
+};
+
+export const splitLine = (line, count) => {
+    const attribute = line.attribute, points = attribute.points;
+    if (points) return samplingPoints(points, count);
+    if (attribute.segments) {
+        const allPoints = attribute.segments.reduce(((res, seg) => {
+            var _a;
+            return res.concat(null !== (_a = seg.points) && void 0 !== _a ? _a : []);
+        }), []);
+        return samplingPoints(allPoints, count);
+    }
+    return [];
+};
+
+function crossProduct(dir1, dir2) {
+    return dir1[0] * dir2[1] - dir1[1] * dir2[0];
+}
+
+const clonePoints = points => points.map((p => ({
+    x: p.x,
+    y: p.y
+}))), splitPolygonByLine = (points, p0, p1) => {
+    const len = points.length, intersections = [];
+    for (let i = 0; i < len; i++) {
+        const cur = points[i], next = i === len - 1 ? points[0] : points[i + 1], res = getIntersectPoint([ p0.x, p0.y ], [ p1.x, p1.y ], [ cur.x, cur.y ], [ next.x, next.y ]);
+        res && "boolean" != typeof res && intersections.push({
+            dot: crossProduct([ res[0] - p0.x, res[1] - p0.x ], [ p1.x - p0.x, p1.y - p0.x ]),
+            point: {
+                x: res[0],
+                y: res[1]
+            },
+            edgeIndex: i
+        });
+    }
+    if (intersections.length < 2) return [ clonePoints(points), clonePoints(points) ];
+    intersections.sort(((a, b) => a.dot - b.dot));
+    let is0 = intersections[0], is1 = intersections[intersections.length - 1];
+    is0.edgeIndex > is1.edgeIndex && ([is0, is1] = [ is1, is0 ]);
+    const newP0 = is0.point, newP1 = is1.point, newPointsA = [ {
+        x: newP0.x,
+        y: newP0.y
+    } ];
+    for (let i = is0.edgeIndex + 1; i <= is1.edgeIndex; i++) newPointsA.push({
+        x: points[i].x,
+        y: points[i].y
+    });
+    newPointsA.push({
+        x: newP1.x,
+        y: newP1.y
+    });
+    const newPointsB = [ {
+        x: newP1.x,
+        y: newP1.y
+    } ];
+    for (let i = is1.edgeIndex + 1, maxIndex = is0.edgeIndex + len; i <= maxIndex; i++) {
+        const p = points[i % len];
+        newPointsB.push({
+            x: p.x,
+            y: p.y
+        });
+    }
+    return newPointsB.push({
+        x: newP0.x,
+        y: newP0.y
+    }), [ newPointsA, newPointsB ];
+};
+
+export const binarySplitPolygon = points => {
+    const box = new Bounds;
+    points.forEach((point => {
+        box.add(point.x, point.y);
+    }));
+    const width = box.width(), height = box.height();
+    if (width >= height) {
+        const midX = box.x1 + width / 2;
+        return splitPolygonByLine(points, {
+            x: midX,
+            y: box.y1
+        }, {
+            x: midX,
+            y: box.y2
+        });
+    }
+    const midY = box.y1 + height / 2;
+    return splitPolygonByLine(points, {
+        x: box.x1,
+        y: midY
+    }, {
+        x: box.x2,
+        y: midY
+    });
+};
+
+export const recursiveCallBinarySplit = (points, count, out) => {
+    if (1 === count) out.push({
+        points: points
+    }); else {
+        const half = Math.floor(count / 2), res = binarySplitPolygon(points);
+        recursiveCallBinarySplit(res[0], half, out), recursiveCallBinarySplit(res[1], count - half, out);
+    }
+};
+
+export const splitPolygon = (polygon, count) => {
+    const points = polygon.attribute.points;
+    if (!points || !points.length) return [];
+    if (1 === count) return [ {
+        points: clonePoints(points)
+    } ];
+    const res = [];
+    return recursiveCallBinarySplit(points, count, res), res;
+};
+
+export const splitPath = (path, count) => {
+    const pathShape = path.getParsedPathShape(), bezierCurves = pathToBezierCurves(pathShape);
+    if (!bezierCurves.length || count < 0) return [];
+    const subPathCnt = bezierCurves.length;
+    if (bezierCurves.length >= count) {
+        const res = [], stepCount = Math.floor(bezierCurves.length / count);
+        for (let i = 0; i < count; i++) {
+            const curves = bezierCurves.slice(i * stepCount, i === count - 1 ? subPathCnt : (i + 1) * stepCount);
+            res.push({
+                path: bezierCurversToPath(curves)
+            });
+        }
+        return res;
+    }
+    const res = [], stepCount = Math.floor(count / subPathCnt);
+    let remain = count;
+    for (let c = 0; c < subPathCnt; c++) {
+        const points = [];
+        for (let i = 2, len = bezierCurves[c].length; i < len; i += 2) points.push({
+            x: bezierCurves[0][i],
+            y: bezierCurves[0][i + 1]
+        });
+        recursiveCallBinarySplit(points, c === subPathCnt - 1 ? remain : stepCount, res), 
+        remain -= stepCount;
+    }
+    return res;
+};
+//# sourceMappingURL=split-path.js.map

package/es/common/split-path.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/common/split-path.ts"],"names":[],"mappings":"AAWA,OAAO,EAAE,QAAQ,EAAE,MAAM,EAAE,iBAAiB,EAAE,MAAM,kBAAkB,CAAC;AAEvE,OAAO,EAAE,mBAAmB,EAAE,kBAAkB,EAAE,MAAM,kBAAkB,CAAC;AAI3E,MAAM,UAAU,YAAY,CAAC,KAAa,EAAE,MAAc,EAAE,KAAa;IACvE,MAAM,KAAK,GAAG,KAAK,GAAG,MAAM,CAAC;IAE7B,IAAI,QAAgB,CAAC;IACrB,IAAI,WAAmB,CAAC;IAExB,IAAI,KAAK,IAAI,MAAM,EAAE;QACnB,WAAW,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC,CAAC,CAAC;QAClD,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,GAAG,WAAW,CAAC,CAAC;QAE3C,IAAI,QAAQ,KAAK,CAAC,EAAE;YAClB,QAAQ,GAAG,CAAC,CAAC;YACb,WAAW,GAAG,KAAK,CAAC;SACrB;KACF;SAAM;QACL,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC,CAAC,CAAC;QAC/C,WAAW,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,GAAG,QAAQ,CAAC,CAAC;QAE3C,IAAI,WAAW,KAAK,CAAC,EAAE;YACrB,WAAW,GAAG,CAAC,CAAC;YAChB,QAAQ,GAAG,KAAK,CAAC;SAClB;KACF;IAED,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,EAAE,CAAC,EAAE,EAAE;QACjC,KAAK,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;KACzB;IACD,MAAM,QAAQ,GAAG,QAAQ,GAAG,WAAW,CAAC;IACxC,MAAM,QAAQ,GAAG,KAAK,GAAG,QAAQ,CAAC;IAElC,IAAI,QAAQ,GAAG,CAAC,EAAE;QAChB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,EAAE,CAAC,IAAI,WAAW,EAAE;YAC9C,IAAI,CAAC,GAAG,WAAW,GAAG,QAAQ,EAAE;gBAC9B,KAAK,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;aACzB;iBAAM;gBACL,KAAK,CAAC,IAAI,CAAC,QAAQ,GAAG,CAAC,CAAC,CAAC;aAC1B;SACF;KACF;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED,MAAM,CAAC,MAAM,SAAS,GAAG,CAAC,IAAW,EAAE,KAAa,EAAE,EAAE;IACtD,MAAM,CAAC,GAAG,CAAC,CAAC;IACZ,MAAM,CAAC,GAAG,CAAC,CAAC;IACZ,MAAM,KAAK,GAAG,IAAI,CAAC,oBAAoB,CAAC,OAAO,CAAC,CAAC;IACjD,MAAM,MAAM,GAAG,IAAI,CAAC,oBAAoB,CAAC,QAAQ,CAAC,CAAC;IACnD,MAAM,KAAK,GAAG,YAAY,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,CAAC,CAAC;IACjD,MAAM,GAAG,GAAG,EAAE,CAAC;IACf,MAAM,UAAU,GAAG,MAAM,GAAG,KAAK,CAAC,MAAM,CAAC;IAEzC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,QAAQ,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,GAAG,QAAQ,EAAE,CAAC,EAAE,EAAE;QAC1D,MAAM,WAAW,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;QAC7B,MAAM,SAAS,GAAG,KAAK,GAAG,WAAW,CAAC;QACtC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,WAAW,EAAE,CAAC,EAAE,EAAE;YACpC,GAAG,CAAC,IAAI,CAAC;gBACP,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,SAAS;gBACpB,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,UAAU;gBACrB,KAAK,EAAE,SAAS;gBAChB,MAAM,EAAE,UAAU;aACnB,CAAC,CAAC;SACJ;KACF;IAED,OAAO,GAAG,CAAC;AACb,CAAC,CAAC;AAEF,MAAM,CAAC,MAAM,QAAQ,GAAG,CAAC,GAAS,EAAE,KAAa,EAAE,EAAE;IACnD,MAAM,CAAC,GAAG,CAAC,CAAC;IACZ,MAAM,CAAC,GAAG,CAAC,CAAC;IACZ,MAAM,MAAM,GAAG,GAAG,CAAC,cAAc,EAAE,CAAC;IACpC,MAAM,UAAU,GAAG,MAAM,CAAC,UAAU,CAAC;IACrC,MAAM,QAAQ,GAAG,MAAM,CAAC,QAAQ,CAAC;IACjC,MAAM,WAAW,GAAG,GAAG,CAAC,oBAAoB,CAAC,aAAa,CAAC,CAAC;IAC5D,MAAM,WAAW,GAAG,GAAG,CAAC,oBAAoB,CAAC,aAAa,CAAC,CAAC;IAC5D,MAAM,UAAU,GAAG,IAAI,CAAC,GAAG,CAAC,UAAU,GAAG,QAAQ,CAAC,CAAC;IACnD,MAAM,WAAW,GAAG,IAAI,CAAC,GAAG,CAAC,WAAW,GAAG,WAAW,CAAC,CAAC;IAExD,MAAM,KAAK,GAAG,YAAY,CAAC,CAAC,UAAU,GAAG,CAAC,WAAW,GAAG,WAAW,CAAC,CAAC,GAAG,CAAC,EAAE,WAAW,EAAE,KAAK,CAAC,CAAC;IAC/F,MAAM,GAAG,GAAG,EAAE,CAAC;IACf,MAAM,UAAU,GAAG,WAAW,GAAG,KAAK,CAAC,MAAM,CAAC;IAC9C,MAAM,UAAU,GAAG,WAAW,IAAI,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACvD,MAAM,SAAS,GAAG,QAAQ,IAAI,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAElD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,QAAQ,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,GAAG,QAAQ,EAAE,CAAC,EAAE,EAAE;QAC1D,MAAM,WAAW,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;QAC7B,MAAM,SAAS,GAAG,UAAU,GAAG,WAAW,CAAC;QAC3C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,WAAW,EAAE,CAAC,EAAE,EAAE;YAEpC,GAAG,CAAC,IAAI,CAAC;gBACP,WAAW,EAAE,WAAW,GAAG,UAAU,GAAG,CAAC,GAAG,UAAU;gBACtD,WAAW,EAAE,WAAW,GAAG,UAAU,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,UAAU;gBAC5D,UAAU,EAAE,UAAU,GAAG,SAAS,GAAG,CAAC,GAAG,SAAS;gBAClD,QAAQ,EAAE,UAAU,GAAG,SAAS,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,SAAS;aACvD,CAAC,CAAC;SACJ;KACF;IAED,OAAO,GAAG,CAAC;AACb,CAAC,CAAC;AAEF,MAAM,CAAC,MAAM,WAAW,GAAG,CAAC,GAAY,EAAE,KAAa,EAAE,EAAE;IACzD,MAAM,CAAC,GAAG,CAAC,CAAC;IACZ,MAAM,CAAC,GAAG,CAAC,CAAC;IACZ,MAAM,UAAU,GAAG,GAAG,CAAC,oBAAoB,CAAC,YAAY,CAAC,CAAC;IAC1D,MAAM,QAAQ,GAAG,GAAG,CAAC,oBAAoB,CAAC,UAAU,CAAC,CAAC;IACtD,MAAM,MAAM,GAAG,GAAG,CAAC,oBAAoB,CAAC,QAAQ,CAAC,CAAC;IAClD,MAAM,UAAU,GAAG,IAAI,CAAC,GAAG,CAAC,UAAU,GAAG,QAAQ,CAAC,CAAC;IAEnD,MAAM,KAAK,GAAG,YAAY,CAAC,UAAU,GAAG,MAAM,EAAE,MAAM,EAAE,KAAK,CAAC,CAAC;IAC/D,MAAM,GAAG,GAAG,EAAE,CAAC;IACf,MAAM,SAAS,GAAG,UAAU,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;IACxC,MAAM,UAAU,GAAG,MAAM,GAAG,KAAK,CAAC,MAAM,CAAC;IACzC,MAAM,SAAS,GAAG,QAAQ,IAAI,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAElD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,QAAQ,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,GAAG,QAAQ,EAAE,CAAC,EAAE,EAAE;QAC1D,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,WAAW,GAAG,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,WAAW,EAAE,CAAC,EAAE,EAAE;YAC5D,GAAG,CAAC,IAAI,CAAC;gBACP,WAAW,EAAE,UAAU,GAAG,CAAC;gBAC3B,WAAW,EAAE,UAAU,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;gBACjC,UAAU,EAAE,UAAU,GAAG,SAAS,GAAG,CAAC,GAAG,SAAS;gBAClD,QAAQ,EAAE,UAAU,GAAG,SAAS,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,SAAS;aACvD,CAAC,CAAC;SACJ;KACF;IAED,OAAO,GAAG,CAAC;AACb,CAAC,CAAC;AAEF,MAAM,cAAc,GAAG,CAAC,MAAoB,EAAE,KAAa,EAAE,EAAE;IAC7D,MAAM,cAAc,GAAG,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,EAAE,CAAC,KAAK,CAAC,OAAO,KAAK,KAAK,IAAI,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;IAEjH,IAAI,cAAc,CAAC,MAAM,KAAK,CAAC,EAAE;QAC/B,OAAO,EAAE,CAAC;KACX;IACD,IAAI,cAAc,CAAC,MAAM,KAAK,CAAC,EAAE;QAC/B,OAAO,IAAI,KAAK,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC;KAC7D;IAED,MAAM,GAAG,GAAG,EAAE,CAAC;IACf,IAAI,KAAK,IAAI,cAAc,CAAC,MAAM,EAAE;QAClC,MAAM,IAAI,GAAG,cAAc,CAAC,MAAM,GAAG,KAAK,CAAC;QAC3C,IAAI,CAAC,GAAG,CAAC,CAAC;QACV,IAAI,GAAG,GAAG,CAAC,CAAC;QAEZ,OAAO,CAAC,GAAG,KAAK,EAAE;YAChB,GAAG,CAAC,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YAE1C,GAAG,IAAI,IAAI,CAAC;YACZ,CAAC,EAAE,CAAC;SACL;QAED,OAAO,GAAG,CAAC;KACZ;IAED,MAAM,WAAW,GAAG,KAAK,GAAG,cAAc,CAAC,MAAM,CAAC;IAClD,MAAM,UAAU,GAAG,WAAW,GAAG,CAAC,cAAc,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IAC7D,MAAM,UAAU,GAAG,CAAC,GAAG,CAAC,UAAU,GAAG,CAAC,CAAC,CAAC;IACxC,IAAI,QAAQ,GAAG,CAAC,CAAC;IAEjB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,GAAG,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE;QACjD,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;QAEpB,IAAI,CAAC,GAAG,GAAG,GAAG,CAAC,EAAE;YACf,IAAI,GAAG,GAAG,UAAU,CAAC;YACrB,MAAM,IAAI,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YACzB,MAAM,IAAI,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YACzB,MAAM,KAAK,GAAG,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;YAC9B,MAAM,KAAK,GAAG,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;YAE9B,OAAO,GAAG,GAAG,CAAC,IAAI,QAAQ,GAAG,WAAW,EAAE;gBACxC,GAAG,CAAC,IAAI,CAAC;oBACP,CAAC,EAAE,IAAI,GAAG,CAAC,KAAK,GAAG,IAAI,CAAC,GAAG,GAAG;oBAC9B,CAAC,EAAE,IAAI,GAAG,CAAC,KAAK,GAAG,IAAI,CAAC,GAAG,GAAG;iBAC/B,CAAC,CAAC;gBACH,GAAG,IAAI,UAAU,CAAC;gBAClB,QAAQ,IAAI,CAAC,CAAC;aACf;SACF;KACF;IAED,OAAO,GAAG,CAAC;AACb,CAAC,CAAC;AAEF,MAAM,CAAC,MAAM,SAAS,GAAG,CAAC,IAAW,EAAE,KAAa,EAAE,EAAE;;IACtD,MAAM,SAAS,GAAG,IAAI,CAAC,SAAS,CAAC;IACjC,IAAI,MAAM,GAAG,SAAS,CAAC,MAAM,CAAC;IAC9B,MAAM,SAAS,GAAG,SAAS,CAAC,QAAQ,CAAC;IAErC,IAAI,CAAC,MAAM,EAAE;QACX,MAAM,GAAG,SAAS,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,EAAE;;YACrC,OAAO,GAAG,CAAC,MAAM,CAAC,MAAA,GAAG,CAAC,MAAM,mCAAI,EAAE,CAAC,CAAC;QACtC,CAAC,EAAE,EAAE,CAAC,CAAC;KACR;IACD,MAAM,cAAc,GAAG,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,EAAE,CAAC,KAAK,CAAC,OAAO,KAAK,KAAK,IAAI,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;IAEjH,IAAI,CAAC,cAAc,CAAC,MAAM,EAAE;QAC1B,OAAO,EAAE,CAAC;KACX;IAED,MAAM,SAAS,GAAiB,EAAE,CAAC;IAEnC,cAAc,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE;QAC7B,SAAS,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,KAAK,CAAC,CAAC,EAAE,CAAC,EAAE,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC;IAC7C,CAAC,CAAC,CAAC;IAEH,KAAK,IAAI,CAAC,GAAG,cAAc,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE;QACnD,MAAM,KAAK,GAAG,cAAc,CAAC,CAAC,CAAC,CAAC;QAEhC,SAAS,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,MAAA,KAAK,CAAC,EAAE,mCAAI,KAAK,CAAC,CAAC,EAAE,CAAC,EAAE,MAAA,KAAK,CAAC,EAAE,mCAAI,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC;KACpE;IAED,MAAM,GAAG,GAA+B,EAAE,CAAC;IAE3C,wBAAwB,CAAC,MAAM,EAAE,KAAK,EAAE,GAAG,CAAC,CAAC;IAE7C,OAAO,GAAG,CAAC;AACb,CAAC,CAAC;AAEF,MAAM,CAAC,MAAM,SAAS,GAAG,CAAC,IAAW,EAAE,KAAa,EAAE,EAAE;IACtD,MAAM,SAAS,GAAG,IAAI,CAAC,SAAS,CAAC;IACjC,MAAM,MAAM,GAAG,SAAS,CAAC,MAAM,CAAC;IAEhC,IAAI,MAAM,EAAE;QACV,OAAO,cAAc,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;KACtC;SAAM,IAAI,SAAS,CAAC,QAAQ,EAAE;QAC7B,MAAM,IAAI,GAAG,SAAS,CAAC,QAAQ,CAAC;QAChC,MAAM,SAAS,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,EAAE;;YACzC,OAAO,GAAG,CAAC,MAAM,CAAC,MAAA,GAAG,CAAC,MAAM,mCAAI,EAAE,CAAC,CAAC;QACtC,CAAC,EAAE,EAAE,CAAC,CAAC;QAEP,OAAO,cAAc,CAAC,SAAS,EAAE,KAAK,CAAC,CAAC;KACzC;IACD,OAAO,EAAE,CAAC;AACZ,CAAC,CAAC;AAEF,SAAS,YAAY,CAAC,IAAsB,EAAE,IAAsB;IAClE,OAAO,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;AAC/C,CAAC;AAED,MAAM,WAAW,GAAG,CAAC,MAAoB,EAAE,EAAE;IAC3C,OAAO,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;AAC/C,CAAC,CAAC;AAEF,MAAM,kBAAkB,GAAG,CAAC,MAAoB,EAAE,EAAc,EAAE,EAAc,EAAE,EAAE;IAClF,MAAM,GAAG,GAAG,MAAM,CAAC,MAAM,CAAC;IAC1B,MAAM,aAAa,GAA4D,EAAE,CAAC;IAElF,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE;QAC5B,MAAM,GAAG,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;QACtB,MAAM,IAAI,GAAG,CAAC,KAAK,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAEvD,MAAM,GAAG,GAAG,iBAAiB,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;QAE5F,IAAI,GAAG,IAAI,OAAO,GAAG,KAAK,SAAS,EAAE;YACnC,aAAa,CAAC,IAAI,CAAC;gBACjB,GAAG,EAAE,YAAY,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC;gBAC7E,KAAK,EAAE,EAAE,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,EAAE;gBAC/B,SAAS,EAAE,CAAC;aACb,CAAC,CAAC;SACJ;KACF;IAED,IAAI,aAAa,CAAC,MAAM,GAAG,CAAC,EAAE;QAE5B,OAAO,CAAC,WAAW,CAAC,MAAM,CAAC,EAAE,WAAW,CAAC,MAAM,CAAC,CAAC,CAAC;KACnD;IAED,aAAa,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;IAC5C,IAAI,GAAG,GAAG,aAAa,CAAC,CAAC,CAAC,CAAC;IAC3B,IAAI,GAAG,GAAG,aAAa,CAAC,aAAa,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IAElD,IAAI,GAAG,CAAC,SAAS,GAAG,GAAG,CAAC,SAAS,EAAE;QACjC,CAAC,GAAG,EAAE,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;KACzB;IAED,MAAM,KAAK,GAAG,GAAG,CAAC,KAAK,CAAC;IACxB,MAAM,KAAK,GAAG,GAAG,CAAC,KAAK,CAAC;IACxB,MAAM,UAAU,GAAG,CAAC,EAAE,CAAC,EAAE,KAAK,CAAC,CAAC,EAAE,CAAC,EAAE,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC;IAEhD,KAAK,IAAI,CAAC,GAAG,GAAG,CAAC,SAAS,GAAG,CAAC,EAAE,CAAC,IAAI,GAAG,CAAC,SAAS,EAAE,CAAC,EAAE,EAAE;QACvD,UAAU,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;KACrD;IACD,UAAU,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,KAAK,CAAC,CAAC,EAAE,CAAC,EAAE,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC;IAE5C,MAAM,UAAU,GAAG,CAAC,EAAE,CAAC,EAAE,KAAK,CAAC,CAAC,EAAE,CAAC,EAAE,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC;IAChD,KAAK,IAAI,CAAC,GAAG,GAAG,CAAC,SAAS,GAAG,CAAC,EAAE,QAAQ,GAAG,GAAG,CAAC,SAAS,GAAG,GAAG,EAAE,CAAC,IAAI,QAAQ,EAAE,CAAC,EAAE,EAAE;QAClF,MAAM,CAAC,GAAG,MAAM,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC;QAC1B,UAAU,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;KACrC;IACD,UAAU,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,KAAK,CAAC,CAAC,EAAE,CAAC,EAAE,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC;IAE5C,OAAO,CAAC,UAAU,EAAE,UAAU,CAAC,CAAC;AAClC,CAAC,CAAC;AAEF,MAAM,CAAC,MAAM,kBAAkB,GAAG,CAAC,MAAoB,EAAE,EAAE;IACzD,MAAM,GAAG,GAAG,IAAI,MAAM,EAAE,CAAC;IAEzB,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE;QACrB,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC;IAC5B,CAAC,CAAC,CAAC;IACH,MAAM,KAAK,GAAG,GAAG,CAAC,KAAK,EAAE,CAAC;IAC1B,MAAM,MAAM,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC;IAE5B,IAAI,KAAK,IAAI,MAAM,EAAE;QAEnB,MAAM,IAAI,GAAG,GAAG,CAAC,EAAE,GAAG,KAAK,GAAG,CAAC,CAAC;QAEhC,OAAO,kBAAkB,CACvB,MAAM,EACN;YACE,CAAC,EAAE,IAAI;YACP,CAAC,EAAE,GAAG,CAAC,EAAE;SACV,EACD;YACE,CAAC,EAAE,IAAI;YACP,CAAC,EAAE,GAAG,CAAC,EAAE;SACV,CACF,CAAC;KACH;IAED,MAAM,IAAI,GAAG,GAAG,CAAC,EAAE,GAAG,MAAM,GAAG,CAAC,CAAC;IAEjC,OAAO,kBAAkB,CACvB,MAAM,EACN;QACE,CAAC,EAAE,GAAG,CAAC,EAAE;QACT,CAAC,EAAE,IAAI;KACR,EACD;QACE,CAAC,EAAE,GAAG,CAAC,EAAE;QACT,CAAC,EAAE,IAAI;KACR,CACF,CAAC;AACJ,CAAC,CAAC;AAEF,MAAM,CAAC,MAAM,wBAAwB,GAAG,CAAC,MAAoB,EAAE,KAAa,EAAE,GAA+B,EAAE,EAAE;IAC/G,IAAI,KAAK,KAAK,CAAC,EAAE;QACf,GAAG,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC,CAAC;KACtB;SAAM;QACL,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;QACnC,MAAM,GAAG,GAAG,kBAAkB,CAAC,MAAM,CAAC,CAAC;QAEvC,wBAAwB,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,GAAG,CAAC,CAAC;QAC5C,wBAAwB,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,KAAK,GAAG,IAAI,EAAE,GAAG,CAAC,CAAC;KACrD;AACH,CAAC,CAAC;AAEF,MAAM,CAAC,MAAM,YAAY,GAAG,CAAC,OAAiB,EAAE,KAAa,EAAE,EAAE;IAC/D,MAAM,MAAM,GAAG,OAAO,CAAC,SAAS,CAAC,MAAM,CAAC;IAExC,IAAI,CAAC,MAAM,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE;QAC7B,OAAO,EAAE,CAAC;KACX;IACD,IAAI,KAAK,KAAK,CAAC,EAAE;QACf,OAAO,CAAC,EAAE,MAAM,EAAE,WAAW,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;KAC1C;IACD,MAAM,GAAG,GAA+B,EAAE,CAAC;IAE3C,wBAAwB,CAAC,MAAM,EAAE,KAAK,EAAE,GAAG,CAAC,CAAC;IAE7C,OAAO,GAAG,CAAC;AACb,CAAC,CAAC;AAEF,MAAM,CAAC,MAAM,SAAS,GAAG,CAAC,IAAW,EAAE,KAAa,EAAE,EAAE;IACtD,MAAM,SAAS,GAAG,IAAI,CAAC,kBAAkB,EAAE,CAAC;IAC5C,MAAM,YAAY,GAAG,kBAAkB,CAAC,SAAS,CAAC,CAAC;IAEnD,IAAI,CAAC,YAAY,CAAC,MAAM,IAAI,KAAK,GAAG,CAAC,EAAE;QACrC,OAAO,EAAE,CAAC;KACX;IAED,MAAM,UAAU,GAAG,YAAY,CAAC,MAAM,CAAC;IAEvC,IAAI,YAAY,CAAC,MAAM,IAAI,KAAK,EAAE;QAChC,MAAM,GAAG,GAA8B,EAAE,CAAC;QAC1C,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,YAAY,CAAC,MAAM,GAAG,KAAK,CAAC,CAAC;QAE1D,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE;YAC9B,MAAM,MAAM,GAAG,YAAY,CAAC,KAAK,CAAC,CAAC,GAAG,SAAS,EAAE,CAAC,KAAK,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,SAAS,CAAC,CAAC;YAErG,GAAG,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,mBAAmB,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;SACjD;QAED,OAAO,GAAG,CAAC;KACZ;IAED,MAAM,GAAG,GAA+B,EAAE,CAAC;IAC3C,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,GAAG,UAAU,CAAC,CAAC;IACjD,IAAI,MAAM,GAAG,KAAK,CAAC;IAEnB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,EAAE,CAAC,EAAE,EAAE;QACnC,MAAM,MAAM,GAAiB,EAAE,CAAC;QAEhC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,GAAG,GAAG,YAAY,CAAC,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,IAAI,CAAC,EAAE;YAC7D,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC;SACnE;QACD,wBAAwB,CAAC,MAAM,EAAE,CAAC,KAAK,UAAU,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,SAAS,EAAE,GAAG,CAAC,CAAC;QACjF,MAAM,IAAI,SAAS,CAAC;KACrB;IAED,OAAO,GAAG,CAAC;AACb,CAAC,CAAC","file":"split-path.js","sourcesContent":["/* Adapted from zrender by ecomfe\n * https://github.com/ecomfe/zrender\n * Licensed under the BSD-3-Clause\n\n * url: https://github.com/ecomfe/zrender/blob/master/src/tool/dividePath.ts\n * License: https://github.com/ecomfe/zrender/blob/master/LICENSE\n * @license\n */\n\nimport type { ICustomPath2D } from './../interface/path';\nimport type { IPointLike } from '@visactor/vutils';\nimport { isNumber, Bounds, getIntersectPoint } from '@visactor/vutils';\nimport type { ILine, IRect, IArc, ICircle, IArea, IPolygon, IPath } from '../interface';\nimport { bezierCurversToPath, pathToBezierCurves } from './morphing-utils';\n/**\n * split a rect to grids\n */\nexport function splitToGrids(width: number, height: number, count: number) {\n  const ratio = width / height;\n\n  let rowCount: number;\n  let columnCount: number;\n\n  if (width >= height) {\n    columnCount = Math.ceil(Math.sqrt(count * ratio));\n    rowCount = Math.floor(count / columnCount);\n\n    if (rowCount === 0) {\n      rowCount = 1;\n      columnCount = count;\n    }\n  } else {\n    rowCount = Math.ceil(Math.sqrt(count / ratio));\n    columnCount = Math.floor(count / rowCount);\n\n    if (columnCount === 0) {\n      columnCount = 1;\n      rowCount = count;\n    }\n  }\n\n  const grids: number[] = [];\n  for (let i = 0; i < rowCount; i++) {\n    grids.push(columnCount);\n  }\n  const sumCount = rowCount * columnCount;\n  const remained = count - sumCount;\n\n  if (remained > 0) {\n    for (let i = 0; i < remained; i += columnCount) {\n      if (i + columnCount < remained) {\n        grids.push(columnCount);\n      } else {\n        grids.push(remained - i);\n      }\n    }\n  }\n  return grids;\n}\n\nexport const splitRect = (rect: IRect, count: number) => {\n  const x = 0;\n  const y = 0;\n  const width = rect.getComputedAttribute('width');\n  const height = rect.getComputedAttribute('height');\n  const grids = splitToGrids(width, height, count);\n  const res = [];\n  const gridHeight = height / grids.length;\n\n  for (let i = 0, rowCount = grids.length; i < rowCount; i++) {\n    const columnCount = grids[i];\n    const gridWidth = width / columnCount;\n    for (let j = 0; j < columnCount; j++) {\n      res.push({\n        x: x + j * gridWidth,\n        y: y + i * gridHeight,\n        width: gridWidth,\n        height: gridHeight\n      });\n    }\n  }\n\n  return res;\n};\n\nexport const splitArc = (arc: IArc, count: number) => {\n  const x = 0;\n  const y = 0;\n  const angles = arc.getParsedAngle();\n  const startAngle = angles.startAngle;\n  const endAngle = angles.endAngle;\n  const innerRadius = arc.getComputedAttribute('innerRadius');\n  const outerRadius = arc.getComputedAttribute('outerRadius');\n  const angleDelta = Math.abs(startAngle - endAngle);\n  const radiusDelta = Math.abs(outerRadius - innerRadius);\n\n  const grids = splitToGrids((angleDelta * (innerRadius + outerRadius)) / 2, radiusDelta, count);\n  const res = [];\n  const gridRadius = radiusDelta / grids.length;\n  const radiusSign = outerRadius >= innerRadius ? 1 : -1;\n  const angleSign = endAngle >= startAngle ? 1 : -1;\n\n  for (let i = 0, rowCount = grids.length; i < rowCount; i++) {\n    const columnCount = grids[i];\n    const gridAngle = angleDelta / columnCount;\n    for (let j = 0; j < columnCount; j++) {\n      // from outter to inner\n      res.push({\n        innerRadius: outerRadius - gridRadius * i * radiusSign,\n        outerRadius: outerRadius - gridRadius * (i + 1) * radiusSign,\n        startAngle: startAngle + gridAngle * j * angleSign,\n        endAngle: startAngle + gridAngle * (j + 1) * angleSign\n      });\n    }\n  }\n\n  return res;\n};\n\nexport const splitCircle = (arc: ICircle, count: number) => {\n  const x = 0;\n  const y = 0;\n  const startAngle = arc.getComputedAttribute('startAngle');\n  const endAngle = arc.getComputedAttribute('endAngle');\n  const radius = arc.getComputedAttribute('radius');\n  const angleDelta = Math.abs(startAngle - endAngle);\n\n  const grids = splitToGrids(angleDelta * radius, radius, count);\n  const res = [];\n  const gridAngle = angleDelta / grids[0];\n  const gridRadius = radius / grids.length;\n  const angleSign = endAngle >= startAngle ? 1 : -1;\n\n  for (let i = 0, rowCount = grids.length; i < rowCount; i++) {\n    for (let j = 0, columnCount = grids[i]; j < columnCount; j++) {\n      res.push({\n        innerRadius: gridRadius * i,\n        outerRadius: gridRadius * (i + 1),\n        startAngle: startAngle + gridAngle * j * angleSign,\n        endAngle: startAngle + gridAngle * (j + 1) * angleSign\n      });\n    }\n  }\n\n  return res;\n};\n\nconst samplingPoints = (points: IPointLike[], count: number) => {\n  const validatePoints = points.filter(point => point.defined !== false && isNumber(point.x) && isNumber(point.y));\n\n  if (validatePoints.length === 0) {\n    return [];\n  }\n  if (validatePoints.length === 1) {\n    return new Array(count).fill(0).map(i => validatePoints[0]);\n  }\n\n  const res = [];\n  if (count <= validatePoints.length) {\n    const step = validatePoints.length / count;\n    let i = 0;\n    let cur = 0;\n\n    while (i < count) {\n      res.push(validatePoints[Math.floor(cur)]);\n\n      cur += step;\n      i++;\n    }\n\n    return res;\n  }\n\n  const insertCount = count - validatePoints.length;\n  const insertStep = insertCount / (validatePoints.length - 1);\n  const insetRatio = 1 / (insertStep + 1);\n  let curCount = 0;\n\n  for (let i = 0, len = points.length; i < len; i++) {\n    res.push(points[i]);\n\n    if (i < len - 1) {\n      let cur = insetRatio;\n      const xCur = points[i].x;\n      const yCur = points[i].y;\n      const xNext = points[i + 1].x;\n      const yNext = points[i + 1].y;\n\n      while (cur < 1 && curCount < insertCount) {\n        res.push({\n          x: xCur + (xNext - xCur) * cur,\n          y: yCur + (yNext - yCur) * cur\n        });\n        cur += insetRatio;\n        curCount += 1;\n      }\n    }\n  }\n\n  return res;\n};\n\nexport const splitArea = (area: IArea, count: number) => {\n  const attribute = area.attribute;\n  let points = attribute.points;\n  const segements = attribute.segments;\n\n  if (!points) {\n    points = segements.reduce((res, seg) => {\n      return res.concat(seg.points ?? []);\n    }, []);\n  }\n  const validatePoints = points.filter(point => point.defined !== false && isNumber(point.x) && isNumber(point.y));\n\n  if (!validatePoints.length) {\n    return [];\n  }\n\n  const allPoints: IPointLike[] = [];\n\n  validatePoints.forEach(point => {\n    allPoints.push({ x: point.x, y: point.y });\n  });\n\n  for (let i = validatePoints.length - 1; i >= 0; i--) {\n    const point = validatePoints[i];\n\n    allPoints.push({ x: point.x1 ?? point.x, y: point.y1 ?? point.y });\n  }\n\n  const res: { points: IPointLike[] }[] = [];\n\n  recursiveCallBinarySplit(points, count, res);\n\n  return res;\n};\n\nexport const splitLine = (line: ILine, count: number) => {\n  const attribute = line.attribute;\n  const points = attribute.points;\n\n  if (points) {\n    return samplingPoints(points, count);\n  } else if (attribute.segments) {\n    const segs = attribute.segments;\n    const allPoints = segs.reduce((res, seg) => {\n      return res.concat(seg.points ?? []);\n    }, []);\n\n    return samplingPoints(allPoints, count);\n  }\n  return [];\n};\n\nfunction crossProduct(dir1: [number, number], dir2: [number, number]): number {\n  return dir1[0] * dir2[1] - dir1[1] * dir2[0];\n}\n\nconst clonePoints = (points: IPointLike[]) => {\n  return points.map(p => ({ x: p.x, y: p.y }));\n};\n\nconst splitPolygonByLine = (points: IPointLike[], p0: IPointLike, p1: IPointLike) => {\n  const len = points.length;\n  const intersections: { dot: number; point: IPointLike; edgeIndex: number }[] = [];\n\n  for (let i = 0; i < len; i++) {\n    const cur = points[i];\n    const next = i === len - 1 ? points[0] : points[i + 1];\n\n    const res = getIntersectPoint([p0.x, p0.y], [p1.x, p1.y], [cur.x, cur.y], [next.x, next.y]);\n\n    if (res && typeof res !== 'boolean') {\n      intersections.push({\n        dot: crossProduct([res[0] - p0.x, res[1] - p0.x], [p1.x - p0.x, p1.y - p0.x]),\n        point: { x: res[0], y: res[1] },\n        edgeIndex: i\n      });\n    }\n  }\n\n  if (intersections.length < 2) {\n    //  没有交点或者和某条边共线\n    return [clonePoints(points), clonePoints(points)];\n  }\n\n  intersections.sort((a, b) => a.dot - b.dot);\n  let is0 = intersections[0];\n  let is1 = intersections[intersections.length - 1];\n\n  if (is0.edgeIndex > is1.edgeIndex) {\n    [is0, is1] = [is1, is0];\n  }\n\n  const newP0 = is0.point;\n  const newP1 = is1.point;\n  const newPointsA = [{ x: newP0.x, y: newP0.y }];\n\n  for (let i = is0.edgeIndex + 1; i <= is1.edgeIndex; i++) {\n    newPointsA.push({ x: points[i].x, y: points[i].y });\n  }\n  newPointsA.push({ x: newP1.x, y: newP1.y });\n\n  const newPointsB = [{ x: newP1.x, y: newP1.y }];\n  for (let i = is1.edgeIndex + 1, maxIndex = is0.edgeIndex + len; i <= maxIndex; i++) {\n    const p = points[i % len];\n    newPointsB.push({ x: p.x, y: p.y });\n  }\n  newPointsB.push({ x: newP0.x, y: newP0.y });\n\n  return [newPointsA, newPointsB];\n};\n\nexport const binarySplitPolygon = (points: IPointLike[]) => {\n  const box = new Bounds();\n\n  points.forEach(point => {\n    box.add(point.x, point.y);\n  });\n  const width = box.width();\n  const height = box.height();\n\n  if (width >= height) {\n    // split horizontal\n    const midX = box.x1 + width / 2;\n\n    return splitPolygonByLine(\n      points,\n      {\n        x: midX,\n        y: box.y1\n      },\n      {\n        x: midX,\n        y: box.y2\n      }\n    );\n  }\n  // split vertical\n  const midY = box.y1 + height / 2;\n\n  return splitPolygonByLine(\n    points,\n    {\n      x: box.x1,\n      y: midY\n    },\n    {\n      x: box.x2,\n      y: midY\n    }\n  );\n};\n\nexport const recursiveCallBinarySplit = (points: IPointLike[], count: number, out: { points: IPointLike[] }[]) => {\n  if (count === 1) {\n    out.push({ points });\n  } else {\n    const half = Math.floor(count / 2);\n    const res = binarySplitPolygon(points);\n\n    recursiveCallBinarySplit(res[0], half, out);\n    recursiveCallBinarySplit(res[1], count - half, out);\n  }\n};\n\nexport const splitPolygon = (polygon: IPolygon, count: number) => {\n  const points = polygon.attribute.points;\n\n  if (!points || !points.length) {\n    return [];\n  }\n  if (count === 1) {\n    return [{ points: clonePoints(points) }];\n  }\n  const res: { points: IPointLike[] }[] = [];\n\n  recursiveCallBinarySplit(points, count, res);\n\n  return res;\n};\n\nexport const splitPath = (path: IPath, count: number) => {\n  const pathShape = path.getParsedPathShape();\n  const bezierCurves = pathToBezierCurves(pathShape);\n\n  if (!bezierCurves.length || count < 0) {\n    return [];\n  }\n\n  const subPathCnt = bezierCurves.length;\n\n  if (bezierCurves.length >= count) {\n    const res: { path: ICustomPath2D }[] = [];\n    const stepCount = Math.floor(bezierCurves.length / count);\n\n    for (let i = 0; i < count; i++) {\n      const curves = bezierCurves.slice(i * stepCount, i === count - 1 ? subPathCnt : (i + 1) * stepCount);\n\n      res.push({ path: bezierCurversToPath(curves) });\n    }\n\n    return res;\n  }\n\n  const res: { points: IPointLike[] }[] = [];\n  const stepCount = Math.floor(count / subPathCnt);\n  let remain = count;\n\n  for (let c = 0; c < subPathCnt; c++) {\n    const points: IPointLike[] = [];\n\n    for (let i = 2, len = bezierCurves[c].length; i < len; i += 2) {\n      points.push({ x: bezierCurves[0][i], y: bezierCurves[0][i + 1] });\n    }\n    recursiveCallBinarySplit(points, c === subPathCnt - 1 ? remain : stepCount, res);\n    remain -= stepCount;\n  }\n\n  return res;\n};\n"]}

package/es/common/store.d.ts

@@ -0,0 +1,2 @@
+declare class StageStore {
+}

package/es/common/store.js

@@ -0,0 +1 @@
+class StageStore {}

package/es/common/store.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/common/store.ts"],"names":[],"mappings":"AAAA,MAAM,UAAU;CAAG","file":"store.js","sourcesContent":["class StageStore {}\n"]}