plotboilerplate 1.27.0 → 1.28.0

package/src/_esm/src/ts/utils/algorithms/detectPaths.js

@@ -0,0 +1,165 @@
+/**
+ * A function to detect connected paths on the plane given by a random set of segments.
+ *
+ * Note that is algorithm operates IN PLACE and will ALTER your INPUT array.
+ *
+ * @author  Ikaros Kappler
+ * @version 1.0.0
+ * @date    2022-10-17
+ */
+import { GenericPath } from "../datastructures/GenericPath";
+/**
+ * A private helper function that initializes the visitation tracking and reverses
+ * dangling path ends to connect them with preceding paths.
+ *
+ * Note that this function alters those dangling path segments IN PLACE!
+ *
+ * @param segments
+ * @param epsilon
+ * @returns
+ */
+const initVisitationArray = (segments, epsilon) => {
+    const result = []; // { visited: false, hasPredecessor: false }
+    for (var i = 0; i < segments.length; i++) {
+        result.push({ visited: false, hasPredecessor: false, hasSuccessor: false });
+        for (var j = 0; j < segments.length; j++) {
+            if (i === j) {
+                continue;
+            }
+            if (segments[i].getStartPoint().distance(segments[j].getEndPoint()) < epsilon ||
+                segments[i].getStartPoint().distance(segments[j].getStartPoint()) < epsilon) {
+                result[i].hasPredecessor = true;
+            }
+            if (segments[i].getEndPoint().distance(segments[j].getEndPoint()) < epsilon ||
+                segments[i].getEndPoint().distance(segments[j].getStartPoint()) < epsilon) {
+                result[i].hasSuccessor = true;
+            }
+        }
+    }
+    // After first initialization make sure that no loose path ends are dangling around
+    // if the affected path segment has a predecessor (but nu successor).
+    //
+    // Revert those segments. This makes the actual detection algorithm much easier.
+    for (var i = 0; i < segments.length; i++) {
+        if (!result[i].hasSuccessor && result[i].hasPredecessor) {
+            segments[i] = segments[i].reverse();
+            result[i].hasPredecessor = false;
+            result[i].hasSuccessor = true;
+        }
+    }
+    return result;
+};
+/**
+ * Find the next unvisited path segment (private helper function).
+ *
+ * There is a special order: starting path segments (those without any predecessor)
+ * will be preferred. If no more open paths are available (no starting path segments),
+ * then no more unvisited paths are available or all remaining paths are loops (without
+ * determined start/end).
+ *
+ * Doing this keeps us from the need to run a final loop to connect detected sub paths.
+ *
+ * @param {Array<PathSegment>} segments - The path segments to search in.
+ * @param { Array<Visitation>} isSegmentVisited
+ * @returns {number} The index of the next unvisited path segment or -1 if no more are available.
+ */
+const locateUnvisitedSegment = (segments, isSegmentVisited) => {
+    // First run: detect beginnings
+    for (var i = 0; i < segments.length; i++) {
+        if (!isSegmentVisited[i].hasPredecessor && !isSegmentVisited[i].visited) {
+            return i;
+        }
+    }
+    // Second run: if no beginnings exist -> use inner path segment
+    for (var i = 0; i < segments.length; i++) {
+        if (!isSegmentVisited[i].visited) {
+            return i;
+        }
+    }
+    return -1;
+};
+/**
+ * Get the next adjacent path segment to the given (current) segment. This is a private
+ * helper function.
+ *
+ * Note that the function will revert the adjacent path segment if required, so the next
+ * starting point 'equals' the current ending point.
+ *
+ * The visitation tracker will be updated if the adjacent segment was found.
+ *
+ * @param {Array<PathSegment>} segments - The total set of available path segments (visited and invisited).
+ * @param {Array<Visitation>} isSegmentVisited - A tracker of visited path segments so far.
+ * @param {PathSegment} currentSegment - The current path segment to find the adjacent segment for.
+ * @param {number} epsilon - The epsilon to use to detect 'equal' start/end points. Must be >= 0.
+ * @returns {PathSegment | null} The next adjacent path segment of null if no such exists.
+ */
+const getAdjacentSegment = (segments, isSegmentVisited, currentSegment, epsilon) => {
+    for (var j = 0; j < segments.length; j++) {
+        if (isSegmentVisited[j].visited) {
+            continue;
+        }
+        var nextSegment = segments[j];
+        // [start]---[end] [start]---[end]
+        if (currentSegment.getEndPoint().distance(nextSegment.getStartPoint()) < epsilon) {
+            isSegmentVisited[j].visited = true;
+            return nextSegment;
+        }
+        // [start]---[end] [end]---[start]
+        else if (currentSegment.getEndPoint().distance(nextSegment.getEndPoint()) < epsilon) {
+            isSegmentVisited[j].visited = true;
+            return nextSegment.reverse();
+        }
+    }
+    return null;
+};
+/**
+ * A private helper function to find the adjacent full path for the given path segment,
+ * considering the current path segment is a starting segment (or one inside a loop).
+ *
+ * @param {Array<PathSegment>} segments - The total set of available path segments.
+ * @param { Array<Visitation>} isSegmentVisited - A tracker to determine which segments have already been visited.
+ * @param {number} currentSegmentIndex - The index of the current segments to find the containing path for.
+ * @param {number} epsilon - The epsilon to use to determine 'equal' path points. Must be >= 0.
+ * @returns {GenericPath} The dected path which consists at least of the current path segment.
+ */
+const detectAdjacentPath = (segments, isSegmentVisited, currentSegmentIndex, epsilon) => {
+    var currentSegment = segments[currentSegmentIndex];
+    isSegmentVisited[currentSegmentIndex].visited = true;
+    const path = new GenericPath(currentSegment); // { segments: [currentSegment], reverse };
+    var i = 0;
+    // A safety break if something goes wrong
+    while (i < segments.length && currentSegment) {
+        currentSegment = getAdjacentSegment(segments, isSegmentVisited, currentSegment, epsilon);
+        if (currentSegment) {
+            path.segments.push(currentSegment);
+        }
+        i++;
+    }
+    return path;
+};
+/**
+ * Run a path detection on the given set of path segments.
+ *
+ * Note that the array and some path segments may be altered (like reversal) IN PLACE.
+ *
+ * @param {Array<PathSegment>} segments - The total set (array) of available path segments.
+ * @param {number=1.0} epsilon - (optional) An epsilon to use to tell if two plane points should be considered 'equal'.
+ * @returns {Array<GenericPath>} An array containing all detected path (consisting of adjacent path segments of the original set).
+ */
+export const detectPaths = (segments, epsilon) => {
+    const eps = typeof epsilon === "undefined" || epsilon < 0 ? 1.0 : epsilon;
+    const isSegmentVisited = initVisitationArray(segments, eps);
+    const resultPaths = [];
+    var nextSegmentIndex = -1;
+    var i = 0;
+    while ((nextSegmentIndex = locateUnvisitedSegment(segments, isSegmentVisited)) !== -1 && i < segments.length) {
+        isSegmentVisited[nextSegmentIndex].visited = true;
+        // A safety break (to avoid infinited loops during development).
+        i++;
+        const path = detectAdjacentPath(segments, isSegmentVisited, nextSegmentIndex, eps);
+        i += path.getSegmentCount() - 1;
+        resultPaths.push(path);
+    }
+    return resultPaths;
+};
+//# sourceMappingURL=detectPaths.js.map

