@visactor/vrender-core 0.16.0-alpha.0

package/cjs/common/split-path.js

@@ -0,0 +1,272 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+    value: !0
+}), exports.splitPath = exports.splitPolygon = exports.recursiveCallBinarySplit = exports.binarySplitPolygon = exports.splitLine = exports.splitArea = exports.splitCircle = exports.splitArc = exports.splitRect = exports.splitToGrids = void 0;
+
+const vutils_1 = require("@visactor/vutils"), morphing_utils_1 = require("./morphing-utils");
+
+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;
+}
+
+exports.splitToGrids = splitToGrids;
+
+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;
+};
+
+exports.splitRect = splitRect;
+
+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;
+};
+
+exports.splitArc = splitArc;
+
+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;
+};
+
+exports.splitCircle = splitCircle;
+
+const samplingPoints = (points, count) => {
+    const validatePoints = points.filter((point => !1 !== point.defined && (0, vutils_1.isNumber)(point.x) && (0, 
+    vutils_1.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;
+}, 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 && (0, vutils_1.isNumber)(point.x) && (0, 
+    vutils_1.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 (0, exports.recursiveCallBinarySplit)(points, count, res), res;
+};
+
+exports.splitArea = splitArea;
+
+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];
+}
+
+exports.splitLine = splitLine;
+
+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 = (0, 
+        vutils_1.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 ];
+}, binarySplitPolygon = points => {
+    const box = new vutils_1.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
+    });
+};
+
+exports.binarySplitPolygon = binarySplitPolygon;
+
+const recursiveCallBinarySplit = (points, count, out) => {
+    if (1 === count) out.push({
+        points: points
+    }); else {
+        const half = Math.floor(count / 2), res = (0, exports.binarySplitPolygon)(points);
+        (0, exports.recursiveCallBinarySplit)(res[0], half, out), (0, exports.recursiveCallBinarySplit)(res[1], count - half, out);
+    }
+};
+
+exports.recursiveCallBinarySplit = recursiveCallBinarySplit;
+
+const splitPolygon = (polygon, count) => {
+    const points = polygon.attribute.points;
+    if (!points || !points.length) return [];
+    if (1 === count) return [ {
+        points: clonePoints(points)
+    } ];
+    const res = [];
+    return (0, exports.recursiveCallBinarySplit)(points, count, res), res;
+};
+
+exports.splitPolygon = splitPolygon;
+
+const splitPath = (path, count) => {
+    const pathShape = path.getParsedPathShape(), bezierCurves = (0, morphing_utils_1.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: (0, morphing_utils_1.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]
+        });
+        (0, exports.recursiveCallBinarySplit)(points, c === subPathCnt - 1 ? remain : stepCount, res), 
+        remain -= stepCount;
+    }
+    return res;
+};
+
+exports.splitPath = splitPath;
+//# sourceMappingURL=split-path.js.map

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

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/common/split-path.ts"],"names":[],"mappings":";;;AAWA,6CAAuE;AAEvE,qDAA2E;AAI3E,SAAgB,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;AAzCD,oCAyCC;AAEM,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;AAvBW,QAAA,SAAS,aAuBpB;AAEK,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;AAhCW,QAAA,QAAQ,YAgCnB;AAEK,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;AA1BW,QAAA,WAAW,eA0BtB;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,IAAA,iBAAQ,EAAC,KAAK,CAAC,CAAC,CAAC,IAAI,IAAA,iBAAQ,EAAC,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;AAEK,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,IAAA,iBAAQ,EAAC,KAAK,CAAC,CAAC,CAAC,IAAI,IAAA,iBAAQ,EAAC,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,IAAA,gCAAwB,EAAC,MAAM,EAAE,KAAK,EAAE,GAAG,CAAC,CAAC;IAE7C,OAAO,GAAG,CAAC;AACb,CAAC,CAAC;AAjCW,QAAA,SAAS,aAiCpB;AAEK,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;AAfW,QAAA,SAAS,aAepB;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,IAAA,0BAAiB,EAAC,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;AAEK,MAAM,kBAAkB,GAAG,CAAC,MAAoB,EAAE,EAAE;IACzD,MAAM,GAAG,GAAG,IAAI,eAAM,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;AAvCW,QAAA,kBAAkB,sBAuC7B;AAEK,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,IAAA,0BAAkB,EAAC,MAAM,CAAC,CAAC;QAEvC,IAAA,gCAAwB,EAAC,GAAG,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,GAAG,CAAC,CAAC;QAC5C,IAAA,gCAAwB,EAAC,GAAG,CAAC,CAAC,CAAC,EAAE,KAAK,GAAG,IAAI,EAAE,GAAG,CAAC,CAAC;KACrD;AACH,CAAC,CAAC;AAVW,QAAA,wBAAwB,4BAUnC;AAEK,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,IAAA,gCAAwB,EAAC,MAAM,EAAE,KAAK,EAAE,GAAG,CAAC,CAAC;IAE7C,OAAO,GAAG,CAAC;AACb,CAAC,CAAC;AAdW,QAAA,YAAY,gBAcvB;AAEK,MAAM,SAAS,GAAG,CAAC,IAAW,EAAE,KAAa,EAAE,EAAE;IACtD,MAAM,SAAS,GAAG,IAAI,CAAC,kBAAkB,EAAE,CAAC;IAC5C,MAAM,YAAY,GAAG,IAAA,mCAAkB,EAAC,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,IAAA,oCAAmB,EAAC,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,IAAA,gCAAwB,EAAC,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;AAtCW,QAAA,SAAS,aAsCpB","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/cjs/common/store.d.ts

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

package/cjs/common/store.js

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

package/cjs/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"]}

package/cjs/common/text.d.ts

@@ -0,0 +1,6 @@
+import type { ITextFontParams } from '@visactor/vutils';
+import type { TextAlignType, TextBaselineType } from '../interface';
+export declare function getContextFont(text: Partial<ITextFontParams>, defaultAttr?: Partial<ITextFontParams>, fontSizeScale?: number): string;
+export declare function textDrawOffsetY(baseline: TextBaselineType, h: number): number;
+export declare function textDrawOffsetX(textAlign: TextAlignType, width: number): number;
+export declare function textLayoutOffsetY(baseline: TextBaselineType, lineHeight: number, fontSize: number, buf?: number): number;

package/cjs/common/text.js

