plotboilerplate 1.20.2 → 1.22.0

package/src/cjs/utils/datastructures/DataGrid2d.d.ts

@@ -0,0 +1,47 @@
+/**
+ * A 2D datagrid interface for getting/storing data in some 2 dimensional array style types.
+ *
+ *  _|---- xIndex --->
+ *  |       d[0][0], d[1][0], d[2][0], ..., d[xSegmentCount-1][0]
+ *  yIndex
+ *  |       d[0][1], d[1][1], d[2][1], ..., d[xSegmentCount-1][1]
+ *  |
+ *  v       ...
+ *
+ *          d[0][ySegmentCount-1], ..., ..., d[xSegmentCount-1][ySegmentCount-1]
+ *
+ *
+ * @date    2023-11-04
+ * @author  Ikaros Kappler
+ * @version 1.0.0
+ */
+export declare type DataGridFace4<T> = [[T | null, T | null], [T | null, T | null]];
+export interface IDataGrid2d<T> {
+    readonly xSegmentCount: number;
+    readonly ySegmentCount: number;
+    getMinDataValue(): T;
+    getMaxDataValue(): T;
+    getDataValueAt(xIndex: number, yIndex: number): T | null;
+    /**
+     * Extract a 2x2 matrix (a "face4") from the underlyting data.
+     *
+     * Imagine a face4 element like this
+     *     (x,y)       (x+1,y)
+     *          A-----B
+     *          |     |
+     *          |     |
+     *          D-----C
+     *   (x,y+1)        (x+1,y+1)
+     *
+     * then result in the buffer will be
+     *   [ [A,B],
+     *     [D,C] ]
+     *
+     * If any index is invalid then the resulting buffer element will be null.
+     *
+     * @param {number} xIndex - The x index in `0 <= xIndex < xSegmentCount`.
+     * @param {number} yIndex - The y index in `0 <= yIndex < ySegmentCount`.
+     * @param {[[T,T],[T,T]]} buffer - The result buffer for four elements.
+     */
+    getDataFace4At(xIndex: number, yIndex: number, buffer: DataGridFace4<T>): void;
+}

package/src/cjs/utils/datastructures/DataGrid2d.js

@@ -0,0 +1,20 @@
+"use strict";
+/**
+ * A 2D datagrid interface for getting/storing data in some 2 dimensional array style types.
+ *
+ *  _|---- xIndex --->
+ *  |       d[0][0], d[1][0], d[2][0], ..., d[xSegmentCount-1][0]
+ *  yIndex
+ *  |       d[0][1], d[1][1], d[2][1], ..., d[xSegmentCount-1][1]
+ *  |
+ *  v       ...
+ *
+ *          d[0][ySegmentCount-1], ..., ..., d[xSegmentCount-1][ySegmentCount-1]
+ *
+ *
+ * @date    2023-11-04
+ * @author  Ikaros Kappler
+ * @version 1.0.0
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+//# sourceMappingURL=DataGrid2d.js.map

package/src/cjs/utils/datastructures/DataGrid2d.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"DataGrid2d.js","sourceRoot":"","sources":["../../../ts/utils/datastructures/DataGrid2d.ts"],"names":[],"mappings":";AAAA;;;;;;;;;;;;;;;;GAgBG"}

package/src/cjs/utils/datastructures/DataGrid2dListAdapter.d.ts

@@ -0,0 +1,65 @@
+/**
+ * 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
+ **/
+import { DataGridFace4, IDataGrid2d } from "./DataGrid2d";
+declare type Triplet<T> = {
+    x: T;
+    y: T;
+    z: T;
+};
+declare type RasterPosition = {
+    xIndex: number;
+    yIndex: number;
+    xRel?: number;
+    yRel?: number;
+};
+export declare class DataGrid2dListAdapter<T> implements IDataGrid2d<T> {
+    /**
+     * @override
+     */
+    readonly xSegmentCount: number;
+    /**
+     * @override
+     */
+    readonly ySegmentCount: number;
+    minDataValue: T;
+    maxDataValue: T;
+    minXValue: T;
+    maxXValue: T;
+    minYValue: T;
+    maxYValue: T;
+    private _dataList;
+    /**
+     * 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: Array<Triplet<T>>, xSegmentCount: number, ySegmentCount: number);
+    getIndicesFromBufferIndex(bufferIndex: number): RasterPosition;
+    getCoordsFromBufferIndex(bufferIndex: number): RasterPosition;
+    coordinateIndicesToBufferIndex(xIndex: number, yIndex: number): number;
+    /**
+     * @override
+     */
+    getMinDataValue(): T;
+    /**
+     * @override
+     */
+    getMaxDataValue(): T;
+    /**
+     * @override
+     */
+    getDataValueAt(xIndex: number, yIndex: number, isDebug?: boolean): T | null;
+    /**
+     * @override
+     */
+    getDataFace4At(xIndex: number, yIndex: number, buffer: DataGridFace4<T>): void;
+}
+export {};

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

