@esotericsoftware/spine-core 4.1.25 → 4.1.28

package/dist/Triangulator.js

@@ -0,0 +1,244 @@
+/******************************************************************************
+ * Spine Runtimes License Agreement
+ * Last updated September 24, 2021. Replaces all prior versions.
+ *
+ * Copyright (c) 2013-2021, Esoteric Software LLC
+ *
+ * Integration of the Spine Runtimes into software or otherwise creating
+ * derivative works of the Spine Runtimes is permitted under the terms and
+ * conditions of Section 2 of the Spine Editor License Agreement:
+ * http://esotericsoftware.com/spine-editor-license
+ *
+ * Otherwise, it is permitted to integrate the Spine Runtimes into software
+ * or otherwise create derivative works of the Spine Runtimes (collectively,
+ * "Products"), provided that each user of the Products must obtain their own
+ * Spine Editor license and redistribution of the Products in any form must
+ * include this license and copyright notice.
+ *
+ * THE SPINE RUNTIMES ARE PROVIDED BY ESOTERIC SOFTWARE LLC "AS IS" AND ANY
+ * EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
+ * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
+ * DISCLAIMED. IN NO EVENT SHALL ESOTERIC SOFTWARE LLC BE LIABLE FOR ANY
+ * DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
+ * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES,
+ * BUSINESS INTERRUPTION, OR LOSS OF USE, DATA, OR PROFITS) HOWEVER CAUSED AND
+ * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+ * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
+ * THE SPINE RUNTIMES, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+ *****************************************************************************/
+import { Pool } from "./Utils";
+export class Triangulator {
+    constructor() {
+        this.convexPolygons = new Array();
+        this.convexPolygonsIndices = new Array();
+        this.indicesArray = new Array();
+        this.isConcaveArray = new Array();
+        this.triangles = new Array();
+        this.polygonPool = new Pool(() => {
+            return new Array();
+        });
+        this.polygonIndicesPool = new Pool(() => {
+            return new Array();
+        });
+    }
+    triangulate(verticesArray) {
+        let vertices = verticesArray;
+        let vertexCount = verticesArray.length >> 1;
+        let indices = this.indicesArray;
+        indices.length = 0;
+        for (let i = 0; i < vertexCount; i++)
+            indices[i] = i;
+        let isConcave = this.isConcaveArray;
+        isConcave.length = 0;
+        for (let i = 0, n = vertexCount; i < n; ++i)
+            isConcave[i] = Triangulator.isConcave(i, vertexCount, vertices, indices);
+        let triangles = this.triangles;
+        triangles.length = 0;
+        while (vertexCount > 3) {
+            // Find ear tip.
+            let previous = vertexCount - 1, i = 0, next = 1;
+            while (true) {
+                outer: if (!isConcave[i]) {
+                    let p1 = indices[previous] << 1, p2 = indices[i] << 1, p3 = indices[next] << 1;
+                    let p1x = vertices[p1], p1y = vertices[p1 + 1];
+                    let p2x = vertices[p2], p2y = vertices[p2 + 1];
+                    let p3x = vertices[p3], p3y = vertices[p3 + 1];
+                    for (let ii = (next + 1) % vertexCount; ii != previous; ii = (ii + 1) % vertexCount) {
+                        if (!isConcave[ii])
+                            continue;
+                        let v = indices[ii] << 1;
+                        let vx = vertices[v], vy = vertices[v + 1];
+                        if (Triangulator.positiveArea(p3x, p3y, p1x, p1y, vx, vy)) {
+                            if (Triangulator.positiveArea(p1x, p1y, p2x, p2y, vx, vy)) {
+                                if (Triangulator.positiveArea(p2x, p2y, p3x, p3y, vx, vy))
+                                    break outer;
+                            }
+                        }
+                    }
+                    break;
+                }
+                if (next == 0) {
+                    do {
+                        if (!isConcave[i])
+                            break;
+                        i--;
+                    } while (i > 0);
+                    break;
+                }
+                previous = i;
+                i = next;
+                next = (next + 1) % vertexCount;
+            }
+            // Cut ear tip.
+            triangles.push(indices[(vertexCount + i - 1) % vertexCount]);
+            triangles.push(indices[i]);
+            triangles.push(indices[(i + 1) % vertexCount]);
+            indices.splice(i, 1);
+            isConcave.splice(i, 1);
+            vertexCount--;
+            let previousIndex = (vertexCount + i - 1) % vertexCount;
+            let nextIndex = i == vertexCount ? 0 : i;
+            isConcave[previousIndex] = Triangulator.isConcave(previousIndex, vertexCount, vertices, indices);
+            isConcave[nextIndex] = Triangulator.isConcave(nextIndex, vertexCount, vertices, indices);
+        }
+        if (vertexCount == 3) {
+            triangles.push(indices[2]);
+            triangles.push(indices[0]);
+            triangles.push(indices[1]);
+        }
+        return triangles;
+    }
+    decompose(verticesArray, triangles) {
+        let vertices = verticesArray;
+        let convexPolygons = this.convexPolygons;
+        this.polygonPool.freeAll(convexPolygons);
+        convexPolygons.length = 0;
+        let convexPolygonsIndices = this.convexPolygonsIndices;
+        this.polygonIndicesPool.freeAll(convexPolygonsIndices);
+        convexPolygonsIndices.length = 0;
+        let polygonIndices = this.polygonIndicesPool.obtain();
+        polygonIndices.length = 0;
+        let polygon = this.polygonPool.obtain();
+        polygon.length = 0;
+        // Merge subsequent triangles if they form a triangle fan.
+        let fanBaseIndex = -1, lastWinding = 0;
+        for (let i = 0, n = triangles.length; i < n; i += 3) {
+            let t1 = triangles[i] << 1, t2 = triangles[i + 1] << 1, t3 = triangles[i + 2] << 1;
+            let x1 = vertices[t1], y1 = vertices[t1 + 1];
+            let x2 = vertices[t2], y2 = vertices[t2 + 1];
+            let x3 = vertices[t3], y3 = vertices[t3 + 1];
+            // If the base of the last triangle is the same as this triangle, check if they form a convex polygon (triangle fan).
+            let merged = false;
+            if (fanBaseIndex == t1) {
+                let o = polygon.length - 4;
+                let winding1 = Triangulator.winding(polygon[o], polygon[o + 1], polygon[o + 2], polygon[o + 3], x3, y3);
+                let winding2 = Triangulator.winding(x3, y3, polygon[0], polygon[1], polygon[2], polygon[3]);
+                if (winding1 == lastWinding && winding2 == lastWinding) {
+                    polygon.push(x3);
+                    polygon.push(y3);
+                    polygonIndices.push(t3);
+                    merged = true;
+                }
+            }
+            // Otherwise make this triangle the new base.
+            if (!merged) {
+                if (polygon.length > 0) {
+                    convexPolygons.push(polygon);
+                    convexPolygonsIndices.push(polygonIndices);
+                }
+                else {
+                    this.polygonPool.free(polygon);
+                    this.polygonIndicesPool.free(polygonIndices);
+                }
+                polygon = this.polygonPool.obtain();
+                polygon.length = 0;
+                polygon.push(x1);
+                polygon.push(y1);
+                polygon.push(x2);
+                polygon.push(y2);
+                polygon.push(x3);
+                polygon.push(y3);
+                polygonIndices = this.polygonIndicesPool.obtain();
+                polygonIndices.length = 0;
+                polygonIndices.push(t1);
+                polygonIndices.push(t2);
+                polygonIndices.push(t3);
+                lastWinding = Triangulator.winding(x1, y1, x2, y2, x3, y3);
+                fanBaseIndex = t1;
+            }
+        }
+        if (polygon.length > 0) {
+            convexPolygons.push(polygon);
+            convexPolygonsIndices.push(polygonIndices);
+        }
+        // Go through the list of polygons and try to merge the remaining triangles with the found triangle fans.
+        for (let i = 0, n = convexPolygons.length; i < n; i++) {
+            polygonIndices = convexPolygonsIndices[i];
+            if (polygonIndices.length == 0)
+                continue;
+            let firstIndex = polygonIndices[0];
+            let lastIndex = polygonIndices[polygonIndices.length - 1];
+            polygon = convexPolygons[i];
+            let o = polygon.length - 4;
+            let prevPrevX = polygon[o], prevPrevY = polygon[o + 1];
+            let prevX = polygon[o + 2], prevY = polygon[o + 3];
+            let firstX = polygon[0], firstY = polygon[1];
+            let secondX = polygon[2], secondY = polygon[3];
+            let winding = Triangulator.winding(prevPrevX, prevPrevY, prevX, prevY, firstX, firstY);
+            for (let ii = 0; ii < n; ii++) {
+                if (ii == i)
+                    continue;
+                let otherIndices = convexPolygonsIndices[ii];
+                if (otherIndices.length != 3)
+                    continue;
+                let otherFirstIndex = otherIndices[0];
+                let otherSecondIndex = otherIndices[1];
+                let otherLastIndex = otherIndices[2];
+                let otherPoly = convexPolygons[ii];
+                let x3 = otherPoly[otherPoly.length - 2], y3 = otherPoly[otherPoly.length - 1];
+                if (otherFirstIndex != firstIndex || otherSecondIndex != lastIndex)
+                    continue;
+                let winding1 = Triangulator.winding(prevPrevX, prevPrevY, prevX, prevY, x3, y3);
+                let winding2 = Triangulator.winding(x3, y3, firstX, firstY, secondX, secondY);
+                if (winding1 == winding && winding2 == winding) {
+                    otherPoly.length = 0;
+                    otherIndices.length = 0;
+                    polygon.push(x3);
+                    polygon.push(y3);
+                    polygonIndices.push(otherLastIndex);
+                    prevPrevX = prevX;
+                    prevPrevY = prevY;
+                    prevX = x3;
+                    prevY = y3;
+                    ii = 0;
+                }
+            }
+        }
+        // Remove empty polygons that resulted from the merge step above.
+        for (let i = convexPolygons.length - 1; i >= 0; i--) {
+            polygon = convexPolygons[i];
+            if (polygon.length == 0) {
+                convexPolygons.splice(i, 1);
+                this.polygonPool.free(polygon);
+                polygonIndices = convexPolygonsIndices[i];
+                convexPolygonsIndices.splice(i, 1);
+                this.polygonIndicesPool.free(polygonIndices);
+            }
+        }
+        return convexPolygons;
+    }
+    static isConcave(index, vertexCount, vertices, indices) {
+        let previous = indices[(vertexCount + index - 1) % vertexCount] << 1;
+        let current = indices[index] << 1;
+        let next = indices[(index + 1) % vertexCount] << 1;
+        return !this.positiveArea(vertices[previous], vertices[previous + 1], vertices[current], vertices[current + 1], vertices[next], vertices[next + 1]);
+    }
+    static positiveArea(p1x, p1y, p2x, p2y, p3x, p3y) {
+        return p1x * (p3y - p2y) + p2x * (p1y - p3y) + p3x * (p2y - p1y) >= 0;
+    }
+    static winding(p1x, p1y, p2x, p2y, p3x, p3y) {
+        let px = p2x - p1x, py = p2y - p1y;
+        return p3x * py - p3y * px + px * p1y - p1x * py >= 0 ? 1 : -1;
+    }
+}
+//# sourceMappingURL=data:application/json;base64,{"version":3,"file":"Triangulator.js","sourceRoot":"","sources":["../src/Triangulator.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;+EA2B+E;AAE/E,OAAO,EAAmB,IAAI,EAAE,MAAM,SAAS,CAAC;AAEhD,MAAM,OAAO,YAAY;IAAzB;QACS,mBAAc,GAAG,IAAI,KAAK,EAAiB,CAAC;QAC5C,0BAAqB,GAAG,IAAI,KAAK,EAAiB,CAAC;QAEnD,iBAAY,GAAG,IAAI,KAAK,EAAU,CAAC;QACnC,mBAAc,GAAG,IAAI,KAAK,EAAW,CAAC;QACtC,cAAS,GAAG,IAAI,KAAK,EAAU,CAAC;QAEhC,gBAAW,GAAG,IAAI,IAAI,CAAgB,GAAG,EAAE;YAClD,OAAO,IAAI,KAAK,EAAU,CAAC;QAC5B,CAAC,CAAC,CAAC;QAEK,uBAAkB,GAAG,IAAI,IAAI,CAAgB,GAAG,EAAE;YACzD,OAAO,IAAI,KAAK,EAAU,CAAC;QAC5B,CAAC,CAAC,CAAC;IA+NJ,CAAC;IA7NO,WAAW,CAAE,aAA8B;QACjD,IAAI,QAAQ,GAAG,aAAa,CAAC;QAC7B,IAAI,WAAW,GAAG,aAAa,CAAC,MAAM,IAAI,CAAC,CAAC;QAE5C,IAAI,OAAO,GAAG,IAAI,CAAC,YAAY,CAAC;QAChC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC;QACnB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,WAAW,EAAE,CAAC,EAAE;YACnC,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QAEhB,IAAI,SAAS,GAAG,IAAI,CAAC,cAAc,CAAC;QACpC,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC;QACrB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,WAAW,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC;YAC1C,SAAS,CAAC,CAAC,CAAC,GAAG,YAAY,CAAC,SAAS,CAAC,CAAC,EAAE,WAAW,EAAE,QAAQ,EAAE,OAAO,CAAC,CAAC;QAE1E,IAAI,SAAS,GAAG,IAAI,CAAC,SAAS,CAAC;QAC/B,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC;QAErB,OAAO,WAAW,GAAG,CAAC,EAAE;YACvB,gBAAgB;YAChB,IAAI,QAAQ,GAAG,WAAW,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,IAAI,GAAG,CAAC,CAAC;YAChD,OAAO,IAAI,EAAE;gBACZ,KAAK,EACL,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE;oBAClB,IAAI,EAAE,GAAG,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,EAAE,GAAG,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,EAAE,GAAG,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;oBAC/E,IAAI,GAAG,GAAG,QAAQ,CAAC,EAAE,CAAC,EAAE,GAAG,GAAG,QAAQ,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC;oBAC/C,IAAI,GAAG,GAAG,QAAQ,CAAC,EAAE,CAAC,EAAE,GAAG,GAAG,QAAQ,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC;oBAC/C,IAAI,GAAG,GAAG,QAAQ,CAAC,EAAE,CAAC,EAAE,GAAG,GAAG,QAAQ,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC;oBAC/C,KAAK,IAAI,EAAE,GAAG,CAAC,IAAI,GAAG,CAAC,CAAC,GAAG,WAAW,EAAE,EAAE,IAAI,QAAQ,EAAE,EAAE,GAAG,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,WAAW,EAAE;wBACpF,IAAI,CAAC,SAAS,CAAC,EAAE,CAAC;4BAAE,SAAS;wBAC7B,IAAI,CAAC,GAAG,OAAO,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC;wBACzB,IAAI,EAAE,GAAG,QAAQ,CAAC,CAAC,CAAC,EAAE,EAAE,GAAG,QAAQ,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;wBAC3C,IAAI,YAAY,CAAC,YAAY,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE;4BAC1D,IAAI,YAAY,CAAC,YAAY,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE;gCAC1D,IAAI,YAAY,CAAC,YAAY,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE,EAAE,EAAE,CAAC;oCAAE,MAAM,KAAK,CAAC;6BACvE;yBACD;qBACD;oBACD,MAAM;iBACN;gBAED,IAAI,IAAI,IAAI,CAAC,EAAE;oBACd,GAAG;wBACF,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC;4BAAE,MAAM;wBACzB,CAAC,EAAE,CAAC;qBACJ,QAAQ,CAAC,GAAG,CAAC,EAAE;oBAChB,MAAM;iBACN;gBAED,QAAQ,GAAG,CAAC,CAAC;gBACb,CAAC,GAAG,IAAI,CAAC;gBACT,IAAI,GAAG,CAAC,IAAI,GAAG,CAAC,CAAC,GAAG,WAAW,CAAC;aAChC;YAED,eAAe;YACf,SAAS,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,WAAW,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,WAAW,CAAC,CAAC,CAAC;YAC7D,SAAS,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;YAC3B,SAAS,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,WAAW,CAAC,CAAC,CAAC;YAC/C,OAAO,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YACrB,SAAS,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YACvB,WAAW,EAAE,CAAC;YAEd,IAAI,aAAa,GAAG,CAAC,WAAW,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,WAAW,CAAC;YACxD,IAAI,SAAS,GAAG,CAAC,IAAI,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YACzC,SAAS,CAAC,aAAa,CAAC,GAAG,YAAY,CAAC,SAAS,CAAC,aAAa,EAAE,WAAW,EAAE,QAAQ,EAAE,OAAO,CAAC,CAAC;YACjG,SAAS,CAAC,SAAS,CAAC,GAAG,YAAY,CAAC,SAAS,CAAC,SAAS,EAAE,WAAW,EAAE,QAAQ,EAAE,OAAO,CAAC,CAAC;SACzF;QAED,IAAI,WAAW,IAAI,CAAC,EAAE;YACrB,SAAS,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;YAC3B,SAAS,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;YAC3B,SAAS,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;SAC3B;QAED,OAAO,SAAS,CAAC;IAClB,CAAC;IAED,SAAS,CAAE,aAA4B,EAAE,SAAwB;QAChE,IAAI,QAAQ,GAAG,aAAa,CAAC;QAC7B,IAAI,cAAc,GAAG,IAAI,CAAC,cAAc,CAAC;QACzC,IAAI,CAAC,WAAW,CAAC,OAAO,CAAC,cAAc,CAAC,CAAC;QACzC,cAAc,CAAC,MAAM,GAAG,CAAC,CAAC;QAE1B,IAAI,qBAAqB,GAAG,IAAI,CAAC,qBAAqB,CAAC;QACvD,IAAI,CAAC,kBAAkB,CAAC,OAAO,CAAC,qBAAqB,CAAC,CAAC;QACvD,qBAAqB,CAAC,MAAM,GAAG,CAAC,CAAC;QAEjC,IAAI,cAAc,GAAG,IAAI,CAAC,kBAAkB,CAAC,MAAM,EAAE,CAAC;QACtD,cAAc,CAAC,MAAM,GAAG,CAAC,CAAC;QAE1B,IAAI,OAAO,GAAG,IAAI,CAAC,WAAW,CAAC,MAAM,EAAE,CAAC;QACxC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC;QAEnB,0DAA0D;QAC1D,IAAI,YAAY,GAAG,CAAC,CAAC,EAAE,WAAW,GAAG,CAAC,CAAC;QACvC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE;YACpD,IAAI,EAAE,GAAG,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,EAAE,GAAG,SAAS,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,EAAE,EAAE,GAAG,SAAS,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC;YACnF,IAAI,EAAE,GAAG,QAAQ,CAAC,EAAE,CAAC,EAAE,EAAE,GAAG,QAAQ,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC;YAC7C,IAAI,EAAE,GAAG,QAAQ,CAAC,EAAE,CAAC,EAAE,EAAE,GAAG,QAAQ,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC;YAC7C,IAAI,EAAE,GAAG,QAAQ,CAAC,EAAE,CAAC,EAAE,EAAE,GAAG,QAAQ,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC;YAE7C,qHAAqH;YACrH,IAAI,MAAM,GAAG,KAAK,CAAC;YACnB,IAAI,YAAY,IAAI,EAAE,EAAE;gBACvB,IAAI,CAAC,GAAG,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC;gBAC3B,IAAI,QAAQ,GAAG,YAAY,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;gBACxG,IAAI,QAAQ,GAAG,YAAY,CAAC,OAAO,CAAC,EAAE,EAAE,EAAE,EAAE,OAAO,CAAC,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;gBAC5F,IAAI,QAAQ,IAAI,WAAW,IAAI,QAAQ,IAAI,WAAW,EAAE;oBACvD,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;oBACjB,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;oBACjB,cAAc,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;oBACxB,MAAM,GAAG,IAAI,CAAC;iBACd;aACD;YAED,6CAA6C;YAC7C,IAAI,CAAC,MAAM,EAAE;gBACZ,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE;oBACvB,cAAc,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;oBAC7B,qBAAqB,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC;iBAC3C;qBAAM;oBACN,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,OAAO,CAAC,CAAA;oBAC9B,IAAI,CAAC,kBAAkB,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC;iBAC7C;gBACD,OAAO,GAAG,IAAI,CAAC,WAAW,CAAC,MAAM,EAAE,CAAC;gBACpC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC;gBACnB,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;gBACjB,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;gBACjB,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;gBACjB,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;gBACjB,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;gBACjB,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;gBACjB,cAAc,GAAG,IAAI,CAAC,kBAAkB,CAAC,MAAM,EAAE,CAAC;gBAClD,cAAc,CAAC,MAAM,GAAG,CAAC,CAAC;gBAC1B,cAAc,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;gBACxB,cAAc,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;gBACxB,cAAc,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;gBACxB,WAAW,GAAG,YAAY,CAAC,OAAO,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;gBAC3D,YAAY,GAAG,EAAE,CAAC;aAClB;SACD;QAED,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE;YACvB,cAAc,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;YAC7B,qBAAqB,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC;SAC3C;QAED,yGAAyG;QACzG,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,cAAc,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;YACtD,cAAc,GAAG,qBAAqB,CAAC,CAAC,CAAC,CAAC;YAC1C,IAAI,cAAc,CAAC,MAAM,IAAI,CAAC;gBAAE,SAAS;YACzC,IAAI,UAAU,GAAG,cAAc,CAAC,CAAC,CAAC,CAAC;YACnC,IAAI,SAAS,GAAG,cAAc,CAAC,cAAc,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;YAE1D,OAAO,GAAG,cAAc,CAAC,CAAC,CAAC,CAAC;YAC5B,IAAI,CAAC,GAAG,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC;YAC3B,IAAI,SAAS,GAAG,OAAO,CAAC,CAAC,CAAC,EAAE,SAAS,GAAG,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YACvD,IAAI,KAAK,GAAG,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,GAAG,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YACnD,IAAI,MAAM,GAAG,OAAO,CAAC,CAAC,CAAC,EAAE,MAAM,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;YAC7C,IAAI,OAAO,GAAG,OAAO,CAAC,CAAC,CAAC,EAAE,OAAO,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;YAC/C,IAAI,OAAO,GAAG,YAAY,CAAC,OAAO,CAAC,SAAS,EAAE,SAAS,EAAE,KAAK,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM,CAAC,CAAC;YAEvF,KAAK,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,EAAE,EAAE,EAAE,EAAE;gBAC9B,IAAI,EAAE,IAAI,CAAC;oBAAE,SAAS;gBACtB,IAAI,YAAY,GAAG,qBAAqB,CAAC,EAAE,CAAC,CAAC;gBAC7C,IAAI,YAAY,CAAC,MAAM,IAAI,CAAC;oBAAE,SAAS;gBACvC,IAAI,eAAe,GAAG,YAAY,CAAC,CAAC,CAAC,CAAC;gBACtC,IAAI,gBAAgB,GAAG,YAAY,CAAC,CAAC,CAAC,CAAC;gBACvC,IAAI,cAAc,GAAG,YAAY,CAAC,CAAC,CAAC,CAAC;gBAErC,IAAI,SAAS,GAAG,cAAc,CAAC,EAAE,CAAC,CAAC;gBACnC,IAAI,EAAE,GAAG,SAAS,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC,EAAE,EAAE,GAAG,SAAS,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;gBAE/E,IAAI,eAAe,IAAI,UAAU,IAAI,gBAAgB,IAAI,SAAS;oBAAE,SAAS;gBAC7E,IAAI,QAAQ,GAAG,YAAY,CAAC,OAAO,CAAC,SAAS,EAAE,SAAS,EAAE,KAAK,EAAE,KAAK,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;gBAChF,IAAI,QAAQ,GAAG,YAAY,CAAC,OAAO,CAAC,EAAE,EAAE,EAAE,EAAE,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,OAAO,CAAC,CAAC;gBAC9E,IAAI,QAAQ,IAAI,OAAO,IAAI,QAAQ,IAAI,OAAO,EAAE;oBAC/C,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC;oBACrB,YAAY,CAAC,MAAM,GAAG,CAAC,CAAC;oBACxB,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;oBACjB,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;oBACjB,cAAc,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC;oBACpC,SAAS,GAAG,KAAK,CAAC;oBAClB,SAAS,GAAG,KAAK,CAAC;oBAClB,KAAK,GAAG,EAAE,CAAC;oBACX,KAAK,GAAG,EAAE,CAAC;oBACX,EAAE,GAAG,CAAC,CAAC;iBACP;aACD;SACD;QAED,iEAAiE;QACjE,KAAK,IAAI,CAAC,GAAG,cAAc,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE;YACpD,OAAO,GAAG,cAAc,CAAC,CAAC,CAAC,CAAC;YAC5B,IAAI,OAAO,CAAC,MAAM,IAAI,CAAC,EAAE;gBACxB,cAAc,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;gBAC5B,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;gBAC/B,cAAc,GAAG,qBAAqB,CAAC,CAAC,CAAC,CAAA;gBACzC,qBAAqB,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;gBAClC,IAAI,CAAC,kBAAkB,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC;aAC7C;SACD;QAED,OAAO,cAAc,CAAC;IACvB,CAAC;IAEO,MAAM,CAAC,SAAS,CAAE,KAAa,EAAE,WAAmB,EAAE,QAAyB,EAAE,OAAwB;QAChH,IAAI,QAAQ,GAAG,OAAO,CAAC,CAAC,WAAW,GAAG,KAAK,GAAG,CAAC,CAAC,GAAG,WAAW,CAAC,IAAI,CAAC,CAAC;QACrE,IAAI,OAAO,GAAG,OAAO,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;QAClC,IAAI,IAAI,GAAG,OAAO,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,GAAG,WAAW,CAAC,IAAI,CAAC,CAAC;QACnD,OAAO,CAAC,IAAI,CAAC,YAAY,CAAC,QAAQ,CAAC,QAAQ,CAAC,EAAE,QAAQ,CAAC,QAAQ,GAAG,CAAC,CAAC,EAAE,QAAQ,CAAC,OAAO,CAAC,EAAE,QAAQ,CAAC,OAAO,GAAG,CAAC,CAAC,EAAE,QAAQ,CAAC,IAAI,CAAC,EAC7H,QAAQ,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC;IACtB,CAAC;IAEO,MAAM,CAAC,YAAY,CAAE,GAAW,EAAE,GAAW,EAAE,GAAW,EAAE,GAAW,EAAE,GAAW,EAAE,GAAW;QACxG,OAAO,GAAG,GAAG,CAAC,GAAG,GAAG,GAAG,CAAC,GAAG,GAAG,GAAG,CAAC,GAAG,GAAG,GAAG,CAAC,GAAG,GAAG,GAAG,CAAC,GAAG,GAAG,GAAG,CAAC,IAAI,CAAC,CAAC;IACvE,CAAC;IAEO,MAAM,CAAC,OAAO,CAAE,GAAW,EAAE,GAAW,EAAE,GAAW,EAAE,GAAW,EAAE,GAAW,EAAE,GAAW;QACnG,IAAI,EAAE,GAAG,GAAG,GAAG,GAAG,EAAE,EAAE,GAAG,GAAG,GAAG,GAAG,CAAC;QACnC,OAAO,GAAG,GAAG,EAAE,GAAG,GAAG,GAAG,EAAE,GAAG,EAAE,GAAG,GAAG,GAAG,GAAG,GAAG,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAChE,CAAC;CACD"}