@@ -0,0 +1,27 @@
+"use strict";
+
+function getContextFont(text, defaultAttr = {}, fontSizeScale) {
+    fontSizeScale || (fontSizeScale = 1);
+    const {fontStyle: fontStyle = defaultAttr.fontStyle, fontVariant: fontVariant = defaultAttr.fontVariant, fontWeight: fontWeight = defaultAttr.fontWeight, fontSize: fontSize = defaultAttr.fontSize, fontFamily: fontFamily = defaultAttr.fontFamily} = text;
+    return (fontStyle ? fontStyle + " " : "") + (fontVariant ? fontVariant + " " : "") + (fontWeight ? fontWeight + " " : "") + fontSize * fontSizeScale + "px " + (fontFamily || "sans-serif");
+}
+
+function textDrawOffsetY(baseline, h) {
+    return "top" === baseline ? Math.ceil(.79 * h) : "middle" === baseline ? Math.round(.3 * h) : "bottom" === baseline ? Math.round(-.21 * h) : 0;
+}
+
+function textDrawOffsetX(textAlign, width) {
+    return "end" === textAlign || "right" === textAlign ? -width : "center" === textAlign ? -width / 2 : 0;
+}
+
+function textLayoutOffsetY(baseline, lineHeight, fontSize, buf = 0) {
+    return "middle" === baseline ? -lineHeight / 2 : "top" === baseline ? 0 : "bottom" === baseline ? buf - lineHeight : baseline && "alphabetic" !== baseline ? 0 : (fontSize || (fontSize = lineHeight), 
+    -(lineHeight - fontSize) / 2 - .79 * fontSize);
+}
+
+Object.defineProperty(exports, "__esModule", {
+    value: !0
+}), exports.textLayoutOffsetY = exports.textDrawOffsetX = exports.textDrawOffsetY = exports.getContextFont = void 0, 
+exports.getContextFont = getContextFont, exports.textDrawOffsetY = textDrawOffsetY, 
+exports.textDrawOffsetX = textDrawOffsetX, exports.textLayoutOffsetY = textLayoutOffsetY;
+//# sourceMappingURL=text.js.map

package/cjs/common/text.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/common/text.ts"],"names":[],"mappings":";;;AAKA,SAAgB,cAAc,CAC5B,IAA8B,EAC9B,cAAwC,EAAE,EAC1C,aAAsB;IAEtB,IAAI,CAAC,aAAa,EAAE;QAClB,aAAa,GAAG,CAAC,CAAC;KACnB;IACD,MAAM,EACJ,SAAS,GAAG,WAAW,CAAC,SAAS,EACjC,WAAW,GAAG,WAAW,CAAC,WAAW,EACrC,UAAU,GAAG,WAAW,CAAC,UAAU,EACnC,QAAQ,GAAG,WAAW,CAAC,QAAQ,EAC/B,UAAU,GAAG,WAAW,CAAC,UAAU,EACpC,GAAG,IAAI,CAAC;IACT,OAAO,CACL,EAAE;QACF,CAAC,SAAS,CAAC,CAAC,CAAC,SAAS,GAAG,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;QAClC,CAAC,WAAW,CAAC,CAAC,CAAC,WAAW,GAAG,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;QACtC,CAAC,UAAU,CAAC,CAAC,CAAC,UAAU,GAAG,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;QACpC,QAAQ,GAAG,aAAa;QACxB,KAAK;QACL,CAAC,UAAU,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,YAAY,CAAC,CACzC,CAAC;AACJ,CAAC;AAxBD,wCAwBC;AASD,SAAgB,eAAe,CAAC,QAA0B,EAAE,CAAS;IACnE,MAAM,MAAM,GACV,QAAQ,KAAK,KAAK;QAChB,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC;QACrB,CAAC,CAAC,QAAQ,KAAK,QAAQ;YACvB,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,GAAG,CAAC,CAAC;YACrB,CAAC,CAAC,QAAQ,KAAK,QAAQ;gBACvB,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC;gBACvB,CAAC,CAAC,CAAC,CAAC;IACR,OAAO,MAAM,CAAC;AAChB,CAAC;AAVD,0CAUC;AAQD,SAAgB,eAAe,CAAC,SAAwB,EAAE,KAAa;IACrE,IAAI,SAAS,KAAK,KAAK,IAAI,SAAS,KAAK,OAAO,EAAE;QAChD,OAAO,CAAC,KAAK,CAAC;KACf;SAAM,IAAI,SAAS,KAAK,QAAQ,EAAE;QACjC,OAAO,CAAC,KAAK,GAAG,CAAC,CAAC;KACnB;IACD,OAAO,CAAC,CAAC;AACX,CAAC;AAPD,0CAOC;AASD,SAAgB,iBAAiB,CAC/B,QAA0B,EAC1B,UAAkB,EAClB,QAAgB,EAChB,MAAc,CAAC;IAEf,IAAI,QAAQ,KAAK,QAAQ,EAAE;QACzB,OAAO,CAAC,UAAU,GAAG,CAAC,CAAC;KACxB;IACD,IAAI,QAAQ,KAAK,KAAK,EAAE;QACtB,OAAO,CAAC,CAAC;KACV;IACD,IAAI,QAAQ,KAAK,QAAQ,EAAE;QACzB,OAAO,GAAG,GAAG,UAAU,CAAC;KACzB;IACD,IAAI,CAAC,QAAQ,IAAI,QAAQ,KAAK,YAAY,EAAE;QAC1C,IAAI,CAAC,QAAQ,EAAE;YACb,QAAQ,GAAG,UAAU,CAAC;SACvB;QACD,OAAO,CAAC,CAAC,UAAU,GAAG,QAAQ,CAAC,GAAG,CAAC,GAAG,IAAI,GAAG,QAAQ,CAAC;KACvD;IACD,OAAO,CAAC,CAAC;AACX,CAAC;AAtBD,8CAsBC","file":"text.js","sourcesContent":["// 存放一些公共方法，公共配置\n\nimport type { ITextFontParams } from '@visactor/vutils';\nimport type { TextAlignType, TextBaselineType } from '../interface';\n\nexport function getContextFont(\n  text: Partial<ITextFontParams>,\n  defaultAttr: Partial<ITextFontParams> = {},\n  fontSizeScale?: number\n): string {\n  if (!fontSizeScale) {\n    fontSizeScale = 1;\n  }\n  const {\n    fontStyle = defaultAttr.fontStyle,\n    fontVariant = defaultAttr.fontVariant,\n    fontWeight = defaultAttr.fontWeight,\n    fontSize = defaultAttr.fontSize,\n    fontFamily = defaultAttr.fontFamily\n  } = text;\n  return (\n    '' +\n    (fontStyle ? fontStyle + ' ' : '') +\n    (fontVariant ? fontVariant + ' ' : '') +\n    (fontWeight ? fontWeight + ' ' : '') +\n    fontSize * fontSizeScale +\n    'px ' +\n    (fontFamily ? fontFamily : 'sans-serif')\n  );\n}\n// TODO: 更好的方案\n/**\n * 用于绘制的时候偏移\n * 经验值，来源于 https://github.com/vega/vega/blob/b45cf431cd6c0d0c0e1567f087f9b3b55bc236fa/packages/vega-scenegraph/src/util/text.js\n * @param baseline\n * @param h\n * @returns\n */\nexport function textDrawOffsetY(baseline: TextBaselineType, h: number): number {\n  const offset =\n    baseline === 'top'\n      ? Math.ceil(0.79 * h)\n      : baseline === 'middle'\n      ? Math.round(0.3 * h)\n      : baseline === 'bottom'\n      ? Math.round(-0.21 * h)\n      : 0;\n  return offset;\n}\n\n/**\n * 用于绘制的时候偏移\n * @param textAlign\n * @param width\n * @returns\n */\nexport function textDrawOffsetX(textAlign: TextAlignType, width: number): number {\n  if (textAlign === 'end' || textAlign === 'right') {\n    return -width;\n  } else if (textAlign === 'center') {\n    return -width / 2;\n  }\n  return 0;\n}\n\n/**\n * 用于计算布局的偏移\n * 经验值，来源于 https://github.com/vega/vega/blob/b45cf431cd6c0d0c0e1567f087f9b3b55bc236fa/packages/vega-scenegraph/src/util/text.js\n * @param baseline\n * @param lineHeight\n * @returns\n */\nexport function textLayoutOffsetY(\n  baseline: TextBaselineType,\n  lineHeight: number,\n  fontSize: number,\n  buf: number = 0\n): number {\n  if (baseline === 'middle') {\n    return -lineHeight / 2;\n  }\n  if (baseline === 'top') {\n    return 0;\n  }\n  if (baseline === 'bottom') {\n    return buf - lineHeight;\n  }\n  if (!baseline || baseline === 'alphabetic') {\n    if (!fontSize) {\n      fontSize = lineHeight;\n    }\n    return -(lineHeight - fontSize) / 2 - 0.79 * fontSize;\n  }\n  return 0;\n}\n"]}

