plotboilerplate 1.27.1 → 1.28.0

package/src/_esm/utils/algorithms/PolygonTesselationOutlines.js

@@ -0,0 +1,267 @@
+"use strict";
+/**
+ * Find the outer hull outlines of a (not necessarily full connected) polygon tesellation.
+ *
+ * The method `findAllOutlinesGraph` will return a simple graph containing all vertices and edges
+ * that belong to the outer hull.
+ *
+ * The method `findAllOutlinesPolygons` will detect connected paths inside the graph and return
+ * an array of Polygons.
+ *
+ *
+ * @require detectPaths
+ *
+ * @author  Ikaros Kappler
+ * @date    2026-01-20
+ * @version 1.0.0
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.PolygonTesselationOutlines = exports.polygonTesselationToGraph = void 0;
+const Line_1 = require("../../Line");
+const Polygon_1 = require("../../Polygon");
+const arrayFill_1 = require("./arrayFill");
+const detectPaths_1 = require("./detectPaths");
+/**
+ * Convert any non-intersecting tesselation to a graph.
+ * Adjadent tiles (polygons) will result in duplicate edges.
+ *
+ * @param {Polygon[]} polygons - The polygon tesselation to use.
+ * @return {TesselationGraph} A tesselation graph.
+ */
+const polygonTesselationToGraph = (polygons) => {
+    const vertices = [];
+    const edges = [];
+    // const vertexPolygonMapping: Array<number>[] = []; // Map polygon+vertex to graph vertices
+    for (var i = 0; i < polygons.length; i++) {
+        const polygon = polygons[i];
+        const polygonMapping = [];
+        // vertexPolygonMapping.push(polygonMapping);
+        // Add vertices
+        for (var j = 0; j < polygon.vertices.length; j++) {
+            const graphVertIndex = vertices.length;
+            vertices.push(polygon.vertices[j]);
+            polygonMapping.push(graphVertIndex);
+        }
+        // Now add edges
+        for (var j = 0; j < polygon.vertices.length; j++) {
+            const polyEdgeIndexA = j;
+            const polyEdgeIndexB = (j + 1) % polygon.vertices.length;
+            const grapgVertIndexA = polygonMapping[polyEdgeIndexA];
+            const grapgVertIndexB = polygonMapping[polyEdgeIndexB];
+            edges.push({ i: grapgVertIndexA, j: grapgVertIndexB });
+        }
+    }
+    return { vertices, edges };
+};
+exports.polygonTesselationToGraph = polygonTesselationToGraph;
+/**
+ * A class to calculate the tesselation's outer hull.
+ */
+class PolygonTesselationOutlines {
+    /**
+     * @constructor
+     * @param {Polygon[]} polygons - The polygon tesselation to use.
+     * @param {PolygonTesselationOutlinesOptions} options - (optional)
+     */
+    constructor(polygons, options) {
+        var _a, _b;
+        this.polygons = polygons;
+        // this.tesselationGraph = tesselationToGraph(polygons);
+        this.tolerance = (_a = options === null || options === void 0 ? void 0 : options.tolerance) !== null && _a !== void 0 ? _a : PolygonTesselationOutlines.DEFAULT_TOLERANCE;
+        this.removeUnusedVertices = (_b = options === null || options === void 0 ? void 0 : options.removeUnusedVertices) !== null && _b !== void 0 ? _b : true;
+    }
+    /**
+     * Clears duplicate edges.
+     *
+     * Note: this works only for duplicates. Triplets will not be removed.
+     *
+     * @name __eliminateDuplicateEdges
+     * @private
+     * @memberof TesselationGraph
+     * @instance
+     * @param {TesselationGraph} tesselationGraph - The tesselation graph to remove duplicate edges from.
+     * @return {TesselationGraph} A new tesselation graph with cleaned up edges.
+     */
+    __eliminateDuplicateEdges(tesselationGraph) {
+        const newEdges = [];
+        for (var e = 0; e < tesselationGraph.edges.length; e++) {
+            const curEdge = tesselationGraph.edges[e];
+            if (!curEdge) {
+                continue;
+            }
+            const curA = tesselationGraph.vertices[curEdge.i];
+            const curB = tesselationGraph.vertices[curEdge.j];
+            for (var f = 0; f < tesselationGraph.edges.length; f++) {
+                if (e === f) {
+                    continue;
+                }
+                const otherEdge = tesselationGraph.edges[f];
+                if (!otherEdge) {
+                    continue;
+                }
+                const otherA = tesselationGraph.vertices[otherEdge.i];
+                const otherB = tesselationGraph.vertices[otherEdge.j];
+                if (this.__isEqualEdge(curA, curB, otherA, otherB)) {
+                    // Both edges are equal -> remove both
+                    tesselationGraph.edges[e] = null;
+                    tesselationGraph.edges[f] = null;
+                }
+            }
+        }
+        // return tesselationGraph; // TODO: create clean clone with new mapping
+        // Clear null-records.
+        return {
+            vertices: tesselationGraph.vertices,
+            edges: tesselationGraph.edges.filter((edge) => edge != null)
+        }; // TODO: create clean clone with new mapping
+    }
+    /**
+     * Locate some edge that adjacent to the given vertex index
+     *
+     * @name __locateEdgeWithVertIndex
+     * @private
+     * @memberof TesselationGraph
+     * @instance
+     * @param {number} vertIndex - The vertex index to find an edge for.
+     * @param {TesselationGraph} tesselationGraph - The tesselation graph to remove unused vertices from.
+     * @return {number} The edge index that's adjacent to the given vertex index.
+     * @return -1 if no such edge is found.
+     */
+    __locateEdgeWithVertIndex(vertIndex, tesselationGraph) {
+        return tesselationGraph.edges.findIndex((edge) => edge.i == vertIndex || edge.j == vertIndex);
+    }
+    /**
+     * Removes all unused vertices from the graph and re-matps the edges.
+     *
+     * @name __removeUnusedVertices
+     * @private
+     * @memberof TesselationGraph
+     * @instance
+     * @param {TesselationGraph} tesselationGraph - The tesselation graph to remove unused vertices from.
+     * @return {TesselationGraph} A new tesselation graph.
+     */
+    __removeUnusedVertices(tesselationGraph) {
+        // First remove un-used vertices and re-map indices.
+        const newVertices = [];
+        const indexMapping = (0, arrayFill_1.arrayFill)(tesselationGraph.vertices.length, -1);
+        for (var j = 0; j < tesselationGraph.vertices.length; j++) {
+            const edgeIndex = this.__locateEdgeWithVertIndex(j, tesselationGraph);
+            if (edgeIndex === -1) {
+                // No adjacent edge found -> vertex is not in use
+                // Ignore; index mapping remains to -1
+            }
+            else {
+                // Keep vertex
+                const newIndex = newVertices.length;
+                newVertices.push(tesselationGraph.vertices[j]);
+                indexMapping[j] = newIndex;
+            }
+        }
+        // Now re-map the egdes
+        const newEdges = [];
+        for (var j = 0; j < tesselationGraph.edges.length; j++) {
+            const edge = tesselationGraph.edges[j];
+            newEdges.push({ i: indexMapping[edge.i], j: indexMapping[edge.j] });
+        }
+        return { vertices: newVertices, edges: newEdges };
+    }
+    /**
+     * Creates a tesselation graph and removes all inner edges.
+     *
+     * @name findAllOutlinesGraph
+     * @private
+     * @memberof PolygonTesselationOutlines
+     * @instance
+     * @return {TesselationGraph} A tesselation graph containing the outer hull edges only.
+     */
+    findAllOutlinesGraph() {
+        // First build tesselation graph from polygons, containing all edges and vertices.
+        const tesselationGraph = (0, exports.polygonTesselationToGraph)(this.polygons);
+        // Now eliminate all duplicate edges. By construction only inner edges are duplicates.
+        const outerHull = this.__eliminateDuplicateEdges(tesselationGraph);
+        // Only of requested remove unused vertices.
+        if (this.removeUnusedVertices) {
+            const cleanOuterHull = this.__removeUnusedVertices(outerHull);
+            return cleanOuterHull;
+        }
+        else {
+            return outerHull;
+        }
+    }
+    /**
+     * Convert any generic path to a polygon. Each path segment (start point and end point)
+     * are interpreted as a linear segment here.
+     *
+     * @name __convertGenericPathToPolygon
+     * @private
+     * @memberof PolygonTesselationOutlines
+     * @instance
+     * @param {GenericPath} path - The path to convert.
+     */
+    __convertGenericPathToPolygon(path) {
+        const vertices = [];
+        const n = path.getSegmentCount();
+        let isOpen = false;
+        for (var i = 0; i < n; i++) {
+            const segment = path.getSegmentAt(i);
+            vertices.push(segment.getStartPoint());
+            if (i > 0 && i + 1 >= n && !this.__isEqualPoint(segment.getEndPoint(), vertices[0])) {
+                isOpen = true;
+            }
+        }
+        return new Polygon_1.Polygon(vertices, isOpen);
+    }
+    /**
+     * Creates a tesselation graph and removes all inner edges.
+     *
+     * @name findAllOutlinesPolygons
+     * @private
+     * @memberof PolygonTesselationOutlines
+     * @instance
+     * @param {TesselationGraph} tesselationGraph - Find all outlines on the tesselation graph.
+     */
+    findAllOutlinesPolygons(tesselationGraph) {
+        // Convert to real line segments:
+        const lineSegments = tesselationGraph.edges.map((edge) => new Line_1.Line(tesselationGraph.vertices[edge.i], tesselationGraph.vertices[edge.j]));
+        // Now run the path detection.
+        const paths = (0, detectPaths_1.detectPaths)(lineSegments, this.tolerance);
+        // And now convert the generic paths back to polygons
+        // (we have put in line segments, so line segments must have returned)
+        return paths.map((path) => this.__convertGenericPathToPolygon(path));
+    }
+    /**
+     * Checks if two vertices are equal – regarding to the current tolerance setting.
+     *
+     * @name __isEqualPoint
+     * @private
+     * @memberof PolygonTesselationOutlines
+     * @instance
+     * @param {boolean} vertA - The first point.
+     * @param {boolean} vertB - The second point.
+     * @return True if the vertices are equal.
+     */
+    __isEqualPoint(vertA, vertB) {
+        return vertA.distance(vertB) < this.tolerance;
+    }
+    /**
+     * Checks if two edges (identified as two pairs of vertices) are equal – regarding to the
+     * current tolerance setting.
+     *
+     * @name __isEqualEdge
+     * @private
+     * @memberof PolygonTesselationOutlines
+     * @instance
+     * @param {boolean} edgeAvertA - The first edge's point A.
+     * @param {boolean} edgeAvertB - The first edge's point B.
+     * @param {boolean} edgeBvertA - The second edge's point A.
+     * @param {boolean} edgeBvertB - The second edge's point B.
+     * @return True if the edges are equal.
+     */
+    __isEqualEdge(edgeAvertA, edgeAvertB, edgeBvertA, edgeBvertB) {
+        return ((this.__isEqualPoint(edgeAvertA, edgeBvertA) && this.__isEqualPoint(edgeAvertB, edgeBvertB)) ||
+            (this.__isEqualPoint(edgeAvertA, edgeBvertB) && this.__isEqualPoint(edgeAvertB, edgeBvertA)));
+    }
+}
+exports.PolygonTesselationOutlines = PolygonTesselationOutlines;
+PolygonTesselationOutlines.DEFAULT_TOLERANCE = 0.01;
+//# sourceMappingURL=PolygonTesselationOutlines.js.map