@@ -0,0 +1,84 @@
+"use strict";
+/**
+ * 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
+ **/
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.DataGrid2dListAdapter = void 0;
+var DataGrid2dListAdapter = /** @class */ (function () {
+    /**
+     * 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
+     */
+    function DataGrid2dListAdapter(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;
+    }
+    DataGrid2dListAdapter.prototype.getIndicesFromBufferIndex = function (bufferIndex) {
+        return { xIndex: Math.floor(bufferIndex % this.xSegmentCount), yIndex: Math.floor(bufferIndex / this.xSegmentCount) };
+    };
+    DataGrid2dListAdapter.prototype.getCoordsFromBufferIndex = function (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;
+    };
+    DataGrid2dListAdapter.prototype.coordinateIndicesToBufferIndex = function (xIndex, yIndex) {
+        return yIndex * this.xSegmentCount + xIndex;
+    };
+    /**
+     * @override
+     */
+    DataGrid2dListAdapter.prototype.getMinDataValue = function () {
+        return this.minDataValue;
+    };
+    /**
+     * @override
+     */
+    DataGrid2dListAdapter.prototype.getMaxDataValue = function () {
+        return this.maxDataValue;
+    };
+    /**
+     * @override
+     */
+    DataGrid2dListAdapter.prototype.getDataValueAt = function (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
+     */
+    DataGrid2dListAdapter.prototype.getDataFace4At = function (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);
+    };
+    return DataGrid2dListAdapter;
+}());
+exports.DataGrid2dListAdapter = DataGrid2dListAdapter;
+//# sourceMappingURL=DataGrid2dListAdapter.js.map

package/src/cjs/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;IAmBE;;;;;;OAMG;IACH,+BAAY,IAAuB,EAAE,aAAqB,EAAE,aAAqB;QAC/E,IAAI,aAAa,GAAG,aAAa,GAAG,IAAI,CAAC,MAAM,EAAE;YAC/C,MAAM,2DAAyD,IAAI,CAAC,MAAM,4CAAuC,aAAa,SAAI,aAAa,uBAAoB,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,yDAAyB,GAAzB,UAA0B,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,wDAAwB,GAAxB,UAAyB,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,8DAA8B,GAA9B,UAA+B,MAAc,EAAE,MAAc;QAC3D,OAAO,MAAM,GAAG,IAAI,CAAC,aAAa,GAAG,MAAM,CAAC;IAC9C,CAAC;IAED;;OAEG;IACH,+CAAe,GAAf;QACE,OAAO,IAAI,CAAC,YAAY,CAAC;IAC3B,CAAC;IAED;;OAEG;IACH,+CAAe,GAAf;QACE,OAAO,IAAI,CAAC,YAAY,CAAC;IAC3B,CAAC;IAED;;OAEG;IACH,8CAAc,GAAd,UAAe,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,8CAAc,GAAd,UAAe,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;IACH,4BAAC;AAAD,CAAC,AAhGD,IAgGC;AAhGY,sDAAqB"}

