plotboilerplate 1.28.0 → 1.28.1

package/src/_esm/utils/datastructures/Girih.d.ts

@@ -1,181 +0,0 @@
-/**
- * @author   Ikaros Kappler
- * @date     2020-11-24
- * @modified 2020-11-25 Ported to TypeScript from vanilla JS.
- * @modified 2024-03-10 Fixed some types for Typescript 5 compatibility.
- * @modified 2026-01-06 Added method `Girih.locateContainingTileAndEdge` to locate tile/edge pairs.
- * @modified 2026-01-12 Added method `Girih.getTileByCenter` to locate tiles by position.
- * @modified 2026-01-18 Added method `Girih.removeAllTiles`.
- * @version  1.1.0
- * @file     Girih
- **/
-import { Vertex } from "../../Vertex";
-import { GirihTile } from "./GirihTile";
-import { XYCoords } from "../../interfaces";
-/**
- * @classdesc The Girih datastructure for generating patterns.
- *
- * @requires Vertex
- * @requires GirihTile
- * @requires GirihBowtie
- * @requires GirihDecagon
- * @requires GirihHexagon
- * @requires GirihPenroseRhombus
- * @requires GirihPentagon
- * @requires GirihRhombus
- */
-export declare class Girih {
-    /**
-     * The edge length to use in this Girih pattern.
-     *
-     * @member {number}
-     * @memberof Girih
-     * @type {number}
-     * @instance
-     */
-    readonly edgeLength: number;
-    /**
-     * An array of all available Girih tiles. Use them as templates for copy-and-paste.
-     *
-     * @member {Array<GirihTile>}
-     * @memberof Girih
-     * @type {Array<GirihTile>}
-     * @instance
-     */
-    readonly TILE_TEMPLATES: Array<GirihTile>;
-    /**
-     * The actual set of Girih tiles used in this Girih pattern.
-     *
-     * @member {Array<GirihTile>}
-     * @memberof Girih
-     * @type {Array<GirihTile>}
-     * @instance
-     */
-    readonly tiles: Array<GirihTile>;
-    /**
-     * Create a new empty Girih pattern.
-     *
-     * @constructor
-     * @memberof Girih
-     * @param {number} edgeLength
-     */
-    constructor(edgeLength: number);
-    /**
-     * Initialize the TILE_TEMPLATES array.
-     *
-     * @name initTemplates
-     * @private
-     * @memberof Girih
-     * @instance
-     * @param {number} edgeLength - The edge length to use for the template tiles.
-     * @return {void}
-     */
-    private initTemplates;
-    /**
-     * Add a new tile to this Girih pattern.
-     *
-     * @name addTile
-     * @memberof Girih
-     * @instance
-     * @param {GirihTile} tile - The tile to add (instance must not already be part of this pattern).
-     * @return {void}
-     */
-    addTile(tile: GirihTile): void;
-    /**
-     * Remove the tile at given array position. The index must be inside valid bounds.
-     *
-     * @name removeTile
-     * @memberof Girih
-     * @instance
-     * @param {number} index - The index in the `tiles` Array.
-     * @return {void}
-     */
-    removeTileAt(index: number): void;
-    /**
-     * Remove all tiles.
-     *
-     * @name removeAllTiles
-     * @memberof Girih
-     * @instance
-     * @return {void}
-     */
-    removeAllTiles(): void;
-    /**
-     * Replace all current tiles with the given ones.
-     *
-     * @param tiles
-     */
-    replaceTiles(tiles: GirihTile[]): void;
-    /**
-     * Find the tile with the given center.
-     *
-     * @name getTileByCenter
-     * @memberof Girih
-     * @instance
-     * @param {XYCoords} center - The center point to look for.
-     * @return {GirihTile} The tile or null if not found.
-     */
-    getTileByCenter(center: XYCoords): GirihTile;
-    /**
-     * Find that tile (index) which contains the given position. First match will be returned.
-     *
-     * @name locateContainingTile
-     * @memberof Girih
-     * @instance
-     * @param {Vertex} position
-     * @return {number} The index of the containing tile or -1 if none was found.
-     **/
-    locateConatiningTile(position: Vertex): number;
-    /**
-     * Find find a tile-edge-pair (indices) that contain the given position. First match will be returned.
-     *
-     * @name locateContainingTileAndEdge
-     * @memberof Girih
-     * @instance
-     * @param {Vertex} position
-     * @return {{ tileIndex: number; edgeIndex: number }} The index of the containing tile and edge or null if none was found.
-     **/
-    locateContainingTileAndEdge(position: any): {
-        tileIndex: number;
-        edgeIndex: number;
-    };
-    /**
-     * Turn the tile the mouse is hovering over.
-     * The turnCount is ab abstract number: -1 for one turn left, +1 for one turn right.
-     * The turning angle is defined by the tile with the lowest turn symmetry: the Decagon,
-     * so angle is 36°.
-     *
-     * @name turnTile
-     * @memberof Girih
-     * @instance
-     * @param {number} tileIndex - The index of the tile to rotate.
-     * @param {number} turnCount - A discrete number indicating the number of turn steps.
-     * @return {void}
-     */
-    turnTile(tileIndex: number, turnCount: number): void;
-    /**
-     * Move that tile the mouse is hovering over.
-     * The move amounts are abstract numbers, 1 indicating one unit along each axis.
-     *
-     * @name moveTile
-     * @memberof Girih
-     * @instance
-     * @param {number} tileIndex - The index of the tile to rotate.
-     * @param {number} moveXAmount - The amount to move along the x axis (in pixels).
-     * @param {number} moveYAmount - The amount to move along the y axis (in pixels).
-     * @return {void}
-     */
-    moveTile(tileIndex: number, moveXAmount: number, moveYAmount: number): void;
-    /**
-     * Find all possible adjadent tiles and their locations (type, rotation and offset). The
-     * function will return an array of all possible tiles matching at the given tile and edge.
-     *
-     * @name findPossibleAdjacentTiles
-     * @memberof Girih
-     * @instance
-     * @param {number} tileIndex - The index of the tile to rotate.
-     * @param {number} edgeIndex - The index of the tile's edge.
-     * @return {Array<GirihTile>} - An array of possible adjecent tiles (already positioned and rotated).
-     */
-    findPossibleAdjacentTiles(tileIndex: number, edgeIndex: number): Array<GirihTile>;
-}