package/src/_esm/utils/algorithms/PolygonTesselationOutlines.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"PolygonTesselationOutlines.js","sourceRoot":"","sources":["../../../ts/utils/algorithms/PolygonTesselationOutlines.ts"],"names":[],"mappings":";AAAA;;;;;;;;;;;;;;;GAeG;;;AAEH,qCAAkC;AAClC,2CAAwC;AAKxC,2CAAwC;AACxC,+CAA4C;AAY5C;;;;;;GAMG;AACI,MAAM,yBAAyB,GAAG,CAAC,QAAmB,EAAoB,EAAE;IACjF,MAAM,QAAQ,GAAkB,EAAE,CAAC;IACnC,MAAM,KAAK,GAAqB,EAAE,CAAC;IACnC,4FAA4F;IAC5F,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACzC,MAAM,OAAO,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;QAC5B,MAAM,cAAc,GAAkB,EAAE,CAAC;QACzC,6CAA6C;QAC7C,eAAe;QACf,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACjD,MAAM,cAAc,GAAG,QAAQ,CAAC,MAAM,CAAC;YACvC,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;YACnC,cAAc,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC;QACtC,CAAC;QACD,gBAAgB;QAChB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACjD,MAAM,cAAc,GAAG,CAAC,CAAC;YACzB,MAAM,cAAc,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,OAAO,CAAC,QAAQ,CAAC,MAAM,CAAC;YACzD,MAAM,eAAe,GAAG,cAAc,CAAC,cAAc,CAAC,CAAC;YACvD,MAAM,eAAe,GAAG,cAAc,CAAC,cAAc,CAAC,CAAC;YACvD,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,eAAe,EAAE,CAAC,EAAE,eAAe,EAAE,CAAC,CAAC;QACzD,CAAC;IACH,CAAC;IACD,OAAO,EAAE,QAAQ,EAAE,KAAK,EAAE,CAAC;AAC7B,CAAC,CAAC;AAxBW,QAAA,yBAAyB,GAAzB,yBAAyB,CAwBpC;AAEF;;GAEG;AACH;IAQE;;;;OAIG;IACH,YAAY,QAAmB,EAAE,OAA2C;;QAC1E,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAC;QACzB,wDAAwD;QACxD,IAAI,CAAC,SAAS,SAAG,OAAO,aAAP,OAAO,uBAAP,OAAO,CAAE,SAAS,mCAAI,0BAA0B,CAAC,iBAAiB,CAAC;QACpF,IAAI,CAAC,oBAAoB,SAAG,OAAO,aAAP,OAAO,uBAAP,OAAO,CAAE,oBAAoB,mCAAI,IAAI,CAAC;IACpE,CAAC;IAED;;;;;;;;;;;OAWG;IACK,yBAAyB,CAAC,gBAAkC;QAClE,MAAM,QAAQ,GAAqB,EAAE,CAAC;QACtC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,gBAAgB,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACvD,MAAM,OAAO,GAAc,gBAAgB,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;YACrD,IAAI,CAAC,OAAO,EAAE,CAAC;gBACb,SAAS;YACX,CAAC;YACD,MAAM,IAAI,GAAW,gBAAgB,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;YAC1D,MAAM,IAAI,GAAW,gBAAgB,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;YAC1D,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,gBAAgB,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBACvD,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;oBACZ,SAAS;gBACX,CAAC;gBACD,MAAM,SAAS,GAAc,gBAAgB,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;gBACvD,IAAI,CAAC,SAAS,EAAE,CAAC;oBACf,SAAS;gBACX,CAAC;gBACD,MAAM,MAAM,GAAW,gBAAgB,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;gBAC9D,MAAM,MAAM,GAAW,gBAAgB,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;gBAC9D,IAAI,IAAI,CAAC,aAAa,CAAC,IAAI,EAAE,IAAI,EAAE,MAAM,EAAE,MAAM,CAAC,EAAE,CAAC;oBACnD,sCAAsC;oBACtC,gBAAgB,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC;oBACjC,gBAAgB,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC;gBACnC,CAAC;YACH,CAAC;QACH,CAAC;QACD,wEAAwE;QACxE,sBAAsB;QACtB,OAAO;YACL,QAAQ,EAAE,gBAAgB,CAAC,QAAQ;YACnC,KAAK,EAAE,gBAAgB,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,IAAe,EAAE,EAAE,CAAC,IAAI,IAAI,IAAI,CAAC;SACxE,CAAC,CAAC,4CAA4C;IACjD,CAAC;IAED;;;;;;;;;;;OAWG;IACK,yBAAyB,CAAC,SAAiB,EAAE,gBAAkC;QACrF,OAAO,gBAAgB,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC,IAAe,EAAE,EAAE,CAAC,IAAI,CAAC,CAAC,IAAI,SAAS,IAAI,IAAI,CAAC,CAAC,IAAI,SAAS,CAAC,CAAC;IAC3G,CAAC;IAED;;;;;;;;;OASG;IACK,sBAAsB,CAAC,gBAAkC;QAC/D,oDAAoD;QACpD,MAAM,WAAW,GAAkB,EAAE,CAAC;QACtC,MAAM,YAAY,GAAkB,IAAA,qBAAS,EAAC,gBAAgB,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,CAAC;QACpF,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,gBAAgB,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC1D,MAAM,SAAS,GAAW,IAAI,CAAC,yBAAyB,CAAC,CAAC,EAAE,gBAAgB,CAAC,CAAC;YAC9E,IAAI,SAAS,KAAK,CAAC,CAAC,EAAE,CAAC;gBACrB,iDAAiD;gBACjD,sCAAsC;YACxC,CAAC;iBAAM,CAAC;gBACN,cAAc;gBACd,MAAM,QAAQ,GAAW,WAAW,CAAC,MAAM,CAAC;gBAC5C,WAAW,CAAC,IAAI,CAAC,gBAAgB,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;gBAC/C,YAAY,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC;YAC7B,CAAC;QACH,CAAC;QAED,uBAAuB;QACvB,MAAM,QAAQ,GAAqB,EAAE,CAAC;QACtC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,gBAAgB,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACvD,MAAM,IAAI,GAAG,gBAAgB,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;YACvC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QACtE,CAAC;QACD,OAAO,EAAE,QAAQ,EAAE,WAAW,EAAE,KAAK,EAAE,QAAQ,EAAE,CAAC;IACpD,CAAC;IAED;;;;;;;;OAQG;IACH,oBAAoB;QAClB,kFAAkF;QAClF,MAAM,gBAAgB,GAAqB,IAAA,QAAA,yBAAyB,EAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QAEpF,sFAAsF;QACtF,MAAM,SAAS,GAAG,IAAI,CAAC,yBAAyB,CAAC,gBAAgB,CAAC,CAAC;QACnE,4CAA4C;QAC5C,IAAI,IAAI,CAAC,oBAAoB,EAAE,CAAC;YAC9B,MAAM,cAAc,GAAG,IAAI,CAAC,sBAAsB,CAAC,SAAS,CAAC,CAAC;YAC9D,OAAO,cAAc,CAAC;QACxB,CAAC;aAAM,CAAC;YACN,OAAO,SAAS,CAAC;QACnB,CAAC;IACH,CAAC;IAED;;;;;;;;;OASG;IACK,6BAA6B,CAAC,IAAiB;QACrD,MAAM,QAAQ,GAAkB,EAAE,CAAC;QACnC,MAAM,CAAC,GAAW,IAAI,CAAC,eAAe,EAAE,CAAC;QACzC,IAAI,MAAM,GAAY,KAAK,CAAC;QAC5B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3B,MAAM,OAAO,GAAgB,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;YAClD,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC,aAAa,EAAE,CAAC,CAAC;YACvC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,cAAc,CAAC,OAAO,CAAC,WAAW,EAAE,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;gBACpF,MAAM,GAAG,IAAI,CAAC;YAChB,CAAC;QACH,CAAC;QACD,OAAO,IAAI,iBAAO,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAC;IACvC,CAAC;IAED;;;;;;;;OAQG;IACH,uBAAuB,CAAC,gBAAkC;QACxD,iCAAiC;QACjC,MAAM,YAAY,GAAgB,gBAAgB,CAAC,KAAK,CAAC,GAAG,CAC1D,CAAC,IAAe,EAAE,EAAE,CAAC,IAAI,WAAI,CAAC,gBAAgB,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,gBAAgB,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CACpG,CAAC;QACF,8BAA8B;QAC9B,MAAM,KAAK,GAAuB,IAAA,yBAAW,EAAC,YAAY,EAAE,IAAI,CAAC,SAAS,CAAC,CAAC;QAE5E,qDAAqD;QACrD,sEAAsE;QACtE,OAAO,KAAK,CAAC,GAAG,CAAC,CAAC,IAAiB,EAAE,EAAE,CAAC,IAAI,CAAC,6BAA6B,CAAC,IAAI,CAAC,CAAC,CAAC;IACpF,CAAC;IAED;;;;;;;;;;OAUG;IACK,cAAc,CAAC,KAAa,EAAE,KAAa;QACjD,OAAO,KAAK,CAAC,QAAQ,CAAC,KAAK,CAAC,GAAG,IAAI,CAAC,SAAS,CAAC;IAChD,CAAC;IAED;;;;;;;;;;;;;OAaG;IACK,aAAa,CAAC,UAAkB,EAAE,UAAkB,EAAE,UAAkB,EAAE,UAAkB;QAClG,OAAO,CACL,CAAC,IAAI,CAAC,cAAc,CAAC,UAAU,EAAE,UAAU,CAAC,IAAI,IAAI,CAAC,cAAc,CAAC,UAAU,EAAE,UAAU,CAAC,CAAC;YAC5F,CAAC,IAAI,CAAC,cAAc,CAAC,UAAU,EAAE,UAAU,CAAC,IAAI,IAAI,CAAC,cAAc,CAAC,UAAU,EAAE,UAAU,CAAC,CAAC,CAC7F,CAAC;IACJ,CAAC;CACF;;AA9NwB,4CAAiB,GAAG,IAAI,CAAC"}

