data-structure-typed 1.21.4 → 1.32.0

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

@@ -1,110 +1,191 @@
 "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 __());
+    };
+})();
+var __generator = (this && this.__generator) || function (thisArg, body) {
+    var _ = { label: 0, sent: function() { if (t[0] & 1) throw t[1]; return t[1]; }, trys: [], ops: [] }, f, y, t, g;
+    return g = { next: verb(0), "throw": verb(1), "return": verb(2) }, typeof Symbol === "function" && (g[Symbol.iterator] = function() { return this; }), g;
+    function verb(n) { return function (v) { return step([n, v]); }; }
+    function step(op) {
+        if (f) throw new TypeError("Generator is already executing.");
+        while (g && (g = 0, op[0] && (_ = 0)), _) try {
+            if (f = 1, y && (t = op[0] & 2 ? y["return"] : op[0] ? y["throw"] || ((t = y["return"]) && t.call(y), 0) : y.next) && !(t = t.call(y, op[1])).done) return t;
+            if (y = 0, t) op = [op[0] & 2, t.value];
+            switch (op[0]) {
+                case 0: case 1: t = op; break;
+                case 4: _.label++; return { value: op[1], done: false };
+                case 5: _.label++; y = op[1]; op = [0]; continue;
+                case 7: op = _.ops.pop(); _.trys.pop(); continue;
+                default:
+                    if (!(t = _.trys, t = t.length > 0 && t[t.length - 1]) && (op[0] === 6 || op[0] === 2)) { _ = 0; continue; }
+                    if (op[0] === 3 && (!t || (op[1] > t[0] && op[1] < t[3]))) { _.label = op[1]; break; }
+                    if (op[0] === 6 && _.label < t[1]) { _.label = t[1]; t = op; break; }
+                    if (t && _.label < t[2]) { _.label = t[2]; _.ops.push(op); break; }
+                    if (t[2]) _.ops.pop();
+                    _.trys.pop(); continue;
+            }
+            op = body.call(thisArg, _);
+        } catch (e) { op = [6, e]; y = 0; } finally { f = t = 0; }
+        if (op[0] & 5) throw op[1]; return { value: op[0] ? op[1] : void 0, done: true };
+    }
+};
+var __values = (this && this.__values) || function(o) {
+    var s = typeof Symbol === "function" && Symbol.iterator, m = s && o[s], i = 0;
+    if (m) return m.call(o);
+    if (o && typeof o.length === "number") return {
+        next: function () {
+            if (o && i >= o.length) o = void 0;
+            return { value: o && o[i++], done: !o };
+        }
+    };
+    throw new TypeError(s ? "Object is not iterable." : "Symbol.iterator is not defined.");
+};
 Object.defineProperty(exports, "__esModule", { value: true });