package/src/cjs/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/cjs/utils/datastructures/GenericPath.js

@@ -1,8 +1,9 @@
 "use strict";
 /**
- * @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.
  */
 Object.defineProperty(exports, "__esModule", { value: true });
 exports.GenericPath = void 0;
@@ -99,6 +100,22 @@ var GenericPath = /** @class */ (function () {
     GenericPath.prototype.getEndTangent = function () {
         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>}
+     */
+    GenericPath.prototype.getAllStartEndPoints = function () {
+        var verts = [this.segments[0].getStartPoint()];
+        this.segments.forEach(function (segment) {
+            verts.push(segment.getEndPoint());
+        });
+        return verts;
+    };
     return GenericPath;
 }());
 exports.GenericPath = GenericPath;

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

@@ -1 +1 @@
-{"version":3,"file":"GenericPath.js","sourceRoot":"","sources":["../../../ts/utils/datastructures/GenericPath.ts"],"names":[],"mappings":";AAAA;;;;GAIG;;;AAKH;IAGE,qBAAY,YAAyB;QACnC,IAAI,CAAC,QAAQ,GAAG,CAAC,YAAY,CAAC,CAAC;IACjC,CAAC;IAED;;;;;;OAMG;IACH,qCAAe,GAAf;QACE,OAAO,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC;IAC9B,CAAC;IAED;;;;;;OAMG;IACH,kCAAY,GAAZ,UAAa,KAAa;QACxB,OAAO,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;IAC9B,CAAC;IAED;;;;;;OAMG;IACH,2BAAK,GAAL;QACE,IAAM,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,6BAAO,GAAP;QACE,IAAM,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,mCAAa,GAAb;QACE,OAAO,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,aAAa,EAAE,CAAC;IAC1C,CAAC;IAED;;;;;;OAMG;IACH,iCAAW,GAAX;QACE,OAAO,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,WAAW,EAAE,CAAC;IAC/D,CAAC;IAED;;;;;;OAMG;IACH,qCAAe,GAAf;QACE,OAAO,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,eAAe,EAAE,CAAC;IAC5C,CAAC;IAED;;;;;;OAMG;IACH,mCAAa,GAAb;QACE,OAAO,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,aAAa,EAAE,CAAC;IACjE,CAAC;IACH,kBAAC;AAAD,CAAC,AAvGD,IAuGC;AAvGY,kCAAW"}
+{"version":3,"file":"GenericPath.js","sourceRoot":"","sources":["../../../ts/utils/datastructures/GenericPath.ts"],"names":[],"mappings":";AAAA;;;;;GAKG;;;AAKH;IAGE,qBAAY,YAAyB;QACnC,IAAI,CAAC,QAAQ,GAAG,CAAC,YAAY,CAAC,CAAC;IACjC,CAAC;IAED;;;;;;OAMG;IACH,qCAAe,GAAf;QACE,OAAO,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC;IAC9B,CAAC;IAED;;;;;;OAMG;IACH,kCAAY,GAAZ,UAAa,KAAa;QACxB,OAAO,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;IAC9B,CAAC;IAED;;;;;;OAMG;IACH,2BAAK,GAAL;QACE,IAAM,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,6BAAO,GAAP;QACE,IAAM,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,mCAAa,GAAb;QACE,OAAO,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,aAAa,EAAE,CAAC;IAC1C,CAAC;IAED;;;;;;OAMG;IACH,iCAAW,GAAX;QACE,OAAO,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,WAAW,EAAE,CAAC;IAC/D,CAAC;IAED;;;;;;OAMG;IACH,qCAAe,GAAf;QACE,OAAO,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,eAAe,EAAE,CAAC;IAC5C,CAAC;IAED;;;;;;OAMG;IACH,mCAAa,GAAb;QACE,OAAO,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,aAAa,EAAE,CAAC;IACjE,CAAC;IAED;;;;;;;;OAQG;IACH,0CAAoB,GAApB;QACE,IAAM,KAAK,GAAkB,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,aAAa,EAAE,CAAC,CAAC;QAChE,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,UAAC,OAAoB;YACzC,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,WAAW,EAAE,CAAC,CAAC;QACpC,CAAC,CAAC,CAAC;QACH,OAAO,KAAK,CAAC;IACf,CAAC;IACH,kBAAC;AAAD,CAAC,AAxHD,IAwHC;AAxHY,kCAAW"}