package/src/_esm/utils/algorithms/arrayFill.d.ts

@@ -0,0 +1,8 @@
+/**
+ * An equivalent of lodash.array_fill(...).
+ *
+ * @author Ikaros Kappler
+ * @date 2020-10-23
+ * @version 1.0.0
+ **/
+export declare const arrayFill: <T extends any>(count: number, initialValue: T) => Array<T>;

package/src/_esm/utils/algorithms/arrayFill.js

@@ -0,0 +1,18 @@
+"use strict";
+/**
+ * An equivalent of lodash.array_fill(...).
+ *
+ * @author Ikaros Kappler
+ * @date 2020-10-23
+ * @version 1.0.0
+ **/
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.arrayFill = void 0;
+const arrayFill = (count, initialValue) => {
+    const arr = Array(count);
+    for (var i = 0; i < count; i++)
+        arr[i] = initialValue;
+    return arr;
+};
+exports.arrayFill = arrayFill;
+//# sourceMappingURL=arrayFill.js.map

package/src/_esm/utils/algorithms/arrayFill.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"arrayFill.js","sourceRoot":"","sources":["../../../ts/utils/algorithms/arrayFill.ts"],"names":[],"mappings":";AAAA;;;;;;IAMI;;;AAEG,MAAM,SAAS,GAAG,CAAiB,KAAY,EAAE,YAAc,EAAc,EAAE;IAClF,MAAM,GAAG,GAAc,KAAK,CAAK,KAAK,CAAE,CAAC;IACzC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE;QACjC,GAAG,CAAC,CAAC,CAAC,GAAG,YAAY,CAAC;IACnB,OAAO,GAAG,CAAC;AACf,CAAC,CAAC;AALW,QAAA,SAAS,GAAT,SAAS,CAKpB"}