package/cjs/common/utils.d.ts

@@ -0,0 +1,40 @@
+import type { IBounds, IPointLike } from '@visactor/vutils';
+import type { IGraphicAttribute, IStrokeStyle } from '../interface';
+export declare enum Edge {
+    Top = 1,
+    Right = 2,
+    Bottom = 4,
+    Left = 8,
+    ALL = 15
+}
+export declare const parseStroke: (stroke: IStrokeStyle['stroke']) => {
+    isFullStroke: boolean;
+    stroke: (boolean | string)[];
+};
+export declare const parsePadding: (padding: IGraphicAttribute['boundsPadding']) => number | [
+    number,
+    number,
+    number,
+    number
+];
+export declare function circleBounds(startAngle: number, endAngle: number, radius: number, bounds: IBounds): void;
+export declare function pointsEqual(pointsA: IPointLike[] | IPointLike, pointsB: IPointLike[] | IPointLike): boolean;
+export declare function pointEqual(pointA: IPointLike, pointB: IPointLike): boolean;
+export declare function pointInterpolation(pointA: IPointLike, pointB: IPointLike, ratio: number): IPointLike;
+export declare function pointInterpolationHighPerformance(pointA: IPointLike, pointB: IPointLike, ratio: number, point: IPointLike): IPointLike;
+export declare function pointsInterpolation(pointsA: IPointLike[] | IPointLike, pointsB: IPointLike[] | IPointLike, ratio: number): IPointLike[];
+export declare const transformKeys: string[];
+export declare const isTransformKey: (key: string) => boolean;
+export declare function getAttributeFromDefaultAttrList(attr: Record<string, any> | Record<string, any>[], key: string): any;
+export declare class RafBasedSTO {
+    static TimeOut: number;
+    durations: number[];
+    timeout: number;
+    lastDate: number;
+    durationsListThreshold: number;
+    constructor();
+    call(cb: FrameRequestCallback): number;
+    clear(h: number): void;
+    appendDuration(d: number): void;
+}
+export declare const rafBasedSto: RafBasedSTO;

package/cjs/common/utils.js

