data-structure-typed 0.8.17 → 0.9.16

package/dist/data-structures/matrix/vector2d.js

@@ -1,161 +1,184 @@
 "use strict";
 Object.defineProperty(exports, "__esModule", { value: true });
-class Vector2D {
-    static add(vector1, vector2) {
-        return new Vector2D(vector1.x + vector2.x, vector1.y + vector2.y);
+exports.Vector2D = void 0;
+var Vector2D = /** @class */ (function () {
+    function Vector2D(x, y, w // needed for matrix multiplication
+    ) {
+        if (x === void 0) { x = 0; }
+        if (y === void 0) { y = 0; }
+        if (w === void 0) { w = 1; }
+        this.x = x;
+        this.y = y;
+        this.w = w;
     }
-    static subtract(vector1, vector2) {
+    Object.defineProperty(Vector2D.prototype, "isZero", {
+        /**
+         * Set x and y both to zero
+         */
+        get: function () {
+            return this.x === 0 && this.y === 0;
+        },
+        enumerable: false,
+        configurable: true
+    });
+    Object.defineProperty(Vector2D.prototype, "length", {
+        /**
+         * The length / magnitude of the vector
+         */
+        get: function () {
+            return Math.sqrt((this.x * this.x) + (this.y * this.y));
+        },
+        enumerable: false,
+        configurable: true
+    });
+    Object.defineProperty(Vector2D.prototype, "lengthSq", {
+        /**
+         * The squared length of the vector
+         */
+        get: function () {
+            return (this.x * this.x) + (this.y * this.y);
+        },
+        enumerable: false,
+        configurable: true
+    });
+    Object.defineProperty(Vector2D.prototype, "rounded", {
+        /**
+         * Return the vector with rounded values
+         */
+        get: function () {
+            return new Vector2D(Math.round(this.x), Math.round(this.y));
+        },
+        enumerable: false,
+        configurable: true
+    });
+    Vector2D.add = function (vector1, vector2) {
+        return new Vector2D(vector1.x + vector2.x, vector1.y + vector2.y);
+    };
+    Vector2D.subtract = function (vector1, vector2) {
         return new Vector2D(vector1.x - vector2.x, vector1.y - vector2.y);
-    }
-    static subtractValue(vector, value) {
+    };
+    Vector2D.subtractValue = function (vector, value) {
         return new Vector2D(vector.x - value, vector.y - value);
-    }
-    static multiply(vector, value) {
+    };
+    Vector2D.multiply = function (vector, value) {
         return new Vector2D(vector.x * value, vector.y * value);
-    }
-    static divide(vector, value) {
+    };
+    Vector2D.divide = function (vector, value) {
         return new Vector2D(vector.x / value, vector.y / value);
-    }
-    static equals(vector1, vector2) {
+    };
+    Vector2D.equals = function (vector1, vector2) {
         return vector1.x === vector2.x && vector1.y === vector2.y;
-    }
-    static equalsRounded(vector1, vector2, roundingFactor = 12) {
-        const vector = Vector2D.abs(Vector2D.subtract(vector1, vector2));
+    };
+    Vector2D.equalsRounded = function (vector1, vector2, roundingFactor) {
+        if (roundingFactor === void 0) { roundingFactor = 12; }
+        var vector = Vector2D.abs(Vector2D.subtract(vector1, vector2));
         if (vector.x < roundingFactor && vector.y < roundingFactor) {
             return true;
         }
         return false;
-    }
+    };
     /**
      * Normalizes the vector if it matches a certain condition
      */
-    static normalize(vector) {
-        const length = vector.length;
+    Vector2D.normalize = function (vector) {
+        var length = vector.length;
         if (length > 2.220446049250313e-16) { // Epsilon
             return Vector2D.divide(vector, length);
         }
         return vector;
-    }
+    };
     /**
      * Adjusts x and y so that the length of the vector does not exceed max
      */
-    static truncate(vector, max) {
+    Vector2D.truncate = function (vector, max) {
         if (vector.length > max) {
             return Vector2D.multiply(Vector2D.normalize(vector), max);
         }
         return vector;
-    }
+    };
     /**
      * The vector that is perpendicular to this one
      */
-    static perp(vector) {
+    Vector2D.perp = function (vector) {
         return new Vector2D(-vector.y, vector.x);
-    }
+    };
     /**
      * returns the vector that is the reverse of this vector
      */
-    static reverse(vector) {
+    Vector2D.reverse = function (vector) {
         return new Vector2D(-vector.x, -vector.y);
-    }
-    static abs(vector) {
+    };
+    Vector2D.abs = function (vector) {
         return new Vector2D(Math.abs(vector.x), Math.abs(vector.y));
-    }
+    };
     /**
      * The dot product of v1 and v2
      */
-    static dot(vector1, vector2) {
+    Vector2D.dot = function (vector1, vector2) {
         return (vector1.x * vector2.x) + (vector1.y * vector2.y);
-    }
+    };
+    // /**
+    //  * Transform vectors based on the current tranformation matrices: translation, rotation and scale
+    //  * @param vectors The vectors to transform
+    //  */
+    // public static transform(vector: Vector2D, transformation: Matrix2D): Vector2D {
+    //     return Matrix2D.multiplyByVector(transformation, vector)
+    // }
+    // /**
+    //  * Transform vectors based on the current tranformation matrices: translation, rotation and scale
+    //  * @param vectors The vectors to transform
+    //  */
+    // public static transformList(vectors: Vector2D[], transformation: Matrix2D): Vector2D[] {
+    //     return vectors.map(vector => Matrix2D.multiplyByVector(transformation, vector))
+    // }
     /**
      * The distance between this and the vector
      */
-    static distance(vector1, vector2) {
-        const ySeparation = vector2.y - vector1.y;
-        const xSeparation = vector2.x - vector1.x;
+    Vector2D.distance = function (vector1, vector2) {
+        var ySeparation = vector2.y - vector1.y;
+        var xSeparation = vector2.x - vector1.x;
         return Math.sqrt((ySeparation * ySeparation) + (xSeparation * xSeparation));
-    }
+    };
     /**
      * The distance between this and the vector squared
      */
-    static distanceSq(vector1, vector2) {
-        const ySeparation = vector2.y - vector1.y;
-        const xSeparation = vector2.x - vector1.x;
+    Vector2D.distanceSq = function (vector1, vector2) {
+        var ySeparation = vector2.y - vector1.y;
+        var xSeparation = vector2.x - vector1.x;
         return (ySeparation * ySeparation) + (xSeparation * xSeparation);
-    }
+    };
     /**
      * Returns positive if v2 is clockwise of this vector, negative if counterclockwise
      * (assuming the Y axis is pointing down, X axis to right like a Window app)
      */
-    static sign(vector1, vector2) {
+    Vector2D.sign = function (vector1, vector2) {
         if (vector1.y * vector2.x > vector1.x * vector2.y) {
             return -1;
         }
         return 1;
-    }
+    };
     /**
      * Returns the angle between origin and the given vector in radians
      * @param vector
      */
-    static angle(vector) {
-        const origin = new Vector2D(0, -1);
-        const radian = Math.acos(Vector2D.dot(vector, origin) / (vector.length * origin.length));
+    Vector2D.angle = function (vector) {
+        var origin = new Vector2D(0, -1);
+        var radian = Math.acos(Vector2D.dot(vector, origin) / (vector.length * origin.length));
         return Vector2D.sign(vector, origin) === 1 ? ((Math.PI * 2) - radian) : radian;
-    }
-    static random(maxX, maxY) {
-        const randX = Math.floor(Math.random() * maxX - (maxX / 2));
-        const randY = Math.floor(Math.random() * maxY - (maxY / 2));
+    };
+    Vector2D.random = function (maxX, maxY) {
+        var randX = Math.floor(Math.random() * maxX - (maxX / 2));
+        var randY = Math.floor(Math.random() * maxY - (maxY / 2));
         return new Vector2D(randX, randY);
-    }
-    // /**
-    //  * Transform vectors based on the current tranformation matrices: translation, rotation and scale
-    //  * @param vectors The vectors to transform
-    //  */
-    // public static transform(vector: Vector2D, transformation: Matrix2D): Vector2D {
-    //     return Matrix2D.multiplyByVector(transformation, vector)
-    // }
-    // /**
-    //  * Transform vectors based on the current tranformation matrices: translation, rotation and scale
-    //  * @param vectors The vectors to transform
-    //  */
-    // public static transformList(vectors: Vector2D[], transformation: Matrix2D): Vector2D[] {
-    //     return vectors.map(vector => Matrix2D.multiplyByVector(transformation, vector))
-    // }
-    constructor(x = 0, y = 0, w = 1 // needed for matrix multiplication
-    ) {
-        this.x = x;
-        this.y = y;
-        this.w = w;
-    }
+    };
     /**
      * Check wether both x and y are zero
      */
-    zero() {
+    Vector2D.prototype.zero = function () {
         this.x = 0;
         this.y = 0;
-    }
-    /**
-     * Set x and y both to zero
-     */
-    get isZero() {
-        return this.x === 0 && this.y === 0;
-    }
-    /**
-     * The length / magnitude of the vector
-     */
-    get length() {
-        return Math.sqrt((this.x * this.x) + (this.y * this.y));
-    }
-    /**
-     * The squared length of the vector
-     */
-    get lengthSq() {
-        return (this.x * this.x) + (this.y * this.y);
-    }
-    /**
-     * Return the vector with rounded values
-     */
-    get rounded() {
-        return new Vector2D(Math.round(this.x), Math.round(this.y));
-    }
-}
+    };
+    return Vector2D;
+}());
+exports.Vector2D = Vector2D;
 exports.default = Vector2D;

package/dist/data-structures/priority-queue/max-priority-queue.d.ts

@@ -1,4 +1,5 @@
-import { PriorityQueue, PriorityQueueOptions } from './priority-queue';
+import { PriorityQueue } from './priority-queue';
+import type { PriorityQueueOptions } from '../types';
 export declare class MaxPriorityQueue<T = number> extends PriorityQueue<T> {
-    constructor(options: PriorityQueueOptions<T>);
+    constructor(options?: PriorityQueueOptions<T>);
 }

package/dist/data-structures/priority-queue/max-priority-queue.js

@@ -1,15 +1,32 @@
 "use strict";
+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.MaxPriorityQueue = void 0;
-const priority_queue_1 = require("./priority-queue");
-class MaxPriorityQueue extends priority_queue_1.PriorityQueue {
-    constructor(options) {
-        super({
-            nodes: options.nodes, comparator: (a, b) => {
-                const aKey = a, bKey = b;
+var priority_queue_1 = require("./priority-queue");
+var MaxPriorityQueue = /** @class */ (function (_super) {
+    __extends(MaxPriorityQueue, _super);
+    function MaxPriorityQueue(options) {
+        return _super.call(this, {
+            nodes: options === null || options === void 0 ? void 0 : options.nodes, comparator: (options === null || options === void 0 ? void 0 : options.comparator) ? options.comparator : function (a, b) {
+                var aKey = a, bKey = b;
                 return bKey - aKey;
             }
-        });
+        }) || this;
     }
-}
+    return MaxPriorityQueue;
+}(priority_queue_1.PriorityQueue));
 exports.MaxPriorityQueue = MaxPriorityQueue;

package/dist/data-structures/priority-queue/min-priority-queue.d.ts

@@ -1,4 +1,5 @@
-import { PriorityQueue, PriorityQueueOptions } from './priority-queue';
+import { PriorityQueue } from './priority-queue';
+import type { PriorityQueueOptions } from '../types';
 export declare class MinPriorityQueue<T = number> extends PriorityQueue<T> {
-    constructor(options: PriorityQueueOptions<T>);
+    constructor(options?: PriorityQueueOptions<T>);
 }

package/dist/data-structures/priority-queue/min-priority-queue.js

@@ -1,15 +1,32 @@
 "use strict";
+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.MinPriorityQueue = void 0;
-const priority_queue_1 = require("./priority-queue");
-class MinPriorityQueue extends priority_queue_1.PriorityQueue {
-    constructor(options) {
-        super({
-            nodes: options.nodes, comparator: (a, b) => {
-                const aKey = a, bKey = b;
+var priority_queue_1 = require("./priority-queue");
+var MinPriorityQueue = /** @class */ (function (_super) {
+    __extends(MinPriorityQueue, _super);
+    function MinPriorityQueue(options) {
+        return _super.call(this, {
+            nodes: options === null || options === void 0 ? void 0 : options.nodes, comparator: (options === null || options === void 0 ? void 0 : options.comparator) ? options.comparator : function (a, b) {
+                var aKey = a, bKey = b;
                 return aKey - bKey;
             }
-        });
+        }) || this;
     }
-}
+    return MinPriorityQueue;
+}(priority_queue_1.PriorityQueue));
 exports.MinPriorityQueue = MinPriorityQueue;

package/dist/data-structures/priority-queue/priority-queue.d.ts

@@ -1,25 +1,10 @@
-export type PriorityQueueComparator<T> = (a: T, b: T) => number;
-export interface PriorityQueueOptions<T> {
-    nodes?: T[];
-    isFix?: boolean;
-    comparator: PriorityQueueComparator<T>;
-}
-export type PriorityQueueDFSOrderPattern = 'pre' | 'in' | 'post';
+import type { PriorityQueueComparator, PriorityQueueDFSOrderPattern, PriorityQueueOptions } from '../types';
 export declare class PriorityQueue<T = number> {
     protected nodes: T[];
-    get size(): number;
-    protected readonly _comparator: PriorityQueueComparator<T>;
     constructor(options: PriorityQueueOptions<T>);
-    protected _compare(a: number, b: number): boolean;
-    protected _swap(a: number, b: number): void;
-    protected _isValidIndex(index: number): boolean;
-    protected _getParent(child: number): number;
-    protected _getLeft(parent: number): number;
-    protected _getRight(parent: number): number;
-    protected _getComparedChild(parent: number): number;
-    protected _heapifyUp(start: number): void;
-    protected _heapifyDown(start: number): void;
-    protected _fix(): void;
+    get size(): number;
+    static heapify<T>(options: PriorityQueueOptions<T>): PriorityQueue<T>;
+    static isPriorityQueueified<T>(options: Omit<PriorityQueueOptions<T>, 'isFix'>): boolean;
     offer(node: T): void;
     peek(): T | null;
     poll(): T | null;
@@ -31,6 +16,15 @@ export declare class PriorityQueue<T = number> {
     isValid(): boolean;
     sort(): T[];
     DFS(dfsMode: PriorityQueueDFSOrderPattern): (T | null)[];
-    static heapify<T>(options: PriorityQueueOptions<T>): PriorityQueue<T>;
-    static isPriorityQueueified<T>(options: Omit<PriorityQueueOptions<T>, 'isFix'>): boolean;
+    protected readonly _comparator: PriorityQueueComparator<T>;
+    protected _compare(a: number, b: number): boolean;
+    protected _swap(a: number, b: number): void;
+    protected _isValidIndex(index: number): boolean;
+    protected _getParent(child: number): number;
+    protected _getLeft(parent: number): number;
+    protected _getRight(parent: number): number;
+    protected _getComparedChild(parent: number): number;
+    protected _heapifyUp(start: number): void;
+    protected _heapifyDown(start: number): void;
+    protected _fix(): void;
 }