package/src/_esm/src/ts/utils/algorithms/detectPaths.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"detectPaths.js","sourceRoot":"","sources":["../../../../../ts/utils/algorithms/detectPaths.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAGH,OAAO,EAAE,WAAW,EAAE,MAAM,+BAA+B,CAAC;AAW5D;;;;;;;;;GASG;AACH,MAAM,mBAAmB,GAAG,CAAC,QAA4B,EAAE,OAAe,EAAqB,EAAE;IAC/F,MAAM,MAAM,GAAsB,EAAE,CAAC,CAAC,4CAA4C;IAClF,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACzC,MAAM,CAAC,IAAI,CAAC,EAAE,OAAO,EAAE,KAAK,EAAE,cAAc,EAAE,KAAK,EAAE,YAAY,EAAE,KAAK,EAAE,CAAC,CAAC;QAC5E,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACzC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;gBACZ,SAAS;YACX,CAAC;YACD,IACE,QAAQ,CAAC,CAAC,CAAC,CAAC,aAAa,EAAE,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,WAAW,EAAE,CAAC,GAAG,OAAO;gBACzE,QAAQ,CAAC,CAAC,CAAC,CAAC,aAAa,EAAE,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,aAAa,EAAE,CAAC,GAAG,OAAO,EAC3E,CAAC;gBACD,MAAM,CAAC,CAAC,CAAC,CAAC,cAAc,GAAG,IAAI,CAAC;YAClC,CAAC;YACD,IACE,QAAQ,CAAC,CAAC,CAAC,CAAC,WAAW,EAAE,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,WAAW,EAAE,CAAC,GAAG,OAAO;gBACvE,QAAQ,CAAC,CAAC,CAAC,CAAC,WAAW,EAAE,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,aAAa,EAAE,CAAC,GAAG,OAAO,EACzE,CAAC;gBACD,MAAM,CAAC,CAAC,CAAC,CAAC,YAAY,GAAG,IAAI,CAAC;YAChC,CAAC;QACH,CAAC;IACH,CAAC;IACD,mFAAmF;IACnF,qEAAqE;IACrE,EAAE;IACF,gFAAgF;IAChF,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACzC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,YAAY,IAAI,MAAM,CAAC,CAAC,CAAC,CAAC,cAAc,EAAE,CAAC;YACxD,QAAQ,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC;YACpC,MAAM,CAAC,CAAC,CAAC,CAAC,cAAc,GAAG,KAAK,CAAC;YACjC,MAAM,CAAC,CAAC,CAAC,CAAC,YAAY,GAAG,IAAI,CAAC;QAChC,CAAC;IACH,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC,CAAC;AAEF;;;;;;;;;;;;;GAaG;AACH,MAAM,sBAAsB,GAAG,CAAC,QAA4B,EAAE,gBAAmC,EAAU,EAAE;IAC3G,+BAA+B;IAC/B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACzC,IAAI,CAAC,gBAAgB,CAAC,CAAC,CAAC,CAAC,cAAc,IAAI,CAAC,gBAAgB,CAAC,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC;YACxE,OAAO,CAAC,CAAC;QACX,CAAC;IACH,CAAC;IACD,+DAA+D;IAC/D,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACzC,IAAI,CAAC,gBAAgB,CAAC,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC;YACjC,OAAO,CAAC,CAAC;QACX,CAAC;IACH,CAAC;IACD,OAAO,CAAC,CAAC,CAAC;AACZ,CAAC,CAAC;AAEF;;;;;;;;;;;;;;GAcG;AACH,MAAM,kBAAkB,GAAG,CACzB,QAA4B,EAC5B,gBAAmC,EACnC,cAA2B,EAC3B,OAAe,EACK,EAAE;IACtB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACzC,IAAI,gBAAgB,CAAC,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC;YAChC,SAAS;QACX,CAAC;QACD,IAAI,WAAW,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;QAC9B,kCAAkC;QAClC,IAAI,cAAc,CAAC,WAAW,EAAE,CAAC,QAAQ,CAAC,WAAW,CAAC,aAAa,EAAE,CAAC,GAAG,OAAO,EAAE,CAAC;YACjF,gBAAgB,CAAC,CAAC,CAAC,CAAC,OAAO,GAAG,IAAI,CAAC;YACnC,OAAO,WAAW,CAAC;QACrB,CAAC;QACD,kCAAkC;aAC7B,IAAI,cAAc,CAAC,WAAW,EAAE,CAAC,QAAQ,CAAC,WAAW,CAAC,WAAW,EAAE,CAAC,GAAG,OAAO,EAAE,CAAC;YACpF,gBAAgB,CAAC,CAAC,CAAC,CAAC,OAAO,GAAG,IAAI,CAAC;YACnC,OAAO,WAAW,CAAC,OAAO,EAAE,CAAC;QAC/B,CAAC;IACH,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC,CAAC;AAEF;;;;;;;;;GASG;AACH,MAAM,kBAAkB,GAAG,CACzB,QAA4B,EAC5B,gBAAmC,EACnC,mBAA2B,EAC3B,OAAe,EACF,EAAE;IACf,IAAI,cAAc,GAAuB,QAAQ,CAAC,mBAAmB,CAAC,CAAC;IACvE,gBAAgB,CAAC,mBAAmB,CAAC,CAAC,OAAO,GAAG,IAAI,CAAC;IACrD,MAAM,IAAI,GAAG,IAAI,WAAW,CAAC,cAAc,CAAC,CAAC,CAAC,2CAA2C;IAEzF,IAAI,CAAC,GAAW,CAAC,CAAC;IAClB,yCAAyC;IACzC,OAAO,CAAC,GAAG,QAAQ,CAAC,MAAM,IAAI,cAAc,EAAE,CAAC;QAC7C,cAAc,GAAG,kBAAkB,CAAC,QAAQ,EAAE,gBAAgB,EAAE,cAAc,EAAE,OAAO,CAAC,CAAC;QACzF,IAAI,cAAc,EAAE,CAAC;YACnB,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC;QACrC,CAAC;QACD,CAAC,EAAE,CAAC;IACN,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC,CAAC;AAEF;;;;;;;;GAQG;AACH,MAAM,CAAC,MAAM,WAAW,GAAG,CAAC,QAA4B,EAAE,OAAgB,EAAsB,EAAE;IAChG,MAAM,GAAG,GAAG,OAAO,OAAO,KAAK,WAAW,IAAI,OAAO,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,OAAO,CAAC;IAC1E,MAAM,gBAAgB,GAAsB,mBAAmB,CAAC,QAAQ,EAAE,GAAG,CAAC,CAAC;IAC/E,MAAM,WAAW,GAAuB,EAAE,CAAC;IAC3C,IAAI,gBAAgB,GAAW,CAAC,CAAC,CAAC;IAClC,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,OAAO,CAAC,gBAAgB,GAAG,sBAAsB,CAAC,QAAQ,EAAE,gBAAgB,CAAC,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC;QAC7G,gBAAgB,CAAC,gBAAgB,CAAC,CAAC,OAAO,GAAG,IAAI,CAAC;QAClD,gEAAgE;QAChE,CAAC,EAAE,CAAC;QACJ,MAAM,IAAI,GAAG,kBAAkB,CAAC,QAAQ,EAAE,gBAAgB,EAAE,gBAAgB,EAAE,GAAG,CAAC,CAAC;QACnF,CAAC,IAAI,IAAI,CAAC,eAAe,EAAE,GAAG,CAAC,CAAC;QAChC,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACzB,CAAC;IACD,OAAO,WAAW,CAAC;AACrB,CAAC,CAAC"}

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