package/src/_esm/utils/datastructures/Girih.js

@@ -1,265 +0,0 @@
-"use strict";
-/**
- * @author   Ikaros Kappler
- * @date     2020-11-24
- * @modified 2020-11-25 Ported to TypeScript from vanilla JS.
- * @modified 2024-03-10 Fixed some types for Typescript 5 compatibility.
- * @modified 2026-01-06 Added method `Girih.locateContainingTileAndEdge` to locate tile/edge pairs.
- * @modified 2026-01-12 Added method `Girih.getTileByCenter` to locate tiles by position.
- * @modified 2026-01-18 Added method `Girih.removeAllTiles`.
- * @version  1.1.0
- * @file     Girih
- **/
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.Girih = void 0;
-const Vertex_1 = require("../../Vertex");
-const GirihBowtie_1 = require("./GirihBowtie");
-const GirihDecagon_1 = require("./GirihDecagon");
-const GirihHexagon_1 = require("./GirihHexagon");
-const GirihPenroseRhombus_1 = require("./GirihPenroseRhombus");
-const GirihPentagon_1 = require("./GirihPentagon");
-const GirihRhombus_1 = require("./GirihRhombus");
-/**
- * @classdesc The Girih datastructure for generating patterns.
- *
- * @requires Vertex
- * @requires GirihTile
- * @requires GirihBowtie
- * @requires GirihDecagon
- * @requires GirihHexagon
- * @requires GirihPenroseRhombus
- * @requires GirihPentagon
- * @requires GirihRhombus
- */
-class Girih {
-    /**
-     * Create a new empty Girih pattern.
-     *
-     * @constructor
-     * @memberof Girih
-     * @param {number} edgeLength
-     */
-    constructor(edgeLength) {
-        this.edgeLength = edgeLength;
-        // Initialize templates, one for each Girih tile type.
-        // The template array will be filled on initialization (see below).
-        this.TILE_TEMPLATES = [];
-        // The set of all Girih tiles in scene
-        this.tiles = [];
-        this.initTemplates(edgeLength);
-    }
-    /**
-     * Initialize the TILE_TEMPLATES array.
-     *
-     * @name initTemplates
-     * @private
-     * @memberof Girih
-     * @instance
-     * @param {number} edgeLength - The edge length to use for the template tiles.
-     * @return {void}
-     */
-    initTemplates(edgeLength) {
-        // Positions actually don't matter here.
-        // Tiles will be moved to correct position conerning adjacency.
-        var decagon = new GirihDecagon_1.GirihDecagon(new Vertex_1.Vertex(0, 0), edgeLength);
-        var pentagon = new GirihPentagon_1.GirihPentagon(new Vertex_1.Vertex(0, 0), edgeLength);
-        var hexagon = new GirihHexagon_1.GirihHexagon(new Vertex_1.Vertex(0, 0), edgeLength);
-        var bowtie = new GirihBowtie_1.GirihBowtie(new Vertex_1.Vertex(0, 0), edgeLength);
-        var rhombus = new GirihRhombus_1.GirihRhombus(new Vertex_1.Vertex(0, 0), edgeLength);
-        var penrose = new GirihPenroseRhombus_1.GirihPenroseRhombus(new Vertex_1.Vertex(0, 0), edgeLength, true); // Add center polygon
-        // Add tiles to array and put them in the correct adjacency position.
-        this.TILE_TEMPLATES.push(decagon);
-        this.TILE_TEMPLATES.push(decagon.transformTilePositionToAdjacency(2, pentagon));
-        this.TILE_TEMPLATES.push(pentagon.transformTilePositionToAdjacency(1, penrose));
-        this.TILE_TEMPLATES.push(penrose.transformTilePositionToAdjacency(3, hexagon));
-        this.TILE_TEMPLATES.push(decagon.transformTilePositionToAdjacency(5, bowtie));
-        this.TILE_TEMPLATES.push(pentagon.transformTilePositionToAdjacency(4, rhombus));
-    }
-    /**
-     * Add a new tile to this Girih pattern.
-     *
-     * @name addTile
-     * @memberof Girih
-     * @instance
-     * @param {GirihTile} tile - The tile to add (instance must not already be part of this pattern).
-     * @return {void}
-     */
-    addTile(tile) {
-        this.tiles.push(tile);
-    }
-    /**
-     * Remove the tile at given array position. The index must be inside valid bounds.
-     *
-     * @name removeTile
-     * @memberof Girih
-     * @instance
-     * @param {number} index - The index in the `tiles` Array.
-     * @return {void}
-     */
-    removeTileAt(index) {
-        this.tiles.splice(index, 1);
-    }
-    /**
-     * Remove all tiles.
-     *
-     * @name removeAllTiles
-     * @memberof Girih
-     * @instance
-     * @return {void}
-     */
-    removeAllTiles() {
-        this.tiles.splice(0, this.tiles.length);
-    }
-    /**
-     * Replace all current tiles with the given ones.
-     *
-     * @param tiles
-     */
-    replaceTiles(tiles) {
-        this.tiles.splice(0, this.tiles.length);
-        for (var i in tiles) {
-            this.addTile(tiles[i]);
-        }
-    }
-    /**
-     * Find the tile with the given center.
-     *
-     * @name getTileByCenter
-     * @memberof Girih
-     * @instance
-     * @param {XYCoords} center - The center point to look for.
-     * @return {GirihTile} The tile or null if not found.
-     */
-    getTileByCenter(center) {
-        for (var i = 0; i < this.tiles.length; i++) {
-            const pos = this.tiles[i].position;
-            if (pos === center || (pos.x == center.x && pos.y == center.y)) {
-                return this.tiles[i];
-            }
-        }
-        return null;
-    }
-    /**
-     * Find that tile (index) which contains the given position. First match will be returned.
-     *
-     * @name locateContainingTile
-     * @memberof Girih
-     * @instance
-     * @param {Vertex} position
-     * @return {number} The index of the containing tile or -1 if none was found.
-     **/
-    locateConatiningTile(position) {
-        for (var i = 0; i < this.tiles.length; i++) {
-            if (this.tiles[i].containsVert(position))
-                return i;
-        }
-        return -1;
-    }
-    /**
-     * Find find a tile-edge-pair (indices) that contain the given position. First match will be returned.
-     *
-     * @name locateContainingTileAndEdge
-     * @memberof Girih
-     * @instance
-     * @param {Vertex} position
-     * @return {{ tileIndex: number; edgeIndex: number }} The index of the containing tile and edge or null if none was found.
-     **/
-    locateContainingTileAndEdge(position) {
-        var containedTileIndex = this.locateConatiningTile(position);
-        // Reset currently highlighted tile/edge (if re-detected nothing changed in the end)
-        var hoverTileIndex = -1;
-        var hoverEdgeIndex = -1;
-        // Find Girih edge nearby ...
-        if (containedTileIndex == -1) {
-            return null;
-        }
-        var i = containedTileIndex;
-        do {
-            var tile = this.tiles[i];
-            // May be -1
-            hoverEdgeIndex = tile.locateEdgeAtPoint(position, this.edgeLength / 2);
-            if (hoverEdgeIndex != -1) {
-                hoverTileIndex = i;
-            }
-            i++;
-        } while (i < this.tiles.length && containedTileIndex == -1 && hoverEdgeIndex == -1);
-        if (hoverTileIndex == -1) {
-            hoverTileIndex = containedTileIndex;
-        }
-        // Find the next possible tile to place?
-        if (hoverTileIndex == -1 || hoverEdgeIndex == -1) {
-            return null;
-        }
-        return { tileIndex: hoverTileIndex, edgeIndex: hoverEdgeIndex };
-    }
-    /**
-     * Turn the tile the mouse is hovering over.
-     * The turnCount is ab abstract number: -1 for one turn left, +1 for one turn right.
-     * The turning angle is defined by the tile with the lowest turn symmetry: the Decagon,
-     * so angle is 36°.
-     *
-     * @name turnTile
-     * @memberof Girih
-     * @instance
-     * @param {number} tileIndex - The index of the tile to rotate.
-     * @param {number} turnCount - A discrete number indicating the number of turn steps.
-     * @return {void}
-     */
-    turnTile(tileIndex, turnCount) {
-        if (tileIndex == -1)
-            // TODO: still required?
-            return;
-        const tile = this.tiles[tileIndex];
-        tile.rotate((turnCount * Math.PI * 2) / tile.symmetry);
-    }
-    /**
-     * Move that tile the mouse is hovering over.
-     * The move amounts are abstract numbers, 1 indicating one unit along each axis.
-     *
-     * @name moveTile
-     * @memberof Girih
-     * @instance
-     * @param {number} tileIndex - The index of the tile to rotate.
-     * @param {number} moveXAmount - The amount to move along the x axis (in pixels).
-     * @param {number} moveYAmount - The amount to move along the y axis (in pixels).
-     * @return {void}
-     */
-    moveTile(tileIndex, moveXAmount, moveYAmount) {
-        if (tileIndex == -1)
-            // TODO: still required?
-            return;
-        const tile = this.tiles[tileIndex];
-        tile.move({ x: moveXAmount * 10, y: moveYAmount * 10 });
-    }
-    /**
-     * Find all possible adjadent tiles and their locations (type, rotation and offset). The
-     * function will return an array of all possible tiles matching at the given tile and edge.
-     *
-     * @name findPossibleAdjacentTiles
-     * @memberof Girih
-     * @instance
-     * @param {number} tileIndex - The index of the tile to rotate.
-     * @param {number} edgeIndex - The index of the tile's edge.
-     * @return {Array<GirihTile>} - An array of possible adjecent tiles (already positioned and rotated).
-     */
-    findPossibleAdjacentTiles(tileIndex, edgeIndex) {
-        var adjTiles = [];
-        if (tileIndex == -1 || edgeIndex == -1)
-            // TODO: still required?
-            return [];
-        let template = null;
-        for (var i in this.TILE_TEMPLATES) {
-            template = this.TILE_TEMPLATES[i].clone();
-            // Find all rotations and positions for that tile to match
-            const foundTiles = this.tiles[tileIndex].transformTileToAdjacencies(edgeIndex, template);
-            if (foundTiles.length != 0) {
-                adjTiles = adjTiles.concat(foundTiles);
-            }
-        }
-        // Set pointer to save range.
-        // previewTilePointer = Math.min( adjTiles.length-1, previewTiilePointer );
-        return adjTiles;
-    }
-} // END class Girih
-exports.Girih = Girih;
-//# sourceMappingURL=Girih.js.map