package/dist/Updatable.d.ts

@@ -0,0 +1,37 @@
+/******************************************************************************
+ * Spine Runtimes License Agreement
+ * Last updated September 24, 2021. Replaces all prior versions.
+ *
+ * Copyright (c) 2013-2021, Esoteric Software LLC
+ *
+ * Integration of the Spine Runtimes into software or otherwise creating
+ * derivative works of the Spine Runtimes is permitted under the terms and
+ * conditions of Section 2 of the Spine Editor License Agreement:
+ * http://esotericsoftware.com/spine-editor-license
+ *
+ * Otherwise, it is permitted to integrate the Spine Runtimes into software
+ * or otherwise create derivative works of the Spine Runtimes (collectively,
+ * "Products"), provided that each user of the Products must obtain their own
+ * Spine Editor license and redistribution of the Products in any form must
+ * include this license and copyright notice.
+ *
+ * THE SPINE RUNTIMES ARE PROVIDED BY ESOTERIC SOFTWARE LLC "AS IS" AND ANY
+ * EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
+ * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
+ * DISCLAIMED. IN NO EVENT SHALL ESOTERIC SOFTWARE LLC BE LIABLE FOR ANY
+ * DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
+ * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES,
+ * BUSINESS INTERRUPTION, OR LOSS OF USE, DATA, OR PROFITS) HOWEVER CAUSED AND
+ * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+ * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
+ * THE SPINE RUNTIMES, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+ *****************************************************************************/
+/** The interface for items updated by {@link Skeleton#updateWorldTransform()}. */
+export interface Updatable {
+    update(): void;
+    /** Returns false when this item has not been updated because a skin is required and the {@link Skeleton#skin active skin}
+     * does not contain this item.
+     * @see Skin#getBones()
+     * @see Skin#getConstraints() */
+    isActive(): boolean;
+}