@@ -0,0 +1,21 @@
+/**
+ * @requires Line
+ * @requires Vertex
+ *
+ * @author   Ikaros Kappler
+ * @date     2020-12-04
+ * @modified 2020-12-09 Ported from vanilla JS to Typescript.
+ * @modified 2024-11-22 Fixed a type error in line 41.
+ */
+import { Vertex } from "../../Vertex";
+import { XYCoords } from "../../interfaces";
+/**
+ * Collect all self-intersection points of the given polygon.
+ *
+ * If the given polygon (vertices) is not self intersecting then the returned array is empty.
+ *
+ * @name findPolygonSelfIntersections
+ * @param {Array<Vertex>} vertices - The vertices that form the polygon.
+ * @return {Array<Vertex>}
+ */
+export declare const findPolygonSelfIntersections: (vertices: Array<XYCoords>) => Array<Vertex>;

package/src/_esm/src/ts/utils/algorithms/findPolygonSelfIntersections.js

@@ -0,0 +1,47 @@
+/**
+ * @requires Line
+ * @requires Vertex
+ *
+ * @author   Ikaros Kappler
+ * @date     2020-12-04
+ * @modified 2020-12-09 Ported from vanilla JS to Typescript.
+ * @modified 2024-11-22 Fixed a type error in line 41.
+ */
+import { Line } from "../../Line";
+import { Vertex } from "../../Vertex";
+/**
+ * Collect all self-intersection points of the given polygon.
+ *
+ * If the given polygon (vertices) is not self intersecting then the returned array is empty.
+ *
+ * @name findPolygonSelfIntersections
+ * @param {Array<Vertex>} vertices - The vertices that form the polygon.
+ * @return {Array<Vertex>}
+ */
+export const findPolygonSelfIntersections = (vertices) => {
+    const pointList = [];
+    const lineA = new Line(new Vertex(), new Vertex());
+    const lineB = new Line(new Vertex(), new Vertex());
+    const n = vertices.length;
+    for (var a = 0; a < n; a++) {
+        lineA.a.set(vertices[a]);
+        lineA.b.set(vertices[(a + 1) % n]);
+        for (var b = 0; b < n; b++) {
+            // Same edge or neighbour edges intersect by definition.
+            // Skip them.
+            if (a == b || a + 1 == b || a == b + 1 || (a == 0 && b + 1 == n) || (b == 0 && a + 1 == n))
+                continue;
+            lineB.a.set(vertices[b]);
+            lineB.b.set(vertices[(b + 1) % n]);
+            // Commpute the intersection point of the (infinite) lines.
+            // The point is undefined if and only if both line are parallel (co-linear).
+            const intersectionPoint = lineA.intersection(lineB);
+            // Check if the intersection point is on both (finite) edges of the polygon.
+            if (intersectionPoint && lineA.hasPoint(intersectionPoint) && lineB.hasPoint(intersectionPoint)) {
+                pointList.push(intersectionPoint);
+            }
+        }
+    }
+    return pointList;
+};
+//# sourceMappingURL=findPolygonSelfIntersections.js.map

package/src/_esm/src/ts/utils/algorithms/findPolygonSelfIntersections.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"findPolygonSelfIntersections.js","sourceRoot":"","sources":["../../../../../ts/utils/algorithms/findPolygonSelfIntersections.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAEH,OAAO,EAAE,IAAI,EAAE,MAAM,YAAY,CAAC;AAClC,OAAO,EAAE,MAAM,EAAE,MAAM,cAAc,CAAC;AAGtC;;;;;;;;GAQG;AACH,MAAM,CAAC,MAAM,4BAA4B,GAAG,CAAC,QAAyB,EAAiB,EAAE;IACvF,MAAM,SAAS,GAAkB,EAAE,CAAC;IACpC,MAAM,KAAK,GAAS,IAAI,IAAI,CAAC,IAAI,MAAM,EAAE,EAAE,IAAI,MAAM,EAAE,CAAC,CAAC;IACzD,MAAM,KAAK,GAAS,IAAI,IAAI,CAAC,IAAI,MAAM,EAAE,EAAE,IAAI,MAAM,EAAE,CAAC,CAAC;IACzD,MAAM,CAAC,GAAW,QAAQ,CAAC,MAAM,CAAC;IAClC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3B,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;QACzB,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACnC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3B,wDAAwD;YACxD,aAAa;YACb,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;gBAAE,SAAS;YACrG,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;YACzB,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YAEnC,2DAA2D;YAC3D,4EAA4E;YAC5E,MAAM,iBAAiB,GAAkB,KAAK,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC;YAEnE,4EAA4E;YAC5E,IAAI,iBAAiB,IAAI,KAAK,CAAC,QAAQ,CAAC,iBAAiB,CAAC,IAAI,KAAK,CAAC,QAAQ,CAAC,iBAAiB,CAAC,EAAE,CAAC;gBAChG,SAAS,CAAC,IAAI,CAAC,iBAAiB,CAAC,CAAC;YACpC,CAAC;QACH,CAAC;IACH,CAAC;IACD,OAAO,SAAS,CAAC;AACnB,CAAC,CAAC"}

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

@@ -0,0 +1,13 @@
+/**
+ * @author Original from Martin Sojka. Ported to TypesScript by Ikaros Kappler
+ * @date   2020-11-10
+ */
+import { Color } from "../datastructures/Color";
+/**
+ * Contrast color algorithm by Martin Sojka's.
+ * Found at
+ *    https://gamedev.stackexchange.com/questions/38536/given-a-rgb-color-x-how-to-find-the-most-contrasting-color-y/38542#38542
+ *
+ * @requires Color
+ */
+export declare const getContrastColor: (color: Color) => Color;

package/src/_esm/src/ts/utils/algorithms/getContrastColor.js

@@ -0,0 +1,22 @@
+/**
+ * @author Original from Martin Sojka. Ported to TypesScript by Ikaros Kappler
+ * @date   2020-11-10
+ */
+import { Color } from "../datastructures/Color";
+const BLACK = Color.makeRGB(0, 0, 0);
+const WHITE = Color.makeRGB(255, 255, 255);
+/**
+ * Contrast color algorithm by Martin Sojka's.
+ * Found at
+ *    https://gamedev.stackexchange.com/questions/38536/given-a-rgb-color-x-how-to-find-the-most-contrasting-color-y/38542#38542
+ *
+ * @requires Color
+ */
+export const getContrastColor = (color) => {
+    // r,g,b in [0..1]
+    const gamma = 2.2;
+    const L = 0.2126 * Math.pow(color.r, gamma) + 0.7152 * Math.pow(color.g, gamma) + 0.0722 * Math.pow(color.b, gamma);
+    const use_black = L > Math.pow(0.5, gamma);
+    return use_black ? BLACK : WHITE;
+};
+//# sourceMappingURL=getContrastColor.js.map