package/src/_esm/utils/datastructures/Girih.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"Girih.js","sourceRoot":"","sources":["../../../ts/utils/datastructures/Girih.ts"],"names":[],"mappings":";AAAA;;;;;;;;;;IAUI;;;AAEJ,yCAAsC;AAEtC,+CAA4C;AAC5C,iDAA8C;AAC9C,iDAA8C;AAC9C,+DAA4D;AAC5D,mDAAgD;AAChD,iDAA8C;AAG9C;;;;;;;;;;;GAWG;AACH;IA+BE;;;;;;OAMG;IACH,YAAY,UAAkB;QAC5B,IAAI,CAAC,UAAU,GAAG,UAAU,CAAC;QAE7B,sDAAsD;QACtD,mEAAmE;QACnE,IAAI,CAAC,cAAc,GAAG,EAAE,CAAC;QAEzB,sCAAsC;QACtC,IAAI,CAAC,KAAK,GAAG,EAAE,CAAC;QAEhB,IAAI,CAAC,aAAa,CAAC,UAAU,CAAC,CAAC;IACjC,CAAC;IAED;;;;;;;;;OASG;IACK,aAAa,CAAC,UAAkB;QACtC,wCAAwC;QACxC,+DAA+D;QAC/D,IAAI,OAAO,GAAG,IAAI,2BAAY,CAAC,IAAI,eAAM,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC;QAC7D,IAAI,QAAQ,GAAG,IAAI,6BAAa,CAAC,IAAI,eAAM,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC;QAC/D,IAAI,OAAO,GAAG,IAAI,2BAAY,CAAC,IAAI,eAAM,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC;QAC7D,IAAI,MAAM,GAAG,IAAI,yBAAW,CAAC,IAAI,eAAM,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC;QAC3D,IAAI,OAAO,GAAG,IAAI,2BAAY,CAAC,IAAI,eAAM,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC;QAC7D,IAAI,OAAO,GAAG,IAAI,yCAAmB,CAAC,IAAI,eAAM,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,UAAU,EAAE,IAAI,CAAC,CAAC,CAAC,qBAAqB;QAEhG,qEAAqE;QACrE,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QAClC,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,OAAO,CAAC,gCAAgC,CAAC,CAAC,EAAE,QAAQ,CAAqB,CAAC,CAAC;QACpG,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,QAAQ,CAAC,gCAAgC,CAAC,CAAC,EAAE,OAAO,CAAqB,CAAC,CAAC;QACpG,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,OAAO,CAAC,gCAAgC,CAAC,CAAC,EAAE,OAAO,CAAqB,CAAC,CAAC;QACnG,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,OAAO,CAAC,gCAAgC,CAAC,CAAC,EAAE,MAAM,CAAqB,CAAC,CAAC;QAClG,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,QAAQ,CAAC,gCAAgC,CAAC,CAAC,EAAE,OAAO,CAAqB,CAAC,CAAC;IACtG,CAAC;IAED;;;;;;;;OAQG;IACH,OAAO,CAAC,IAAe;QACrB,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACxB,CAAC;IAED;;;;;;;;OAQG;IACH,YAAY,CAAC,KAAa;QACxB,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;IAC9B,CAAC;IAED;;;;;;;OAOG;IACH,cAAc;QACZ,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;IAC1C,CAAC;IAED;;;;OAIG;IACH,YAAY,CAAC,KAAkB;QAC7B,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;QACxC,KAAK,IAAI,CAAC,IAAI,KAAK,EAAE,CAAC;YACpB,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;QACzB,CAAC;IACH,CAAC;IAED;;;;;;;;OAQG;IACH,eAAe,CAAC,MAAgB;QAC9B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3C,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC;YACnC,IAAI,GAAG,KAAK,MAAM,IAAI,CAAC,GAAG,CAAC,CAAC,IAAI,MAAM,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC;gBAC/D,OAAO,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;YACvB,CAAC;QACH,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;;;;;;;QAQI;IACJ,oBAAoB,CAAC,QAAgB;QACnC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3C,IAAI,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,QAAQ,CAAC;gBAAE,OAAO,CAAC,CAAC;QACrD,CAAC;QACD,OAAO,CAAC,CAAC,CAAC;IACZ,CAAC;IAED;;;;;;;;QAQI;IACJ,2BAA2B,CAAC,QAAQ;QAClC,IAAI,kBAAkB,GAAG,IAAI,CAAC,oBAAoB,CAAC,QAAQ,CAAC,CAAC;QAE7D,oFAAoF;QACpF,IAAI,cAAc,GAAG,CAAC,CAAC,CAAC;QACxB,IAAI,cAAc,GAAG,CAAC,CAAC,CAAC;QAExB,6BAA6B;QAC7B,IAAI,kBAAkB,IAAI,CAAC,CAAC,EAAE,CAAC;YAC7B,OAAO,IAAI,CAAC;QACd,CAAC;QACD,IAAI,CAAC,GAAG,kBAAkB,CAAC;QAC3B,GAAG,CAAC;YACF,IAAI,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;YACzB,YAAY;YACZ,cAAc,GAAG,IAAI,CAAC,iBAAiB,CAAC,QAAQ,EAAE,IAAI,CAAC,UAAU,GAAG,CAAC,CAAC,CAAC;YACvE,IAAI,cAAc,IAAI,CAAC,CAAC,EAAE,CAAC;gBACzB,cAAc,GAAG,CAAC,CAAC;YACrB,CAAC;YACD,CAAC,EAAE,CAAC;QACN,CAAC,QAAQ,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,IAAI,kBAAkB,IAAI,CAAC,CAAC,IAAI,cAAc,IAAI,CAAC,CAAC,EAAE;QACpF,IAAI,cAAc,IAAI,CAAC,CAAC,EAAE,CAAC;YACzB,cAAc,GAAG,kBAAkB,CAAC;QACtC,CAAC;QAED,wCAAwC;QACxC,IAAI,cAAc,IAAI,CAAC,CAAC,IAAI,cAAc,IAAI,CAAC,CAAC,EAAE,CAAC;YACjD,OAAO,IAAI,CAAC;QACd,CAAC;QACD,OAAO,EAAE,SAAS,EAAE,cAAc,EAAE,SAAS,EAAE,cAAc,EAAE,CAAC;IAClE,CAAC;IAED;;;;;;;;;;;;OAYG;IACH,QAAQ,CAAC,SAAiB,EAAE,SAAiB;QAC3C,IAAI,SAAS,IAAI,CAAC,CAAC;YACjB,wBAAwB;YACxB,OAAO;QACT,MAAM,IAAI,GAAc,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC;QAC9C,IAAI,CAAC,MAAM,CAAC,CAAC,SAAS,GAAG,IAAI,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC;IACzD,CAAC;IAED;;;;;;;;;;;OAWG;IACH,QAAQ,CAAC,SAAiB,EAAE,WAAmB,EAAE,WAAmB;QAClE,IAAI,SAAS,IAAI,CAAC,CAAC;YACjB,wBAAwB;YACxB,OAAO;QACT,MAAM,IAAI,GAAc,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC;QAC9C,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,WAAW,GAAG,EAAE,EAAE,CAAC,EAAE,WAAW,GAAG,EAAE,EAAE,CAAC,CAAC;IAC1D,CAAC;IAED;;;;;;;;;;OAUG;IACH,yBAAyB,CAAC,SAAiB,EAAE,SAAiB;QAC5D,IAAI,QAAQ,GAAqB,EAAE,CAAC;QACpC,IAAI,SAAS,IAAI,CAAC,CAAC,IAAI,SAAS,IAAI,CAAC,CAAC;YACpC,wBAAwB;YACxB,OAAO,EAAE,CAAC;QAEZ,IAAI,QAAQ,GAAqB,IAAI,CAAC;QACtC,KAAK,IAAI,CAAC,IAAI,IAAI,CAAC,cAAc,EAAE,CAAC;YAClC,QAAQ,GAAG,IAAI,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC;YAC1C,0DAA0D;YAC1D,MAAM,UAAU,GAAqB,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC,0BAA0B,CAAC,SAAS,EAAE,QAAQ,CAAC,CAAC;YAC3G,IAAI,UAAU,CAAC,MAAM,IAAI,CAAC,EAAE,CAAC;gBAC3B,QAAQ,GAAG,QAAQ,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC;YACzC,CAAC;QACH,CAAC;QACD,6BAA6B;QAC7B,2EAA2E;QAC3E,OAAO,QAAQ,CAAC;IAClB,CAAC;CACF,CAAC,kBAAkB"}

