plotboilerplate 1.21.0 → 1.22.0

package/src/esm/utils/datastructures/DataGrid2dListAdapter.js

@@ -0,0 +1,79 @@
+/**
+ * A DataGrid2d implementation on a linear array of triplets/Vector3.
+ *
+ * @author   Ikaros Kappler
+ * @date     2023-10-28
+ * @modified 2023-11-04 Converted to a Typescript class.
+ * @version  1.0.0
+ **/
+export class DataGrid2dListAdapter {
+    /**
+     * Create a new DataGrid2d from the given
+     * @throws Error if xSegmentCount*ySegmentCount is larger than the capacity of the array/list.
+     * @param list
+     * @param xSegmentCount
+     * @param ySegmentCount
+     */
+    constructor(list, xSegmentCount, ySegmentCount) {
+        if (xSegmentCount * ySegmentCount > list.length) {
+            throw `Cannot create DataGrid2dListAdapter, the list (length ${list.length}) does not provide enough items for ${xSegmentCount}x${ySegmentCount} required entries.`;
+        }
+        // this.canvas = document.getElementById(canvasId);
+        this.xSegmentCount = xSegmentCount;
+        this.ySegmentCount = ySegmentCount;
+        this._dataList = list;
+    }
+    getIndicesFromBufferIndex(bufferIndex) {
+        return { xIndex: Math.floor(bufferIndex % this.xSegmentCount), yIndex: Math.floor(bufferIndex / this.xSegmentCount) };
+    }
+    getCoordsFromBufferIndex(bufferIndex) {
+        var index = this.getIndicesFromBufferIndex(bufferIndex);
+        // Note that the xSegmentCount and ySegmentCount counts plane squares, each consisting of four vertices
+        index.xRel = index.xIndex / (this.xSegmentCount - 1);
+        index.yRel = index.yIndex / (this.ySegmentCount - 1);
+        return index;
+    }
+    coordinateIndicesToBufferIndex(xIndex, yIndex) {
+        return yIndex * this.xSegmentCount + xIndex;
+    }
+    /**
+     * @override
+     */
+    getMinDataValue() {
+        return this.minDataValue;
+    }
+    /**
+     * @override
+     */
+    getMaxDataValue() {
+        return this.maxDataValue;
+    }
+    /**
+     * @override
+     */
+    getDataValueAt(xIndex, yIndex, isDebug) {
+        // var bufferIndex = yIndex * this.xSegmentCount + xIndex;
+        var bufferIndex = this.coordinateIndicesToBufferIndex(xIndex, yIndex);
+        if (isDebug) {
+            console.log("xIndex", xIndex, "yIndex", yIndex, "bufferIndex", bufferIndex);
+        }
+        if (bufferIndex > this._dataList.length) {
+            console.error("ERR buffer index is out of bounds! xIndex", xIndex, "yIndex", yIndex, "bufferIndex", bufferIndex);
+        }
+        if (!this._dataList[bufferIndex]) {
+            console.error("ERR buffer element is null! xIndex", xIndex, "yIndex", yIndex, "bufferIndex", bufferIndex);
+        }
+        return this._dataList && bufferIndex < this._dataList.length ? this._dataList[bufferIndex].z : null;
+    }
+    /**
+     * @override
+     */
+    getDataFace4At(xIndex, yIndex, buffer) {
+        // buffer: array[2][2]
+        buffer[0][0] = this.getDataValueAt(xIndex, yIndex);
+        buffer[1][0] = this.getDataValueAt(xIndex + 1, yIndex);
+        buffer[1][1] = this.getDataValueAt(xIndex + 1, yIndex + 1);
+        buffer[0][1] = this.getDataValueAt(xIndex, yIndex + 1);
+    }
+}
+//# sourceMappingURL=DataGrid2dListAdapter.js.map