package/src/_esm/src/ts/utils/algorithms/getContrastColor.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"getContrastColor.js","sourceRoot":"","sources":["../../../../../ts/utils/algorithms/getContrastColor.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,KAAK,EAAE,MAAM,yBAAyB,CAAC;AAEhD,MAAM,KAAK,GAAG,KAAK,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;AACrC,MAAM,KAAK,GAAG,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;AAE3C;;;;;;GAMG;AACH,MAAM,CAAC,MAAM,gBAAgB,GAAG,CAAC,KAAY,EAAS,EAAE;IACtD,kBAAkB;IAClB,MAAM,KAAK,GAAW,GAAG,CAAC;IAC1B,MAAM,CAAC,GAAW,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,GAAG,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,GAAG,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;IAC5H,MAAM,SAAS,GAAY,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;IACpD,OAAO,SAAS,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC;AACnC,CAAC,CAAC"}

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

@@ -0,0 +1,10 @@
+/**
+ * @author Ikaros Kappler
+ * @date 2020-10-23
+ * @version 1.0.0
+ **/
+import { Matrix } from "../datastructures/interfaces";
+/**
+ * A matrix-fill helper function. Equivalent of lodash.array_fill(...).
+ */
+export declare const matrixFill: <T extends any>(countA: number, countB: number, initialValue: T) => Matrix<T>;

package/src/_esm/src/ts/utils/algorithms/matrixFill.js

@@ -0,0 +1,17 @@
+/**
+ * @author Ikaros Kappler
+ * @date 2020-10-23
+ * @version 1.0.0
+ **/
+import { arrayFill } from "./arrayFill";
+/**
+ * A matrix-fill helper function. Equivalent of lodash.array_fill(...).
+ */
+export const matrixFill = (countA, countB, initialValue) => {
+    const arr = Array(countA);
+    for (var i = 0; i < countA; i++) {
+        arr[i] = arrayFill(countB, initialValue);
+    }
+    return arr;
+};
+//# sourceMappingURL=matrixFill.js.map

package/src/_esm/src/ts/utils/algorithms/matrixFill.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"matrixFill.js","sourceRoot":"","sources":["../../../../../ts/utils/algorithms/matrixFill.ts"],"names":[],"mappings":"AAAA;;;;IAII;AAEJ,OAAO,EAAE,SAAS,EAAE,MAAM,aAAa,CAAC;AAIxC;;GAEG;AACH,MAAM,CAAC,MAAM,UAAU,GAAG,CAAiB,MAAa,EAAE,MAAa,EAAE,YAAc,EAAe,EAAE;IACpG,MAAM,GAAG,GAAe,KAAK,CAAY,MAAM,CAAE,CAAC;IAClD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,EAAE,EAAG,CAAC;QACtC,GAAG,CAAC,CAAC,CAAC,GAAG,SAAS,CAAK,MAAM,EAAE,YAAY,CAAE,CAAC;IAC3C,CAAC;IACD,OAAO,GAAG,CAAC;AACf,CAAC,CAAC"}

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

@@ -0,0 +1,23 @@
+/**
+ * A script to convert any boolean matrix to rounded paths.
+ *
+ * @author  Ikaros Kappler
+ * @date    2025-10-17 (ported to Typescript from a demo-script)
+ * @version 1.0.0
+ */
+import { SVGPathParams, XYCoords } from "../../interfaces";
+import { DataGrid2dArrayMatrix } from "../datastructures/DataGrid2dArrayMatrix";
+export type PixelCornerPathOptions = {
+    origin?: XYCoords;
+    squareSize?: number;
+    gapSize?: number;
+    curveFactor?: number;
+};
+/**
+ * Computes an array of paths from the given boolean matrix.
+ *
+ * @param {DataGrid2dArrayMatrix<boolean>} matrix
+ * @param {PixelCornerPathOptions} options
+ * @returns
+ */
+export declare const pixelCornersToRoundPaths: (matrix: DataGrid2dArrayMatrix<boolean>, options: PixelCornerPathOptions) => Array<SVGPathParams>;

package/src/_esm/src/ts/utils/algorithms/pixelCornersToRoundPaths.js

