plotboilerplate 1.27.0 → 1.28.0

package/src/_cjs/utils/datastructures/GirihTile.d.ts

@@ -0,0 +1,283 @@
+/**
+ * @author   Ikaros Kappler
+ * @date     2013-11-27
+ * @modified 2014-04-05 Ikaros Kappler (member array outerTilePolygons added).
+ * @modified 2015-03-19 Ikaros Kappler (added toSVG()).
+ * @modified 2020-10-30 Refactored the this super class to work with PlotBoilerplate.
+ * @modified 2020-11-11 Ported the class from vanilla JS to TypeScript.
+ * @version  2.0.1-alpha
+ * @name GirihTile
+ **/
+import { Bounds } from "../../Bounds";
+import { Polygon } from "../../Polygon";
+import { Vertex } from "../../Vertex";
+import { XYCoords } from "../../interfaces";
+export declare enum TileType {
+    UNKNOWN = "UNKNOWN",
+    DECAGON = "DECAGON",
+    PENTAGON = "PENTAGON",
+    IRREGULAR_HEXAGON = "IRREGULAR_HEXAGON",
+    RHOMBUS = "RHOMBUS",
+    BOW_TIE = "BOW_TIE",
+    PENROSE_RHOMBUS = "PENROSE_RHOMBUS"
+}
+export interface IAdjacency {
+    edgeIndex: number;
+    offset: XYCoords;
+}
+/**
+ * @classdesc This is a general tile superclass. All other tile classes extends this one.
+ *
+ * Rule:
+ *  * the outer and the inner sub polygons must be inside the main polygon's bounds.
+ *
+ * @requires Bounds
+ * @requires Polyon
+ * @requires Vertex
+ * @requires XYCoords
+ */
+export declare abstract class GirihTile extends Polygon {
+    /**
+     * The center of this tile.
+     *
+     * @name position
+     * @member {Vertex}
+     * @memberof GirihTile
+     * @type {Vertex}
+     * @instance
+     */
+    position: Vertex;
+    /**
+     * The edge length of this tile (all edges of a Girih tile have same length).
+     *
+     * @name edgeLength
+     * @member {number}
+     * @memberof GirihTile
+     * @type {number}
+     * @readonly
+     * @instance
+     */
+    readonly edgeLength: number;
+    /**
+     * The rotation of this tile. This is stored to make cloning easier.
+     *
+     * @name rotation.
+     * @member {number}
+     * @memberof GirihTile
+     * @type {number}
+     * @instance
+     */
+    rotation: number;
+    /**
+     * The symmetry (=order) of this tile. This is the number of steps used for a full
+     * rotation (in this Girih case: 10). Future Girih implementations might have other symmetries.
+     *
+     * @name symmetry
+     * @member {number}
+     * @memberof GirihTile
+     * @type {number}
+     * @instance
+     */
+    symmetry: number;
+    /**
+     * The unique symmetries. This must be an nth part of the global `symmetry`.
+     * Rotating this tile `uniqueSymmetries' times results in the same visual tile (flipped around
+     * a symmetry axis).
+     *
+     * @name uniqueSymmetries
+     * @member {number}
+     * @memberof GirihTile
+     * @type {number}
+     * @instance
+     */
+    uniqueSymmetries: number;
+    /**
+     * The inner tile polygons.
+     *
+     * @name innerTilePolygons
+     * @member {Array<Polygon>}
+     * @memberof GirihTile
+     * @type {Array<Polygon>}
+     * @instance
+     */
+    innerTilePolygons: Array<Polygon>;
+    /**
+     * The outer tile polygons.
+     *
+     * @name outerTilePolygons
+     * @member {Array<Polygon>}
+     * @memberof GirihTile
+     * @type {Array<Polygon>}
+     * @instance
+     */
+    outerTilePolygons: Array<Polygon>;
+    /**
+     * An identifier for the tile type.
+     *
+     * @name tileType
+     * @member {TileType}
+     * @memberof GirihTile
+     * @type {TileType}
+     * @instance
+     */
+    tileType: TileType;
+    /**
+     * The initial bounds (of the un-rotated tile). These are required to calculate the
+     * correct texture mapping.
+     *
+     * @name baseBounds
+     * @member {Bounds}
+     * @memberof GirihTile
+     * @type {Bounds}
+     * @instance
+     */
+    baseBounds: Bounds;
+    /**
+     * A rectangle on the shipped texture image (`girihtexture-500px.png`) marking the
+     * texture position. The bounds are relative, so each component must be in [0..1].
+     * The texture is a square.
+     *
+     * @name textureSource
+     * @member {Bounds}
+     * @memberof GirihTile
+     * @type {Bounds}
+     * @instance
+     */
+    readonly textureSource: Bounds;
+    /**
+     * An epsilon to use for detecting adjacent edges. 0.001 seems to be a good value.
+     * Adjust if needed.
+     *
+     * @name epsilon
+     * @member {number}
+     * @memberof GirihTile
+     * @type {number}
+     * @static
+     */
+    static epsilon: number;
+    /**
+     * The default edge length.
+     *
+     * @name DEFAULT_EDGE_LENGTH
+     * @member {number}
+     * @memberof GirihTile
+     * @type {number}
+     * @readonly
+     * @static
+     */
+    static readonly DEFAULT_EDGE_LENGTH: number;
+    /**
+     * @constructor
+     * @memberof GirihTile
+     * @abstract class
+     * @param {Vertex} position   - The position of the tile.
+     * @param {number} edgeLength - The edge length (default is GirihTile.DEFAULT_EDGE_LENGTH).
+     * @param {TileType} tileType - One of `TileType.*` enum members.
+     **/
+    constructor(position: Vertex, edgeLength?: number, tileType?: TileType);
+    /**
+     * @abstract Subclasses must override this.
+     */
+    abstract clone(): GirihTile;
+    /**
+     * Move this tile around (together will all inner polygons).
+     * As this function overrides Polygon.move(...), the returned
+     * instance (this) must be of type `Polygon`.
+     *
+     * @name move
+     * @instance
+     * @override
+     * @memberof GirihTile
+     * @param {XYCoords} amount
+     * @return {Polygon} this
+     */
+    move(amount: XYCoords): Polygon;
+    /**
+     * Find the adjacent tile (given by the template tile)
+     * Note that the tile itself will be modified (rotated and moved to the correct position).
+     *
+     * @name findAdjacentTilePosition
+     * @memberof GirihTile
+     * @instance
+     * @param {number} edgeIndex - The edge number of the you you want to find adjacency for.
+     * @param {Polygon} tile - The polygon (or tile) you want to find adjacency for at the specified edge.
+     * @return {IAdjacency|null} Adjacency information or null if the passed tile does not match.
+     */
+    findAdjacentTilePosition(edgeIndex: number, tile: Polygon): IAdjacency | null;
+    /**
+     * Find all possible adjacent tile positions (and rotations) for `neighbourTile`.
+     *
+     * @name transformTileToAdjacencies
+     * @memberof GirihTile
+     * @instance
+     * @param {number} baseEdgeIndex - The edge number of the you you want to find adjacencies for.
+     * @param {GirihTile} neighbourTile - The polygon (or tile) you want to find adjacencies for at the specified edge.
+     * @return {IAdjacency|null} Adjacency information or null if the passed tile does not match.
+     */
+    transformTileToAdjacencies(baseEdgeIndex: number, neighbourTile: GirihTile): Array<GirihTile>;
+    /**
+     * Apply adjacent tile position to `neighbourTile`.
+     *
+     * @name transformTilePositionToAdjacencies
+     * @memberof GirihTile
+     * @instance
+     * @param {number} baseEdgeIndex - The edge number of the you you want to apply adjacent position for.
+     * @param {Polygon} neighbourTile - The polygon (or tile) you want to find adjacency for at the specified edge.
+     * @return {Polygon|null} the passed tile itself if adjacency was found, null otherwise.
+     */
+    transformTilePositionToAdjacency<P extends Polygon>(baseEdgeIndex: number, neighbourTile: P): P | null;
+    /**
+     * Get the inner tile polygon at the given index.
+     * This function applies MOD to the index.
+     *
+     * @name getInnerTilePolygonAt
+     * @instance
+     * @memberof GirihTile
+     * @param {number} index
+     * @return {Polygon} The sub polygon (inner tile) at the given index.
+     **/
+    getInnerTilePolygonAt(index: number): Polygon;
+    /**
+     * Get the outer tile polygon at the given index.
+     * This function applies MOD to the index.
+     *
+     * @name getOuterTilePolygonAt
+     * @instance
+     * @memberof GirihTile
+     * @param {number} index
+     * @return {Polygon} The sub polygon (outer tile) at the given index.
+     **/
+    getOuterTilePolygonAt(index: number): Polygon;
+    /**
+     * Rotate this tile
+     * Note: this function behaves a bitdifferent than the genuine Polygon.rotate function!
+     *       Polygon has the default center of rotation at (0,0).
+     *       The GirihTile rotates around its center (position) by default.
+     *
+     * @name rotate
+     * @instance
+     * @memberof GirihTile
+     * @param {number} angle - The angle to use for rotation.
+     * @param {Vertex?} center - The center of rotation (default is this.position).
+     * @return {Polygon} this
+     **/
+    rotate(angle: number, center?: Vertex): GirihTile;
+    /**
+     * This function locates the closest tile edge (polygon edge)
+     * to the passed point.
+     *
+     * Currently the edge distance to a point is measured by the
+     * euclidian distance from the edge's middle point.
+     *
+     * Idea: move this function to Polygon?
+     *
+     * @name locateEdgeAtPoint
+     * @instance
+     * @memberof GirihTile
+     * @param {XYCoords} point     - The point to detect the closest edge for.
+     * @param {number}   tolerance - The tolerance (=max distance) the detected edge
+     *                               must be inside.
+     * @return {nmber} the edge index (index of the starting vertex, so [index,index+1] is the edge ) or -1 if not found.
+     **/
+    locateEdgeAtPoint(point: XYCoords, tolerance: number): number;
+}