package/src/_esm/utils/datastructures/GirihBowtie.d.ts

@@ -1,37 +0,0 @@
-/**
- * @classdesc The bow tie tile from the Girih set.
- *
- * @requires Bounds
- * @requires GirihTile
- * @requires Polygon
- * @requires TileType
- * @requires Vertex
- *
- * @author Ikaros Kappler
- * @modified 2013-11-28
- * @modified 2014-04-05 Ikaros Kappler (member array outerTilePolygons added).
- * @modified 2015-03-19 Ikaros Kappler (added toSVG()).
- * @modified 2020-10-31 Refactored to work with PlotBoilerplate.
- * @modified 2020-11-13 Ported from vanilla JS to TypeScript.
- * @version 2.0.1-alpha
- * @file GirihBowtie
- * @public
- **/
-import { GirihTile } from "./GirihTile";
-import { Vertex } from "../../Vertex";
-export declare class GirihBowtie extends GirihTile {
-    /**
-     * @constructor
-     * @extends GirihTile
-     * @name GirihBowtie
-     * @param {Vertex} position
-     * @param {number} edgeLength
-     */
-    constructor(position: Vertex, edgeLength?: number);
-    /**
-     * @override
-     */
-    clone(): GirihTile;
-    private _buildInnerPolygons;
-    private _buildOuterPolygons;
-}