package/src/_esm/utils/algorithms/arrayResize.d.ts

@@ -0,0 +1,8 @@
+/**
+ * Resize a given array to a desired number of elements by adding or removing some.
+ *
+ * @author  Ikaros Kappler
+ * @date    2024-02-07
+ * @version 1.0.0
+ */
+export declare const arrayResize: <T>(arr: Array<T>, desiredSize: number, factoryFn: () => T) => void;

package/src/_esm/utils/algorithms/arrayResize.js

@@ -0,0 +1,24 @@
+"use strict";
+/**
+ * Resize a given array to a desired number of elements by adding or removing some.
+ *
+ * @author  Ikaros Kappler
+ * @date    2024-02-07
+ * @version 1.0.0
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.arrayResize = void 0;
+const arrayResize = (arr, desiredSize, factoryFn) => {
+    if (arr.length === desiredSize) {
+        // No change required
+        return;
+    }
+    while (arr.length < desiredSize) {
+        arr.push(factoryFn());
+    }
+    if (arr.length > desiredSize) {
+        arr.splice(desiredSize);
+    }
+};
+exports.arrayResize = arrayResize;
+//# sourceMappingURL=arrayResize.js.map

package/src/_esm/utils/algorithms/arrayResize.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"arrayResize.js","sourceRoot":"","sources":["../../../ts/utils/algorithms/arrayResize.ts"],"names":[],"mappings":";AAAA;;;;;;GAMG;;;AAEI,MAAM,WAAW,GAAG,CAAI,GAAa,EAAE,WAAmB,EAAE,SAAkB,EAAE,EAAE;IACvF,IAAI,GAAG,CAAC,MAAM,KAAK,WAAW,EAAE,CAAC;QAC/B,qBAAqB;QACrB,OAAO;IACT,CAAC;IAED,OAAO,GAAG,CAAC,MAAM,GAAG,WAAW,EAAE,CAAC;QAChC,GAAG,CAAC,IAAI,CAAC,SAAS,EAAE,CAAC,CAAC;IACxB,CAAC;IAED,IAAI,GAAG,CAAC,MAAM,GAAG,WAAW,EAAE,CAAC;QAC7B,GAAG,CAAC,MAAM,CAAC,WAAW,CAAC,CAAC;IAC1B,CAAC;AACH,CAAC,CAAC;AAbW,QAAA,WAAW,GAAX,WAAW,CAatB"}

package/src/_esm/utils/algorithms/arrayShuffle.d.ts

@@ -0,0 +1,8 @@
+/**
+ * Randomize a given array in-place.
+ *
+ * @author Ikaros Kappler
+ * @date 2022-10-09
+ * @version 1.0.0
+ **/
+export declare const arrayShuffle: (arr: Array<any>) => void;