package/dist/Updatable.js

@@ -0,0 +1,30 @@
+/******************************************************************************
+ * Spine Runtimes License Agreement
+ * Last updated September 24, 2021. Replaces all prior versions.
+ *
+ * Copyright (c) 2013-2021, Esoteric Software LLC
+ *
+ * Integration of the Spine Runtimes into software or otherwise creating
+ * derivative works of the Spine Runtimes is permitted under the terms and
+ * conditions of Section 2 of the Spine Editor License Agreement:
+ * http://esotericsoftware.com/spine-editor-license
+ *
+ * Otherwise, it is permitted to integrate the Spine Runtimes into software
+ * or otherwise create derivative works of the Spine Runtimes (collectively,
+ * "Products"), provided that each user of the Products must obtain their own
+ * Spine Editor license and redistribution of the Products in any form must
+ * include this license and copyright notice.
+ *
+ * THE SPINE RUNTIMES ARE PROVIDED BY ESOTERIC SOFTWARE LLC "AS IS" AND ANY
+ * EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
+ * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
+ * DISCLAIMED. IN NO EVENT SHALL ESOTERIC SOFTWARE LLC BE LIABLE FOR ANY
+ * DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
+ * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES,
+ * BUSINESS INTERRUPTION, OR LOSS OF USE, DATA, OR PROFITS) HOWEVER CAUSED AND
+ * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+ * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
+ * THE SPINE RUNTIMES, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+ *****************************************************************************/
+export {};
+//# sourceMappingURL=data:application/json;base64,eyJ2ZXJzaW9uIjozLCJmaWxlIjoiVXBkYXRhYmxlLmpzIiwic291cmNlUm9vdCI6IiIsInNvdXJjZXMiOlsiLi4vc3JjL1VwZGF0YWJsZS50cyJdLCJuYW1lcyI6W10sIm1hcHBpbmdzIjoiQUFBQTs7Ozs7Ozs7Ozs7Ozs7Ozs7Ozs7Ozs7Ozs7OytFQTJCK0UifQ==