@@ -0,0 +1,154 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+    value: !0
+}), exports.rafBasedSto = exports.RafBasedSTO = exports.getAttributeFromDefaultAttrList = exports.isTransformKey = exports.transformKeys = exports.pointsInterpolation = exports.pointInterpolationHighPerformance = exports.pointInterpolation = exports.pointEqual = exports.pointsEqual = exports.circleBounds = exports.parsePadding = exports.parseStroke = exports.Edge = void 0;
+
+const vutils_1 = require("@visactor/vutils");
+
+var Edge;
+
+!function(Edge) {
+    Edge[Edge.Top = 1] = "Top", Edge[Edge.Right = 2] = "Right", Edge[Edge.Bottom = 4] = "Bottom", 
+    Edge[Edge.Left = 8] = "Left", Edge[Edge.ALL = 15] = "ALL";
+}(Edge = exports.Edge || (exports.Edge = {}));
+
+const _strokeVec4 = [ !1, !1, !1, !1 ], parseStroke = stroke => {
+    var _a;
+    let isFullStroke = !0;
+    if ((0, vutils_1.isBoolean)(stroke, !0)) {
+        for (let i = 0; i < 4; i++) _strokeVec4[i] = stroke, isFullStroke && (isFullStroke = !(null !== (_a = _strokeVec4[i]) && void 0 !== _a && !_a));
+        isFullStroke = stroke;
+    } else if (Array.isArray(stroke)) for (let i = 0; i < 4; i++) _strokeVec4[i] = !!stroke[i], 
+    isFullStroke && (isFullStroke = !!_strokeVec4[i]); else _strokeVec4[0] = !1, _strokeVec4[1] = !1, 
+    _strokeVec4[2] = !1, _strokeVec4[3] = !1;
+    return {
+        isFullStroke: isFullStroke,
+        stroke: _strokeVec4
+    };
+};
+
+exports.parseStroke = parseStroke;
+
+const _paddingVec4 = [ 0, 0, 0, 0 ], parsePadding = padding => padding ? (0, vutils_1.isArray)(padding) ? 0 === padding.length ? 0 : 1 === padding.length ? padding[0] : 2 === padding.length ? (_paddingVec4[0] = padding[0], 
+_paddingVec4[2] = padding[0], _paddingVec4[1] = padding[1], _paddingVec4[3] = padding[1], 
+_paddingVec4) : padding : padding : 0;
+
+exports.parsePadding = parsePadding;
+
+const _coords = [ {
+    x: 0,
+    y: 0
+}, {
+    x: 0,
+    y: 0
+}, {
+    x: 0,
+    y: 0
+}, {
+    x: 0,
+    y: 0
+} ], indexList = [ 1, 2, 3, 0, 1, 2, 3, 0 ];
+
+function circleBounds(startAngle, endAngle, radius, bounds) {
+    for (;startAngle >= vutils_1.pi2; ) startAngle -= vutils_1.pi2;
+    for (;startAngle < 0; ) startAngle += vutils_1.pi2;
+    for (;startAngle > endAngle; ) endAngle += vutils_1.pi2;
+    _coords[0].x = radius, _coords[1].y = radius, _coords[2].x = -radius, _coords[3].y = -radius;
+    const startIdx = Math.ceil(startAngle / vutils_1.halfPi) % 4, endIdx = Math.ceil(endAngle / vutils_1.halfPi) % 4;
+    if (bounds.add((0, vutils_1.cos)(startAngle) * radius, (0, vutils_1.sin)(startAngle) * radius), 
+    bounds.add((0, vutils_1.cos)(endAngle) * radius, (0, vutils_1.sin)(endAngle) * radius), 
+    startIdx !== endIdx || endAngle - startAngle > vutils_1.pi) {
+        let match = !1;
+        for (let i = 0; i < indexList.length; i++) if (match || startIdx !== indexList[i]) {
+            if (match && endIdx === indexList[i]) break;
+            if (match) {
+                const p = _coords[indexList[i]];
+                bounds.add(p.x, p.y);
+            }
+        } else {
+            match = !0;
+            const p = _coords[startIdx];
+            bounds.add(p.x, p.y);
+        }
+    }
+}
+
+function pointsEqual(pointsA, pointsB) {
+    return !(!pointsA || !pointsB) && (Array.isArray(pointsA) && Array.isArray(pointsB) ? pointsA.length === pointsB.length && pointsA.every(((point, index) => pointEqual(point, pointsB[index]))) : !Number.isNaN(pointsA.x + pointsA.y) && pointEqual(pointsA, pointsB));
+}
+
+function pointEqual(pointA, pointB) {
+    return pointA.x === pointB.x && pointA.y === pointB.y && pointA.x1 === pointB.x1 && pointA.y1 === pointB.y1 && pointA.defined === pointB.defined;
+}
+
+function pointInterpolation(pointA, pointB, ratio) {
+    const {x: x, y: y} = (0, vutils_1.pointAt)(pointA.x, pointA.y, pointB.x, pointB.y, ratio), {x: x1, y: y1} = (0, 
+    vutils_1.pointAt)(pointA.x1, pointA.y1, pointB.x1, pointB.y1, ratio), point = new vutils_1.Point(x, y, x1, y1);
+    return point.defined = pointB.defined, point;
+}
+
+function pointInterpolationHighPerformance(pointA, pointB, ratio, point) {
+    const {x: x, y: y} = (0, vutils_1.pointAt)(pointA.x, pointA.y, pointB.x, pointB.y, ratio), {x: x1, y: y1} = (0, 
+    vutils_1.pointAt)(pointA.x1, pointA.y1, pointB.x1, pointB.y1, ratio);
+    return point.x = x, point.y = y, point.x1 = x1, point.y1 = y1, point.defined = pointB.defined, 
+    point;
+}
+
+function pointsInterpolation(pointsA, pointsB, ratio) {
+    if (!pointsA || !pointsB) return [];
+    Array.isArray(pointsA) || (pointsA = [ pointsA ]), Array.isArray(pointsB) || (pointsB = [ pointsB ]);
+    let points = [];
+    if (pointsA.length > pointsB.length) {
+        points = pointsB.map((point => {
+            const p = new vutils_1.Point(point.x, point.y, point.x1, point.y1);
+            return p.defined = point.defined, p;
+        }));
+        for (let i = 0; i < pointsB.length; i++) points[i] = pointInterpolation(pointsA[i], pointsB[i], ratio);
+    } else {
+        points = pointsB.map((point => {
+            const p = new vutils_1.Point(point.x, point.y, point.x1, point.y1);
+            return p.defined = point.defined, p;
+        }));
+        for (let i = 0; i < pointsA.length; i++) points[i] = pointInterpolation(pointsA[i], pointsB[i], ratio);
+    }
+    return points;
+}
+
+exports.circleBounds = circleBounds, exports.pointsEqual = pointsEqual, exports.pointEqual = pointEqual, 
+exports.pointInterpolation = pointInterpolation, exports.pointInterpolationHighPerformance = pointInterpolationHighPerformance, 
+exports.pointsInterpolation = pointsInterpolation, exports.transformKeys = [ "x", "y", "dx", "dy", "scaleX", "scaleY", "angle", "anchor", "postMatrix", "scrollX", "scrollY" ];
+
+const isTransformKey = key => exports.transformKeys.includes(key);
+
+function getAttributeFromDefaultAttrList(attr, key) {
+    if ((0, vutils_1.isArray)(attr)) {
+        let val;
+        for (let i = 0; i < attr.length && void 0 === val; i++) val = attr[i][key];
+        return val;
+    }
+    return attr[key];
+}
+
+exports.isTransformKey = isTransformKey, exports.getAttributeFromDefaultAttrList = getAttributeFromDefaultAttrList;
+
+class RafBasedSTO {
+    constructor() {
+        this.durations = [], this.timeout = RafBasedSTO.TimeOut, this.lastDate = 0, this.durationsListThreshold = 30;
+    }
+    call(cb) {
+        return this.lastDate = Date.now(), setTimeout((() => {
+            this.appendDuration(Date.now() - this.lastDate), cb(0);
+        }), this.timeout, !0);
+    }
+    clear(h) {
+        clearTimeout(h);
+    }
+    appendDuration(d) {
+        this.durations.push(d), this.durations.length > this.durationsListThreshold && this.durations.shift(), 
+        this.timeout = Math.min(Math.max(this.durations.reduce(((a, b) => a + b), 0) / this.durations.length, 1e3 / 60), 1e3 / 30);
+    }
+}
+
+exports.RafBasedSTO = RafBasedSTO, RafBasedSTO.TimeOut = 1e3 / 60, exports.rafBasedSto = new RafBasedSTO;
+//# sourceMappingURL=utils.js.map