package/src/cjs/utils/detectDarkMode.d.ts

@@ -0,0 +1,10 @@
+/**
+ * @author  Ikaros Kappler
+ * @date    2021-11-07
+ * @modified 2023-09-25 Ported to Typescript and added system darkmode detection.
+ * @version 1.1.0
+ *
+ * @param {Record<string,string>} GUP
+ * @returns {boolean}
+ */
+export declare const detectDarkMode: (GUP?: Record<string, string>) => boolean;

package/src/cjs/utils/detectDarkMode.js

@@ -0,0 +1,32 @@
+"use strict";
+/**
+ * @author  Ikaros Kappler
+ * @date    2021-11-07
+ * @modified 2023-09-25 Ported to Typescript and added system darkmode detection.
+ * @version 1.1.0
+ *
+ * @param {Record<string,string>} GUP
+ * @returns {boolean}
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.detectDarkMode = void 0;
+var detectDarkMode = function (GUP) {
+    // Respect overrides
+    if (typeof GUP !== "undefined" && GUP.hasOwnProperty("darkmode") && GUP["darkmode"]) {
+        // const overrideValue = PlotBoilerplate.utils.fetch.bool(GUP, "darkmode", null);
+        var overrideValue = !!JSON.parse(GUP["darkmode"]);
+        if (overrideValue !== null) {
+            return overrideValue;
+        }
+    }
+    if (globalThis.matchMedia && globalThis.matchMedia("(prefers-color-scheme: dark)").matches) {
+        // dark mode by system
+        return true;
+    }
+    // else: dark mode by daytime
+    var hours = new Date().getHours();
+    var isDayTime = hours > 6 && hours < 18;
+    return !isDayTime;
+};
+exports.detectDarkMode = detectDarkMode;
+//# sourceMappingURL=detectDarkMode.js.map

package/src/cjs/utils/detectDarkMode.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"detectDarkMode.js","sourceRoot":"","sources":["../../ts/utils/detectDarkMode.ts"],"names":[],"mappings":";AAAA;;;;;;;;GAQG;;;AAII,IAAM,cAAc,GAAG,UAAC,GAA4B;IACzD,oBAAoB;IACpB,IAAI,OAAO,GAAG,KAAK,WAAW,IAAI,GAAG,CAAC,cAAc,CAAC,UAAU,CAAC,IAAI,GAAG,CAAC,UAAU,CAAC,EAAE;QACnF,iFAAiF;QACjF,IAAM,aAAa,GAAG,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC,CAAC;QACpD,IAAI,aAAa,KAAK,IAAI,EAAE;YAC1B,OAAO,aAAa,CAAC;SACtB;KACF;IACD,IAAI,UAAU,CAAC,UAAU,IAAI,UAAU,CAAC,UAAU,CAAC,8BAA8B,CAAC,CAAC,OAAO,EAAE;QAC1F,sBAAsB;QACtB,OAAO,IAAI,CAAC;KACb;IACD,6BAA6B;IAC7B,IAAM,KAAK,GAAG,IAAI,IAAI,EAAE,CAAC,QAAQ,EAAE,CAAC;IACpC,IAAM,SAAS,GAAG,KAAK,GAAG,CAAC,IAAI,KAAK,GAAG,EAAE,CAAC;IAC1C,OAAO,CAAC,SAAS,CAAC;AACpB,CAAC,CAAC;AAjBW,QAAA,cAAc,kBAiBzB"}

package/src/esm/BezierPath.d.ts

@@ -23,7 +23,9 @@
  * @modified 2022-01-31 Added `BezierPath.getEvenDistributionVertices(number)`.
  * @modified 2022-02-02 Added the `destroy` method.
  * @modified 2022-02-02 Cleared the `toSVGString` function (deprecated). Use `drawutilssvg` instead.
- * @version 2.5.0
+ * @modified 2023-10-06 Adding the `BezierPath.toPathPoints()` method.
+ * @modified 2023-10-07 Adding the `BezierPath.fromCurve(CubicBezierCurve)` static function.
+ * @version 2.6.0
  *
  * @file BezierPath
  * @public
@@ -212,54 +214,6 @@ export declare class BezierPath implements SVGSerializable {
      * @return {CubicBezierCurve} The curve at the specified index.
      **/
     getCurveAt(curveIndex: number): CubicBezierCurve;