package/src/_esm/utils/algorithms/arrayShuffle.js

@@ -0,0 +1,15 @@
+"use strict";
+/**
+ * Randomize a given array in-place.
+ *
+ * @author Ikaros Kappler
+ * @date 2022-10-09
+ * @version 1.0.0
+ **/
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.arrayShuffle = void 0;
+const arrayShuffle = (arr) => {
+    arr.sort(() => Math.random() - 0.5);
+};
+exports.arrayShuffle = arrayShuffle;
+//# sourceMappingURL=arrayShuffle.js.map

package/src/_esm/utils/algorithms/arrayShuffle.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"arrayShuffle.js","sourceRoot":"","sources":["../../../ts/utils/algorithms/arrayShuffle.ts"],"names":[],"mappings":";AAAA;;;;;;IAMI;;;AAEG,MAAM,YAAY,GAAG,CAAC,GAAe,EAAQ,EAAE;IACpD,GAAG,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,GAAG,CAAC,CAAC;AACtC,CAAC,CAAC;AAFW,QAAA,YAAY,GAAZ,YAAY,CAEvB"}

package/src/_esm/utils/algorithms/clearDuplicateVertices.d.ts

@@ -0,0 +1,22 @@
+/**
+ * Remove duplicate vertices (2d) from an array.
+ *
+ * This method war taken and refactored from an older demo.
+ *
+ * @author   Ikaros Kappler
+ * @date     2021-07-13
+ * @modified 2023-10-28 Refactored and ported to Typescript.
+ * @modified 2024-12-17 Simplified this method to work with generic sub types of XYCoords as well.
+ * @version  1.0.1
+ */
+import { XYCoords } from "../../interfaces";
+/**
+ * Filter the array and clear all duplicates.
+ *
+ * The original array is left unchanged. The vertices in the array are not cloned.
+ *
+ * @param {XYCoords[]} vertices
+ * @param {number=EPS} epsilon
+ * @return {Vertex[]}
+ */
+export declare const clearDuplicateVertices: <T extends XYCoords>(vertices: T[], epsilon?: number) => T[];

