data-structure-typed 0.8.6

package/dist/data-structures/index.js

@@ -0,0 +1,25 @@
+"use strict";
+var __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {
+    if (k2 === undefined) k2 = k;
+    var desc = Object.getOwnPropertyDescriptor(m, k);
+    if (!desc || ("get" in desc ? !m.__esModule : desc.writable || desc.configurable)) {
+      desc = { enumerable: true, get: function() { return m[k]; } };
+    }
+    Object.defineProperty(o, k2, desc);
+}) : (function(o, m, k, k2) {
+    if (k2 === undefined) k2 = k;
+    o[k2] = m[k];
+}));
+var __exportStar = (this && this.__exportStar) || function(m, exports) {
+    for (var p in m) if (p !== "default" && !Object.prototype.hasOwnProperty.call(exports, p)) __createBinding(exports, m, p);
+};
+Object.defineProperty(exports, "__esModule", { value: true });
+__exportStar(require("./hash"), exports);
+__exportStar(require("./linked-list"), exports);
+__exportStar(require("./stack"), exports);
+__exportStar(require("./queue"), exports);
+__exportStar(require("./graph"), exports);
+__exportStar(require("./binary-tree"), exports);
+__exportStar(require("./heap"), exports);
+__exportStar(require("./priority-queue"), exports);
+__exportStar(require("./matrix"), exports);

package/dist/data-structures/linked-list/doubly-linked-list.js