@@ -0,0 +1,266 @@
+/**
+ * A script to convert any boolean matrix to rounded paths.
+ *
+ * @author  Ikaros Kappler
+ * @date    2025-10-17 (ported to Typescript from a demo-script)
+ * @version 1.0.0
+ */
+import { Bounds } from "../../Bounds";
+import { DataGrid2dArrayMatrix } from "../datastructures/DataGrid2dArrayMatrix";
+const LEFT_BORDER = 0;
+const TOP_BORDER = 1;
+const RIGHT_BORDER = 2;
+const BOTTOM_BORDER = 3;
+/**
+ * Computes an array of paths from the given boolean matrix.
+ *
+ * @param {DataGrid2dArrayMatrix<boolean>} matrix
+ * @param {PixelCornerPathOptions} options
+ * @returns
+ */
+export const pixelCornersToRoundPaths = (matrix, options) => {
+    const paths = [];
+    const visitedLeftBorderMatrix = new DataGrid2dArrayMatrix(matrix.xSegmentCount, matrix.ySegmentCount, false);
+    const origin = options && options.origin ? options.origin : { x: 0, y: 0 };
+    const squareSize = options && typeof options.squareSize === "number" ? options.squareSize : 10;
+    const gapSize = options && typeof options.gapSize === "number" ? options.gapSize : 2;
+    const curveFactor = options && typeof options.curveFactor === "number" ? options.curveFactor : 0.666;
+    // Find an unvisited pixel with a free left neighbour
+    const condition = (value, x, y, _matrix) => {
+        return (value === true &&
+            visitedLeftBorderMatrix.get(x, y) === false &&
+            // is left neighbour free?
+            (x - 1 < 0 || _matrix.get(x - 1, y) === false));
+    };
+    // Just to be sure the while loop terminates after a maximum number of iterations.
+    const safetyLimit = matrix.xSegmentCount * matrix.ySegmentCount + 1;
+    // The next unvisited pixel position.
+    var nonVisitedPosition;
+    var i = 0;
+    while ((nonVisitedPosition = matrix.find(condition)) && i++ < safetyLimit) {
+        // console.log("nonVisitedPosition", nonVisitedPosition);
+        // Condition: if a point was found then its left neighbour is empty.
+        //            So by this the current pixel's left bound is definitely a path start.
+        const squareBox = getSquareBox(origin, squareSize, gapSize, nonVisitedPosition.xIndex, nonVisitedPosition.yIndex);
+        const west = squareBox.getWestPoint();
+        // A starting point was found: Initialize the next path.
+        var pathData = [
+            // Start point
+            "M",
+            west.x,
+            west.y
+        ];
+        // Now from this point starting (left pixel corner) construct the next sequence of path commands.
+        __constructPath(pathData, matrix, visitedLeftBorderMatrix, nonVisitedPosition, LEFT_BORDER, origin, squareSize, gapSize, curveFactor);
+        paths.push(pathData);
+        // console.log("pathData", pathData);
+    }
+    return paths;
+};
+/**
+ * Construct a bounding box representing the visual square bounds for the given pixel.
+ *
+ * @param {XYCoords} origin - The origin to build the paths from (upper left corner of the graphics).
+ * @param {number} squareSize - The number of pixels to use to represent a pixel square.
+ * @param {number} gapSize - The number of pixels to use for gaps between squares.
+ * @param {number} x - The x position inside the data grid (matrix offset).
+ * @param {number} y - They  position inside the data grid (matrix offset).
+ * @returns
+ */
+const getSquareBox = (origin, squareSize, gapSize, x, y) => {
+    return new Bounds({
+        x: origin.x + x * (squareSize + gapSize),
+        y: origin.y + y * (squareSize + gapSize)
+    }, {
+        x: origin.x + x * (squareSize + gapSize) + squareSize,
+        y: origin.y + y * (squareSize + gapSize) + squareSize
+    });
+};
+/**
+ * Lerp between these two numbers using the passed lerp amount (usually a value in 0.0-1.0).
+ *
+ * @param {number} a
+ * @param {number} b
+ * @param {number} lerpFactor
+ * @returns {number}
+ */
+const lerp = (a, b, lerpFactor) => {
+    return a + (b - a) * lerpFactor;
+};
+/**
+ * Construct a path command for a cubic Bézier curve.
+ *
+ * @param {SVGPathParams} pathData
+ * @param {XYCoords} start
+ * @param {XYCoords} controlA
+ * @param {XYCoords} controlB
+ * @param {XYCoords} end
+ * @param {number} curveFactor
+ */
+const addRoundCorner = (pathData, start, controlA, controlB, end, curveFactor) => {
+    pathData.push("C", lerp(start.x, controlA.x, curveFactor), lerp(start.y, controlA.y, curveFactor), lerp(end.x, controlB.x, curveFactor), lerp(end.y, controlB.y, curveFactor), end.x, end.y);
+};
+/**
+ * Construct a new path command for a straight line.
+ *
+ * @param {SVGPathParams} pathData
+ * @param {XYCoords} target
+ */
+const addStraightLine = (pathData, target) => {
+    pathData.push("L", target.x, target.y);
+};
+/**
+ * A helper function for constructing the next path, beginning at the passed matrix position.
+ *
+ * Note the path will be created at the left border of the given 'pixel', constructe
+ * in clockwise order.
+ *
+ * @param {SVGPathParams} pathData
+ * @param {DataGrid2dArrayMatrix<boolean>} matrix - The data matrix to use.
+ * @param {DataGrid2dArrayMatrix<boolean>} visitedLeftBordersMatrix - A helper matrix to keep track of visited pixels.
+ * @param {RasterPosition} startingPosition
+ * @param {number} startingBorderDirection
+ * @param {XYCoords} origin
+ * @param {number} squareSize
+ * @param {number} gapSize
+ * @param {number} curveFactor
+ */
+const __constructPath = (pathData, matrix, visitedLeftBordersMatrix, startingPosition, startingBorderDirection, origin, squareSize, gapSize, curveFactor) => {
+    // Pre: position's neighbour pixel at ehe given border direction is unset.
+    var isPathComplete = false;
+    const maxInterations = matrix.xSegmentCount * matrix.ySegmentCount * 4 + 1;
+    var i = 0;
+    var position = startingPosition;
+    var borderDirection = startingBorderDirection;
+    while (!isPathComplete && i++ < maxInterations) {
+        var x = position.xIndex;
+        var y = position.yIndex;
+        // console.log("x", x, "y", y, "borderDirection", borderDirection);
+        // Get the pixel's box bounds.
+        const squareBox = getSquareBox(origin, squareSize, gapSize, x, y);
+        // Find next step when walking 'clockwise'
+        if (borderDirection === LEFT_BORDER) {
+            // Only track visits on left borders. By this we can detect non-visited holes :)
+            visitedLeftBordersMatrix.set(x, y, true);
+            // We want to expand the left border
+            const west = squareBox.getWestPoint();
+            // Pixel in the north?
+            if (y - 1 < 0 || matrix.get(x, y - 1) === false) {
+                // Northwise pixel is empty
+                //  -> construct round corner to right
+                addRoundCorner(pathData, west, squareBox.getNorthWestPoint(), squareBox.getNorthWestPoint(), squareBox.getNorthPoint(), curveFactor);
+                borderDirection = TOP_BORDER;
+                // Keep pixel position unchanged
+            }
+            else if (x - 1 >= 0 && matrix.get(x - 1, y - 1) === true) {
+                // Top neighbour pixel is set AND top-left pixel is set too.
+                // -> construct rounded edge to top-left.
+                const squareBoxNW = getSquareBox(origin, squareSize, gapSize, x - 1, y - 1);
+                addRoundCorner(pathData, west, squareBox.getNorthWestPoint(), squareBoxNW.getSouthEastPoint(), squareBoxNW.getSouthPoint(), curveFactor);
+                borderDirection = BOTTOM_BORDER;
+                position = { xIndex: x - 1, yIndex: y - 1 };
+            }
+            else {
+                // Straight to top
+                const squareBoxN = getSquareBox(origin, squareSize, gapSize, x, y - 1);
+                addStraightLine(pathData, squareBoxN.getWestPoint());
+                position = { xIndex: x, yIndex: y - 1 };
+                // Keep borderDirection: LEFT_BORDER
+                // isPathComplete = true; // TODO
+            }
+        }
+        else if (borderDirection === TOP_BORDER) {
+            // North pixel is definitely empty.
+            const north = squareBox.getNorthPoint();
+            if (x + 1 >= matrix.xSegmentCount || matrix.get(x + 1, y) === false) {
+                // Top border and right pixel is empty
+                //  --> create rounded corner to right south
+                addRoundCorner(pathData, north, squareBox.getNorthEastPoint(), squareBox.getNorthEastPoint(), squareBox.getEastPoint(), curveFactor);
+                borderDirection = RIGHT_BORDER;
+                // Keep pixel position unchanged
+            }
+            else if (y - 1 < 0 || matrix.get(x + 1, y - 1) === false) {
+                // Top border and right pixel is set, and north-east pixel is clear.
+                // -> linear path to right
+                const squareBoxE = getSquareBox(origin, squareSize, gapSize, x + 1, y);
+                addStraightLine(pathData, squareBoxE.getNorthPoint());
+                position = { xIndex: x + 1, yIndex: y };
+                // Keep borderDirection TOP
+            }
+            else {
+                // Last case: right neighbour is set and north-east pixel is set
+                //-> construct a rounded corner to east-north.
+                const squareBoxNE = getSquareBox(origin, squareSize, gapSize, x + 1, y - 1);
+                addRoundCorner(pathData, north, squareBox.getNorthEastPoint(), squareBoxNE.getSouthWestPoint(), squareBoxNE.getWestPoint(), curveFactor);
+                borderDirection = LEFT_BORDER;
+                position = { xIndex: x + 1, yIndex: y - 1 };
+                // isPathComplete = true; // TODO!!!
+            }
+        }
+        else if (borderDirection === RIGHT_BORDER) {
+            // East pixel is definitely empty.
+            var east = squareBox.getEastPoint();
+            if (y + 1 >= matrix.ySegmentCount || matrix.get(x, y + 1) === false) {
+                // South pixel is empty.
+                // -> construct rounded corner to south-east
+                addRoundCorner(pathData, east, squareBox.getSouthEastPoint(), squareBox.getSouthEastPoint(), squareBox.getSouthPoint(), curveFactor);
+                borderDirection = BOTTOM_BORDER;
+                // Keep pixel position unchanged
+            }
+            else if (x + 1 < matrix.xSegmentCount && y + 1 < matrix.ySegmentCount && matrix.get(x + 1, y + 1) === true) {
+                // South pixel is set AND right lower pixel is set, too.
+                // -> construct round corner to south-east.
+                const squareBoxSE = getSquareBox(origin, squareSize, gapSize, x + 1, y + 1);
+                addRoundCorner(pathData, east, squareBox.getSouthEastPoint(), squareBoxSE.getNorthWestPoint(), squareBoxSE.getNorthPoint(), curveFactor);
+                borderDirection = TOP_BORDER;
+                position = { xIndex: x + 1, yIndex: y + 1 };
+            }
+            else {
+                // South pixel is set and south-east pixel is clear.
+                // -> construct linear connection to south
+                const squareBoxS = getSquareBox(origin, squareSize, gapSize, x, y + 1);
+                addStraightLine(pathData, squareBoxS.getEastPoint());
+                position = { xIndex: x, yIndex: y + 1 };
+                // Keep borderDirection RIGHT
+            }
+        }
+        else if (borderDirection === BOTTOM_BORDER) {
+            // Pre: south pixel is definitely empty
+            const south = squareBox.getSouthPoint();
+            if (x - 1 < 0 || matrix.get(x - 1, y) === false) {
+                // Left pixel is empty
+                // -> construct round corner to west-north
+                addRoundCorner(pathData, south, squareBox.getSouthWestPoint(), squareBox.getSouthWestPoint(), squareBox.getWestPoint(), curveFactor);
+                borderDirection = LEFT_BORDER;
+            }
+            else if (x - 1 >= 0 && y + 1 < matrix.ySegmentCount && matrix.get(x - 1, y + 1) === true) {
+                // Left pixel AND left lower pixel are set
+                // -> construct rounded edge to south-west
+                const squareBoxSW = getSquareBox(origin, squareSize, gapSize, x - 1, y + 1);
+                addRoundCorner(pathData, south, squareBox.getSouthWestPoint(), squareBoxSW.getNorthEastPoint(), squareBoxSW.getEastPoint(), curveFactor);
+                borderDirection = RIGHT_BORDER;
+                position = { xIndex: x - 1, yIndex: y + 1 };
+            }
+            else {
+                // Left pixel is set AND south pixel is empty
+                // -> construct linear edge to left neighbour.
+                const squareBoxW = getSquareBox(origin, squareSize, gapSize, x - 1, y);
+                addStraightLine(pathData, squareBoxW.getSouthPoint());
+                position = { xIndex: x - 1, yIndex: y };
+                // Keep borderDirection BOTTOM
+            }
+        }
+        else {
+            console.warn(`[Error] Cannot construct full rounded path; 'borderDirection' has wrong value (${borderDirection}).`);
+            isPathComplete = true;
+        }
+        // End condition reached?
+        if (startingPosition.xIndex === position.xIndex &&
+            startingPosition.yIndex === position.yIndex &&
+            startingBorderDirection === borderDirection) {
+            pathData.push("Z");
+            isPathComplete = true;
+        }
+    }
+};
+//# sourceMappingURL=pixelCornersToRoundPaths.js.map