package/src/_esm/utils/algorithms/clearDuplicateVertices.js

@@ -0,0 +1,51 @@
+"use strict";
+/**
+ * Remove duplicate vertices (2d) from an array.
+ *
+ * This method war taken and refactored from an older demo.
+ *
+ * @author   Ikaros Kappler
+ * @date     2021-07-13
+ * @modified 2023-10-28 Refactored and ported to Typescript.
+ * @modified 2024-12-17 Simplified this method to work with generic sub types of XYCoords as well.
+ * @version  1.0.1
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.clearDuplicateVertices = void 0;
+const geomutils_1 = require("../../geomutils");
+const EPS = 0.000001;
+/**
+ * Filter the array and clear all duplicates.
+ *
+ * The original array is left unchanged. The vertices in the array are not cloned.
+ *
+ * @param {XYCoords[]} vertices
+ * @param {number=EPS} epsilon
+ * @return {Vertex[]}
+ */
+const clearDuplicateVertices = (vertices, epsilon) => {
+    if (typeof epsilon === "undefined") {
+        epsilon = EPS;
+    }
+    const result = [];
+    for (var i = 0; i < vertices.length; i++) {
+        if (!containsElementFrom(vertices, vertices[i], i + 1, epsilon)) {
+            result.push(vertices[i]);
+        }
+    }
+    return result;
+};
+exports.clearDuplicateVertices = clearDuplicateVertices;
+const isCloseTo = (vertA, vertB, eps) => {
+    // return vertA.distance(vertB) < eps;
+    return geomutils_1.geomutils.dist4(vertA.x, vertA.y, vertB.x, vertB.y) < eps;
+};
+const containsElementFrom = (vertices, vertex, fromIndex, epsilon) => {
+    for (var i = fromIndex; i < vertices.length; i++) {
+        if (isCloseTo(vertices[i], vertex, epsilon)) {
+            return true;
+        }
+    }
+    return false;
+};
+//# sourceMappingURL=clearDuplicateVertices.js.map

package/src/_esm/utils/algorithms/clearDuplicateVertices.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"clearDuplicateVertices.js","sourceRoot":"","sources":["../../../ts/utils/algorithms/clearDuplicateVertices.ts"],"names":[],"mappings":";AAAA;;;;;;;;;;GAUG;;;AAEH,+CAA4C;AAG5C,MAAM,GAAG,GAAW,QAAQ,CAAC;AAE7B;;;;;;;;GAQG;AACI,MAAM,sBAAsB,GAAG,CAAqB,QAAa,EAAE,OAAgB,EAAE,EAAE;IAC5F,IAAI,OAAO,OAAO,KAAK,WAAW,EAAE,CAAC;QACnC,OAAO,GAAG,GAAG,CAAC;IAChB,CAAC;IACD,MAAM,MAAM,GAAa,EAAE,CAAC;IAC5B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACzC,IAAI,CAAC,mBAAmB,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,OAAO,CAAC,EAAE,CAAC;YAChE,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;QAC3B,CAAC;IACH,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC,CAAC;AAXW,QAAA,sBAAsB,GAAtB,sBAAsB,CAWjC;AAEF,MAAM,SAAS,GAAG,CAAqB,KAAQ,EAAE,KAAQ,EAAE,GAAW,EAAW,EAAE;IACjF,sCAAsC;IACtC,OAAO,qBAAS,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC;AACnE,CAAC,CAAC;AAEF,MAAM,mBAAmB,GAAG,CAAqB,QAAkB,EAAE,MAAS,EAAE,SAAiB,EAAE,OAAe,EAAW,EAAE;IAC7H,KAAK,IAAI,CAAC,GAAG,SAAS,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACjD,IAAI,SAAS,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,OAAO,CAAC,EAAE,CAAC;YAC5C,OAAO,IAAI,CAAC;QACd,CAAC;IACH,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC,CAAC"}

package/src/_esm/utils/algorithms/clearPolygonDuplicateVertices.d.ts

@@ -0,0 +1,24 @@
+/**
+ * @requires Vertex
+ *
+ * @author Ikaros Kappler
+ * @date 2020-12-20
+ */
+import { Vertex } from "../../Vertex";
+/**
+ * Remove all duplicate neighbours from the given polygon.
+ *
+ * Imagagine a polygon:
+ * [ [0,0], [10,10], [10,10], [10,10], [20,20], [10,10], [30,30], [0,0] ]
+ *
+ * The returned vertex array will then be:
+ * [ [10,10], [20,20], [10,10], [30,30], [0,0] ]
+ *
+ * Duplicate neighbours (and only neightours) of a run of any length will be removed.
+ *
+ * @method clearPolygonDuplicateVertices
+ * @param {Array<Vertex>} vertices - The polygon vertices to use.
+ * @param {number=0} epsilon - The epsilon area to use around each vertex to check equality.
+ * @return {Array<Vertex>}
+ */
+export declare const clearPolygonDuplicateVertices: (vertices: Array<Vertex>, epsilon?: number) => Array<Vertex>;

package/src/_esm/utils/algorithms/clearPolygonDuplicateVertices.js