-    /**
-     * Remove the end point of this path (which removes the last curve from this path).<br>
-     * <br>
-     * Please note that this function does never remove the first curve, thus the path
-     * cannot be empty after this call.
-     *
-     * @method removeEndPoint
-     * @instance
-     * @memberof BezierPath
-     * @return {boolean} Indicating if the last curve was removed.
-     **/
-    /**
-     * Remove the start point of this path (which removes the first curve from this path).<br>
-     * <br>
-     * Please note that this function does never remove the last curve, thus the path
-     * cannot be empty after this call.<br>
-     *
-     * @method removeStartPoint
-     * @instance
-     * @memberof BezierPath
-     * @return {boolean} Indicating if the first curve was removed.
-     **/
-    /**
-     * Removes a path point inside the path.
-     *
-     * This function joins the bezier curve at the given index with
-     * its predecessor, which means that the start point at the given
-     * curve index will be removed.
-     *
-     * @method joinAt
-     * @param {number} curveIndex - The index of the curve to be joined with its predecessor.
-     * @instance
-     * @memberof BezierPath
-     * @return {boolean} True if the passed index indicated an inner vertex and the two curves were joined.
-     **/
-    /**
-     * Add a new inner curve point to the path.<br>
-     * <br>
-     * This function splits the bezier curve at the given index and given
-     * curve segment index.
-     *
-     * @method splitAt
-     * @param {number} curveIndex - The index of the curve to split.
-     * @param {nunber} segmentIndex - The index of the curve segment where the split should be performed.
-     * @instance
-     * @memberof BezierPath
-     * @return {boolean} True if the passed indices were valid and the path was split.
-     **/
     /**
      * Move the whole bezier path by the given (x,y)-amount.
      *
@@ -519,8 +473,22 @@ export declare class BezierPath implements SVGSerializable {
      * This function should invalidate any installed listeners and invalidate this object.
      * After calling this function the object might not hold valid data any more and
      * should not be used.
+     *
+     * @method destroy
+     * @instance
+     * @memberof BezierPath
      */
     destroy(): void;
+    /**
+     * Convert this path to an array of path points that can be drawn by the default DrawLib
+     * implementations.
+     *
+     * @method toPathPoints
+     * @instance
+     * @memberof BezierPath
+     * @return {Array<XYCoords>}
+     */
+    toPathPoints(): Array<XYCoords>;
     /**
      * Create a JSON string representation of this bézier curve.
      *
@@ -542,6 +510,16 @@ export declare class BezierPath implements SVGSerializable {
      * @return {BezierPath} The parsed bezier path instance.
      **/
     static fromJSON(jsonString: string): BezierPath;
+    /**
+     * Construct a new path with a single curve. Adding more curves is always possible.
+     *
+     * @method fromCurve
+     * @param {CubicBezierCurve} curve - The curve to construct a new path from.
+     * @static
+     * @memberof BezierPath
+     * @return {BezierPath} The constructed bezier path instance.
+     */
+    static fromCurve(curve: CubicBezierCurve): BezierPath;
     /**
      * Create a BezierPath instance from the given array.
      *