package/src/_esm/src/ts/utils/algorithms/pixelCornersToRoundPaths.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"pixelCornersToRoundPaths.js","sourceRoot":"","sources":["../../../../../ts/utils/algorithms/pixelCornersToRoundPaths.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAEH,OAAO,EAAE,MAAM,EAAE,MAAM,cAAc,CAAC;AAGtC,OAAO,EAAE,qBAAqB,EAAE,MAAM,yCAAyC,CAAC;AAEhF,MAAM,WAAW,GAAW,CAAC,CAAC;AAC9B,MAAM,UAAU,GAAW,CAAC,CAAC;AAC7B,MAAM,YAAY,GAAW,CAAC,CAAC;AAC/B,MAAM,aAAa,GAAW,CAAC,CAAC;AAShC;;;;;;GAMG;AACH,MAAM,CAAC,MAAM,wBAAwB,GAAG,CACtC,MAAsC,EACtC,OAA+B,EACT,EAAE;IACxB,MAAM,KAAK,GAAyB,EAAE,CAAC;IACvC,MAAM,uBAAuB,GAAG,IAAI,qBAAqB,CAAC,MAAM,CAAC,aAAa,EAAE,MAAM,CAAC,aAAa,EAAE,KAAK,CAAC,CAAC;IAE7G,MAAM,MAAM,GAAa,OAAO,IAAI,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC;IACrF,MAAM,UAAU,GAAW,OAAO,IAAI,OAAO,OAAO,CAAC,UAAU,KAAK,QAAQ,CAAC,CAAC,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC;IACvG,MAAM,OAAO,GAAW,OAAO,IAAI,OAAO,OAAO,CAAC,OAAO,KAAK,QAAQ,CAAC,CAAC,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;IAC7F,MAAM,WAAW,GAAW,OAAO,IAAI,OAAO,OAAO,CAAC,WAAW,KAAK,QAAQ,CAAC,CAAC,CAAC,OAAO,CAAC,WAAW,CAAC,CAAC,CAAC,KAAK,CAAC;IAE7G,qDAAqD;IACrD,MAAM,SAAS,GAAG,CAAC,KAAc,EAAE,CAAS,EAAE,CAAS,EAAE,OAAuC,EAAE,EAAE;QAClG,OAAO,CACL,KAAK,KAAK,IAAI;YACd,uBAAuB,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,KAAK,KAAK;YAC3C,0BAA0B;YAC1B,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,OAAO,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,KAAK,KAAK,CAAC,CAC/C,CAAC;IACJ,CAAC,CAAC;IAEF,kFAAkF;IAClF,MAAM,WAAW,GAAW,MAAM,CAAC,aAAa,GAAG,MAAM,CAAC,aAAa,GAAG,CAAC,CAAC;IAE5E,qCAAqC;IACrC,IAAI,kBAAkC,CAAC;IAEvC,IAAI,CAAC,GAAW,CAAC,CAAC;IAClB,OAAO,CAAC,kBAAkB,GAAG,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,IAAI,CAAC,EAAE,GAAG,WAAW,EAAE,CAAC;QAC1E,yDAAyD;QACzD,oEAAoE;QACpE,mFAAmF;QACnF,MAAM,SAAS,GAAW,YAAY,CAAC,MAAM,EAAE,UAAU,EAAE,OAAO,EAAE,kBAAkB,CAAC,MAAM,EAAE,kBAAkB,CAAC,MAAM,CAAC,CAAC;QAC1H,MAAM,IAAI,GAAa,SAAS,CAAC,YAAY,EAAE,CAAC;QAChD,wDAAwD;QACxD,IAAI,QAAQ,GAAkB;YAC5B,cAAc;YACd,GAAG;YACH,IAAI,CAAC,CAAC;YACN,IAAI,CAAC,CAAC;SACP,CAAC;QACF,iGAAiG;QACjG,eAAe,CACb,QAAQ,EACR,MAAM,EACN,uBAAuB,EACvB,kBAAkB,EAClB,WAAW,EACX,MAAM,EACN,UAAU,EACV,OAAO,EACP,WAAW,CACZ,CAAC;QACF,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QACrB,qCAAqC;IACvC,CAAC;IAED,OAAO,KAAK,CAAC;AACf,CAAC,CAAC;AAEF;;;;;;;;;GASG;AACH,MAAM,YAAY,GAAG,CAAC,MAAgB,EAAE,UAAkB,EAAE,OAAe,EAAE,CAAS,EAAE,CAAS,EAAU,EAAE;IAC3G,OAAO,IAAI,MAAM,CACf;QACE,CAAC,EAAE,MAAM,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,UAAU,GAAG,OAAO,CAAC;QACxC,CAAC,EAAE,MAAM,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,UAAU,GAAG,OAAO,CAAC;KACzC,EACD;QACE,CAAC,EAAE,MAAM,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,UAAU,GAAG,OAAO,CAAC,GAAG,UAAU;QACrD,CAAC,EAAE,MAAM,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,UAAU,GAAG,OAAO,CAAC,GAAG,UAAU;KACtD,CACF,CAAC;AACJ,CAAC,CAAC;AAEF;;;;;;;GAOG;AACH,MAAM,IAAI,GAAG,CAAC,CAAS,EAAE,CAAS,EAAE,UAAU,EAAU,EAAE;IACxD,OAAO,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,UAAU,CAAC;AAClC,CAAC,CAAC;AAEF;;;;;;;;;GASG;AACH,MAAM,cAAc,GAAG,CACrB,QAAuB,EACvB,KAAe,EACf,QAAkB,EAClB,QAAkB,EAClB,GAAa,EACb,WAAmB,EACnB,EAAE;IACF,QAAQ,CAAC,IAAI,CACX,GAAG,EACH,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC,EAAE,WAAW,CAAC,EACtC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC,EAAE,WAAW,CAAC,EACtC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC,EAAE,WAAW,CAAC,EACpC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC,EAAE,WAAW,CAAC,EACpC,GAAG,CAAC,CAAC,EACL,GAAG,CAAC,CAAC,CACN,CAAC;AACJ,CAAC,CAAC;AAEF;;;;;GAKG;AACH,MAAM,eAAe,GAAG,CAAC,QAAuB,EAAE,MAAgB,EAAE,EAAE;IACpE,QAAQ,CAAC,IAAI,CAAC,GAAG,EAAE,MAAM,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC;AACzC,CAAC,CAAC;AAEF;;;;;;;;;;;;;;;GAeG;AACH,MAAM,eAAe,GAAG,CACtB,QAAuB,EACvB,MAAsC,EACtC,wBAAwD,EACxD,gBAAgC,EAChC,uBAA+B,EAC/B,MAAgB,EAChB,UAAkB,EAClB,OAAe,EACf,WAAmB,EACnB,EAAE;IACF,0EAA0E;IAC1E,IAAI,cAAc,GAAY,KAAK,CAAC;IACpC,MAAM,cAAc,GAAG,MAAM,CAAC,aAAa,GAAG,MAAM,CAAC,aAAa,GAAG,CAAC,GAAG,CAAC,CAAC;IAC3E,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,IAAI,QAAQ,GAAG,gBAAgB,CAAC;IAChC,IAAI,eAAe,GAAG,uBAAuB,CAAC;IAE9C,OAAO,CAAC,cAAc,IAAI,CAAC,EAAE,GAAG,cAAc,EAAE,CAAC;QAC/C,IAAI,CAAC,GAAG,QAAQ,CAAC,MAAM,CAAC;QACxB,IAAI,CAAC,GAAG,QAAQ,CAAC,MAAM,CAAC;QACxB,mEAAmE;QACnE,8BAA8B;QAC9B,MAAM,SAAS,GAAW,YAAY,CAAC,MAAM,EAAE,UAAU,EAAE,OAAO,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QAC1E,0CAA0C;QAC1C,IAAI,eAAe,KAAK,WAAW,EAAE,CAAC;YACpC,gFAAgF;YAChF,wBAAwB,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC;YACzC,oCAAoC;YACpC,MAAM,IAAI,GAAa,SAAS,CAAC,YAAY,EAAE,CAAC;YAChD,sBAAsB;YACtB,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,KAAK,KAAK,EAAE,CAAC;gBAChD,2BAA2B;gBAC3B,sCAAsC;gBACtC,cAAc,CACZ,QAAQ,EACR,IAAI,EACJ,SAAS,CAAC,iBAAiB,EAAE,EAC7B,SAAS,CAAC,iBAAiB,EAAE,EAC7B,SAAS,CAAC,aAAa,EAAE,EACzB,WAAW,CACZ,CAAC;gBACF,eAAe,GAAG,UAAU,CAAC;gBAC7B,gCAAgC;YAClC,CAAC;iBAAM,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,MAAM,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,KAAK,IAAI,EAAE,CAAC;gBAC3D,4DAA4D;gBAC5D,yCAAyC;gBACzC,MAAM,WAAW,GAAW,YAAY,CAAC,MAAM,EAAE,UAAU,EAAE,OAAO,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;gBACpF,cAAc,CACZ,QAAQ,EACR,IAAI,EACJ,SAAS,CAAC,iBAAiB,EAAE,EAC7B,WAAW,CAAC,iBAAiB,EAAE,EAC/B,WAAW,CAAC,aAAa,EAAE,EAC3B,WAAW,CACZ,CAAC;gBACF,eAAe,GAAG,aAAa,CAAC;gBAChC,QAAQ,GAAG,EAAE,MAAM,EAAE,CAAC,GAAG,CAAC,EAAE,MAAM,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC;YAC9C,CAAC;iBAAM,CAAC;gBACN,kBAAkB;gBAClB,MAAM,UAAU,GAAW,YAAY,CAAC,MAAM,EAAE,UAAU,EAAE,OAAO,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;gBAC/E,eAAe,CAAC,QAAQ,EAAE,UAAU,CAAC,YAAY,EAAE,CAAC,CAAC;gBACrD,QAAQ,GAAG,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC;gBACxC,oCAAoC;gBACpC,iCAAiC;YACnC,CAAC;QACH,CAAC;aAAM,IAAI,eAAe,KAAK,UAAU,EAAE,CAAC;YAC1C,mCAAmC;YACnC,MAAM,KAAK,GAAa,SAAS,CAAC,aAAa,EAAE,CAAC;YAClD,IAAI,CAAC,GAAG,CAAC,IAAI,MAAM,CAAC,aAAa,IAAI,MAAM,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,KAAK,KAAK,EAAE,CAAC;gBACpE,sCAAsC;gBACtC,4CAA4C;gBAC5C,cAAc,CACZ,QAAQ,EACR,KAAK,EACL,SAAS,CAAC,iBAAiB,EAAE,EAC7B,SAAS,CAAC,iBAAiB,EAAE,EAC7B,SAAS,CAAC,YAAY,EAAE,EACxB,WAAW,CACZ,CAAC;gBACF,eAAe,GAAG,YAAY,CAAC;gBAC/B,gCAAgC;YAClC,CAAC;iBAAM,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,MAAM,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,KAAK,KAAK,EAAE,CAAC;gBAC3D,oEAAoE;gBACpE,0BAA0B;gBAC1B,MAAM,UAAU,GAAW,YAAY,CAAC,MAAM,EAAE,UAAU,EAAE,OAAO,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;gBAC/E,eAAe,CAAC,QAAQ,EAAE,UAAU,CAAC,aAAa,EAAE,CAAC,CAAC;gBACtD,QAAQ,GAAG,EAAE,MAAM,EAAE,CAAC,GAAG,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC;gBACxC,2BAA2B;YAC7B,CAAC;iBAAM,CAAC;gBACN,gEAAgE;gBAChE,8CAA8C;gBAC9C,MAAM,WAAW,GAAW,YAAY,CAAC,MAAM,EAAE,UAAU,EAAE,OAAO,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;gBACpF,cAAc,CACZ,QAAQ,EACR,KAAK,EACL,SAAS,CAAC,iBAAiB,EAAE,EAC7B,WAAW,CAAC,iBAAiB,EAAE,EAC/B,WAAW,CAAC,YAAY,EAAE,EAC1B,WAAW,CACZ,CAAC;gBACF,eAAe,GAAG,WAAW,CAAC;gBAC9B,QAAQ,GAAG,EAAE,MAAM,EAAE,CAAC,GAAG,CAAC,EAAE,MAAM,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC;gBAC5C,oCAAoC;YACtC,CAAC;QACH,CAAC;aAAM,IAAI,eAAe,KAAK,YAAY,EAAE,CAAC;YAC5C,kCAAkC;YAClC,IAAI,IAAI,GAAG,SAAS,CAAC,YAAY,EAAE,CAAC;YACpC,IAAI,CAAC,GAAG,CAAC,IAAI,MAAM,CAAC,aAAa,IAAI,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,KAAK,KAAK,EAAE,CAAC;gBACpE,wBAAwB;gBACxB,4CAA4C;gBAC5C,cAAc,CACZ,QAAQ,EACR,IAAI,EACJ,SAAS,CAAC,iBAAiB,EAAE,EAC7B,SAAS,CAAC,iBAAiB,EAAE,EAC7B,SAAS,CAAC,aAAa,EAAE,EACzB,WAAW,CACZ,CAAC;gBACF,eAAe,GAAG,aAAa,CAAC;gBAChC,gCAAgC;YAClC,CAAC;iBAAM,IAAI,CAAC,GAAG,CAAC,GAAG,MAAM,CAAC,aAAa,IAAI,CAAC,GAAG,CAAC,GAAG,MAAM,CAAC,aAAa,IAAI,MAAM,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,KAAK,IAAI,EAAE,CAAC;gBAC7G,wDAAwD;gBACxD,2CAA2C;gBAC3C,MAAM,WAAW,GAAW,YAAY,CAAC,MAAM,EAAE,UAAU,EAAE,OAAO,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;gBACpF,cAAc,CACZ,QAAQ,EACR,IAAI,EACJ,SAAS,CAAC,iBAAiB,EAAE,EAC7B,WAAW,CAAC,iBAAiB,EAAE,EAC/B,WAAW,CAAC,aAAa,EAAE,EAC3B,WAAW,CACZ,CAAC;gBACF,eAAe,GAAG,UAAU,CAAC;gBAC7B,QAAQ,GAAG,EAAE,MAAM,EAAE,CAAC,GAAG,CAAC,EAAE,MAAM,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC;YAC9C,CAAC;iBAAM,CAAC;gBACN,oDAAoD;gBACpD,0CAA0C;gBAC1C,MAAM,UAAU,GAAW,YAAY,CAAC,MAAM,EAAE,UAAU,EAAE,OAAO,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;gBAC/E,eAAe,CAAC,QAAQ,EAAE,UAAU,CAAC,YAAY,EAAE,CAAC,CAAC;gBACrD,QAAQ,GAAG,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC;gBACxC,6BAA6B;YAC/B,CAAC;QACH,CAAC;aAAM,IAAI,eAAe,KAAK,aAAa,EAAE,CAAC;YAC7C,uCAAuC;YACvC,MAAM,KAAK,GAAa,SAAS,CAAC,aAAa,EAAE,CAAC;YAClD,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,MAAM,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,KAAK,KAAK,EAAE,CAAC;gBAChD,sBAAsB;gBACtB,0CAA0C;gBAC1C,cAAc,CACZ,QAAQ,EACR,KAAK,EACL,SAAS,CAAC,iBAAiB,EAAE,EAC7B,SAAS,CAAC,iBAAiB,EAAE,EAC7B,SAAS,CAAC,YAAY,EAAE,EACxB,WAAW,CACZ,CAAC;gBACF,eAAe,GAAG,WAAW,CAAC;YAChC,CAAC;iBAAM,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,MAAM,CAAC,aAAa,IAAI,MAAM,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,KAAK,IAAI,EAAE,CAAC;gBAC3F,0CAA0C;gBAC1C,0CAA0C;gBAC1C,MAAM,WAAW,GAAW,YAAY,CAAC,MAAM,EAAE,UAAU,EAAE,OAAO,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;gBACpF,cAAc,CACZ,QAAQ,EACR,KAAK,EACL,SAAS,CAAC,iBAAiB,EAAE,EAC7B,WAAW,CAAC,iBAAiB,EAAE,EAC/B,WAAW,CAAC,YAAY,EAAE,EAC1B,WAAW,CACZ,CAAC;gBACF,eAAe,GAAG,YAAY,CAAC;gBAC/B,QAAQ,GAAG,EAAE,MAAM,EAAE,CAAC,GAAG,CAAC,EAAE,MAAM,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC;YAC9C,CAAC;iBAAM,CAAC;gBACN,6CAA6C;gBAC7C,8CAA8C;gBAC9C,MAAM,UAAU,GAAW,YAAY,CAAC,MAAM,EAAE,UAAU,EAAE,OAAO,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;gBAC/E,eAAe,CAAC,QAAQ,EAAE,UAAU,CAAC,aAAa,EAAE,CAAC,CAAC;gBACtD,QAAQ,GAAG,EAAE,MAAM,EAAE,CAAC,GAAG,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC;gBACxC,8BAA8B;YAChC,CAAC;QACH,CAAC;aAAM,CAAC;YACN,OAAO,CAAC,IAAI,CAAC,kFAAkF,eAAe,IAAI,CAAC,CAAC;YACpH,cAAc,GAAG,IAAI,CAAC;QACxB,CAAC;QAED,yBAAyB;QACzB,IACE,gBAAgB,CAAC,MAAM,KAAK,QAAQ,CAAC,MAAM;YAC3C,gBAAgB,CAAC,MAAM,KAAK,QAAQ,CAAC,MAAM;YAC3C,uBAAuB,KAAK,eAAe,EAC3C,CAAC;YACD,QAAQ,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YACnB,cAAc,GAAG,IAAI,CAAC;QACxB,CAAC;IACH,CAAC;AACH,CAAC,CAAC"}