@@ -0,0 +1,61 @@
+"use strict";
+/**
+ * @requires Vertex
+ *
+ * @author Ikaros Kappler
+ * @date 2020-12-20
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.clearPolygonDuplicateVertices = void 0;
+/**
+ * Remove all duplicate neighbours from the given polygon.
+ *
+ * Imagagine a polygon:
+ * [ [0,0], [10,10], [10,10], [10,10], [20,20], [10,10], [30,30], [0,0] ]
+ *
+ * The returned vertex array will then be:
+ * [ [10,10], [20,20], [10,10], [30,30], [0,0] ]
+ *
+ * Duplicate neighbours (and only neightours) of a run of any length will be removed.
+ *
+ * @method clearPolygonDuplicateVertices
+ * @param {Array<Vertex>} vertices - The polygon vertices to use.
+ * @param {number=0} epsilon - The epsilon area to use around each vertex to check equality.
+ * @return {Array<Vertex>}
+ */
+const clearPolygonDuplicateVertices = (vertices, epsilon) => {
+    const n = vertices.length;
+    if (n === 0)
+        return [];
+    // Find following up sequence of vertices that are inside the epsilon sphere.
+    if (typeof epsilon === "undefined")
+        epsilon = 0;
+    // Check if the verts a i and j are considered equal
+    const equalVerts = (i, j) => {
+        const vertA = vertices[i % n];
+        const vertB = vertices[j % n];
+        return (epsilon === 0 && vertA.x === vertB.x && vertA.y === vertB.y)
+            || (epsilon !== 0 && vertA.distance(vertB) <= epsilon);
+    };
+    // Find the next vertex in the list, starting from 'index', that is different
+    const findEndOfRun = (index) => {
+        var b = index;
+        while (equalVerts(index, b + 1) && b < index + n) {
+            b++;
+        }
+        return b;
+    };
+    var start = findEndOfRun(0);
+    // console.log('starting at', start );
+    var i = 0;
+    const result = [];
+    for (var j = i + 1; j <= n; j++) {
+        if (!equalVerts(start + i, start + j)) {
+            result.push(vertices[(start + j) % n]);
+            i = j;
+        }
+    }
+    return result;
+};
+exports.clearPolygonDuplicateVertices = clearPolygonDuplicateVertices;
+//# sourceMappingURL=clearPolygonDuplicateVertices.js.map

package/src/_esm/utils/algorithms/clearPolygonDuplicateVertices.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"clearPolygonDuplicateVertices.js","sourceRoot":"","sources":["../../../ts/utils/algorithms/clearPolygonDuplicateVertices.ts"],"names":[],"mappings":";AAAA;;;;;GAKG;;;AAIH;;;;;;;;;;;;;;;GAeG;AACI,MAAM,6BAA6B,GAAG,CAAE,QAAsB,EAAE,OAAe,EAAmB,EAAE;IACvG,MAAM,CAAC,GAAY,QAAQ,CAAC,MAAM,CAAC;IACnC,IAAI,CAAC,KAAK,CAAC;QACd,OAAO,EAAE,CAAC;IAEP,6EAA6E;IAC7E,IAAI,OAAO,OAAO,KAAK,WAAW;QACrC,OAAO,GAAG,CAAC,CAAC;IAET,oDAAoD;IACpD,MAAM,UAAU,GAAG,CAAE,CAAQ,EAAE,CAAQ,EAAa,EAAE;QACzD,MAAM,KAAK,GAAG,QAAQ,CAAC,CAAC,GAAC,CAAC,CAAC,CAAC;QAC5B,MAAM,KAAK,GAAG,QAAQ,CAAC,CAAC,GAAC,CAAC,CAAC,CAAC;QAC5B,OAAO,CAAC,OAAO,KAAK,CAAC,IAAI,KAAK,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC,CAAC;eAC7D,CAAC,OAAO,KAAK,CAAC,IAAI,KAAK,CAAC,QAAQ,CAAC,KAAK,CAAC,IAAI,OAAO,CAAE,CAAC;IACzD,CAAC,CAAC;IAEF,6EAA6E;IAC7E,MAAM,YAAY,GAAG,CAAE,KAAY,EAAY,EAAE;QACpD,IAAI,CAAC,GAAY,KAAK,CAAC;QACvB,OAAO,UAAU,CAAC,KAAK,EAAC,CAAC,GAAC,CAAC,CAAC,IAAI,CAAC,GAAG,KAAK,GAAC,CAAC,EAAG,CAAC;YAC3C,CAAC,EAAE,CAAC;QACR,CAAC;QACD,OAAO,CAAC,CAAC;IACN,CAAC,CAAC;IAEF,IAAI,KAAK,GAAY,YAAY,CAAC,CAAC,CAAC,CAAC;IACrC,sCAAsC;IACtC,IAAI,CAAC,GAAY,CAAC,CAAC;IACnB,MAAM,MAAM,GAAmB,EAAE,CAAC;IAClC,KAAK,IAAI,CAAC,GAAG,CAAC,GAAC,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAG,CAAC;QACpC,IAAI,CAAC,UAAU,CAAC,KAAK,GAAC,CAAC,EAAC,KAAK,GAAC,CAAC,CAAC,EAAG,CAAC;YAChC,MAAM,CAAC,IAAI,CAAE,QAAQ,CAAC,CAAC,KAAK,GAAC,CAAC,CAAC,GAAC,CAAC,CAAC,CAAE,CAAC;YACrC,CAAC,GAAG,CAAC,CAAC;QACV,CAAC;IACE,CAAC;IACD,OAAO,MAAM,CAAC;AAClB,CAAC,CAAC;AArCW,QAAA,6BAA6B,GAA7B,6BAA6B,CAqCxC"}