package/dist/Utils.d.ts

@@ -0,0 +1,168 @@
+/******************************************************************************
+ * Spine Runtimes License Agreement
+ * Last updated September 24, 2021. Replaces all prior versions.
+ *
+ * Copyright (c) 2013-2021, Esoteric Software LLC
+ *
+ * Integration of the Spine Runtimes into software or otherwise creating
+ * derivative works of the Spine Runtimes is permitted under the terms and
+ * conditions of Section 2 of the Spine Editor License Agreement:
+ * http://esotericsoftware.com/spine-editor-license
+ *
+ * Otherwise, it is permitted to integrate the Spine Runtimes into software
+ * or otherwise create derivative works of the Spine Runtimes (collectively,
+ * "Products"), provided that each user of the Products must obtain their own
+ * Spine Editor license and redistribution of the Products in any form must
+ * include this license and copyright notice.
+ *
+ * THE SPINE RUNTIMES ARE PROVIDED BY ESOTERIC SOFTWARE LLC "AS IS" AND ANY
+ * EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
+ * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
+ * DISCLAIMED. IN NO EVENT SHALL ESOTERIC SOFTWARE LLC BE LIABLE FOR ANY
+ * DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
+ * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES,
+ * BUSINESS INTERRUPTION, OR LOSS OF USE, DATA, OR PROFITS) HOWEVER CAUSED AND
+ * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+ * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
+ * THE SPINE RUNTIMES, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+ *****************************************************************************/
+import { Skeleton } from "./Skeleton";
+import { MixBlend } from "./Animation";
+export interface StringMap<T> {
+    [key: string]: T;
+}
+export declare class IntSet {
+    array: (number | undefined)[];
+    add(value: number): boolean;
+    contains(value: number): boolean;
+    remove(value: number): void;
+    clear(): void;
+}
+export declare class StringSet {
+    entries: StringMap<boolean>;
+    size: number;
+    add(value: string): boolean;
+    addAll(values: string[]): boolean;
+    contains(value: string): boolean;
+    clear(): void;
+}
+export interface NumberArrayLike {
+    readonly length: number;
+    [n: number]: number;
+}
+export interface Disposable {
+    dispose(): void;
+}
+export interface Restorable {
+    restore(): void;
+}
+export declare class Color {
+    r: number;
+    g: number;
+    b: number;
+    a: number;
+    static WHITE: Color;
+    static RED: Color;
+    static GREEN: Color;
+    static BLUE: Color;
+    static MAGENTA: Color;
+    constructor(r?: number, g?: number, b?: number, a?: number);
+    set(r: number, g: number, b: number, a: number): this;
+    setFromColor(c: Color): this;
+    setFromString(hex: string): this;
+    add(r: number, g: number, b: number, a: number): this;
+    clamp(): this;
+    static rgba8888ToColor(color: Color, value: number): void;
+    static rgb888ToColor(color: Color, value: number): void;
+    static fromString(hex: string): Color;
+}
+export declare class MathUtils {
+    static PI: number;
+    static PI2: number;
+    static radiansToDegrees: number;
+    static radDeg: number;
+    static degreesToRadians: number;
+    static degRad: number;
+    static clamp(value: number, min: number, max: number): number;
+    static cosDeg(degrees: number): number;
+    static sinDeg(degrees: number): number;
+    static signum(value: number): number;
+    static toInt(x: number): number;
+    static cbrt(x: number): number;
+    static randomTriangular(min: number, max: number): number;
+    static randomTriangularWith(min: number, max: number, mode: number): number;
+    static isPowerOfTwo(value: number): boolean | 0;
+}
+export declare abstract class Interpolation {
+    protected abstract applyInternal(a: number): number;
+    apply(start: number, end: number, a: number): number;
+}
+export declare class Pow extends Interpolation {
+    protected power: number;
+    constructor(power: number);
+    applyInternal(a: number): number;
+}
+export declare class PowOut extends Pow {
+    constructor(power: number);
+    applyInternal(a: number): number;
+}
+export declare class Utils {
+    static SUPPORTS_TYPED_ARRAYS: boolean;
+    static arrayCopy<T>(source: ArrayLike<T>, sourceStart: number, dest: ArrayLike<T>, destStart: number, numElements: number): void;
+    static arrayFill<T>(array: ArrayLike<T>, fromIndex: number, toIndex: number, value: T): void;
+    static setArraySize<T>(array: Array<T>, size: number, value?: any): Array<T>;
+    static ensureArrayCapacity<T>(array: Array<T>, size: number, value?: any): Array<T>;
+    static newArray<T>(size: number, defaultValue: T): Array<T>;
+    static newFloatArray(size: number): NumberArrayLike;
+    static newShortArray(size: number): NumberArrayLike;
+    static toFloatArray(array: Array<number>): number[] | Float32Array;
+    static toSinglePrecision(value: number): number;
+    static webkit602BugfixHelper(alpha: number, blend: MixBlend): void;
+    static contains<T>(array: Array<T>, element: T, identity?: boolean): boolean;
+    static enumValue(type: any, name: string): any;
+}
+export declare class DebugUtils {
+    static logBones(skeleton: Skeleton): void;
+}
+export declare class Pool<T> {
+    private items;
+    private instantiator;
+    constructor(instantiator: () => T);
+    obtain(): T;
+    free(item: T): void;
+    freeAll(items: ArrayLike<T>): void;
+    clear(): void;
+}
+export declare class Vector2 {
+    x: number;
+    y: number;
+    constructor(x?: number, y?: number);
+    set(x: number, y: number): Vector2;
+    length(): number;
+    normalize(): this;
+}
+export declare class TimeKeeper {
+    maxDelta: number;
+    framesPerSecond: number;
+    delta: number;
+    totalTime: number;
+    private lastTime;
+    private frameCount;
+    private frameTime;
+    update(): void;
+}
+export interface ArrayLike<T> {
+    length: number;
+    [n: number]: T;
+}
+export declare class WindowedMean {
+    values: Array<number>;
+    addedValues: number;
+    lastValue: number;
+    mean: number;
+    dirty: boolean;
+    constructor(windowSize?: number);
+    hasEnoughData(): boolean;
+    addValue(value: number): void;
+    getMean(): number;
+}