package/src/esm/utils/datastructures/DataGrid2dListAdapter.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"DataGrid2dListAdapter.js","sourceRoot":"","sources":["../../../ts/utils/datastructures/DataGrid2dListAdapter.ts"],"names":[],"mappings":"AAAA;;;;;;;IAOI;AAiBJ,MAAM,OAAO,qBAAqB;IAmBhC;;;;;;OAMG;IACH,YAAY,IAAuB,EAAE,aAAqB,EAAE,aAAqB;QAC/E,IAAI,aAAa,GAAG,aAAa,GAAG,IAAI,CAAC,MAAM,EAAE;YAC/C,MAAM,yDAAyD,IAAI,CAAC,MAAM,uCAAuC,aAAa,IAAI,aAAa,oBAAoB,CAAC;SACrK;QAED,mDAAmD;QACnD,IAAI,CAAC,aAAa,GAAG,aAAa,CAAC;QACnC,IAAI,CAAC,aAAa,GAAG,aAAa,CAAC;QAEnC,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC;IACxB,CAAC;IAED,yBAAyB,CAAC,WAAmB;QAC3C,OAAO,EAAE,MAAM,EAAE,IAAI,CAAC,KAAK,CAAC,WAAW,GAAG,IAAI,CAAC,aAAa,CAAC,EAAE,MAAM,EAAE,IAAI,CAAC,KAAK,CAAC,WAAW,GAAG,IAAI,CAAC,aAAa,CAAC,EAAE,CAAC;IACxH,CAAC;IAED,wBAAwB,CAAC,WAAmB;QAC1C,IAAI,KAAK,GAAG,IAAI,CAAC,yBAAyB,CAAC,WAAW,CAAC,CAAC;QACxD,uGAAuG;QACvG,KAAK,CAAC,IAAI,GAAG,KAAK,CAAC,MAAM,GAAG,CAAC,IAAI,CAAC,aAAa,GAAG,CAAC,CAAC,CAAC;QACrD,KAAK,CAAC,IAAI,GAAG,KAAK,CAAC,MAAM,GAAG,CAAC,IAAI,CAAC,aAAa,GAAG,CAAC,CAAC,CAAC;QACrD,OAAO,KAAK,CAAC;IACf,CAAC;IAED,8BAA8B,CAAC,MAAc,EAAE,MAAc;QAC3D,OAAO,MAAM,GAAG,IAAI,CAAC,aAAa,GAAG,MAAM,CAAC;IAC9C,CAAC;IAED;;OAEG;IACH,eAAe;QACb,OAAO,IAAI,CAAC,YAAY,CAAC;IAC3B,CAAC;IAED;;OAEG;IACH,eAAe;QACb,OAAO,IAAI,CAAC,YAAY,CAAC;IAC3B,CAAC;IAED;;OAEG;IACH,cAAc,CAAC,MAAc,EAAE,MAAc,EAAE,OAAiB;QAC9D,0DAA0D;QAC1D,IAAI,WAAW,GAAG,IAAI,CAAC,8BAA8B,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;QACtE,IAAI,OAAO,EAAE;YACX,OAAO,CAAC,GAAG,CAAC,QAAQ,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,EAAE,aAAa,EAAE,WAAW,CAAC,CAAC;SAC7E;QACD,IAAI,WAAW,GAAG,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE;YACvC,OAAO,CAAC,KAAK,CAAC,2CAA2C,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,EAAE,aAAa,EAAE,WAAW,CAAC,CAAC;SAClH;QACD,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,WAAW,CAAC,EAAE;YAChC,OAAO,CAAC,KAAK,CAAC,oCAAoC,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,EAAE,aAAa,EAAE,WAAW,CAAC,CAAC;SAC3G;QACD,OAAO,IAAI,CAAC,SAAS,IAAI,WAAW,GAAG,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;IACtG,CAAC;IAED;;OAEG;IACH,cAAc,CAAC,MAAc,EAAE,MAAc,EAAE,MAAwB;QACrE,sBAAsB;QACtB,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,cAAc,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;QACnD,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,cAAc,CAAC,MAAM,GAAG,CAAC,EAAE,MAAM,CAAC,CAAC;QACvD,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,cAAc,CAAC,MAAM,GAAG,CAAC,EAAE,MAAM,GAAG,CAAC,CAAC,CAAC;QAC3D,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,cAAc,CAAC,MAAM,EAAE,MAAM,GAAG,CAAC,CAAC,CAAC;IACzD,CAAC;CACF"}

package/src/esm/utils/datastructures/GenericPath.d.ts

@@ -1,7 +1,8 @@
 /**
- * @author  Ikaros Kappler
- * @version 1.0.0
- * @date    2022-10-17
+ * @author   Ikaros Kappler
+ * @version  1.1.0
+ * @date     2022-10-17
+ * @modified 2023-11-27 Added the `GenericPath.getAllStartEndPoints()` function.
  */
 import { Path, PathSegment } from "../../interfaces/additionals";
 import { Vertex } from "../../Vertex";
@@ -72,4 +73,14 @@ export declare class GenericPath implements Path {
      * @return {Vertex} The end point of the ending point's tangent.
      */
     getEndTangent(): Vertex;
+    /**
+     * Get the sequence of all start/end points of this path.
+     * Assumption is: each path segment's end point is located on the next segment's start point
+     * to shape a full connected path.
+     *
+     * No arcs are considered here, just plain linear segments.
+     *
+     * @returns {Array<Vertex>}
+     */
+    getAllStartEndPoints(): Array<Vertex>;
 }