package/src/_esm/utils/algorithms/convexHull.d.ts

@@ -0,0 +1,23 @@
+/**
+ * @author   Rosettcode, rewritten and ported to TypeScript by Ikaros Kappler
+ * @date     2020-05-04
+ * @modified 2020-08-17 Ported this function from vanilla JS to TypeScript.
+ * @version  1.0.1
+ *
+ * @file convexHull
+ * @public
+ **/
+import { XYCoords } from "../../interfaces";
+/**
+ * @description The Convex Hull algorithm, found at RosettaCode:
+ *
+ * https://rosettacode.org/wiki/Convex_hull#JavaScript
+ *
+ * @requires XYCoords
+ *
+ * @global
+ * @name convexHull
+ * @param {Array<XYCoords>} points - The points on the 2D plane to find the convex hull for.
+ * @return {Array<XYCoords>} A ordered array of points defining the convex hull.
+ **/
+export declare const getConvexHull: (points: Array<XYCoords>) => Array<XYCoords>;

package/src/_esm/utils/algorithms/convexHull.js

@@ -0,0 +1,71 @@
+"use strict";
+/**
+ * @author   Rosettcode, rewritten and ported to TypeScript by Ikaros Kappler
+ * @date     2020-05-04
+ * @modified 2020-08-17 Ported this function from vanilla JS to TypeScript.
+ * @version  1.0.1
+ *
+ * @file convexHull
+ * @public
+ **/
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.getConvexHull = void 0;
+/**
+ * @description The Convex Hull algorithm, found at RosettaCode:
+ *
+ * https://rosettacode.org/wiki/Convex_hull#JavaScript
+ *
+ * @requires XYCoords
+ *
+ * @global
+ * @name convexHull
+ * @param {Array<XYCoords>} points - The points on the 2D plane to find the convex hull for.
+ * @return {Array<XYCoords>} A ordered array of points defining the convex hull.
+ **/
+const getConvexHull = (points) => {
+    points.sort(comparison);
+    const L = [];
+    for (var i = 0; i < points.length; i++) {
+        while (L.length >= 2 && cross(L[L.length - 2], L[L.length - 1], points[i]) <= 0) {
+            L.pop();
+        }
+        L.push(points[i]);
+    }
+    const U = [];
+    for (var i = points.length - 1; i >= 0; i--) {
+        while (U.length >= 2 && cross(U[U.length - 2], U[U.length - 1], points[i]) <= 0) {
+            U.pop();
+        }
+        U.push(points[i]);
+    }
+    L.pop();
+    U.pop();
+    return L.concat(U);
+};
+exports.getConvexHull = getConvexHull;
+/**
+ * Compare two vertices to create an order on the 2D plane.
+ *
+ * @name comparison
+ * @private
+ * @param {XYCoords} a - The first of the two points to compare.
+ * @param {XYCoords} b - The second of the two points to compare.
+ * @return {number} A number indicating the order (negative if `a` is 'smaller', 0 if both are equal, positive if `a` is 'larger').
+ **/
+const comparison = (a, b) => {
+    return a.x == b.x ? a.y - b.y : a.x - b.x;
+};
+/**
+ * Calculate the cross product of the three coordinates, interpreted as vectors.
+ *
+ * @name cross
+ * @private
+ * @param {XYCoords} a
+ * @param {XYCoords} b
+ * @param {XYCoords} o
+ * @return {number} The cross product of the three 'vectors'.
+ **/
+const cross = (a, b, o) => {
+    return (a.x - o.x) * (b.y - o.y) - (a.y - o.y) * (b.x - o.x);
+};
+//# sourceMappingURL=convexHull.js.map

package/src/_esm/utils/algorithms/convexHull.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"convexHull.js","sourceRoot":"","sources":["../../../ts/utils/algorithms/convexHull.ts"],"names":[],"mappings":";AAAA;;;;;;;;IAQI;;;AAIJ;;;;;;;;;;;IAWI;AACG,MAAM,aAAa,GAAG,CAAC,MAAsB,EAAoB,EAAE;IACtE,MAAM,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;IACxB,MAAM,CAAC,GAAqB,EAAE,CAAC;IAC/B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACrC,OAAO,CAAC,CAAC,MAAM,IAAI,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC;YACrF,CAAC,CAAC,GAAG,EAAE,CAAC;QACL,CAAC;QACD,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;IACtB,CAAC;IACD,MAAM,CAAC,GAAqB,EAAE,CAAC;IAC/B,KAAK,IAAI,CAAC,GAAG,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC1C,OAAO,CAAC,CAAC,MAAM,IAAI,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC;YACrF,CAAC,CAAC,GAAG,EAAE,CAAC;QACL,CAAC;QACD,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;IACtB,CAAC;IACD,CAAC,CAAC,GAAG,EAAE,CAAC;IACR,CAAC,CAAC,GAAG,EAAE,CAAC;IACR,OAAO,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;AACvB,CAAC,CAAC;AAnBW,QAAA,aAAa,GAAb,aAAa,CAmBxB;AAGF;;;;;;;;IAQI;AACJ,MAAM,UAAU,GAAG,CAAC,CAAU,EAAE,CAAU,EAAW,EAAE;IACnD,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;AAC9C,CAAC,CAAC;AAGF;;;;;;;;;IASI;AACJ,MAAM,KAAK,GAAG,CAAC,CAAU,EAAE,CAAU,EAAE,CAAU,EAAW,EAAE;IAC1D,OAAO,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;AACjE,CAAC,CAAC"}