package/src/_cjs/utils/datastructures/GirihTile.js

@@ -0,0 +1,308 @@
+"use strict";
+/**
+ * @author   Ikaros Kappler
+ * @date     2013-11-27
+ * @modified 2014-04-05 Ikaros Kappler (member array outerTilePolygons added).
+ * @modified 2015-03-19 Ikaros Kappler (added toSVG()).
+ * @modified 2020-10-30 Refactored the this super class to work with PlotBoilerplate.
+ * @modified 2020-11-11 Ported the class from vanilla JS to TypeScript.
+ * @version  2.0.1-alpha
+ * @name GirihTile
+ **/
+var __extends = (this && this.__extends) || (function () {
+    var extendStatics = function (d, b) {
+        extendStatics = Object.setPrototypeOf ||
+            ({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) ||
+            function (d, b) { for (var p in b) if (Object.prototype.hasOwnProperty.call(b, p)) d[p] = b[p]; };
+        return extendStatics(d, b);
+    };
+    return function (d, b) {
+        if (typeof b !== "function" && b !== null)
+            throw new TypeError("Class extends value " + String(b) + " is not a constructor or null");
+        extendStatics(d, b);
+        function __() { this.constructor = d; }
+        d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());
+    };
+})();
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.GirihTile = exports.TileType = void 0;
+var Bounds_1 = require("../../Bounds");
+var Line_1 = require("../../Line");
+var Polygon_1 = require("../../Polygon");
+var Vertex_1 = require("../../Vertex");
+var TileType;
+(function (TileType) {
+    TileType["UNKNOWN"] = "UNKNOWN";
+    TileType["DECAGON"] = "DECAGON";
+    TileType["PENTAGON"] = "PENTAGON";
+    TileType["IRREGULAR_HEXAGON"] = "IRREGULAR_HEXAGON";
+    TileType["RHOMBUS"] = "RHOMBUS";
+    TileType["BOW_TIE"] = "BOW_TIE";
+    // This is not part of the actual girih tile set!
+    TileType["PENROSE_RHOMBUS"] = "PENROSE_RHOMBUS";
+})(TileType || (exports.TileType = TileType = {}));
+/**
+ * @classdesc This is a general tile superclass. All other tile classes extends this one.
+ *
+ * Rule:
+ *  * the outer and the inner sub polygons must be inside the main polygon's bounds.
+ *
+ * @requires Bounds
+ * @requires Polyon
+ * @requires Vertex
+ * @requires XYCoords
+ */
+var GirihTile = /** @class */ (function (_super) {
+    __extends(GirihTile, _super);
+    /**
+     * @constructor
+     * @memberof GirihTile
+     * @abstract class
+     * @param {Vertex} position   - The position of the tile.
+     * @param {number} edgeLength - The edge length (default is GirihTile.DEFAULT_EDGE_LENGTH).
+     * @param {TileType} tileType - One of `TileType.*` enum members.
+     **/
+    function GirihTile(position, edgeLength, tileType) {
+        var _this = _super.call(this, [], false) || this; // vertices, isOpen
+        if (typeof edgeLength === "undefined")
+            edgeLength = GirihTile.DEFAULT_EDGE_LENGTH;
+        if (typeof tileType == "undefined")
+            tileType = TileType.UNKNOWN;
+        _this.edgeLength = edgeLength;
+        _this.position = position;
+        _this.rotation = 0.0; // angle;
+        _this.symmetry = 10;
+        _this.uniqueSymmetries = 10;
+        // An array of polygons.
+        // The inner tile polygons are those that do not share edges with the outer
+        // tile bounds (vertices are OK).
+        _this.innerTilePolygons = [];
+        // A second array of polygons.
+        // The outer tile polygons are those that make up the whole tile area
+        // _together with the inner tile polygons (!)_; the union of the
+        // inner tile polygons and the outer tile polygons covers exactly
+        // the whole tile polygon.
+        // The intersection of both sets is empty.
+        // Outer tile polygon share at least one (partial) edge with the complete
+        // tile polygon (length > 0).
+        _this.outerTilePolygons = [];
+        // this.imageProperties      = null;
+        _this.textureSource = new Bounds_1.Bounds(new Vertex_1.Vertex(), new Vertex_1.Vertex());
+        _this.tileType = tileType;
+        return _this;
+    }
+    /**
+     * Move this tile around (together will all inner polygons).
+     * As this function overrides Polygon.move(...), the returned
+     * instance (this) must be of type `Polygon`.
+     *
+     * @name move
+     * @instance
+     * @override
+     * @memberof GirihTile
+     * @param {XYCoords} amount
+     * @return {Polygon} this
+     */
+    GirihTile.prototype.move = function (amount) {
+        _super.prototype.move.call(this, amount);
+        for (var i in this.innerTilePolygons)
+            this.innerTilePolygons[i].move(amount);
+        for (var i in this.outerTilePolygons)
+            this.outerTilePolygons[i].move(amount);
+        this.position.add(amount);
+        return this;
+    };
+    /**
+     * Find the adjacent tile (given by the template tile)
+     * Note that the tile itself will be modified (rotated and moved to the correct position).
+     *
+     * @name findAdjacentTilePosition
+     * @memberof GirihTile
+     * @instance
+     * @param {number} edgeIndex - The edge number of the you you want to find adjacency for.
+     * @param {Polygon} tile - The polygon (or tile) you want to find adjacency for at the specified edge.
+     * @return {IAdjacency|null} Adjacency information or null if the passed tile does not match.
+     */
+    GirihTile.prototype.findAdjacentTilePosition = function (edgeIndex, tile) {
+        var edgeA = new Line_1.Line(this.vertices[edgeIndex % this.vertices.length], this.vertices[(edgeIndex + 1) % this.vertices.length]);
+        // Find adjacent edge
+        for (var i = 0; i < tile.vertices.length; i++) {
+            var edgeB = new Line_1.Line(tile.vertices[i % tile.vertices.length].clone(), tile.vertices[(i + 1) % tile.vertices.length].clone());
+            // Goal: edgeA.a==edgeB.b && edgeA.b==edgeB.a
+            // So move edgeB
+            var offset = edgeB.b.difference(edgeA.a);
+            edgeB.add(offset);
+            if (edgeB.a.distance(edgeA.b) < GirihTile.epsilon) {
+                return { edgeIndex: i, offset: offset };
+            }
+        }
+        return null;
+    };
+    /**
+     * Find all possible adjacent tile positions (and rotations) for `neighbourTile`.
+     *
+     * @name transformTileToAdjacencies
+     * @memberof GirihTile
+     * @instance
+     * @param {number} baseEdgeIndex - The edge number of the you you want to find adjacencies for.
+     * @param {GirihTile} neighbourTile - The polygon (or tile) you want to find adjacencies for at the specified edge.
+     * @return {IAdjacency|null} Adjacency information or null if the passed tile does not match.
+     */
+    GirihTile.prototype.transformTileToAdjacencies = function (baseEdgeIndex, neighbourTile) {
+        // Find a rotation for that tile to match
+        var i = 0;
+        var foundAlignments = [];
+        var positionedTile = null;
+        while (i < neighbourTile.uniqueSymmetries) {
+            positionedTile = this.transformTilePositionToAdjacency(baseEdgeIndex, neighbourTile);
+            if (positionedTile != null) {
+                positionedTile = positionedTile.clone();
+                foundAlignments.push(positionedTile);
+            }
+            neighbourTile.rotate((Math.PI * 2) / neighbourTile.symmetry);
+            i++;
+        }
+        return foundAlignments;
+    };
+    /**
+     * Apply adjacent tile position to `neighbourTile`.
+     *
+     * @name transformTilePositionToAdjacencies
+     * @memberof GirihTile
+     * @instance
+     * @param {number} baseEdgeIndex - The edge number of the you you want to apply adjacent position for.
+     * @param {Polygon} neighbourTile - The polygon (or tile) you want to find adjacency for at the specified edge.
+     * @return {Polygon|null} the passed tile itself if adjacency was found, null otherwise.
+     */
+    GirihTile.prototype.transformTilePositionToAdjacency = function (baseEdgeIndex, neighbourTile) {
+        // Find the position for that tile to match (might not exist)
+        // { edgeIndex:number, offset:XYCoords }
+        var adjacency = this.findAdjacentTilePosition(baseEdgeIndex, neighbourTile);
+        if (adjacency != null) {
+            neighbourTile.move(adjacency.offset);
+            return neighbourTile;
+        }
+        return null;
+    };
+    /**
+     * Get the inner tile polygon at the given index.
+     * This function applies MOD to the index.
+     *
+     * @name getInnerTilePolygonAt
+     * @instance
+     * @memberof GirihTile
+     * @param {number} index
+     * @return {Polygon} The sub polygon (inner tile) at the given index.
+     **/
+    GirihTile.prototype.getInnerTilePolygonAt = function (index) {
+        if (index < 0)
+            return this.innerTilePolygons[this.innerTilePolygons.length - (Math.abs(index) % this.innerTilePolygons.length)];
+        else
+            return this.innerTilePolygons[index % this.innerTilePolygons.length];
+    };
+    /**
+     * Get the outer tile polygon at the given index.
+     * This function applies MOD to the index.
+     *
+     * @name getOuterTilePolygonAt
+     * @instance
+     * @memberof GirihTile
+     * @param {number} index
+     * @return {Polygon} The sub polygon (outer tile) at the given index.
+     **/
+    GirihTile.prototype.getOuterTilePolygonAt = function (index) {
+        if (index < 0)
+            return this.outerTilePolygons[this.outerTilePolygons.length - (Math.abs(index) % this.outerTilePolygons.length)];
+        else
+            return this.outerTilePolygons[index % this.outerTilePolygons.length];
+    };
+    /**
+     * Rotate this tile
+     * Note: this function behaves a bitdifferent than the genuine Polygon.rotate function!
+     *       Polygon has the default center of rotation at (0,0).
+     *       The GirihTile rotates around its center (position) by default.
+     *
+     * @name rotate
+     * @instance
+     * @memberof GirihTile
+     * @param {number} angle - The angle to use for rotation.
+     * @param {Vertex?} center - The center of rotation (default is this.position).
+     * @return {Polygon} this
+     **/
+    GirihTile.prototype.rotate = function (angle, center) {
+        if (typeof center === "undefined")
+            center = this.position;
+        _super.prototype.rotate.call(this, angle, center);
+        for (var i in this.innerTilePolygons) {
+            this.innerTilePolygons[i].rotate(angle, center);
+        }
+        for (var i in this.outerTilePolygons) {
+            this.outerTilePolygons[i].rotate(angle, center);
+        }
+        this.rotation += angle;
+        return this;
+    };
+    /**
+     * This function locates the closest tile edge (polygon edge)
+     * to the passed point.
+     *
+     * Currently the edge distance to a point is measured by the
+     * euclidian distance from the edge's middle point.
+     *
+     * Idea: move this function to Polygon?
+     *
+     * @name locateEdgeAtPoint
+     * @instance
+     * @memberof GirihTile
+     * @param {XYCoords} point     - The point to detect the closest edge for.
+     * @param {number}   tolerance - The tolerance (=max distance) the detected edge
+     *                               must be inside.
+     * @return {nmber} the edge index (index of the starting vertex, so [index,index+1] is the edge ) or -1 if not found.
+     **/
+    GirihTile.prototype.locateEdgeAtPoint = function (point, tolerance) {
+        if (this.vertices.length == 0)
+            return -1;
+        var middle = new Vertex_1.Vertex(0, 0);
+        var tmpDistance = 0;
+        var resultDistance = tolerance * 2; // definitely outside the tolerance :)
+        var resultIndex = -1;
+        for (var i = 0; i < this.vertices.length; i++) {
+            var vertI = this.getVertexAt(i);
+            var vertJ = this.getVertexAt(i + 1);
+            // Create a point in the middle of the edge
+            middle.x = vertI.x + (vertJ.x - vertI.x) / 2.0;
+            middle.y = vertI.y + (vertJ.y - vertI.y) / 2.0;
+            tmpDistance = middle.distance(point);
+            if (tmpDistance <= tolerance && (resultIndex == -1 || tmpDistance < resultDistance)) {
+                resultDistance = tmpDistance;
+                resultIndex = i;
+            }
+        }
+        return resultIndex;
+    };
+    /**
+     * An epsilon to use for detecting adjacent edges. 0.001 seems to be a good value.
+     * Adjust if needed.
+     *
+     * @name epsilon
+     * @member {number}
+     * @memberof GirihTile
+     * @type {number}
+     * @static
+     */
+    GirihTile.epsilon = 0.001;
+    /**
+     * The default edge length.
+     *
+     * @name DEFAULT_EDGE_LENGTH
+     * @member {number}
+     * @memberof GirihTile
+     * @type {number}
+     * @readonly
+     * @static
+     */
+    GirihTile.DEFAULT_EDGE_LENGTH = 58;
+    return GirihTile;
+}(Polygon_1.Polygon)); // END class
+exports.GirihTile = GirihTile;
+//# sourceMappingURL=GirihTile.js.map