package/src/esm/utils/datastructures/GenericPath.js

@@ -1,7 +1,8 @@
 /**
- * @author  Ikaros Kappler
- * @version 1.0.0
- * @date    2022-10-17
+ * @author   Ikaros Kappler
+ * @version  1.1.0
+ * @date     2022-10-17
+ * @modified 2023-11-27 Added the `GenericPath.getAllStartEndPoints()` function.
  */
 export class GenericPath {
     constructor(startSegment) {
@@ -96,5 +97,21 @@ export class GenericPath {
     getEndTangent() {
         return this.segments[this.segments.length - 1].getEndTangent();
     }
+    /**
+     * Get the sequence of all start/end points of this path.
+     * Assumption is: each path segment's end point is located on the next segment's start point
+     * to shape a full connected path.
+     *
+     * No arcs are considered here, just plain linear segments.
+     *
+     * @returns {Array<Vertex>}
+     */
+    getAllStartEndPoints() {
+        const verts = [this.segments[0].getStartPoint()];
+        this.segments.forEach((segment) => {
+            verts.push(segment.getEndPoint());
+        });
+        return verts;
+    }
 }
 //# sourceMappingURL=GenericPath.js.map

package/src/esm/utils/datastructures/GenericPath.js.map

@@ -1 +1 @@
-{"version":3,"file":"GenericPath.js","sourceRoot":"","sources":["../../../ts/utils/datastructures/GenericPath.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAKH,MAAM,OAAO,WAAW;IAGtB,YAAY,YAAyB;QACnC,IAAI,CAAC,QAAQ,GAAG,CAAC,YAAY,CAAC,CAAC;IACjC,CAAC;IAED;;;;;;OAMG;IACH,eAAe;QACb,OAAO,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC;IAC9B,CAAC;IAED;;;;;;OAMG;IACH,YAAY,CAAC,KAAa;QACxB,OAAO,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;IAC9B,CAAC;IAED;;;;;;OAMG;IACH,KAAK;QACH,MAAM,OAAO,GAAG,IAAI,WAAW,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,OAAO,EAAE,CAAC,CAAC;QAC3F,KAAK,IAAI,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE;YAClD,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,OAAO,EAAE,CAAC,CAAC;SAC3D;QACD,OAAO,OAAO,CAAC;IACjB,CAAC;IAED;;;;;;OAMG;IACH,OAAO;QACL,MAAM,WAAW,GAAuB,EAAE,CAAC;QAC3C,KAAK,IAAI,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE;YAClD,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC,CAAC;SAC9C;QACD,IAAI,CAAC,QAAQ,GAAG,WAAW,CAAC;QAC5B,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;;;;;OAMG;IACH,aAAa;QACX,OAAO,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,aAAa,EAAE,CAAC;IAC1C,CAAC;IAED;;;;;;OAMG;IACH,WAAW;QACT,OAAO,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,WAAW,EAAE,CAAC;IAC/D,CAAC;IAED;;;;;;OAMG;IACH,eAAe;QACb,OAAO,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,eAAe,EAAE,CAAC;IAC5C,CAAC;IAED;;;;;;OAMG;IACH,aAAa;QACX,OAAO,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,aAAa,EAAE,CAAC;IACjE,CAAC;CACF"}
+{"version":3,"file":"GenericPath.js","sourceRoot":"","sources":["../../../ts/utils/datastructures/GenericPath.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAKH,MAAM,OAAO,WAAW;IAGtB,YAAY,YAAyB;QACnC,IAAI,CAAC,QAAQ,GAAG,CAAC,YAAY,CAAC,CAAC;IACjC,CAAC;IAED;;;;;;OAMG;IACH,eAAe;QACb,OAAO,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC;IAC9B,CAAC;IAED;;;;;;OAMG;IACH,YAAY,CAAC,KAAa;QACxB,OAAO,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;IAC9B,CAAC;IAED;;;;;;OAMG;IACH,KAAK;QACH,MAAM,OAAO,GAAG,IAAI,WAAW,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,OAAO,EAAE,CAAC,CAAC;QAC3F,KAAK,IAAI,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE;YAClD,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,OAAO,EAAE,CAAC,CAAC;SAC3D;QACD,OAAO,OAAO,CAAC;IACjB,CAAC;IAED;;;;;;OAMG;IACH,OAAO;QACL,MAAM,WAAW,GAAuB,EAAE,CAAC;QAC3C,KAAK,IAAI,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE;YAClD,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC,CAAC;SAC9C;QACD,IAAI,CAAC,QAAQ,GAAG,WAAW,CAAC;QAC5B,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;;;;;OAMG;IACH,aAAa;QACX,OAAO,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,aAAa,EAAE,CAAC;IAC1C,CAAC;IAED;;;;;;OAMG;IACH,WAAW;QACT,OAAO,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,WAAW,EAAE,CAAC;IAC/D,CAAC;IAED;;;;;;OAMG;IACH,eAAe;QACb,OAAO,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,eAAe,EAAE,CAAC;IAC5C,CAAC;IAED;;;;;;OAMG;IACH,aAAa;QACX,OAAO,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,aAAa,EAAE,CAAC;IACjE,CAAC;IAED;;;;;;;;OAQG;IACH,oBAAoB;QAClB,MAAM,KAAK,GAAkB,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,aAAa,EAAE,CAAC,CAAC;QAChE,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC,OAAoB,EAAE,EAAE;YAC7C,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,WAAW,EAAE,CAAC,CAAC;QACpC,CAAC,CAAC,CAAC;QACH,OAAO,KAAK,CAAC;IACf,CAAC;CACF"}

package/src/ts/Polygon.ts

@@ -27,7 +27,8 @@
  * @modified 2023-09-25 Added the `Polygon.getInterpolationPolygon(number)` function.
  * @modified 2023-09-25 Added the `Polygon.lineIntersections(Line,boolean)` function.
  * @modified 2023-09-29 Added the `Polygon.closestLineIntersection(Line,boolean)` function.
- * @version 1.11.0
+ * @modified 2023-11-24 Added the `Polygon.containsPolygon(Polygon)' function.
+ * @version 1.12.0
  *
  * @file Polygon
  * @public
@@ -184,6 +185,35 @@ export class Polygon implements SVGSerializable {
     return inside;
   }
 
+  /**
+   * Check if the passed polygon is completly contained inside this polygon.
+   *
+   * This means:
+   *  - all polygon's vertices must be inside this polygon.
+   *  - the polygon has no edge intersections with this polygon.
+   *
+   * @param {Polygon} polygon - The polygon to check if contained.
+   * @return {boolean}
+   */
+  containsPolygon(polygon: Polygon): boolean {
+    for (var i = 0; i < polygon.vertices.length; i++) {
+      if (!this.containsVert(polygon.vertices[i])) {
+        return false;
+      }
+    }
+    // All vertices are inside; check for intersections
+    const lineSegment = new Line(new Vertex(), new Vertex());
+    for (var i = 0; i < polygon.vertices.length; i++) {
+      lineSegment.a.set(polygon.vertices[i]);
+      lineSegment.b.set(polygon.vertices[(i + 1) % polygon.vertices.length]);
+      if (this.lineIntersections(lineSegment, true).length > 0) {
+        // Current segment has intersection(s) with this polygon.
+        return false;
+      }
+    }
+    return true;
+  }
+
   /**
    * Calculate the area of the given polygon (unsigned).
    *

package/src/ts/utils/Params.ts

@@ -0,0 +1,47 @@
+/**
+ * Wraps a Record<string,string> and adds type conversion methods (developed this in
+ * some other project) and added this here (2023-10-28).
+ *
+ * @author  Ikars Kappler
+ * @version 1.0.0
+ * @date    2023-03-13
+ */
+
+export class Params {
+  baseParams: Record<string, string>;
+
+  constructor(baseParams: Record<string, string>) {
+    this.baseParams = baseParams;
+  }
+
+  getString(name: string, fallback: string): string {
+    let value = this.baseParams[name];
+    if (typeof value === "undefined" || !value || (value = value.trim()).length === 0) {
+      return fallback;
+    }
+    return value;
+  }
+
+  getNumber(name: string, fallback: number): number {
+    let value = this.baseParams[name];
+    if (typeof value === "undefined" || !value || (value = value.trim()).length === 0) {
+      return fallback;
+    }
+    return Number(value);
+  }
+
+  getBoolean(name: string, fallback: boolean): boolean {
+    let value = this.baseParams[name];
+    if (typeof value === "undefined" || !value || (value = value.trim()).length === 0) {
+      return fallback;
+    }
+    value = value.toLocaleLowerCase();
+    if (value === "1" || value === "on" || value === "yes" || value === "y" || value === "hi" || value == "high") {
+      return true;
+    } else if (value === "0" || value === "off" || value === "no" || value === "n" || value === "lo" || value == "low") {
+      return false;
+    } else {
+      return Boolean(value);
+    }
+  }
+}