@@ -0,0 +1,259 @@
+"use strict";
+// 操作      常见名称       Ada           Java        JavaScript     C++          Python      Perl       PHP             Ruby
+// 尾部插入   inject, snoc Append         offerLast   push          push_back    append      push        array_push      push
+// 头部插入   push, cons   Prepend        offerFirst  unshift       push_front   appendleft  unshift     array_unshift   unshift
+// 尾部删除   eject        Delete_Last    pollLast    pop           pop_back     pop         pop         array_pop       pop
+// 头部删除   pop          Delete_First   pollFirst   shift         pop_front    popleft     shift       array_shift     shift
+// 查看尾部                Last_Element   peekLast    [length - 1]  back         [-1]        $array[-1]  end             last
+// 查看头部                First_Element  peekFirst   [0]           front        [0]         $array[0]   reset           first
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.DoublyLinkedList = exports.DoublyLinkedListNode = void 0;
+class DoublyLinkedListNode {
+    constructor(nodeValue) {
+        this.val = nodeValue;
+        this.next = null;
+        this.prev = null;
+    }
+}
+exports.DoublyLinkedListNode = DoublyLinkedListNode;
+class DoublyLinkedList {
+    constructor() {
+        this._first = null;
+        this._last = null;
+        this._size = 0;
+        // --- end extra methods ---
+    }
+    get size() {
+        return this._size;
+    }
+    set size(v) {
+        this._size = v;
+    }
+    /**
+     * Adds a node at the beginning of the linked list
+     * @param val Value to be stored at the beginning of the linked list
+     */
+    offerFirst(val) {
+        const newNode = new DoublyLinkedListNode(val);
+        if (this._size === 0) {
+            this._first = newNode;
+            this._last = newNode;
+        }
+        else {
+            if (this._first)
+                this._first.prev = newNode;
+            newNode.next = this._first;
+            this._first = newNode;
+        }
+        this._size++;
+        return true;
+    }
+    /**
+     * Adds a node to the end of the linked list
+     * @param val Value to be stored in the Doubly linked list node
+     */
+    offerLast(val) {
+        const newNode = new DoublyLinkedListNode(val);
+        if (this._size === 0) {
+            this._first = newNode;
+            this._last = newNode;
+        }
+        else {
+            if (this._last)
+                this._last.next = newNode;
+            newNode.prev = this._last;
+            this._last = newNode;
+        }
+        this._size++;
+        return true;
+    }
+    peekFirst(by) {
+        var _a, _b, _c, _d, _e;
+        switch (by) {
+            case 'node':
+                return (_a = this._first) !== null && _a !== void 0 ? _a : null;
+            case 'val':
+                return (_c = (_b = this._first) === null || _b === void 0 ? void 0 : _b.val) !== null && _c !== void 0 ? _c : null;
+            default:
+                return (_e = (_d = this._first) === null || _d === void 0 ? void 0 : _d.val) !== null && _e !== void 0 ? _e : null;
+        }
+    }
+    peekLast(by = 'val') {
+        var _a, _b, _c, _d, _e;
+        switch (by) {
+            case 'node':
+                return (_a = this._last) !== null && _a !== void 0 ? _a : null;
+            case 'val':
+                return (_c = (_b = this._last) === null || _b === void 0 ? void 0 : _b.val) !== null && _c !== void 0 ? _c : null;
+            default:
+                return (_e = (_d = this._last) === null || _d === void 0 ? void 0 : _d.val) !== null && _e !== void 0 ? _e : null;
+        }
+    }
+    /**
+     * Removes a node form the beginning of the linked list and will return the node val
+     */
+    pollFirst(by = 'val') {
+        var _a, _b, _c;
+        if (this._size === 0)
+            return null;
+        const oldHead = this._first;
+        if (this._size === 1) {
+            this._first = null;
+            this._last = null;
+        }
+        else {
+            this._first = (_a = oldHead === null || oldHead === void 0 ? void 0 : oldHead.next) !== null && _a !== void 0 ? _a : null;
+            if (this._first)
+                this._first.prev = null;
+            if (oldHead)
+                oldHead.next = null;
+        }
+        this._size--;
+        switch (by) {
+            case 'node':
+                return oldHead !== null && oldHead !== void 0 ? oldHead : null;
+            case 'val':
+                return (_b = oldHead === null || oldHead === void 0 ? void 0 : oldHead.val) !== null && _b !== void 0 ? _b : null;
+            default:
+                return (_c = oldHead === null || oldHead === void 0 ? void 0 : oldHead.val) !== null && _c !== void 0 ? _c : null;
+        }
+    }
+    /**
+     * Removes a node at the end of the linked list and will return the node value
+     */
+    pollLast(by = 'val') {
+        var _a, _b, _c;
+        if (this._size === 0)
+            return null;
+        const polled = this._last;
+        if (this._size === 1) {
+            this._first = null;
+            this._last = null;
+        }
+        else {
+            this._last = (_a = polled === null || polled === void 0 ? void 0 : polled.prev) !== null && _a !== void 0 ? _a : null;
+            if (this._last)
+                this._last.next = null;
+            if (polled)
+                polled.prev = null;
+        }
+        this._size--;
+        switch (by) {
+            case 'node':
+                return polled !== null && polled !== void 0 ? polled : null;
+            case 'val':
+                return (_b = polled === null || polled === void 0 ? void 0 : polled.val) !== null && _b !== void 0 ? _b : null;
+            default:
+                return (_c = polled === null || polled === void 0 ? void 0 : polled.val) !== null && _c !== void 0 ? _c : null;
+        }
+    }
+    /**
+     * Returns the node at the specified index of the linked list.
+     * If index = 0; first element in the list is returned.
+     * If index = 3; fourth element in the list is returned.
+     * @param index Index of the node to be retrieved
+     * @param by Return value type
+     */
+    get(index, by = 'val') {
+        var _a, _b;
+        if (index < 0 || index >= this._size)
+            return null;
+        let count, current;
+        if (index <= this._size / 2) {
+            count = 0;
+            current = this._first;
+            while (count !== index) {
+                current = current === null || current === void 0 ? void 0 : current.next;
+                count++;
+            }
+        }
+        else {
+            count = this._size - 1;
+            current = this._last;
+            while (count !== index) {
+                current = current === null || current === void 0 ? void 0 : current.prev;
+                count--;
+            }
+        }
+        switch (by) {
+            case 'node':
+                return current !== null && current !== void 0 ? current : null;
+            case 'val':
+                return (_a = current === null || current === void 0 ? void 0 : current.val) !== null && _a !== void 0 ? _a : null;
+            default:
+                return (_b = current === null || current === void 0 ? void 0 : current.val) !== null && _b !== void 0 ? _b : null;
+        }
+    }
+    /**
+     * Updates the value of the node at the specified index.
+     * If index = 0; Value of the first element in the list is updated.
+     * If index = 3; Value of the fourth element in the list is updated.
+     * @param index Index of the node to be updated
+     * @param val New value of the node
+     */
+    set(index, val) {
+        const foundNode = this.get(index, 'node');
+        if (foundNode !== null) {
+            foundNode.val = val;
+            return true;
+        }
+        return false;
+    }
+    isEmpty() {
+        return this._size === 0;
+    }
+    // --- start extra methods ---
+    /**
+     * Inserts a new node at the specified index.
+     * @param index Index at which the new node has to be inserted
+     * @param val Value of the new node to be inserted
+     */
+    insert(index, val) {
+        if (index < 0 || index > this._size)
+            return false;
+        if (index === 0)
+            return !!this.offerFirst(val);
+        if (index === this._size)
+            return !!this.offerLast(val);
+        const newNode = new DoublyLinkedListNode(val);
+        const prevNode = this.get(index - 1, 'node');
+        const nextNode = prevNode === null || prevNode === void 0 ? void 0 : prevNode.next;
+        if (prevNode)
+            prevNode.next = newNode;
+        newNode.prev = prevNode;
+        newNode.next = nextNode !== null && nextNode !== void 0 ? nextNode : null;
+        if (nextNode)
+            nextNode.prev = newNode;
+        this._size++;
+        return true;
+    }
+    /**
+     * Removes a node at the specified index and returns its value.
+     * @param index Index at which the node has to be removed.
+     */
+    remove(index) {
+        var _a, _b, _c;
+        if (index < 0 || index > this._size - 1)
+            return null;
+        else if (index === 0)
+            return this.pollFirst();
+        else if (index === this._size - 1)
+            return (_b = (_a = this.pollLast('node')) === null || _a === void 0 ? void 0 : _a.val) !== null && _b !== void 0 ? _b : null;
+        else {
+            const prevNode = this.get(index - 1, 'node');
+            const removeNode = prevNode === null || prevNode === void 0 ? void 0 : prevNode.next;
+            const nextNode = removeNode === null || removeNode === void 0 ? void 0 : removeNode.next;
+            if (prevNode)
+                prevNode.next = nextNode !== null && nextNode !== void 0 ? nextNode : null;
+            if (nextNode)
+                nextNode.prev = prevNode;
+            if (removeNode)
+                removeNode.next = null;
+            if (removeNode)
+                removeNode.prev = null;
+            this._size--;
+            return (_c = removeNode === null || removeNode === void 0 ? void 0 : removeNode.val) !== null && _c !== void 0 ? _c : null;
+        }
+    }
+}
+exports.DoublyLinkedList = DoublyLinkedList;

package/dist/data-structures/linked-list/index.js

@@ -0,0 +1,18 @@
+"use strict";
+var __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {
+    if (k2 === undefined) k2 = k;
+    var desc = Object.getOwnPropertyDescriptor(m, k);
+    if (!desc || ("get" in desc ? !m.__esModule : desc.writable || desc.configurable)) {
+      desc = { enumerable: true, get: function() { return m[k]; } };
+    }
+    Object.defineProperty(o, k2, desc);
+}) : (function(o, m, k, k2) {
+    if (k2 === undefined) k2 = k;
+    o[k2] = m[k];
+}));
+var __exportStar = (this && this.__exportStar) || function(m, exports) {
+    for (var p in m) if (p !== "default" && !Object.prototype.hasOwnProperty.call(exports, p)) __createBinding(exports, m, p);
+};
+Object.defineProperty(exports, "__esModule", { value: true });
+__exportStar(require("./singly-linked-list"), exports);
+__exportStar(require("./doubly-linked-list"), exports);