package/src/_esm/utils/datastructures/GirihBowtie.js

@@ -1,134 +0,0 @@
-"use strict";
-/**
- * @classdesc The bow tie tile from the Girih set.
- *
- * @requires Bounds
- * @requires GirihTile
- * @requires Polygon
- * @requires TileType
- * @requires Vertex
- *
- * @author Ikaros Kappler
- * @modified 2013-11-28
- * @modified 2014-04-05 Ikaros Kappler (member array outerTilePolygons added).
- * @modified 2015-03-19 Ikaros Kappler (added toSVG()).
- * @modified 2020-10-31 Refactored to work with PlotBoilerplate.
- * @modified 2020-11-13 Ported from vanilla JS to TypeScript.
- * @version 2.0.1-alpha
- * @file GirihBowtie
- * @public
- **/
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.GirihBowtie = void 0;
-const GirihTile_1 = require("./GirihTile");
-const Polygon_1 = require("../../Polygon");
-const Vertex_1 = require("../../Vertex");
-class GirihBowtie extends GirihTile_1.GirihTile {
-    /**
-     * @constructor
-     * @extends GirihTile
-     * @name GirihBowtie
-     * @param {Vertex} position
-     * @param {number} edgeLength
-     */
-    constructor(position, edgeLength) {
-        super(position, edgeLength, GirihTile_1.TileType.BOW_TIE);
-        // Overwrite the default symmetries:
-        //    the bow-tie tile has a 180° symmetry (5/10 * 360°)
-        this.uniqueSymmetries = 5;
-        // Init the actual decahedron shape with the passed size
-        let pointA = new Vertex_1.Vertex(0, 0);
-        let pointB = pointA;
-        const startPoint = pointA;
-        let oppositePoint = null;
-        this.addVertex(pointB);
-        // TODO: notate in radians
-        var angles = [0.0,
-            72.0,
-            72.0,
-            216.0,
-            72.0
-        ];
-        var theta = 0.0;
-        for (var i = 0; i < angles.length; i++) {
-            theta += (180.0 - angles[i]);
-            pointA = pointB; // center of rotation
-            pointB = pointB.clone();
-            pointB.x -= this.edgeLength;
-            pointB.rotate(theta * (Math.PI / 180.0), pointA);
-            this.addVertex(pointB);
-            if (i == 2)
-                oppositePoint = pointB;
-        } // END for
-        // Move to center and position 
-        const move = new Vertex_1.Vertex((oppositePoint.x - startPoint.x) / 2.0, (oppositePoint.y - startPoint.y) / 2.0);
-        for (var i = 0; i < this.vertices.length; i++) {
-            this.vertices[i].add(position).sub(move);
-        }
-        this.textureSource.min.x = 288 / 500.0;
-        this.textureSource.min.y = 7 / 460.0;
-        this.textureSource.max.x = this.textureSource.min.x + 206 / 500.0;
-        this.textureSource.max.y = this.textureSource.min.y + 150 / 460.0;
-        this.baseBounds = this.getBounds();
-        this._buildInnerPolygons(this.edgeLength);
-        this._buildOuterPolygons(this.edgeLength); // Only call AFTER the inner polygons were created!
-    }
-    ;
-    /**
-     * @override
-     */
-    clone() {
-        return new GirihBowtie(this.position.clone(), this.edgeLength).rotate(this.rotation);
-    }
-    ;
-    _buildInnerPolygons(edgeLength) {
-        const indices = [1, 4];
-        for (var i = 0; i < indices.length; i++) {
-            const index = indices[i];
-            const middlePoint = this.getVertexAt(index).clone().scale(0.5, this.getVertexAt(index + 1));
-            const leftPoint = this.getVertexAt(index - 1).clone().scale(0.5, this.getVertexAt(index));
-            const rightPoint = this.getVertexAt(index + 1).clone().scale(0.5, this.getVertexAt(index + 2));
-            const innerPoint = middlePoint.clone().scale(0.38, this.position); // multiplyScalar( 0.38 );
-            const innerTile = new Polygon_1.Polygon([]);
-            innerTile.addVertex(middlePoint);
-            innerTile.addVertex(rightPoint);
-            innerTile.addVertex(innerPoint);
-            innerTile.addVertex(leftPoint);
-            this.innerTilePolygons.push(innerTile);
-        }
-    }
-    ;
-    _buildOuterPolygons(edgeLength) {
-        // Add the outer four 'edges'
-        const indices = [0, 3];
-        for (var i = 0; i < indices.length; i++) {
-            const index = indices[i];
-            // The first/third triangle
-            const outerTileA = new Polygon_1.Polygon();
-            outerTileA.addVertex(this.innerTilePolygons[i].getVertexAt(0).clone());
-            outerTileA.addVertex(this.getVertexAt(index + 2).clone());
-            outerTileA.addVertex(this.innerTilePolygons[i].getVertexAt(1).clone());
-            this.outerTilePolygons.push(outerTileA);
-            // The second/fourth triangle
-            const outerTileB = new Polygon_1.Polygon();
-            outerTileB.addVertex(this.innerTilePolygons[i].getVertexAt(0).clone());
-            outerTileB.addVertex(this.getVertexAt(index + 1).clone());
-            outerTileB.addVertex(this.innerTilePolygons[i].getVertexAt(3).clone());
-            this.outerTilePolygons.push(outerTileB);
-        }
-        // Add the center polygon
-        const centerTile = new Polygon_1.Polygon();
-        centerTile.addVertex(this.getVertexAt(0).clone());
-        centerTile.addVertex(this.innerTilePolygons[0].getVertexAt(3).clone());
-        centerTile.addVertex(this.innerTilePolygons[0].getVertexAt(2).clone());
-        centerTile.addVertex(this.innerTilePolygons[0].getVertexAt(1).clone());
-        centerTile.addVertex(this.getVertexAt(3).clone());
-        centerTile.addVertex(this.innerTilePolygons[1].getVertexAt(3).clone());
-        centerTile.addVertex(this.innerTilePolygons[1].getVertexAt(2).clone());
-        centerTile.addVertex(this.innerTilePolygons[1].getVertexAt(1).clone());
-        this.outerTilePolygons.push(centerTile);
-    }
-    ;
-}
-exports.GirihBowtie = GirihBowtie;
-//# sourceMappingURL=GirihBowtie.js.map

