data-structure-typed 1.21.4 → 1.32.0

package/dist/data-structures/queue/deque.js

@@ -1,24 +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.ArrayDeque = exports.ObjectDeque = exports.Deque = void 0;
-/**
- * data-structure-typed
- *
- * @author Tyler Zeng
- * @copyright Copyright (c) 2022 Tyler Zeng <zrwusa@gmail.com>
- * @license MIT License
- */
-const linked_list_1 = require("../linked-list");
-// O(n) time complexity of obtaining the value
-// O(1) time complexity of adding at the beginning and the end
-class Deque extends linked_list_1.DoublyLinkedList {
-}
+var linked_list_1 = require("../linked-list");
+var Deque = (function (_super) {
+    __extends(Deque, _super);
+    function Deque() {
+        return _super !== null && _super.apply(this, arguments) || this;
+    }
+    return Deque;
+}(linked_list_1.DoublyLinkedList));
 exports.Deque = Deque;
-// O(1) time complexity of obtaining the value
-// O(n) time complexity of adding at the beginning and the end
-// todo tested slowest one
-class ObjectDeque {
-    constructor(capacity) {
+var ObjectDeque = (function () {
+    function ObjectDeque(capacity) {
         this._nodes = {};
         this._capacity = Number.MAX_SAFE_INTEGER;
         this._first = -1;
@@ -27,33 +35,53 @@ class ObjectDeque {
         if (capacity !== undefined)
             this._capacity = capacity;
     }
-    get nodes() {
-        return this._nodes;
-    }
-    get capacity() {
-        return this._capacity;
-    }
-    set capacity(value) {
-        this._capacity = value;
-    }
-    get first() {
-        return this._first;
-    }
-    set first(value) {
-        this._first = value;
-    }
-    get last() {
-        return this._last;
-    }
-    set last(value) {
-        this._last = value;
-    }
-    get size() {
-        return this._size;
-    }
-    addFirst(value) {
+    Object.defineProperty(ObjectDeque.prototype, "nodes", {
+        get: function () {
+            return this._nodes;
+        },
+        enumerable: false,
+        configurable: true
+    });
+    Object.defineProperty(ObjectDeque.prototype, "capacity", {
+        get: function () {
+            return this._capacity;
+        },
+        set: function (value) {
+            this._capacity = value;
+        },
+        enumerable: false,
+        configurable: true
+    });
+    Object.defineProperty(ObjectDeque.prototype, "first", {
+        get: function () {
+            return this._first;
+        },
+        set: function (value) {
+            this._first = value;
+        },
+        enumerable: false,
+        configurable: true
+    });
+    Object.defineProperty(ObjectDeque.prototype, "last", {
+        get: function () {
+            return this._last;
+        },
+        set: function (value) {
+            this._last = value;
+        },
+        enumerable: false,
+        configurable: true
+    });
+    Object.defineProperty(ObjectDeque.prototype, "size", {
+        get: function () {
+            return this._size;
+        },
+        enumerable: false,
+        configurable: true
+    });
+    ObjectDeque.prototype.addFirst = function (value) {
         if (this._size === 0) {
-            const mid = Math.floor(this._capacity / 2);
+            var mid = Math.floor(this._capacity / 2);
             this._first = mid;
             this._last = mid;
         }
@@ -62,10 +90,10 @@ class ObjectDeque {
         }
         this._nodes[this._first] = value;
         this._size++;
-    }
-    addLast(value) {
+    };
+    ObjectDeque.prototype.addLast = function (value) {
         if (this._size === 0) {
-            const mid = Math.floor(this._capacity / 2);
+            var mid = Math.floor(this._capacity / 2);
             this._first = mid;
             this._last = mid;
         }
@@ -74,158 +102,98 @@ class ObjectDeque {
         }
         this._nodes[this._last] = value;
         this._size++;
-    }
-    pollFirst() {
+    };
+    ObjectDeque.prototype.pollFirst = function () {
         if (!this._size)
             return;
-        const value = this.peekFirst();
+        var value = this.peekFirst();
         delete this._nodes[this._first];
         this._first++;
         this._size--;
         return value;
-    }
-    peekFirst() {
+    };
+    ObjectDeque.prototype.peekFirst = function () {
         if (this._size)
             return this._nodes[this._first];
-    }
-    pollLast() {
+    };
+    ObjectDeque.prototype.pollLast = function () {
         if (!this._size)
             return;
-        const value = this.peekLast();
+        var value = this.peekLast();
         delete this._nodes[this._last];
         this._last--;
         this._size--;
         return value;
-    }
-    peekLast() {
+    };
+    ObjectDeque.prototype.peekLast = function () {
         if (this._size)
             return this._nodes[this._last];
-    }
-    get(index) {
+    };
+    ObjectDeque.prototype.get = function (index) {
         return this._nodes[this._first + index] || null;
-    }
-    isEmpty() {
+    };
+    ObjectDeque.prototype.isEmpty = function () {
         return this._size <= 0;
-    }
-    _seNodes(value) {
+    };
+    ObjectDeque.prototype._seNodes = function (value) {
         this._nodes = value;
-    }
-    _setSize(value) {
+    };
+    ObjectDeque.prototype._setSize = function (value) {
         this._size = value;
-    }
-}
+    };
+    return ObjectDeque;
+}());
 exports.ObjectDeque = ObjectDeque;
-// O(1) time complexity of obtaining the value
-// O(n) time complexity of adding at the beginning and the end
-class ArrayDeque {
-    constructor() {
+var ArrayDeque = (function () {
+    function ArrayDeque() {
         this._nodes = [];
     }
-    get size() {
-        return this._nodes.length;
-    }
-    /**
-     * The function "addLast" adds a value to the end of an array.
-     * @param {T} value - The value parameter represents the value that you want to add to the end of the array.
-     * @returns The return value is the new length of the array after the value has been added.
-     */
-    addLast(value) {
+    Object.defineProperty(ArrayDeque.prototype, "size", {
+        get: function () {
+            return this._nodes.length;
+        },
+        enumerable: false,
+        configurable: true
+    });
+    ArrayDeque.prototype.addLast = function (value) {
         return this._nodes.push(value);
-    }
-    /**
-     * The function "pollLast" returns and removes the last element from an array, or returns null if the array is empty.
-     * @returns The method `pollLast()` returns the last element of the `_nodes` array, or `null` if the array is empty.
-     */
-    pollLast() {
+    };
+    ArrayDeque.prototype.pollLast = function () {
         var _a;
         return (_a = this._nodes.pop()) !== null && _a !== void 0 ? _a : null;
-    }
-    /**
-     * The `pollFirst` function removes and returns the first element from an array, or returns null if the array is empty.
-     * @returns The `pollFirst()` function returns the first element of the `_nodes` array, or `null` if the array is
-     * empty.
-     */
-    pollFirst() {
+    };
+    ArrayDeque.prototype.pollFirst = function () {
         var _a;
         return (_a = this._nodes.shift()) !== null && _a !== void 0 ? _a : null;
-    }
-    /**
-     * The function "addFirst" adds a value to the beginning of an array.
-     * @param {T} value - The value parameter represents the value that you want to add to the beginning of the array.
-     * @returns The return value of the `addFirst` function is the new length of the array `_nodes` after adding the
-     * `value` at the beginning.
-     */
-    addFirst(value) {
+    };
+    ArrayDeque.prototype.addFirst = function (value) {
         return this._nodes.unshift(value);
-    }
-    /**
-     * The `peekFirst` function returns the first element of an array or null if the array is empty.
-     * @returns The function `peekFirst()` is returning the first element (`T`) of the `_nodes` array. If the array is
-     * empty, it will return `null`.
-     */
-    peekFirst() {
+    };
+    ArrayDeque.prototype.peekFirst = function () {
         var _a;
         return (_a = this._nodes[0]) !== null && _a !== void 0 ? _a : null;
-    }
-    /**
-     * The `peekLast` function returns the last element of an array or null if the array is empty.
-     * @returns The method `peekLast()` returns the last element of the `_nodes` array, or `null` if the array is empty.
-     */
-    peekLast() {
+    };
+    ArrayDeque.prototype.peekLast = function () {
         var _a;
         return (_a = this._nodes[this._nodes.length - 1]) !== null && _a !== void 0 ? _a : null;
-    }
-    /**
-     * The get function returns the element at the specified index in an array, or null if the index is out of bounds.
-     * @param {number} index - The index parameter is a number that represents the position of the element you want to
-     * retrieve from the array.
-     * @returns The method is returning the element at the specified index in the `_nodes` array. If the element exists, it
-     * will be returned. If the element does not exist (i.e., the index is out of bounds), `null` will be returned.
-     */
-    get(index) {
+    };
+    ArrayDeque.prototype.get = function (index) {
         var _a;
         return (_a = this._nodes[index]) !== null && _a !== void 0 ? _a : null;
-    }
-    /**
-     * The set function assigns a value to a specific index in an array.
-     * @param {number} index - The index parameter is a number that represents the position of the element in the array
-     * that you want to set a new value for.
-     * @param {T} value - The value parameter represents the new value that you want to set at the specified index in the
-     * _nodes array.
-     * @returns The value that is being set at the specified index in the `_nodes` array.
-     */
-    set(index, value) {
-        return this._nodes[index] = value;
-    }
-    /**
-     * The insert function adds a value at a specified index in an array.
-     * @param {number} index - The index parameter specifies the position at which the value should be inserted in the
-     * array. It is a number that represents the index of the array where the value should be inserted. The index starts
-     * from 0, so the first element of the array has an index of 0, the second element has
-     * @param {T} value - The value parameter represents the value that you want to insert into the array at the specified
-     * index.
-     * @returns The splice method returns an array containing the removed elements, if any. In this case, since no elements
-     * are being removed, an empty array will be returned.
-     */
-    insert(index, value) {
+    };
+    ArrayDeque.prototype.set = function (index, value) {
+        return (this._nodes[index] = value);
+    };
+    ArrayDeque.prototype.insert = function (index, value) {
         return this._nodes.splice(index, 0, value);
-    }
-    /**
-     * The remove function removes an element from an array at a specified index.
-     * @param {number} index - The index parameter specifies the position of the element to be removed from the array. It
-     * is a number that represents the index of the element to be removed.
-     * @returns The method is returning an array containing the removed element.
-     */
-    remove(index) {
+    };
+    ArrayDeque.prototype.remove = function (index) {
         return this._nodes.splice(index, 1);
-    }
-    /**
-     * The function checks if an array called "_nodes" is empty.
-     * @returns The method `isEmpty()` is returning a boolean value. It returns `true` if the length of the `_nodes` array
-     * is 0, indicating that the array is empty. Otherwise, it returns `false`.
-     */
-    isEmpty() {
+    };
+    ArrayDeque.prototype.isEmpty = function () {
         return this._nodes.length === 0;
-    }
-}
+    };
+    return ArrayDeque;
+}());
 exports.ArrayDeque = ArrayDeque;
+//# sourceMappingURL=deque.js.map

package/dist/data-structures/queue/deque.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"deque.js","sourceRoot":"","sources":["../../../src/data-structures/queue/deque.ts"],"names":[],"mappings":";;;;;;;;;;;;;;;;;;AAOA,8CAAkD;AAIlD;IAA8B,yBAAmB;IAAjD;;IAAmD,CAAC;IAAD,YAAC;AAAD,CAAC,AAApD,CAA8B,8BAAgB,GAAM;AAAvC,sBAAK;AAKlB;IACE,qBAAY,QAAiB;QAIrB,WAAM,GAAyB,EAAE,CAAC;QAMlC,cAAS,GAAG,MAAM,CAAC,gBAAgB,CAAC;QAUpC,WAAM,GAAG,CAAC,CAAC,CAAC;QAUZ,UAAK,GAAG,CAAC,CAAC,CAAC;QAUX,UAAK,GAAG,CAAC,CAAC;QAvChB,IAAI,QAAQ,KAAK,SAAS;YAAE,IAAI,CAAC,SAAS,GAAG,QAAQ,CAAC;IACxD,CAAC;IAID,sBAAI,8BAAK;aAAT;YACE,OAAO,IAAI,CAAC,MAAM,CAAC;QACrB,CAAC;;;OAAA;IAID,sBAAI,iCAAQ;aAAZ;YACE,OAAO,IAAI,CAAC,SAAS,CAAC;QACxB,CAAC;aAED,UAAa,KAAa;YACxB,IAAI,CAAC,SAAS,GAAG,KAAK,CAAC;QACzB,CAAC;;;OAJA;IAQD,sBAAI,8BAAK;aAAT;YACE,OAAO,IAAI,CAAC,MAAM,CAAC;QACrB,CAAC;aAED,UAAU,KAAa;YACrB,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC;QACtB,CAAC;;;OAJA;IAQD,sBAAI,6BAAI;aAAR;YACE,OAAO,IAAI,CAAC,KAAK,CAAC;QACpB,CAAC;aAED,UAAS,KAAa;YACpB,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACrB,CAAC;;;OAJA;IAQD,sBAAI,6BAAI;aAAR;YACE,OAAO,IAAI,CAAC,KAAK,CAAC;QACpB,CAAC;;;OAAA;IAOD,8BAAQ,GAAR,UAAS,KAAQ;QACf,IAAI,IAAI,CAAC,KAAK,KAAK,CAAC,EAAE;YACpB,IAAM,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,SAAS,GAAG,CAAC,CAAC,CAAC;YAC3C,IAAI,CAAC,MAAM,GAAG,GAAG,CAAC;YAClB,IAAI,CAAC,KAAK,GAAG,GAAG,CAAC;SAClB;aAAM;YACL,IAAI,CAAC,MAAM,EAAE,CAAC;SACf;QACD,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,KAAK,CAAC;QACjC,IAAI,CAAC,KAAK,EAAE,CAAC;IACf,CAAC;IAMD,6BAAO,GAAP,UAAQ,KAAQ;QACd,IAAI,IAAI,CAAC,KAAK,KAAK,CAAC,EAAE;YACpB,IAAM,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,SAAS,GAAG,CAAC,CAAC,CAAC;YAC3C,IAAI,CAAC,MAAM,GAAG,GAAG,CAAC;YAClB,IAAI,CAAC,KAAK,GAAG,GAAG,CAAC;SAClB;aAAM;YACL,IAAI,CAAC,KAAK,EAAE,CAAC;SACd;QACD,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,KAAK,CAAC;QAChC,IAAI,CAAC,KAAK,EAAE,CAAC;IACf,CAAC;IAMD,+BAAS,GAAT;QACE,IAAI,CAAC,IAAI,CAAC,KAAK;YAAE,OAAO;QACxB,IAAM,KAAK,GAAG,IAAI,CAAC,SAAS,EAAE,CAAC;QAC/B,OAAO,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QAChC,IAAI,CAAC,MAAM,EAAE,CAAC;QACd,IAAI,CAAC,KAAK,EAAE,CAAC;QACb,OAAO,KAAK,CAAC;IACf,CAAC;IAMD,+BAAS,GAAT;QACE,IAAI,IAAI,CAAC,KAAK;YAAE,OAAO,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IAClD,CAAC;IAMD,8BAAQ,GAAR;QACE,IAAI,CAAC,IAAI,CAAC,KAAK;YAAE,OAAO;QACxB,IAAM,KAAK,GAAG,IAAI,CAAC,QAAQ,EAAE,CAAC;QAC9B,OAAO,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC/B,IAAI,CAAC,KAAK,EAAE,CAAC;QACb,IAAI,CAAC,KAAK,EAAE,CAAC;QAEb,OAAO,KAAK,CAAC;IACf,CAAC;IAMD,8BAAQ,GAAR;QACE,IAAI,IAAI,CAAC,KAAK;YAAE,OAAO,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACjD,CAAC;IASD,yBAAG,GAAH,UAAI,KAAa;QACf,OAAO,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC,IAAI,IAAI,CAAC;IAClD,CAAC;IAMD,6BAAO,GAAP;QACE,OAAO,IAAI,CAAC,KAAK,IAAI,CAAC,CAAC;IACzB,CAAC;IAES,8BAAQ,GAAlB,UAAmB,KAAyB;QAC1C,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC;IACtB,CAAC;IAES,8BAAQ,GAAlB,UAAmB,KAAa;QAC9B,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;IACrB,CAAC;IACH,kBAAC;AAAD,CAAC,AArJD,IAqJC;AArJY,kCAAW;AAyJxB;IAAA;QACY,WAAM,GAAQ,EAAE,CAAC;IA8H7B,CAAC;IA5HC,sBAAI,4BAAI;aAAR;YACE,OAAO,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC;QAC5B,CAAC;;;OAAA;IAWD,4BAAO,GAAP,UAAQ,KAAQ;QACd,OAAO,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACjC,CAAC;IAMD,6BAAQ,GAAR;;QACE,OAAO,MAAA,IAAI,CAAC,MAAM,CAAC,GAAG,EAAE,mCAAI,IAAI,CAAC;IACnC,CAAC;IAOD,8BAAS,GAAT;;QACE,OAAO,MAAA,IAAI,CAAC,MAAM,CAAC,KAAK,EAAE,mCAAI,IAAI,CAAC;IACrC,CAAC;IAYD,6BAAQ,GAAR,UAAS,KAAQ;QACf,OAAO,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;IACpC,CAAC;IAOD,8BAAS,GAAT;;QACE,OAAO,MAAA,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,mCAAI,IAAI,CAAC;IAChC,CAAC;IAMD,6BAAQ,GAAR;;QACE,OAAO,MAAA,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,mCAAI,IAAI,CAAC;IACrD,CAAC;IAaD,wBAAG,GAAH,UAAI,KAAa;;QACf,OAAO,MAAA,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,mCAAI,IAAI,CAAC;IACpC,CAAC;IAUD,wBAAG,GAAH,UAAI,KAAa,EAAE,KAAQ;QACzB,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,GAAG,KAAK,CAAC,CAAC;IACtC,CAAC;IAYD,2BAAM,GAAN,UAAO,KAAa,EAAE,KAAQ;QAC5B,OAAO,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,EAAE,KAAK,CAAC,CAAC;IAC7C,CAAC;IAQD,2BAAM,GAAN,UAAO,KAAa;QAClB,OAAO,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;IACtC,CAAC;IAOD,4BAAO,GAAP;QACE,OAAO,IAAI,CAAC,MAAM,CAAC,MAAM,KAAK,CAAC,CAAC;IAClC,CAAC;IACH,iBAAC;AAAD,CAAC,AA/HD,IA+HC;AA/HY,gCAAU"}

package/dist/data-structures/queue/index.js

@@ -16,3 +16,4 @@ var __exportStar = (this && this.__exportStar) || function(m, exports) {
 Object.defineProperty(exports, "__esModule", { value: true });
 __exportStar(require("./queue"), exports);
 __exportStar(require("./deque"), exports);
+//# sourceMappingURL=index.js.map

package/dist/data-structures/queue/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../src/data-structures/queue/index.ts"],"names":[],"mappings":";;;;;;;;;;;;;;;;AAAA,0CAAwB;AACxB,0CAAwB"}