-exports.Queue = void 0;
-/**
- * @license MIT
- * @copyright Tyler Zeng <zrwusa@gmail.com>
- * @class
- */
-class Queue {
-    /**
-     * The constructor initializes an instance of a class with an optional array of elements and sets the offset to 0.
-     * @param {T[]} [elements] - The `elements` parameter is an optional array of elements of type `T`. If provided, it
-     * will be used to initialize the `_nodes` property of the class. If not provided, the `_nodes` property will be
-     * initialized as an empty array.
-     */
-    constructor(elements) {
+exports.Queue = exports.LinkedListQueue = void 0;
+var linked_list_1 = require("../linked-list");
+var LinkedListQueue = (function (_super) {
+    __extends(LinkedListQueue, _super);
+    function LinkedListQueue() {
+        return _super !== null && _super.apply(this, arguments) || this;
+    }
+    LinkedListQueue.prototype.enqueue = function (value) {
+        this.push(value);
+    };
+    LinkedListQueue.prototype.dequeue = function () {
+        return this.shift();
+    };
+    LinkedListQueue.prototype.peek = function () {
+        var _a;
+        return (_a = this.head) === null || _a === void 0 ? void 0 : _a.val;
+    };
+    return LinkedListQueue;
+}(linked_list_1.SinglyLinkedList));
+exports.LinkedListQueue = LinkedListQueue;
+var Queue = (function () {
+    function Queue(elements) {
         this._nodes = elements || [];
         this._offset = 0;
     }
-    /**
-     * The function "fromArray" creates a new Queue object from an array of elements.Creates a queue from an existing array.
-     * @public
-     * @static
-     * @param {T[]} elements - The "elements" parameter is an array of elements of type T.
-     * @returns The method is returning a new instance of the Queue class, initialized with the elements from the input
-     * array.
-     */
-    static fromArray(elements) {
+    Object.defineProperty(Queue.prototype, "nodes", {
+        get: function () {
+            return this._nodes;
+        },
+        set: function (value) {
+            this._nodes = value;
+        },
+        enumerable: false,
+        configurable: true
+    });
+    Object.defineProperty(Queue.prototype, "offset", {
+        get: function () {
+            return this._offset;
+        },
+        set: function (value) {
+            this._offset = value;
+        },
+        enumerable: false,
+        configurable: true
+    });
+    Object.defineProperty(Queue.prototype, "size", {
+        get: function () {
+            return this.nodes.length - this.offset;
+        },
+        enumerable: false,
+        configurable: true
+    });
+    Queue.fromArray = function (elements) {
         return new Queue(elements);
-    }
-    /**
-     * The add function adds an element to the end of the queue and returns the updated queue.Adds an element at the back of the queue.
-     * @param {T} element - The `element` parameter represents the element that you want to add to the queue.
-     * @returns The `add` method is returning a `Queue<T>` object.
-     */
-    add(element) {
-        this._nodes.push(element);
+    };
+    Queue.prototype.push = function (element) {
+        this.nodes.push(element);
         return this;
-    }
-    /**
-     * The `poll` function removes and returns the first element in the queue, and adjusts the internal data structure if
-     * necessary to optimize performance.
-     * @returns The function `poll()` returns either the first element in the queue or `null` if the queue is empty.
-     */
-    poll() {
-        if (this.size() === 0)
-            return null;
-        const first = this.peek();
-        this._offset += 1;
-        if (this._offset * 2 < this._nodes.length)
+    };
+    Queue.prototype.shift = function () {
+        if (this.size === 0)
+            return undefined;
+        var first = this.peek();
+        this.offset += 1;
+        if (this.offset * 2 < this.nodes.length)
             return first;
-        // only remove dequeued elements when reaching half size
-        // to decrease latency of shifting elements.
-        this._nodes = this._nodes.slice(this._offset);
-        this._offset = 0;
+        this.nodes = this.nodes.slice(this.offset);
+        this.offset = 0;
         return first;
-    }
-    /**
-     * The `peek` function returns the first element of the array `_nodes` if it exists, otherwise it returns `null`.
-     * @returns The `peek()` method returns the first element of the data structure, represented by the `_nodes` array at
-     * the `_offset` index. If the data structure is empty (size is 0), it returns `null`.
-     */
-    peek() {
-        return this.size() > 0 ? this._nodes[this._offset] : null;
-    }
-    /**
-     * The `peekLast` function returns the last element in an array-like data structure, or null if the structure is empty.
-     * @returns The method `peekLast()` returns the last element of the `_nodes` array if the array is not empty. If the
-     * array is empty, it returns `null`.
-     */
-    peekLast() {
-        return this.size() > 0 ? this._nodes[this._nodes.length - 1] : null;
-    }
-    /**
-     * The size function returns the number of elements in an array.
-     * @returns {number} The size of the array, which is the difference between the length of the array and the offset.
-     */
-    size() {
-        return this._nodes.length - this._offset;
-    }
-    /**
-     * The function checks if a data structure is empty by comparing its size to zero.
-     * @returns {boolean} A boolean value indicating whether the size of the object is 0 or not.
-     */
-    isEmpty() {
-        return this.size() === 0;
-    }
-    /**
-     * The toArray() function returns an array of elements from the current offset to the end of the _nodes array.
-     * @returns An array of type T is being returned.
-     */
-    toArray() {
-        return this._nodes.slice(this._offset);
-    }
-    /**
-     * The clear function resets the nodes array and offset to their initial values.
-     */
-    clear() {
-        this._nodes = [];
-        this._offset = 0;
-    }
-    /**
-     * The `clone()` function returns a new Queue object with the same elements as the original Queue.
-     * @returns The `clone()` method is returning a new instance of the `Queue` class.
-     */
-    clone() {
-        return new Queue(this._nodes.slice(this._offset));
-    }
-}
+    };
+    Queue.prototype.peek = function () {
+        return this.size > 0 ? this.nodes[this.offset] : undefined;
+    };
+    Queue.prototype.peekLast = function () {
+        return this.size > 0 ? this.nodes[this.nodes.length - 1] : undefined;
+    };
+    Queue.prototype.enqueue = function (value) {
+        this.push(value);
+    };
+    Queue.prototype.dequeue = function () {
+        return this.shift();
+    };
+    Queue.prototype.getAt = function (index) {
+        return this.nodes[index];
+    };
+    Queue.prototype.isEmpty = function () {
+        return this.size === 0;
+    };
+    Queue.prototype.toArray = function () {
+        return this.nodes.slice(this.offset);
+    };
+    Queue.prototype.clear = function () {
+        this.nodes = [];
+        this.offset = 0;
+    };
+    Queue.prototype.clone = function () {
+        return new Queue(this.nodes.slice(this.offset));
+    };
+    Queue.prototype[Symbol.iterator] = function () {
+        var _a, _b, item, e_1_1;
+        var e_1, _c;
+        return __generator(this, function (_d) {
+            switch (_d.label) {
+                case 0:
+                    _d.trys.push([0, 5, 6, 7]);
+                    _a = __values(this.nodes), _b = _a.next();
+                    _d.label = 1;
+                case 1:
+                    if (!!_b.done) return [3, 4];
+                    item = _b.value;
+                    return [4, item];
+                case 2:
+                    _d.sent();
+                    _d.label = 3;
+                case 3:
+                    _b = _a.next();
+                    return [3, 1];
+                case 4: return [3, 7];
+                case 5:
+                    e_1_1 = _d.sent();
+                    e_1 = { error: e_1_1 };
+                    return [3, 7];
+                case 6:
+                    try {
+                        if (_b && !_b.done && (_c = _a.return)) _c.call(_a);
+                    }
+                    finally { if (e_1) throw e_1.error; }
+                    return [7];
+                case 7: return [2];
+            }
+        });
+    };
+    return Queue;
+}());
 exports.Queue = Queue;
+//# sourceMappingURL=queue.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"queue.js","sourceRoot":"","sources":["../../../src/data-structures/queue/queue.ts"],"names":[],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAKA,8CAAkD;AAElD;IAA8C,mCAAmB;IAAjE;;IAwBA,CAAC;IAnBC,iCAAO,GAAP,UAAQ,KAAQ;QACd,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACnB,CAAC;IAMD,iCAAO,GAAP;QACE,OAAO,IAAI,CAAC,KAAK,EAAE,CAAC;IACtB,CAAC;IAMD,8BAAI,GAAJ;;QACE,OAAO,MAAA,IAAI,CAAC,IAAI,0CAAE,GAAG,CAAC;IACxB,CAAC;IACH,sBAAC;AAAD,CAAC,AAxBD,CAA8C,8BAAgB,GAwB7D;AAxBY,0CAAe;AA0B5B;IAOE,eAAY,QAAc;QACxB,IAAI,CAAC,MAAM,GAAG,QAAQ,IAAI,EAAE,CAAC;QAC7B,IAAI,CAAC,OAAO,GAAG,CAAC,CAAC;IACnB,CAAC;IAID,sBAAI,wBAAK;aAAT;YACE,OAAO,IAAI,CAAC,MAAM,CAAC;QACrB,CAAC;aAED,UAAU,KAAU;YAClB,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC;QACtB,CAAC;;;OAJA;IAQD,sBAAI,yBAAM;aAAV;YACE,OAAO,IAAI,CAAC,OAAO,CAAC;QACtB,CAAC;aAED,UAAW,KAAa;YACtB,IAAI,CAAC,OAAO,GAAG,KAAK,CAAC;QACvB,CAAC;;;OAJA;IAUD,sBAAI,uBAAI;aAAR;YACE,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC;QACzC,CAAC;;;OAAA;IAUM,eAAS,GAAhB,UAAoB,QAAa;QAC/B,OAAO,IAAI,KAAK,CAAC,QAAQ,CAAC,CAAC;IAC7B,CAAC;IAOD,oBAAI,GAAJ,UAAK,OAAU;QACb,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QACzB,OAAO,IAAI,CAAC;IACd,CAAC;IAOD,qBAAK,GAAL;QACE,IAAI,IAAI,CAAC,IAAI,KAAK,CAAC;YAAE,OAAO,SAAS,CAAC;QAEtC,IAAM,KAAK,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC;QAC1B,IAAI,CAAC,MAAM,IAAI,CAAC,CAAC;QAEjB,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM;YAAE,OAAO,KAAK,CAAC;QAItD,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QAC3C,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;QAChB,OAAO,KAAK,CAAC;IACf,CAAC;IAOD,oBAAI,GAAJ;QACE,OAAO,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;IAC7D,CAAC;IAOD,wBAAQ,GAAR;QACE,OAAO,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;IACvE,CAAC;IAMD,uBAAO,GAAP,UAAQ,KAAQ;QACd,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACnB,CAAC;IAMD,uBAAO,GAAP;QACE,OAAO,IAAI,CAAC,KAAK,EAAE,CAAC;IACtB,CAAC;IAED,qBAAK,GAAL,UAAM,KAAa;QACjB,OAAO,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;IAC3B,CAAC;IAMD,uBAAO,GAAP;QACE,OAAO,IAAI,CAAC,IAAI,KAAK,CAAC,CAAC;IACzB,CAAC;IAMD,uBAAO,GAAP;QACE,OAAO,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IACvC,CAAC;IAKD,qBAAK,GAAL;QACE,IAAI,CAAC,KAAK,GAAG,EAAE,CAAC;QAChB,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;IAClB,CAAC;IAMD,qBAAK,GAAL;QACE,OAAO,IAAI,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC;IAClD,CAAC;IAEA,gBAAC,MAAM,CAAC,QAAQ,CAAC,GAAlB;;;;;;;oBACqB,KAAA,SAAA,IAAI,CAAC,KAAK,CAAA;;;;oBAAlB,IAAI;oBACb,WAAM,IAAI,EAAA;;oBAAV,SAAU,CAAC;;;;;;;;;;;;;;;;;;;KAEd;IACH,YAAC;AAAD,CAAC,AA7JD,IA6JC;AA7JY,sBAAK"}

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

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

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

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

package/dist/data-structures/stack/stack.js

@@ -1,91 +1,43 @@
 "use strict";
 Object.defineProperty(exports, "__esModule", { value: true });
 exports.Stack = void 0;
-/**
- * @license MIT
- * @copyright Tyler Zeng <zrwusa@gmail.com>
- * @class
- */
-class Stack {
-    /**
-     * The constructor initializes an array of elements, which can be provided as an optional parameter.
-     * @param {T[]} [elements] - The `elements` parameter is an optional parameter of type `T[]`, which represents an array
-     * of elements of type `T`. It is used to initialize the `_elements` property of the class. If the `elements` parameter
-     * is provided and is an array, it is assigned to the `_elements
-     */
-    constructor(elements) {
+var Stack = (function () {
+    function Stack(elements) {
         this._elements = Array.isArray(elements) ? elements : [];
     }
-    /**
-     * The function "fromArray" creates a new Stack object from an array of elements.
-     * @param {T[]} elements - The `elements` parameter is an array of elements of type `T`.
-     * @returns {Stack} The method is returning a new instance of the Stack class, initialized with the elements from the input
-     * array.
-     */
-    static fromArray(elements) {
+    Stack.fromArray = function (elements) {
         return new Stack(elements);
-    }
-    /**
-     * The function checks if an array is empty and returns a boolean value.
-     * @returns A boolean value indicating whether the `_elements` array is empty or not.
-     */
-    isEmpty() {
+    };
+    Stack.prototype.isEmpty = function () {
         return this._elements.length === 0;
-    }
-    /**
-     * The size() function returns the number of elements in an array.
-     * @returns The size of the elements array.
-     */
-    size() {
+    };
+    Stack.prototype.size = function () {
         return this._elements.length;
-    }
-    /**
-     * The `peek` function returns the last element of an array, or null if the array is empty.
-     * @returns The `peek()` function returns the last element of the `_elements` array, or `null` if the array is empty.
-     */
-    peek() {
+    };
+    Stack.prototype.peek = function () {
         if (this.isEmpty())
             return null;
         return this._elements[this._elements.length - 1];
-    }
-    /**
-     * The push function adds an element to the stack and returns the updated stack.
-     * @param {T} element - The parameter "element" is of type T, which means it can be any data type.
-     * @returns The `push` method is returning the updated `Stack<T>` object.
-     */
-    push(element) {
+    };
+    Stack.prototype.push = function (element) {
         this._elements.push(element);
         return this;
-    }
-    /**
-     * The `pop` function removes and returns the last element from an array, or returns null if the array is empty.
-     * @returns The `pop()` method is returning the last element of the array `_elements` if the array is not empty. If the
-     * array is empty, it returns `null`.
-     */
-    pop() {
+    };
+    Stack.prototype.pop = function () {
         if (this.isEmpty())
             return null;
         return this._elements.pop() || null;
-    }
-    /**
-     * The toArray function returns a copy of the elements in an array.
-     * @returns An array of type T.
-     */
-    toArray() {
+    };
+    Stack.prototype.toArray = function () {
         return this._elements.slice();
-    }
-    /**
-     * The clear function clears the elements array.
-     */
-    clear() {
+    };
+    Stack.prototype.clear = function () {
         this._elements = [];
-    }
-    /**
-     * The `clone()` function returns a new `Stack` object with the same elements as the original stack.
-     * @returns The `clone()` method is returning a new `Stack` object with a copy of the `_elements` array.
-     */
-    clone() {
+    };
+    Stack.prototype.clone = function () {
         return new Stack(this._elements.slice());
-    }
-}
+    };
+    return Stack;
+}());
 exports.Stack = Stack;
+//# sourceMappingURL=stack.js.map

package/dist/data-structures/stack/stack.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"stack.js","sourceRoot":"","sources":["../../../src/data-structures/stack/stack.ts"],"names":[],"mappings":";;;AAKA;IASE,eAAY,QAAc;QACxB,IAAI,CAAC,SAAS,GAAG,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC;IAC3D,CAAC;IAQM,eAAS,GAAhB,UAAoB,QAAa;QAC/B,OAAO,IAAI,KAAK,CAAC,QAAQ,CAAC,CAAC;IAC7B,CAAC;IAMD,uBAAO,GAAP;QACE,OAAO,IAAI,CAAC,SAAS,CAAC,MAAM,KAAK,CAAC,CAAC;IACrC,CAAC;IAMD,oBAAI,GAAJ;QACE,OAAO,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC;IAC/B,CAAC;IAMD,oBAAI,GAAJ;QACE,IAAI,IAAI,CAAC,OAAO,EAAE;YAAE,OAAO,IAAI,CAAC;QAEhC,OAAO,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IACnD,CAAC;IAOD,oBAAI,GAAJ,UAAK,OAAU;QACb,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QAC7B,OAAO,IAAI,CAAC;IACd,CAAC;IAOD,mBAAG,GAAH;QACE,IAAI,IAAI,CAAC,OAAO,EAAE;YAAE,OAAO,IAAI,CAAC;QAEhC,OAAO,IAAI,CAAC,SAAS,CAAC,GAAG,EAAE,IAAI,IAAI,CAAC;IACtC,CAAC;IAMD,uBAAO,GAAP;QACE,OAAO,IAAI,CAAC,SAAS,CAAC,KAAK,EAAE,CAAC;IAChC,CAAC;IAKD,qBAAK,GAAL;QACE,IAAI,CAAC,SAAS,GAAG,EAAE,CAAC;IACtB,CAAC;IAMD,qBAAK,GAAL;QACE,OAAO,IAAI,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,KAAK,EAAE,CAAC,CAAC;IAC3C,CAAC;IACH,YAAC;AAAD,CAAC,AA5FD,IA4FC;AA5FY,sBAAK"}

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

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

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

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

package/dist/data-structures/tree/tree.js

@@ -1,31 +1,43 @@
 "use strict";
 Object.defineProperty(exports, "__esModule", { value: true });
 exports.TreeNode = void 0;
-class TreeNode {
-    constructor(id, value, children) {
+var TreeNode = (function () {
+    function TreeNode(id, value, children) {
         this._id = id;
         this._value = value || undefined;
         this._children = children || [];
     }
-    get id() {
-        return this._id;
-    }
-    set id(value) {
-        this._id = value;
-    }
-    get value() {
-        return this._value;
-    }
-    set value(value) {
-        this._value = value;
-    }
-    get children() {
-        return this._children;
-    }
-    set children(value) {
-        this._children = value;
-    }
-    addChildren(children) {
+    Object.defineProperty(TreeNode.prototype, "id", {
+        get: function () {
+            return this._id;
+        },
+        set: function (value) {
+            this._id = value;
+        },
+        enumerable: false,
+        configurable: true
+    });
+    Object.defineProperty(TreeNode.prototype, "value", {
+        get: function () {
+            return this._value;
+        },
+        set: function (value) {
+            this._value = value;
+        },
+        enumerable: false,
+        configurable: true
+    });
+    Object.defineProperty(TreeNode.prototype, "children", {
+        get: function () {
+            return this._children;
+        },
+        set: function (value) {
+            this._children = value;
+        },
+        enumerable: false,
+        configurable: true
+    });
+    TreeNode.prototype.addChildren = function (children) {
         if (!this.children) {
             this.children = [];
         }
@@ -35,26 +47,27 @@ class TreeNode {
         else {
             this.children = this.children.concat(children);
         }
-    }
-    getHeight() {
-        // eslint-disable-next-line @typescript-eslint/no-this-alias
-        const beginRoot = this;
-        let maxDepth = 1;
+    };
+    TreeNode.prototype.getHeight = function () {
+        var beginRoot = this;
+        var maxDepth = 1;
         if (beginRoot) {
-            const bfs = (node, level) => {
+            var bfs_1 = function (node, level) {
                 if (level > maxDepth) {
                     maxDepth = level;
                 }
-                const { children } = node;
+                var children = node.children;
                 if (children) {
-                    for (let i = 0, len = children.length; i < len; i++) {
-                        bfs(children[i], level + 1);
+                    for (var i = 0, len = children.length; i < len; i++) {
+                        bfs_1(children[i], level + 1);
                     }
                 }
             };
-            bfs(beginRoot, 1);
+            bfs_1(beginRoot, 1);
         }
         return maxDepth;
-    }
-}
+    };
+    return TreeNode;
+}());
 exports.TreeNode = TreeNode;
+//# sourceMappingURL=tree.js.map

package/dist/data-structures/tree/tree.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"tree.js","sourceRoot":"","sources":["../../../src/data-structures/tree/tree.ts"],"names":[],"mappings":";;;AAAA;IACE,kBAAY,EAAU,EAAE,KAAS,EAAE,QAAwB;QACzD,IAAI,CAAC,GAAG,GAAG,EAAE,CAAC;QACd,IAAI,CAAC,MAAM,GAAG,KAAK,IAAI,SAAS,CAAC;QACjC,IAAI,CAAC,SAAS,GAAG,QAAQ,IAAI,EAAE,CAAC;IAClC,CAAC;IAID,sBAAI,wBAAE;aAAN;YACE,OAAO,IAAI,CAAC,GAAG,CAAC;QAClB,CAAC;aAED,UAAO,KAAa;YAClB,IAAI,CAAC,GAAG,GAAG,KAAK,CAAC;QACnB,CAAC;;;OAJA;IAQD,sBAAI,2BAAK;aAAT;YACE,OAAO,IAAI,CAAC,MAAM,CAAC;QACrB,CAAC;aAED,UAAU,KAAoB;YAC5B,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC;QACtB,CAAC;;;OAJA;IAQD,sBAAI,8BAAQ;aAAZ;YACE,OAAO,IAAI,CAAC,SAAS,CAAC;QACxB,CAAC;aAED,UAAa,KAAgC;YAC3C,IAAI,CAAC,SAAS,GAAG,KAAK,CAAC;QACzB,CAAC;;;OAJA;IAMD,8BAAW,GAAX,UAAY,QAAqC;QAC/C,IAAI,CAAC,IAAI,CAAC,QAAQ,EAAE;YAClB,IAAI,CAAC,QAAQ,GAAG,EAAE,CAAC;SACpB;QACD,IAAI,QAAQ,YAAY,QAAQ,EAAE;YAChC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;SAC9B;aAAM;YACL,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC;SAChD;IACH,CAAC;IAED,4BAAS,GAAT;QAEE,IAAM,SAAS,GAAG,IAAI,CAAC;QACvB,IAAI,QAAQ,GAAG,CAAC,CAAC;QACjB,IAAI,SAAS,EAAE;YACb,IAAM,KAAG,GAAG,UAAC,IAAiB,EAAE,KAAa;gBAC3C,IAAI,KAAK,GAAG,QAAQ,EAAE;oBACpB,QAAQ,GAAG,KAAK,CAAC;iBAClB;gBACO,IAAA,QAAQ,GAAK,IAAI,SAAT,CAAU;gBAC1B,IAAI,QAAQ,EAAE;oBACZ,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,GAAG,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE;wBACnD,KAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC;qBAC7B;iBACF;YACH,CAAC,CAAC;YACF,KAAG,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC;SACnB;QACD,OAAO,QAAQ,CAAC;IAClB,CAAC;IACH,eAAC;AAAD,CAAC,AApED,IAoEC;AApEY,4BAAQ"}

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

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

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

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