package/cjs/common/utils.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/common/utils.ts"],"names":[],"mappings":";;;AACA,6CAAqH;AAKrH,IAAY,IAOX;AAPD,WAAY,IAAI;IACd,6BAAc,CAAA;IACd,iCAAgB,CAAA;IAChB,mCAAiB,CAAA;IACjB,+BAAe,CAAA;IAEf,8BAAc,CAAA;AAChB,CAAC,EAPW,IAAI,GAAJ,YAAI,KAAJ,YAAI,QAOf;AAGD,MAAM,WAAW,GAA6E;IAC5F,KAAK;IACL,KAAK;IACL,KAAK;IACL,KAAK;CACN,CAAC;AAMK,MAAM,WAAW,GAAG,CACzB,MAA8B,EAI9B,EAAE;;IACF,IAAI,YAAY,GAAY,IAAI,CAAC;IAEjC,IAAI,IAAA,kBAAS,EAAC,MAAM,EAAE,IAAI,CAAC,EAAE;QAC3B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;YAC1B,WAAW,CAAC,CAAC,CAAC,GAAG,MAAiB,CAAC;YACnC,YAAY,KAAZ,YAAY,GAAK,CAAC,CAAC,CAAC,MAAA,WAAW,CAAC,CAAC,CAAC,mCAAI,IAAI,CAAC,EAAC;SAC7C;QACD,YAAY,GAAG,MAAiB,CAAC;KAClC;SAAM,IAAI,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE;QAEhC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;YAC1B,WAAW,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YAC7B,YAAY,KAAZ,YAAY,GAAK,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,EAAC;SACnC;KACF;SAAM;QACL,WAAW,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC;QACvB,WAAW,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC;QACvB,WAAW,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC;QACvB,WAAW,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC;KACxB;IAED,OAAO;QACL,YAAY;QACZ,MAAM,EAAE,WAAW;KACpB,CAAC;AACJ,CAAC,CAAC;AA/BW,QAAA,WAAW,eA+BtB;AAGF,MAAM,YAAY,GAAqC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;AAM7D,MAAM,YAAY,GAAG,CAC1B,OAA2C,EACA,EAAE;IAC7C,IAAI,CAAC,OAAO,EAAE;QACZ,OAAO,CAAC,CAAC;KACV;IACD,IAAI,IAAA,gBAAO,EAAC,OAAO,CAAC,EAAE;QACpB,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC,EAAE;YACxB,OAAO,CAAC,CAAC;SACV;aAAM,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC,EAAE;YAC/B,OAAO,OAAO,CAAC,CAAC,CAAC,CAAC;SACnB;aAAM,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC,EAAE;YAC/B,YAAY,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;YAC7B,YAAY,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;YAC7B,YAAY,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;YAC7B,YAAY,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;YAC7B,OAAO,YAAY,CAAC;SACrB;QAED,OAAO,OAA2C,CAAC;KACpD;IAED,OAAO,OAAiB,CAAC;AAC3B,CAAC,CAAC;AAvBW,QAAA,YAAY,gBAuBvB;AAEF,MAAM,OAAO,GAAqD;IAChE,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE;IACd,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE;IACd,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE;IACd,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE;CACf,CAAC;AACF,MAAM,SAAS,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;AAQ3C,SAAgB,YAAY,CAAC,UAAkB,EAAE,QAAgB,EAAE,MAAc,EAAE,MAAe;IAGhG,OAAO,UAAU,IAAI,YAAG,EAAE;QACxB,UAAU,IAAI,YAAG,CAAC;KACnB;IACD,OAAO,UAAU,GAAG,CAAC,EAAE;QACrB,UAAU,IAAI,YAAG,CAAC;KACnB;IACD,OAAO,UAAU,GAAG,QAAQ,EAAE;QAC5B,QAAQ,IAAI,YAAG,CAAC;KACjB;IACD,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC;IAGtB,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC;IACtB,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC;IAGvB,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC;IAIvB,MAAM,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC,UAAU,GAAG,eAAM,CAAC,GAAG,CAAC,CAAC;IACpD,MAAM,MAAM,GAAG,IAAI,CAAC,IAAI,CAAC,QAAQ,GAAG,eAAM,CAAC,GAAG,CAAC,CAAC;IAEhD,MAAM,CAAC,GAAG,CAAC,IAAA,YAAG,EAAC,UAAU,CAAC,GAAG,MAAM,EAAE,IAAA,YAAG,EAAC,UAAU,CAAC,GAAG,MAAM,CAAC,CAAC;IAC/D,MAAM,CAAC,GAAG,CAAC,IAAA,YAAG,EAAC,QAAQ,CAAC,GAAG,MAAM,EAAE,IAAA,YAAG,EAAC,QAAQ,CAAC,GAAG,MAAM,CAAC,CAAC;IAC3D,IAAI,QAAQ,KAAK,MAAM,IAAI,QAAQ,GAAG,UAAU,GAAG,WAAE,EAAE;QACrD,IAAI,KAAK,GAAG,KAAK,CAAC;QAClB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;YACzC,IAAI,CAAC,KAAK,IAAI,QAAQ,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE;gBACvC,KAAK,GAAG,IAAI,CAAC;gBACb,MAAM,CAAC,GAAG,OAAO,CAAC,QAAQ,CAAC,CAAC;gBAC5B,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;gBACrB,SAAS;aACV;iBAAM,IAAI,KAAK,IAAI,MAAM,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE;gBAC3C,MAAM;aACP;YACD,IAAI,KAAK,EAAE;gBACT,MAAM,CAAC,GAAG,OAAO,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC;gBAChC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;aACtB;SACF;KACF;AAiBH,CAAC;AA7DD,oCA6DC;AAOD,SAAgB,WAAW,CAAC,OAAkC,EAAE,OAAkC;IAChG,IAAI,CAAC,OAAO,IAAI,CAAC,OAAO,EAAE;QACxB,OAAO,KAAK,CAAC;KACd;IACD,IAAI,KAAK,CAAC,OAAO,CAAC,OAAO,CAAC,IAAI,KAAK,CAAC,OAAO,CAAC,OAAO,CAAC,EAAE;QAEpD,IAAI,OAAO,CAAC,MAAM,KAAK,OAAO,CAAC,MAAM,EAAE;YACrC,OAAO,KAAK,CAAC;SACd;QACD,OAAO,OAAO,CAAC,KAAK,CAAC,CAAC,KAAK,EAAE,KAAK,EAAE,EAAE,CAAC,UAAU,CAAC,KAAK,EAAE,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;KAC3E;IACD,IAAI,CAAC,MAAM,CAAC,KAAK,CAAE,OAAsB,CAAC,CAAC,GAAI,OAAsB,CAAC,CAAC,CAAC,EAAE;QAExE,OAAO,UAAU,CAAC,OAAqB,EAAE,OAAqB,CAAC,CAAC;KACjE;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAhBD,kCAgBC;AAOD,SAAgB,UAAU,CAAC,MAAkB,EAAE,MAAkB;IAC/D,OAAO,CACL,MAAM,CAAC,CAAC,KAAK,MAAM,CAAC,CAAC;QACrB,MAAM,CAAC,CAAC,KAAK,MAAM,CAAC,CAAC;QACrB,MAAM,CAAC,EAAE,KAAK,MAAM,CAAC,EAAE;QACvB,MAAM,CAAC,EAAE,KAAK,MAAM,CAAC,EAAE;QACvB,MAAM,CAAC,OAAO,KAAK,MAAM,CAAC,OAAO,CAClC,CAAC;AACJ,CAAC;AARD,gCAQC;AAQD,SAAgB,kBAAkB,CAAC,MAAkB,EAAE,MAAkB,EAAE,KAAa;IACtF,MAAM,EAAE,CAAC,EAAE,CAAC,EAAE,GAAG,IAAA,gBAAO,EAAC,MAAM,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;IACxE,MAAM,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,GAAG,IAAA,gBAAO,EAAC,MAAM,CAAC,EAAE,EAAE,MAAM,CAAC,EAAE,EAAE,MAAM,CAAC,EAAE,EAAE,MAAM,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC;IACpF,MAAM,KAAK,GAAG,IAAI,cAAK,CAAC,CAAW,EAAE,CAAW,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;IAC1D,KAAK,CAAC,OAAO,GAAG,MAAM,CAAC,OAAO,CAAC;IAC/B,OAAO,KAAK,CAAC;AACf,CAAC;AAND,gDAMC;AAQD,SAAgB,iCAAiC,CAC/C,MAAkB,EAClB,MAAkB,EAClB,KAAa,EACb,KAAiB;IAEjB,MAAM,EAAE,CAAC,EAAE,CAAC,EAAE,GAAG,IAAA,gBAAO,EAAC,MAAM,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;IACxE,MAAM,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,GAAG,IAAA,gBAAO,EAAC,MAAM,CAAC,EAAE,EAAE,MAAM,CAAC,EAAE,EAAE,MAAM,CAAC,EAAE,EAAE,MAAM,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC;IAEpF,KAAK,CAAC,CAAC,GAAG,CAAW,CAAC;IACtB,KAAK,CAAC,CAAC,GAAG,CAAW,CAAC;IACtB,KAAK,CAAC,EAAE,GAAG,EAAE,CAAC;IACd,KAAK,CAAC,EAAE,GAAG,EAAE,CAAC;IACd,KAAK,CAAC,OAAO,GAAG,MAAM,CAAC,OAAO,CAAC;IAC/B,OAAO,KAAK,CAAC;AACf,CAAC;AAfD,8EAeC;AAQD,SAAgB,mBAAmB,CACjC,OAAkC,EAClC,OAAkC,EAClC,KAAa;IAEb,IAAI,CAAC,OAAO,IAAI,CAAC,OAAO,EAAE;QACxB,OAAO,EAAE,CAAC;KACX;IACD,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,OAAO,CAAC,EAAE;QAC3B,OAAO,GAAG,CAAC,OAAO,CAAC,CAAC;KACrB;IACD,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,OAAO,CAAC,EAAE;QAC3B,OAAO,GAAG,CAAC,OAAO,CAAC,CAAC;KACrB;IAED,IAAI,MAAM,GAAiB,EAAE,CAAC;IAC9B,IAAI,OAAO,CAAC,MAAM,GAAG,OAAO,CAAC,MAAM,EAAE;QAEnC,MAAM,GAAG,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE;YAC3B,MAAM,CAAC,GAAG,IAAI,cAAK,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,EAAE,EAAE,KAAK,CAAC,EAAE,CAAC,CAAC;YAC1D,CAAC,CAAC,OAAO,GAAG,KAAK,CAAC,OAAO,CAAC;YAC1B,OAAO,CAAC,CAAC;QACX,CAAC,CAAC,CAAC;QACH,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;YACvC,MAAM,CAAC,CAAC,CAAC,GAAG,kBAAkB,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;SAC/D;KACF;SAAM;QAEL,MAAM,GAAG,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE;YAC3B,MAAM,CAAC,GAAG,IAAI,cAAK,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,EAAE,EAAE,KAAK,CAAC,EAAE,CAAC,CAAC;YAC1D,CAAC,CAAC,OAAO,GAAG,KAAK,CAAC,OAAO,CAAC;YAC1B,OAAO,CAAC,CAAC;QACX,CAAC,CAAC,CAAC;QACH,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;YACvC,MAAM,CAAC,CAAC,CAAC,GAAG,kBAAkB,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;SAC/D;KACF;IACD,OAAO,MAAM,CAAC;AAChB,CAAC;AAtCD,kDAsCC;AAEY,QAAA,aAAa,GAAG;IAC3B,GAAG;IACH,GAAG;IACH,IAAI;IACJ,IAAI;IACJ,QAAQ;IACR,QAAQ;IACR,OAAO;IACP,QAAQ;IACR,YAAY;IACZ,SAAS;IACT,SAAS;CACV,CAAC;AACK,MAAM,cAAc,GAAG,CAAC,GAAW,EAAE,EAAE;IAC5C,OAAO,qBAAa,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC;AACrC,CAAC,CAAC;AAFW,QAAA,cAAc,kBAEzB;AAEF,SAAgB,+BAA+B,CAAC,IAAiD,EAAE,GAAW;IAC5G,IAAI,IAAA,gBAAO,EAAC,IAAI,CAAC,EAAE;QACjB,IAAI,GAAG,CAAC;QACR,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,IAAI,GAAG,KAAK,SAAS,EAAE,CAAC,EAAE,EAAE;YACzD,GAAG,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;SACpB;QACD,OAAO,GAAG,CAAC;KACZ;IACD,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC;AACnB,CAAC;AATD,0EASC;AAED,MAAa,WAAW;IAOtB;QACE,IAAI,CAAC,SAAS,GAAG,EAAE,CAAC;QACpB,IAAI,CAAC,OAAO,GAAG,WAAW,CAAC,OAAO,CAAC;QACnC,IAAI,CAAC,QAAQ,GAAG,CAAC,CAAC;QAClB,IAAI,CAAC,sBAAsB,GAAG,EAAE,CAAC;IACnC,CAAC;IAED,IAAI,CAAC,EAAwB;QAC3B,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QAC3B,OAAO,UAAU,CACf,GAAG,EAAE;YACH,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC;YAChD,EAAE,CAAC,CAAC,CAAC,CAAC;QACR,CAAC,EACD,IAAI,CAAC,OAAO,EACZ,IAAI,CACL,CAAC;IACJ,CAAC;IAED,KAAK,CAAC,CAAS;QACb,YAAY,CAAC,CAAC,CAAC,CAAC;IAClB,CAAC;IAED,cAAc,CAAC,CAAS;QACtB,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACvB,IAAI,IAAI,CAAC,SAAS,CAAC,MAAM,GAAG,IAAI,CAAC,sBAAsB,EAAE;YACvD,IAAI,CAAC,SAAS,CAAC,KAAK,EAAE,CAAC;SACxB;QAED,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,GAAG,CACrB,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,GAAG,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,IAAI,GAAG,EAAE,CAAC,EACtF,IAAI,GAAG,EAAE,CACV,CAAC;IACJ,CAAC;;AAxCH,kCAyCC;AAxCQ,mBAAO,GAAG,IAAI,GAAG,EAAE,CAAC;AA0ChB,QAAA,WAAW,GAAG,IAAI,WAAW,EAAE,CAAC","file":"utils.js","sourcesContent":["import type { IBounds, IPointLike } from '@visactor/vutils';\nimport { isBoolean, isNumber, halfPi, pi, pi2, max, min, sin, cos, isArray, pointAt, Point } from '@visactor/vutils';\nimport type { IGraphicAttribute, IStrokeStyle } from '../interface';\n\n// todo: 迁移到@visactor/vutils\n\nexport enum Edge {\n  Top = 0b000001,\n  Right = 0b000010,\n  Bottom = 0b000100,\n  Left = 0b001000,\n\n  ALL = 0b001111\n}\n\n// 公共的stroke数组，避免大量数组生成\nconst _strokeVec4: [boolean | string, boolean | string, boolean | string, boolean | string] = [\n  false,\n  false,\n  false,\n  false\n];\n/**\n * 解析stroke配置\n * @param stroke\n * @returns\n */\nexport const parseStroke = (\n  stroke: IStrokeStyle['stroke']\n): {\n  isFullStroke: boolean;\n  stroke: (boolean | string)[];\n} => {\n  let isFullStroke: boolean = true;\n  // 首先判断\n  if (isBoolean(stroke, true)) {\n    for (let i = 0; i < 4; i++) {\n      _strokeVec4[i] = stroke as boolean;\n      isFullStroke &&= !!(_strokeVec4[i] ?? true);\n    }\n    isFullStroke = stroke as boolean;\n  } else if (Array.isArray(stroke)) {\n    // array\n    for (let i = 0; i < 4; i++) {\n      _strokeVec4[i] = !!stroke[i];\n      isFullStroke &&= !!_strokeVec4[i];\n    }\n  } else {\n    _strokeVec4[0] = false;\n    _strokeVec4[1] = false;\n    _strokeVec4[2] = false;\n    _strokeVec4[3] = false;\n  }\n\n  return {\n    isFullStroke,\n    stroke: _strokeVec4\n  };\n};\n\n// 公共的padding数组，避免大量数组生成\nconst _paddingVec4: [number, number, number, number] = [0, 0, 0, 0];\n/**\n * 解析padding配置\n * @param padding\n * @returns\n */\nexport const parsePadding = (\n  padding: IGraphicAttribute['boundsPadding']\n): number | [number, number, number, number] => {\n  if (!padding) {\n    return 0;\n  }\n  if (isArray(padding)) {\n    if (padding.length === 0) {\n      return 0;\n    } else if (padding.length === 1) {\n      return padding[0];\n    } else if (padding.length === 2) {\n      _paddingVec4[0] = padding[0];\n      _paddingVec4[2] = padding[0];\n      _paddingVec4[1] = padding[1];\n      _paddingVec4[3] = padding[1];\n      return _paddingVec4;\n    }\n    // 不考虑三个数的情况，三个数是用户传错了\n    return padding as [number, number, number, number];\n  }\n\n  return padding as number;\n};\n\nconst _coords: [IPointLike, IPointLike, IPointLike, IPointLike] = [\n  { x: 0, y: 0 },\n  { x: 0, y: 0 },\n  { x: 0, y: 0 },\n  { x: 0, y: 0 }\n];\nconst indexList = [1, 2, 3, 0, 1, 2, 3, 0];\n/**\n * 计算circle一段弧线的bounds\n * @param startAngle 小于2pi\n * @param endAngle\n * @param radius\n * @param bounds\n */\nexport function circleBounds(startAngle: number, endAngle: number, radius: number, bounds: IBounds) {\n  // startAngle小于2pi\n  // endAngle - startAngle小于2pi\n  while (startAngle >= pi2) {\n    startAngle -= pi2;\n  }\n  while (startAngle < 0) {\n    startAngle += pi2;\n  }\n  while (startAngle > endAngle) {\n    endAngle += pi2;\n  }\n  _coords[0].x = radius;\n  // _coords[0].y = 0;\n  // _coords[1].x = 0;\n  _coords[1].y = radius;\n  _coords[2].x = -radius;\n  // _coords[2].y = -radius;\n  // _coords[3].x = 0;\n  _coords[3].y = -radius;\n\n  // (0,pi/2], (pi/2, pi], (pi, pi/2*3], (pi/2*3, 2pi]\n  // 1,         2,           3,           0\n  const startIdx = Math.ceil(startAngle / halfPi) % 4;\n  const endIdx = Math.ceil(endAngle / halfPi) % 4;\n  // console.log(startAngle, endAngle, cos(startAngle), sin(startAngle), cos(endAngle), sin(endAngle));\n  bounds.add(cos(startAngle) * radius, sin(startAngle) * radius);\n  bounds.add(cos(endAngle) * radius, sin(endAngle) * radius);\n  if (startIdx !== endIdx || endAngle - startAngle > pi) {\n    let match = false;\n    for (let i = 0; i < indexList.length; i++) {\n      if (!match && startIdx === indexList[i]) {\n        match = true;\n        const p = _coords[startIdx];\n        bounds.add(p.x, p.y);\n        continue;\n      } else if (match && endIdx === indexList[i]) {\n        break;\n      }\n      if (match) {\n        const p = _coords[indexList[i]];\n        bounds.add(p.x, p.y);\n      }\n    }\n  }\n  // const delta = Math.floor((endAngle - startAngle) / halfPi);\n  // for (let i = 0; i < delta; i++) {\n  //   const p = _coords[(startIdx + i) % 4];\n  //   bounds.add(p.x, p.y);\n  // }\n\n  // // 计算y1, y2\n  // const y2 = halfPi >= startAngle && halfPi <= endAngle ? radius : max(sin(startAngle), sin(endAngle)) * radius;\n  // const y1 =\n  //   halfPi + pi >= startAngle && halfPi + pi <= endAngle ? -radius : min(sin(startAngle), sin(endAngle)) * radius;\n  // const x2 = pi2 >= startAngle && pi2 <= endAngle ? radius : max(cos(startAngle), cos(endAngle)) * radius;\n  // const x1 = pi >= startAngle && pi <= endAngle ? -radius : min(cos(startAngle), cos(endAngle)) * radius;\n\n  // // bounds.set(x1, y1, x2, y2);\n  // bounds.add(x1, y1);\n  // bounds.add(x2, y2);\n}\n\n/**\n * 比较两个点数组是否相同\n * @param pointsA 数组A\n * @param pointsB 数组B\n */\nexport function pointsEqual(pointsA: IPointLike[] | IPointLike, pointsB: IPointLike[] | IPointLike): boolean {\n  if (!pointsA || !pointsB) {\n    return false;\n  } // 需要传入pointsA和pointsB\n  if (Array.isArray(pointsA) && Array.isArray(pointsB)) {\n    // 如果pointsA和pointsB是数组\n    if (pointsA.length !== pointsB.length) {\n      return false;\n    }\n    return pointsA.every((point, index) => pointEqual(point, pointsB[index]));\n  }\n  if (!Number.isNaN((pointsA as IPointLike).x + (pointsA as IPointLike).y)) {\n    // 如果pointA是IPoint（防止参数是undefined）\n    return pointEqual(pointsA as IPointLike, pointsB as IPointLike);\n  }\n  return false;\n}\n\n/**\n * 比较两个点是否相同\n * @param pointA 点A\n * @param pointB 点B\n */\nexport function pointEqual(pointA: IPointLike, pointB: IPointLike): boolean {\n  return (\n    pointA.x === pointB.x &&\n    pointA.y === pointB.y &&\n    pointA.x1 === pointB.x1 &&\n    pointA.y1 === pointB.y1 &&\n    pointA.defined === pointB.defined\n  );\n}\n\n/**\n * 两点插值\n * @param pointA 点A\n * @param pointB 点B\n * @param ratio 比例\n */\nexport function pointInterpolation(pointA: IPointLike, pointB: IPointLike, ratio: number): IPointLike {\n  const { x, y } = pointAt(pointA.x, pointA.y, pointB.x, pointB.y, ratio);\n  const { x: x1, y: y1 } = pointAt(pointA.x1, pointA.y1, pointB.x1, pointB.y1, ratio);\n  const point = new Point(x as number, y as number, x1, y1);\n  point.defined = pointB.defined;\n  return point;\n}\n\n/**\n * 两点插值\n * @param pointA 点A\n * @param pointB 点B\n * @param ratio 比例\n */\nexport function pointInterpolationHighPerformance(\n  pointA: IPointLike,\n  pointB: IPointLike,\n  ratio: number,\n  point: IPointLike\n): IPointLike {\n  const { x, y } = pointAt(pointA.x, pointA.y, pointB.x, pointB.y, ratio);\n  const { x: x1, y: y1 } = pointAt(pointA.x1, pointA.y1, pointB.x1, pointB.y1, ratio);\n  // const point = new Point(x as number, y as number, x1, y1);\n  point.x = x as number;\n  point.y = y as number;\n  point.x1 = x1;\n  point.y1 = y1;\n  point.defined = pointB.defined;\n  return point;\n}\n\n/**\n * 点数组插值\n * @param pointsA 点数组A\n * @param pointsB 点数组B\n * @param ratio 比例\n */\nexport function pointsInterpolation(\n  pointsA: IPointLike[] | IPointLike,\n  pointsB: IPointLike[] | IPointLike,\n  ratio: number\n): IPointLike[] {\n  if (!pointsA || !pointsB) {\n    return [];\n  } // 需要传入pointsA和pointsB\n  if (!Array.isArray(pointsA)) {\n    pointsA = [pointsA];\n  }\n  if (!Array.isArray(pointsB)) {\n    pointsB = [pointsB];\n  }\n\n  let points: IPointLike[] = [];\n  if (pointsA.length > pointsB.length) {\n    // 如果变短了，那么后面点的直接clip\n    points = pointsB.map(point => {\n      const p = new Point(point.x, point.y, point.x1, point.y1);\n      p.defined = point.defined;\n      return p;\n    });\n    for (let i = 0; i < pointsB.length; i++) {\n      points[i] = pointInterpolation(pointsA[i], pointsB[i], ratio);\n    }\n  } else {\n    // 如果变长了，加上后面的点\n    points = pointsB.map(point => {\n      const p = new Point(point.x, point.y, point.x1, point.y1);\n      p.defined = point.defined;\n      return p;\n    });\n    for (let i = 0; i < pointsA.length; i++) {\n      points[i] = pointInterpolation(pointsA[i], pointsB[i], ratio);\n    }\n  }\n  return points;\n}\n\nexport const transformKeys = [\n  'x',\n  'y',\n  'dx',\n  'dy',\n  'scaleX',\n  'scaleY',\n  'angle',\n  'anchor',\n  'postMatrix',\n  'scrollX',\n  'scrollY'\n];\nexport const isTransformKey = (key: string) => {\n  return transformKeys.includes(key);\n};\n\nexport function getAttributeFromDefaultAttrList(attr: Record<string, any> | Record<string, any>[], key: string) {\n  if (isArray(attr)) {\n    let val;\n    for (let i = 0; i < attr.length && val === undefined; i++) {\n      val = attr[i][key];\n    }\n    return val;\n  }\n  return attr[key];\n}\n\nexport class RafBasedSTO {\n  static TimeOut = 1000 / 60;\n  durations: number[];\n  timeout: number;\n  lastDate: number;\n  durationsListThreshold: number;\n\n  constructor() {\n    this.durations = [];\n    this.timeout = RafBasedSTO.TimeOut;\n    this.lastDate = 0;\n    this.durationsListThreshold = 30;\n  }\n\n  call(cb: FrameRequestCallback) {\n    this.lastDate = Date.now();\n    return setTimeout(\n      () => {\n        this.appendDuration(Date.now() - this.lastDate);\n        cb(0);\n      },\n      this.timeout,\n      true\n    );\n  }\n\n  clear(h: number) {\n    clearTimeout(h);\n  }\n\n  appendDuration(d: number) {\n    this.durations.push(d);\n    if (this.durations.length > this.durationsListThreshold) {\n      this.durations.shift();\n    }\n    // 最多60fps, 最少30fps\n    this.timeout = Math.min(\n      Math.max(this.durations.reduce((a, b) => a + b, 0) / this.durations.length, 1000 / 60),\n      1000 / 30\n    );\n  }\n}\n\nexport const rafBasedSto = new RafBasedSTO();\n"]}

package/cjs/common/xml/OrderedObjParser.d.ts

@@ -0,0 +1,19 @@
+import type { X2jOptions } from './type';
+declare class XmlNode {
+    tagname: string;
+    child: any[];
+    constructor(tagname: string);
+    add(key: string, val: string): void;
+    addChild(node: XmlNode): void;
+}
+export declare class OrderedObjParser {
+    options: Partial<X2jOptions>;
+    currentNode: XmlNode | null;
+    tagsNodeStack: XmlNode[];
+    docTypeEntities: Record<string, any>;
+    constructor(options: Partial<X2jOptions>);
+    protected addChild(currentNode: XmlNode, childNode: XmlNode, jPath: string): void;
+    protected buildAttributesMap(attrStr: string, jPath: string, tagName: string): {};
+    parseXml(xmlData: string): any[];
+}
+export {};