package/src/_cjs/utils/datastructures/GirihTile.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"GirihTile.js","sourceRoot":"","sources":["../../../ts/utils/datastructures/GirihTile.ts"],"names":[],"mappings":";AAAA;;;;;;;;;IASI;;;;;;;;;;;;;;;;;;AAEJ,uCAAsC;AACtC,mCAAkC;AAClC,yCAAwC;AACxC,uCAAsC;AAGtC,IAAY,QASX;AATD,WAAY,QAAQ;IAClB,+BAAmB,CAAA;IACnB,+BAAmB,CAAA;IACnB,iCAAqB,CAAA;IACrB,mDAAuC,CAAA;IACvC,+BAAmB,CAAA;IACnB,+BAAmB,CAAA;IACnB,iDAAiD;IACjD,+CAAmC,CAAA;AACrC,CAAC,EATW,QAAQ,wBAAR,QAAQ,QASnB;AAOD;;;;;;;;;;GAUG;AACH;IAAwC,6BAAO;IA8I7C;;;;;;;QAOI;IACJ,mBAAY,QAAgB,EAAE,UAAmB,EAAE,QAAmB;QACpE,YAAA,MAAK,YAAC,EAAE,EAAE,KAAK,CAAC,SAAC,CAAC,mBAAmB;QAErC,IAAI,OAAO,UAAU,KAAK,WAAW;YAAE,UAAU,GAAG,SAAS,CAAC,mBAAmB,CAAC;QAClF,IAAI,OAAO,QAAQ,IAAI,WAAW;YAAE,QAAQ,GAAG,QAAQ,CAAC,OAAO,CAAC;QAEhE,KAAI,CAAC,UAAU,GAAG,UAAU,CAAC;QAC7B,KAAI,CAAC,QAAQ,GAAG,QAAQ,CAAC;QACzB,KAAI,CAAC,QAAQ,GAAG,GAAG,CAAC,CAAC,SAAS;QAC9B,KAAI,CAAC,QAAQ,GAAG,EAAE,CAAC;QACnB,KAAI,CAAC,gBAAgB,GAAG,EAAE,CAAC;QAE3B,wBAAwB;QACxB,2EAA2E;QAC3E,iCAAiC;QACjC,KAAI,CAAC,iBAAiB,GAAG,EAAE,CAAC;QAE5B,8BAA8B;QAC9B,qEAAqE;QACrE,gEAAgE;QAChE,iEAAiE;QACjE,0BAA0B;QAC1B,0CAA0C;QAC1C,yEAAyE;QACzE,6BAA6B;QAC7B,KAAI,CAAC,iBAAiB,GAAG,EAAE,CAAC;QAC5B,oCAAoC;QACpC,KAAI,CAAC,aAAa,GAAG,IAAI,eAAM,CAAC,IAAI,eAAM,EAAE,EAAE,IAAI,eAAM,EAAE,CAAC,CAAC;QAE5D,KAAI,CAAC,QAAQ,GAAG,QAAQ,CAAC;;IAC3B,CAAC;IAOD;;;;;;;;;;;OAWG;IACH,wBAAI,GAAJ,UAAK,MAAgB;QACnB,gBAAK,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;QAC9B,KAAK,IAAI,CAAC,IAAI,IAAI,CAAC,iBAAiB;YAAE,IAAI,CAAC,iBAAiB,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QAC7E,KAAK,IAAI,CAAC,IAAI,IAAI,CAAC,iBAAiB;YAAE,IAAI,CAAC,iBAAiB,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QAC7E,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QAC1B,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;;;;;;;;;OAUG;IACH,4CAAwB,GAAxB,UAAyB,SAAiB,EAAE,IAAa;QACvD,IAAM,KAAK,GAAS,IAAI,WAAI,CAC1B,IAAI,CAAC,QAAQ,CAAC,SAAS,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,EAC/C,IAAI,CAAC,QAAQ,CAAC,CAAC,SAAS,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,CACtD,CAAC;QACF,qBAAqB;QACrB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC9C,IAAM,KAAK,GAAS,IAAI,WAAI,CAC1B,IAAI,CAAC,QAAQ,CAAC,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,KAAK,EAAE,EAC/C,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,KAAK,EAAE,CACtD,CAAC;YACF,6CAA6C;YAC7C,gBAAgB;YAChB,IAAM,MAAM,GAAa,KAAK,CAAC,CAAC,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;YACrD,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YAClB,IAAI,KAAK,CAAC,CAAC,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC,OAAO,EAAE,CAAC;gBAClD,OAAO,EAAE,SAAS,EAAE,CAAC,EAAE,MAAM,EAAE,MAAM,EAAgB,CAAC;YACxD,CAAC;QACH,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;;;;;;;;OASG;IACH,8CAA0B,GAA1B,UAA2B,aAAqB,EAAE,aAAwB;QACxE,yCAAyC;QACzC,IAAI,CAAC,GAAW,CAAC,CAAC;QAClB,IAAM,eAAe,GAAqB,EAAE,CAAC;QAC7C,IAAI,cAAc,GAAqB,IAAI,CAAC;QAC5C,OAAO,CAAC,GAAG,aAAa,CAAC,gBAAgB,EAAE,CAAC;YAC1C,cAAc,GAAG,IAAI,CAAC,gCAAgC,CAAC,aAAa,EAAE,aAAa,CAAC,CAAC;YACrF,IAAI,cAAc,IAAI,IAAI,EAAE,CAAC;gBAC3B,cAAc,GAAG,cAAc,CAAC,KAAK,EAAE,CAAC;gBACxC,eAAe,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC;YACvC,CAAC;YACD,aAAa,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,aAAa,CAAC,QAAQ,CAAC,CAAC;YAC7D,CAAC,EAAE,CAAC;QACN,CAAC;QACD,OAAO,eAAe,CAAC;IACzB,CAAC;IAED;;;;;;;;;OASG;IACH,oDAAgC,GAAhC,UAAoD,aAAqB,EAAE,aAAgB;QACzF,6DAA6D;QAC7D,wCAAwC;QACxC,IAAI,SAAS,GAAG,IAAI,CAAC,wBAAwB,CAAC,aAAa,EAAE,aAAa,CAAC,CAAC;QAC5E,IAAI,SAAS,IAAI,IAAI,EAAE,CAAC;YACtB,aAAa,CAAC,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC;YACrC,OAAO,aAAa,CAAC;QACvB,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;;;;;;;;QASI;IACJ,yCAAqB,GAArB,UAAsB,KAAa;QACjC,IAAI,KAAK,GAAG,CAAC;YACX,OAAO,IAAI,CAAC,iBAAiB,CAAC,IAAI,CAAC,iBAAiB,CAAC,MAAM,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,IAAI,CAAC,iBAAiB,CAAC,MAAM,CAAC,CAAC,CAAC;;YAC9G,OAAO,IAAI,CAAC,iBAAiB,CAAC,KAAK,GAAG,IAAI,CAAC,iBAAiB,CAAC,MAAM,CAAC,CAAC;IAC5E,CAAC;IAED;;;;;;;;;QASI;IACJ,yCAAqB,GAArB,UAAsB,KAAa;QACjC,IAAI,KAAK,GAAG,CAAC;YACX,OAAO,IAAI,CAAC,iBAAiB,CAAC,IAAI,CAAC,iBAAiB,CAAC,MAAM,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,IAAI,CAAC,iBAAiB,CAAC,MAAM,CAAC,CAAC,CAAC;;YAC9G,OAAO,IAAI,CAAC,iBAAiB,CAAC,KAAK,GAAG,IAAI,CAAC,iBAAiB,CAAC,MAAM,CAAC,CAAC;IAC5E,CAAC;IAED;;;;;;;;;;;;QAYI;IACJ,0BAAM,GAAN,UAAO,KAAa,EAAE,MAAe;QACnC,IAAI,OAAO,MAAM,KAAK,WAAW;YAAE,MAAM,GAAG,IAAI,CAAC,QAAQ,CAAC;QAC1D,gBAAK,CAAC,MAAM,YAAC,KAAK,EAAE,MAAM,CAAC,CAAC;QAC5B,KAAK,IAAI,CAAC,IAAI,IAAI,CAAC,iBAAiB,EAAE,CAAC;YACrC,IAAI,CAAC,iBAAiB,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;QAClD,CAAC;QACD,KAAK,IAAI,CAAC,IAAI,IAAI,CAAC,iBAAiB,EAAE,CAAC;YACrC,IAAI,CAAC,iBAAiB,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;QAClD,CAAC;QACD,IAAI,CAAC,QAAQ,IAAI,KAAK,CAAC;QACvB,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;;;;;;;;;;;;;;;QAgBI;IACJ,qCAAiB,GAAjB,UAAkB,KAAe,EAAE,SAAiB;QAClD,IAAI,IAAI,CAAC,QAAQ,CAAC,MAAM,IAAI,CAAC;YAAE,OAAO,CAAC,CAAC,CAAC;QACzC,IAAM,MAAM,GAAW,IAAI,eAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACxC,IAAI,WAAW,GAAW,CAAC,CAAC;QAC5B,IAAI,cAAc,GAAW,SAAS,GAAG,CAAC,CAAC,CAAC,sCAAsC;QAClF,IAAI,WAAW,GAAW,CAAC,CAAC,CAAC;QAC7B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC9C,IAAM,KAAK,GAAW,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC;YAC1C,IAAM,KAAK,GAAW,IAAI,CAAC,WAAW,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YAC9C,2CAA2C;YAC3C,MAAM,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC;YAC/C,MAAM,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC;YAC/C,WAAW,GAAG,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;YACrC,IAAI,WAAW,IAAI,SAAS,IAAI,CAAC,WAAW,IAAI,CAAC,CAAC,IAAI,WAAW,GAAG,cAAc,CAAC,EAAE,CAAC;gBACpF,cAAc,GAAG,WAAW,CAAC;gBAC7B,WAAW,GAAG,CAAC,CAAC;YAClB,CAAC;QACH,CAAC;QACD,OAAO,WAAW,CAAC;IACrB,CAAC;IAxQD;;;;;;;;;OASG;IACW,iBAAO,GAAW,KAAK,CAAC;IAEtC;;;;;;;;;OASG;IACoB,6BAAmB,GAAW,EAAE,CAAC;IAmP1D,gBAAC;CAAA,AA/XD,CAAwC,iBAAO,GA+X9C,CAAC,YAAY;AA/XQ,8BAAS"}