package/src/_esm/utils/datastructures/GirihBowtie.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"GirihBowtie.js","sourceRoot":"","sources":["../../../ts/utils/datastructures/GirihBowtie.ts"],"names":[],"mappings":";AAAA;;;;;;;;;;;;;;;;;;IAkBI;;;AAEJ,2CAAkD;AAClD,2CAAwC;AACxC,yCAAsC;AAEtC,iBAAyB,SAAQ,qBAAS;IAEtC;;;;;;OAMG;IACH,YAAa,QAAe,EAAE,UAAkB;QAEnD,KAAK,CAAE,QAAQ,EAAE,UAAU,EAAE,oBAAQ,CAAC,OAAO,CAAE,CAAC;QAEhD,oCAAoC;QACpC,wDAAwD;QACxD,IAAI,CAAC,gBAAgB,GAAO,CAAC,CAAC;QAE9B,wDAAwD;QACxD,IAAI,MAAM,GAAY,IAAI,eAAM,CAAC,CAAC,EAAC,CAAC,CAAC,CAAC;QACtC,IAAI,MAAM,GAAY,MAAM,CAAC;QAC7B,MAAM,UAAU,GAAM,MAAM,CAAC;QAC7B,IAAI,aAAa,GAAK,IAAI,CAAC;QAC3B,IAAI,CAAC,SAAS,CAAE,MAAM,CAAE,CAAC;QAEzB,0BAA0B;QAC1B,IAAI,MAAM,GAAG,CAAE,GAAG;YACV,IAAI;YACJ,IAAI;YACJ,KAAK;YACL,IAAI;SACL,CAAC;QAER,IAAI,KAAK,GAAG,GAAG,CAAC;QAChB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAG,CAAC;YACtC,KAAK,IAAI,CAAC,KAAK,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;YAC7B,MAAM,GAAG,MAAM,CAAC,CAAC,qBAAqB;YACtC,MAAM,GAAG,MAAM,CAAC,KAAK,EAAE,CAAC;YACxB,MAAM,CAAC,CAAC,IAAI,IAAI,CAAC,UAAU,CAAC;YAC5B,MAAM,CAAC,MAAM,CAAE,KAAK,GAAG,CAAC,IAAI,CAAC,EAAE,GAAC,KAAK,CAAC,EAAE,MAAM,CAAE,CAAC;YACjD,IAAI,CAAC,SAAS,CAAE,MAAM,CAAE,CAAC;YACzB,IAAI,CAAC,IAAI,CAAC;gBACb,aAAa,GAAG,MAAM,CAAC;QACxB,CAAC,CAAC,UAAU;QAEZ,+BAA+B;QAC/B,MAAM,IAAI,GAAY,IAAI,eAAM,CAAE,CAAC,aAAa,CAAC,CAAC,GAAG,UAAU,CAAC,CAAC,CAAC,GAAC,GAAG,EAChE,CAAC,aAAa,CAAC,CAAC,GAAG,UAAU,CAAC,CAAC,CAAC,GAAC,GAAG,CACrC,CAAC;QAEN,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAG,CAAC;YAC7C,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,GAAG,CAAE,QAAQ,CAAE,CAAC,GAAG,CAAE,IAAI,CAAE,CAAC;QACjD,CAAC;QAED,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,CAAC,GAAG,GAAG,GAAC,KAAK,CAAC;QACrC,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,GAAC,KAAK,CAAC;QACnC,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,CAAC,GAAG,GAAG,GAAC,KAAK,CAAC;QAChE,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,CAAC,GAAG,GAAG,GAAC,KAAK,CAAC;QAEhE,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,SAAS,EAAE,CAAC;QAEnC,IAAI,CAAC,mBAAmB,CAAE,IAAI,CAAC,UAAU,CAAE,CAAC;QAC5C,IAAI,CAAC,mBAAmB,CAAE,IAAI,CAAC,UAAU,CAAE,CAAC,CAAO,mDAAmD;IACnG,CAAC;IAAA,CAAC;IAIF;;OAEG;IACH,KAAK;QACR,OAAO,IAAI,WAAW,CAAE,IAAI,CAAC,QAAQ,CAAC,KAAK,EAAE,EAAE,IAAI,CAAC,UAAU,CAAE,CAAC,MAAM,CAAE,IAAI,CAAC,QAAQ,CAAE,CAAC;IACtF,CAAC;IAAA,CAAC;IAEM,mBAAmB,CAAE,UAAiB;QAEjD,MAAM,OAAO,GAAiB,CAAE,CAAC,EAAE,CAAC,CAAE,CAAC;QACvC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAG,CAAC;YACvC,MAAM,KAAK,GAAgB,OAAO,CAAC,CAAC,CAAC,CAAC;YACtC,MAAM,WAAW,GAAU,IAAI,CAAC,WAAW,CAAE,KAAK,CAAE,CAAC,KAAK,EAAE,CAAC,KAAK,CAAE,GAAG,EAAE,IAAI,CAAC,WAAW,CAAC,KAAK,GAAC,CAAC,CAAC,CAAE,CAAC;YACrG,MAAM,SAAS,GAAY,IAAI,CAAC,WAAW,CAAE,KAAK,GAAC,CAAC,CAAE,CAAC,KAAK,EAAE,CAAC,KAAK,CAAE,GAAG,EAAE,IAAI,CAAC,WAAW,CAAC,KAAK,CAAC,CAAE,CAAC;YACrG,MAAM,UAAU,GAAW,IAAI,CAAC,WAAW,CAAE,KAAK,GAAC,CAAC,CAAE,CAAC,KAAK,EAAE,CAAC,KAAK,CAAE,GAAG,EAAE,IAAI,CAAC,WAAW,CAAC,KAAK,GAAC,CAAC,CAAC,CAAE,CAAC;YACvG,MAAM,UAAU,GAAW,WAAW,CAAC,KAAK,EAAE,CAAC,KAAK,CAAE,IAAI,EAAE,IAAI,CAAC,QAAQ,CAAE,CAAC,CAAC,0BAA0B;YAEvG,MAAM,SAAS,GAAW,IAAI,iBAAO,CAAE,EAAE,CAAE,CAAC;YAC5C,SAAS,CAAC,SAAS,CAAE,WAAW,CAAE,CAAC;YACnC,SAAS,CAAC,SAAS,CAAE,UAAU,CAAE,CAAC;YAClC,SAAS,CAAC,SAAS,CAAE,UAAU,CAAE,CAAC;YAClC,SAAS,CAAC,SAAS,CAAE,SAAS,CAAE,CAAC;YAEjC,IAAI,CAAC,iBAAiB,CAAC,IAAI,CAAE,SAAS,CAAE,CAAC;QAC7C,CAAC;IACE,CAAC;IAAA,CAAC;IAEM,mBAAmB,CAAE,UAAiB;QACjD,6BAA6B;QAC7B,MAAM,OAAO,GAAiB,CAAE,CAAC,EAAE,CAAC,CAAE,CAAC;QACvC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAG,CAAC;YAEvC,MAAM,KAAK,GAAgB,OAAO,CAAC,CAAC,CAAC,CAAC;YAEtC,2BAA2B;YAC3B,MAAM,UAAU,GAAa,IAAI,iBAAO,EAAE,CAAC;YAC3C,UAAU,CAAC,SAAS,CAAE,IAAI,CAAC,iBAAiB,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,KAAK,EAAE,CAAE,CAAC;YACzE,UAAU,CAAC,SAAS,CAAE,IAAI,CAAC,WAAW,CAAC,KAAK,GAAC,CAAC,CAAC,CAAC,KAAK,EAAE,CAAE,CAAC;YAC1D,UAAU,CAAC,SAAS,CAAE,IAAI,CAAC,iBAAiB,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,CAAE;YACzE,IAAI,CAAC,iBAAiB,CAAC,IAAI,CAAE,UAAU,CAAE,CAAC;YAE1C,6BAA6B;YAC7B,MAAM,UAAU,GAAW,IAAI,iBAAO,EAAE,CAAC;YACzC,UAAU,CAAC,SAAS,CAAE,IAAI,CAAC,iBAAiB,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,KAAK,EAAE,CAAE,CAAC;YACzE,UAAU,CAAC,SAAS,CAAE,IAAI,CAAC,WAAW,CAAC,KAAK,GAAC,CAAC,CAAC,CAAC,KAAK,EAAE,CAAE,CAAC;YAC1D,UAAU,CAAC,SAAS,CAAE,IAAI,CAAC,iBAAiB,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,CAAE;YACzE,IAAI,CAAC,iBAAiB,CAAC,IAAI,CAAE,UAAU,CAAE,CAAC;QAE9C,CAAC;QAED,yBAAyB;QACzB,MAAM,UAAU,GAAW,IAAI,iBAAO,EAAE,CAAC;QACzC,UAAU,CAAC,SAAS,CAAE,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,KAAK,EAAE,CAAE,CAAC;QACpD,UAAU,CAAC,SAAS,CAAE,IAAI,CAAC,iBAAiB,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,KAAK,EAAE,CAAE,CAAC;QACzE,UAAU,CAAC,SAAS,CAAE,IAAI,CAAC,iBAAiB,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,KAAK,EAAE,CAAE,CAAC;QACzE,UAAU,CAAC,SAAS,CAAE,IAAI,CAAC,iBAAiB,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,KAAK,EAAE,CAAE,CAAC;QACzE,UAAU,CAAC,SAAS,CAAE,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,KAAK,EAAE,CAAE,CAAC;QACpD,UAAU,CAAC,SAAS,CAAE,IAAI,CAAC,iBAAiB,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,KAAK,EAAE,CAAE,CAAC;QACzE,UAAU,CAAC,SAAS,CAAE,IAAI,CAAC,iBAAiB,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,KAAK,EAAE,CAAE,CAAC;QACzE,UAAU,CAAC,SAAS,CAAE,IAAI,CAAC,iBAAiB,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,KAAK,EAAE,CAAE,CAAC;QACzE,IAAI,CAAC,iBAAiB,CAAC,IAAI,CAAE,UAAU,CAAE,CAAC;IACvC,CAAC;IAAA,CAAC;CAGL"}