typescript-ds-lib 0.0.1 → 0.1.0

package/README.md

@@ -1,6 +1,38 @@
 # TypeScript Data Structure Library
+[![NPM](https://img.shields.io/npm/v/marcal.svg?label=npm%20package&color=limegreen)](https://www.npmjs.com/package/typescript-ds-lib)
+
 Native TypeScript data structure implementations without external dependencies.
 
+- Fast, Light and Tested
+
+## Install
+```
+npm install typescript-ds-lib
+```
+
+## Usage
+```typescript
+import { Stack, StackTy } from 'typescript-ds-lib';
+
+const stack: StackTy<number> = new Stack<number>();
+
+stack.push(1);
+stack.push(2);
+stack.push(3);
+
+console.log(stack.top());   // 3
+console.log(stack.pop());   // 3
+console.log(stack.size());  // 2
+```
+
+## Data Structures
+- Stack
+- Queue
+- Priority Queue
+- Linked List
+- Binary Search Tree
+- Deque
+
 
 ## Contributions
 Contributions are welcome and can be made by submitting GitHub pull requests

package/dist/index.d.ts

@@ -1 +1,7 @@
-export {};
+export * from './types';
+export { Stack } from './lib/stack';
+export { Queue } from './lib/queue';
+export { PriorityQueue } from './lib/priority-queue';
+export { BinarySearchTree } from './lib/binary-search-tree';
+export { Deque } from './lib/deque';
+export { LinkedList } from './lib/linked-list';

package/dist/index.js

@@ -1,3 +1,31 @@
 "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 });
+exports.LinkedList = exports.Deque = exports.BinarySearchTree = exports.PriorityQueue = exports.Queue = exports.Stack = void 0;
+__exportStar(require("./types"), exports);
+var stack_1 = require("./lib/stack");
+Object.defineProperty(exports, "Stack", { enumerable: true, get: function () { return stack_1.Stack; } });
+var queue_1 = require("./lib/queue");
+Object.defineProperty(exports, "Queue", { enumerable: true, get: function () { return queue_1.Queue; } });
+var priority_queue_1 = require("./lib/priority-queue");
+Object.defineProperty(exports, "PriorityQueue", { enumerable: true, get: function () { return priority_queue_1.PriorityQueue; } });
+var binary_search_tree_1 = require("./lib/binary-search-tree");
+Object.defineProperty(exports, "BinarySearchTree", { enumerable: true, get: function () { return binary_search_tree_1.BinarySearchTree; } });
+var deque_1 = require("./lib/deque");
+Object.defineProperty(exports, "Deque", { enumerable: true, get: function () { return deque_1.Deque; } });
+var linked_list_1 = require("./lib/linked-list");
+Object.defineProperty(exports, "LinkedList", { enumerable: true, get: function () { return linked_list_1.LinkedList; } });
 //# sourceMappingURL=index.js.map

package/dist/index.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.js","sourceRoot":"","sources":["../index.ts"],"names":[],"mappings":""}
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../index.ts"],"names":[],"mappings":";;;;;;;;;;;;;;;;;AAAA,0CAAwB;AACxB,qCAAoC;AAA3B,8FAAA,KAAK,OAAA;AACd,qCAAoC;AAA3B,8FAAA,KAAK,OAAA;AACd,uDAAqD;AAA5C,+GAAA,aAAa,OAAA;AACtB,+DAA4D;AAAnD,sHAAA,gBAAgB,OAAA;AACzB,qCAAoC;AAA3B,8FAAA,KAAK,OAAA;AACd,iDAA+C;AAAtC,yGAAA,UAAU,OAAA"}

package/dist/lib/binary-search-tree.d.ts

@@ -0,0 +1,35 @@
+import { BinarySearchTreeTy } from '../types';
+export declare class BinarySearchTree<T> implements BinarySearchTreeTy<T> {
+    private root;
+    constructor();
+    /**
+     * Inserts a value into the BST
+     */
+    insert(value: T): void;
+    /**
+     * Searches for a value in the BST. Returns true if found, false otherwise
+     */
+    find(value: T): boolean;
+    /**
+     * Returns the minimum value in the BST, or undefined if tree is empty
+     */
+    min(): T | undefined;
+    /**
+     * Returns the maximum value in the BST, or undefined if tree is empty
+     */
+    max(): T | undefined;
+    /**
+     * Removes a value from the BST if it exists
+     */
+    remove(value: T): void;
+    private removeNode;
+    private findMin;
+    /**
+     * Returns true if the BST is empty, false otherwise
+     */
+    empty(): boolean;
+    /**
+     * Removes all nodes from the BST
+     */
+    clear(): void;
+}

package/dist/lib/binary-search-tree.js

@@ -0,0 +1,144 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.BinarySearchTree = void 0;
+class TreeNode {
+    value;
+    left;
+    right;
+    constructor(value) {
+        this.value = value;
+        this.left = null;
+        this.right = null;
+    }
+}
+class BinarySearchTree {
+    root;
+    constructor() {
+        this.root = null;
+    }
+    /**
+     * Inserts a value into the BST
+     */
+    insert(value) {
+        const newNode = new TreeNode(value);
+        if (!this.root) {
+            this.root = newNode;
+            return;
+        }
+        let current = this.root;
+        while (true) {
+            if (value < current.value) {
+                if (current.left === null) {
+                    current.left = newNode;
+                    break;
+                }
+                current = current.left;
+            }
+            else {
+                if (current.right === null) {
+                    current.right = newNode;
+                    break;
+                }
+                current = current.right;
+            }
+        }
+    }
+    /**
+     * Searches for a value in the BST. Returns true if found, false otherwise
+     */
+    find(value) {
+        let current = this.root;
+        while (current !== null) {
+            if (value === current.value) {
+                return true;
+            }
+            if (value < current.value) {
+                current = current.left;
+            }
+            else {
+                current = current.right;
+            }
+        }
+        return false;
+    }
+    /**
+     * Returns the minimum value in the BST, or undefined if tree is empty
+     */
+    min() {
+        if (!this.root)
+            return undefined;
+        let current = this.root;
+        while (current.left !== null) {
+            current = current.left;
+        }
+        return current.value;
+    }
+    /**
+     * Returns the maximum value in the BST, or undefined if tree is empty
+     */
+    max() {
+        if (!this.root)
+            return undefined;
+        let current = this.root;
+        while (current.right !== null) {
+            current = current.right;
+        }
+        return current.value;
+    }
+    /**
+     * Removes a value from the BST if it exists
+     */
+    remove(value) {
+        this.root = this.removeNode(this.root, value);
+    }
+    removeNode(node, value) {
+        if (node === null)
+            return null;
+        if (value < node.value) {
+            node.left = this.removeNode(node.left, value);
+            return node;
+        }
+        else if (value > node.value) {
+            node.right = this.removeNode(node.right, value);
+            return node;
+        }
+        else {
+            // Node to delete found
+            // Case 1: Leaf node
+            if (node.left === null && node.right === null) {
+                return null;
+            }
+            // Case 2: Node with one child
+            if (node.left === null)
+                return node.right;
+            if (node.right === null)
+                return node.left;
+            // Case 3: Node with two children
+            const minNode = this.findMin(node.right);
+            node.value = minNode.value;
+            node.right = this.removeNode(node.right, minNode.value);
+            return node;
+        }
+    }
+    findMin(node) {
+        let current = node;
+        while (current.left !== null) {
+            current = current.left;
+        }
+        return current;
+    }
+    /**
+     * Returns true if the BST is empty, false otherwise
+     */
+    empty() {
+        return this.root === null;
+    }
+    /**
+     * Removes all nodes from the BST
+     */
+    clear() {
+        this.root = null;
+    }
+}
+exports.BinarySearchTree = BinarySearchTree;
+//# sourceMappingURL=binary-search-tree.js.map

package/dist/lib/binary-search-tree.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"binary-search-tree.js","sourceRoot":"","sources":["../../lib/binary-search-tree.ts"],"names":[],"mappings":";;;AAGA,MAAM,QAAQ;IACZ,KAAK,CAAI;IACT,IAAI,CAAqB;IACzB,KAAK,CAAqB;IAE1B,YAAY,KAAQ;QAClB,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACnB,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;QACjB,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;IACpB,CAAC;CACF;AAED,MAAa,gBAAgB;IACnB,IAAI,CAAqB;IAEjC;QACE,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;IACnB,CAAC;IAED;;OAEG;IACH,MAAM,CAAC,KAAQ;QACb,MAAM,OAAO,GAAG,IAAI,QAAQ,CAAC,KAAK,CAAC,CAAC;QACpC,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC;YACf,IAAI,CAAC,IAAI,GAAG,OAAO,CAAC;YACpB,OAAO;QACT,CAAC;QACD,IAAI,OAAO,GAAG,IAAI,CAAC,IAAI,CAAC;QACxB,OAAO,IAAI,EAAE,CAAC;YACZ,IAAI,KAAK,GAAG,OAAO,CAAC,KAAK,EAAE,CAAC;gBAC1B,IAAI,OAAO,CAAC,IAAI,KAAK,IAAI,EAAE,CAAC;oBAC1B,OAAO,CAAC,IAAI,GAAG,OAAO,CAAC;oBACvB,MAAM;gBACR,CAAC;gBACD,OAAO,GAAG,OAAO,CAAC,IAAI,CAAC;YACzB,CAAC;iBAAM,CAAC;gBACN,IAAI,OAAO,CAAC,KAAK,KAAK,IAAI,EAAE,CAAC;oBAC3B,OAAO,CAAC,KAAK,GAAG,OAAO,CAAC;oBACxB,MAAM;gBACR,CAAC;gBACD,OAAO,GAAG,OAAO,CAAC,KAAK,CAAC;YAC1B,CAAC;QACH,CAAC;IACH,CAAC;IAED;;OAEG;IACH,IAAI,CAAC,KAAQ;QACX,IAAI,OAAO,GAAG,IAAI,CAAC,IAAI,CAAC;QACxB,OAAO,OAAO,KAAK,IAAI,EAAE,CAAC;YACxB,IAAI,KAAK,KAAK,OAAO,CAAC,KAAK,EAAE,CAAC;gBAC5B,OAAO,IAAI,CAAC;YACd,CAAC;YACD,IAAI,KAAK,GAAG,OAAO,CAAC,KAAK,EAAE,CAAC;gBAC1B,OAAO,GAAG,OAAO,CAAC,IAAI,CAAC;YACzB,CAAC;iBAAM,CAAC;gBACN,OAAO,GAAG,OAAO,CAAC,KAAK,CAAC;YAC1B,CAAC;QACH,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;OAEG;IACH,GAAG;QACD,IAAI,CAAC,IAAI,CAAC,IAAI;YAAE,OAAO,SAAS,CAAC;QAEjC,IAAI,OAAO,GAAG,IAAI,CAAC,IAAI,CAAC;QACxB,OAAO,OAAO,CAAC,IAAI,KAAK,IAAI,EAAE,CAAC;YAC7B,OAAO,GAAG,OAAO,CAAC,IAAI,CAAC;QACzB,CAAC;QACD,OAAO,OAAO,CAAC,KAAK,CAAC;IACvB,CAAC;IAED;;OAEG;IACH,GAAG;QACD,IAAI,CAAC,IAAI,CAAC,IAAI;YAAE,OAAO,SAAS,CAAC;QACjC,IAAI,OAAO,GAAG,IAAI,CAAC,IAAI,CAAC;QACxB,OAAO,OAAO,CAAC,KAAK,KAAK,IAAI,EAAE,CAAC;YAC9B,OAAO,GAAG,OAAO,CAAC,KAAK,CAAC;QAC1B,CAAC;QACD,OAAO,OAAO,CAAC,KAAK,CAAC;IACvB,CAAC;IAED;;OAEG;IACH,MAAM,CAAC,KAAQ;QACb,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;IAChD,CAAC;IAEO,UAAU,CAAC,IAAwB,EAAE,KAAQ;QACnD,IAAI,IAAI,KAAK,IAAI;YAAE,OAAO,IAAI,CAAC;QAE/B,IAAI,KAAK,GAAG,IAAI,CAAC,KAAK,EAAE,CAAC;YACvB,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;YAC9C,OAAO,IAAI,CAAC;QACd,CAAC;aAAM,IAAI,KAAK,GAAG,IAAI,CAAC,KAAK,EAAE,CAAC;YAC9B,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;YAChD,OAAO,IAAI,CAAC;QACd,CAAC;aAAM,CAAC;YACN,uBAAuB;YACvB,oBAAoB;YACpB,IAAI,IAAI,CAAC,IAAI,KAAK,IAAI,IAAI,IAAI,CAAC,KAAK,KAAK,IAAI,EAAE,CAAC;gBAC9C,OAAO,IAAI,CAAC;YACd,CAAC;YACD,8BAA8B;YAC9B,IAAI,IAAI,CAAC,IAAI,KAAK,IAAI;gBAAE,OAAO,IAAI,CAAC,KAAK,CAAC;YAC1C,IAAI,IAAI,CAAC,KAAK,KAAK,IAAI;gBAAE,OAAO,IAAI,CAAC,IAAI,CAAC;YAC1C,iCAAiC;YACjC,MAAM,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACzC,IAAI,CAAC,KAAK,GAAG,OAAO,CAAC,KAAK,CAAC;YAC3B,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,KAAK,EAAE,OAAO,CAAC,KAAK,CAAC,CAAC;YACxD,OAAO,IAAI,CAAC;QACd,CAAC;IACH,CAAC;IAEO,OAAO,CAAC,IAAiB;QAC/B,IAAI,OAAO,GAAG,IAAI,CAAC;QACnB,OAAO,OAAO,CAAC,IAAI,KAAK,IAAI,EAAE,CAAC;YAC7B,OAAO,GAAG,OAAO,CAAC,IAAI,CAAC;QACzB,CAAC;QACD,OAAO,OAAO,CAAC;IACjB,CAAC;IAED;;OAEG;IACH,KAAK;QACH,OAAO,IAAI,CAAC,IAAI,KAAK,IAAI,CAAC;IAC5B,CAAC;IAED;;OAEG;IACH,KAAK;QACH,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;IACnB,CAAC;CACF;AAnID,4CAmIC"}

package/dist/lib/deque.d.ts

@@ -0,0 +1,41 @@
+import { DequeTy } from '../types';
+export declare class Deque<T> implements DequeTy<T> {
+    private items;
+    constructor();
+    /**
+     * Adds an element to the front of the deque
+     */
+    pushFront(element: T): void;
+    /**
+     * Adds an element to the back of the deque
+     */
+    pushBack(element: T): void;
+    /**
+     * Removes and returns the front element from the deque, or undefined if deque is empty
+     */
+    popFront(): T | undefined;
+    /**
+     * Removes and returns the back element from the deque, or undefined if deque is empty
+     */
+    popBack(): T | undefined;
+    /**
+     * Returns the front element without removing it, or undefined if deque is empty
+     */
+    front(): T | undefined;
+    /**
+     * Returns the back element without removing it, or undefined if deque is empty
+     */
+    back(): T | undefined;
+    /**
+     * Returns true if the deque is empty, false otherwise
+     */
+    empty(): boolean;
+    /**
+     * Returns the number of elements in the deque
+     */
+    size(): number;
+    /**
+     * Removes all elements from the deque
+     */
+    clear(): void;
+}

package/dist/lib/deque.js

@@ -0,0 +1,65 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.Deque = void 0;
+class Deque {
+    items;
+    constructor() {
+        this.items = [];
+    }
+    /**
+     * Adds an element to the front of the deque
+     */
+    pushFront(element) {
+        this.items.unshift(element);
+    }
+    /**
+     * Adds an element to the back of the deque
+     */
+    pushBack(element) {
+        this.items.push(element);
+    }
+    /**
+     * Removes and returns the front element from the deque, or undefined if deque is empty
+     */
+    popFront() {
+        return this.items.shift();
+    }
+    /**
+     * Removes and returns the back element from the deque, or undefined if deque is empty
+     */
+    popBack() {
+        return this.items.pop();
+    }
+    /**
+     * Returns the front element without removing it, or undefined if deque is empty
+     */
+    front() {
+        return this.items[0];
+    }
+    /**
+     * Returns the back element without removing it, or undefined if deque is empty
+     */
+    back() {
+        return this.items[this.items.length - 1];
+    }
+    /**
+     * Returns true if the deque is empty, false otherwise
+     */
+    empty() {
+        return this.items.length === 0;
+    }
+    /**
+     * Returns the number of elements in the deque
+     */
+    size() {
+        return this.items.length;
+    }
+    /**
+     * Removes all elements from the deque
+     */
+    clear() {
+        this.items = [];
+    }
+}
+exports.Deque = Deque;
+//# sourceMappingURL=deque.js.map

package/dist/lib/deque.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"deque.js","sourceRoot":"","sources":["../../lib/deque.ts"],"names":[],"mappings":";;;AAGA,MAAa,KAAK;IACR,KAAK,CAAM;IAEnB;QACE,IAAI,CAAC,KAAK,GAAG,EAAE,CAAC;IAClB,CAAC;IAED;;OAEG;IACH,SAAS,CAAC,OAAU;QAClB,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC;IAC9B,CAAC;IAED;;OAEG;IACH,QAAQ,CAAC,OAAU;QACjB,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;IAC3B,CAAC;IAED;;OAEG;IACH,QAAQ;QACN,OAAO,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC;IAC5B,CAAC;IAED;;OAEG;IACH,OAAO;QACL,OAAO,IAAI,CAAC,KAAK,CAAC,GAAG,EAAE,CAAC;IAC1B,CAAC;IAED;;OAEG;IACH,KAAK;QACH,OAAO,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IACvB,CAAC;IAED;;OAEG;IACH,IAAI;QACF,OAAO,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IAC3C,CAAC;IAED;;OAEG;IACH,KAAK;QACH,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM,KAAK,CAAC,CAAC;IACjC,CAAC;IAED;;OAEG;IACH,IAAI;QACF,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC;IAC3B,CAAC;IAED;;OAEG;IACH,KAAK;QACH,IAAI,CAAC,KAAK,GAAG,EAAE,CAAC;IAClB,CAAC;CACF;AArED,sBAqEC"}

package/dist/lib/linked-list.d.ts

@@ -0,0 +1,43 @@
+import { LinkedListTy } from '../types';
+export declare class LinkedList<T> implements LinkedListTy<T> {
+    private head;
+    private tail;
+    private length;
+    constructor();
+    /**
+     * Adds an element to the end of the list
+     */
+    pushBack(element: T): void;
+    /**
+     * Adds an element to the front of the list
+     */
+    pushFront(element: T): void;
+    /**
+     * Inserts an element at the specified position. Returns true if successful, false if position is invalid
+     */
+    insert(element: T, position: number): boolean;
+    /**
+     * Removes the first element that satisfies the predicate. Returns true if an element was removed, false otherwise.
+     */
+    removeIf(condition: (element: T) => boolean): boolean;
+    /**
+     * Removes and returns the element at the specified position. Returns undefined if position is invalid
+     */
+    removeAt(position: number): T | undefined;
+    /**
+     * Returns the element at the specified position without removing it. Returns undefined if position is invalid
+     */
+    get(position: number): T | undefined;
+    /**
+     * Returns true if the list is empty, false otherwise
+     */
+    empty(): boolean;
+    /**
+     * Returns the number of elements in the list
+     */
+    size(): number;
+    /**
+     * Removes all elements from the list
+     */
+    clear(): void;
+}

package/dist/lib/linked-list.js

@@ -0,0 +1,172 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.LinkedList = void 0;
+class Node {
+    value;
+    next;
+    constructor(value) {
+        this.value = value;
+        this.next = null;
+    }
+}
+class LinkedList {
+    head;
+    tail;
+    length;
+    constructor() {
+        this.head = null;
+        this.tail = null;
+        this.length = 0;
+    }
+    /**
+     * Adds an element to the end of the list
+     */
+    pushBack(element) {
+        const newNode = new Node(element);
+        if (!this.head) {
+            this.head = newNode;
+            this.tail = newNode;
+        }
+        else {
+            this.tail.next = newNode;
+            this.tail = newNode;
+        }
+        this.length++;
+    }
+    /**
+     * Adds an element to the front of the list
+     */
+    pushFront(element) {
+        const newNode = new Node(element);
+        if (!this.head) {
+            this.head = newNode;
+            this.tail = newNode;
+        }
+        else {
+            newNode.next = this.head;
+            this.head = newNode;
+        }
+        this.length++;
+    }
+    /**
+     * Inserts an element at the specified position. Returns true if successful, false if position is invalid
+     */
+    insert(element, position) {
+        if (position < 0 || position > this.length) {
+            return false;
+        }
+        if (position === 0) {
+            this.pushFront(element);
+            return true;
+        }
+        if (position === this.length) {
+            this.pushBack(element);
+            return true;
+        }
+        const newNode = new Node(element);
+        let current = this.head;
+        let prev = null;
+        let index = 0;
+        while (index < position) {
+            prev = current;
+            current = current.next;
+            index++;
+        }
+        prev.next = newNode;
+        newNode.next = current;
+        this.length++;
+        return true;
+    }
+    /**
+     * Removes the first element that satisfies the predicate. Returns true if an element was removed, false otherwise.
+     */
+    removeIf(condition) {
+        let current = this.head;
+        let prev = null;
+        while (current !== null) {
+            if (condition(current.value)) {
+                if (prev === null) {
+                    this.head = current.next;
+                }
+                else {
+                    prev.next = current.next;
+                }
+                if (current === this.tail) {
+                    this.tail = prev;
+                }
+                this.length--;
+                return true;
+            }
+            prev = current;
+            current = current.next;
+        }
+        return false;
+    }
+    /**
+     * Removes and returns the element at the specified position. Returns undefined if position is invalid
+     */
+    removeAt(position) {
+        if (position < 0 || position >= this.length) {
+            return undefined;
+        }
+        let current = this.head;
+        if (position === 0) {
+            this.head = current.next;
+            if (this.length === 1) {
+                this.tail = null;
+            }
+            this.length--;
+            return current.value;
+        }
+        let prev = null;
+        let index = 0;
+        while (index < position) {
+            prev = current;
+            current = current.next;
+            index++;
+        }
+        prev.next = current.next;
+        if (position === this.length - 1) {
+            this.tail = prev;
+        }
+        this.length--;
+        return current.value;
+    }
+    /**
+     * Returns the element at the specified position without removing it. Returns undefined if position is invalid
+     */
+    get(position) {
+        if (position < 0 || position >= this.length) {
+            return undefined;
+        }
+        let current = this.head;
+        let index = 0;
+        while (index < position) {
+            current = current.next;
+            index++;
+        }
+        return current.value;
+    }
+    /**
+     * Returns true if the list is empty, false otherwise
+     */
+    empty() {
+        return this.length === 0;
+    }
+    /**
+     * Returns the number of elements in the list
+     */
+    size() {
+        return this.length;
+    }
+    /**
+     * Removes all elements from the list
+     */
+    clear() {
+        this.head = null;
+        this.tail = null;
+        this.length = 0;
+    }
+}
+exports.LinkedList = LinkedList;
+//# sourceMappingURL=linked-list.js.map

package/dist/lib/linked-list.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"linked-list.js","sourceRoot":"","sources":["../../lib/linked-list.ts"],"names":[],"mappings":";;;AAEA,MAAM,IAAI;IACR,KAAK,CAAI;IACT,IAAI,CAAiB;IAErB,YAAY,KAAQ;QAClB,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACnB,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;IACnB,CAAC;CACF;AAED,MAAa,UAAU;IACb,IAAI,CAAiB;IACrB,IAAI,CAAiB;IACrB,MAAM,CAAS;IAEvB;QACE,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;QACjB,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;QACjB,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;IAClB,CAAC;IAED;;OAEG;IACH,QAAQ,CAAC,OAAU;QACjB,MAAM,OAAO,GAAG,IAAI,IAAI,CAAC,OAAO,CAAC,CAAC;QAClC,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC;YACf,IAAI,CAAC,IAAI,GAAG,OAAO,CAAC;YACpB,IAAI,CAAC,IAAI,GAAG,OAAO,CAAC;QACtB,CAAC;aAAM,CAAC;YACN,IAAI,CAAC,IAAK,CAAC,IAAI,GAAG,OAAO,CAAC;YAC1B,IAAI,CAAC,IAAI,GAAG,OAAO,CAAC;QACtB,CAAC;QACD,IAAI,CAAC,MAAM,EAAE,CAAC;IAChB,CAAC;IAED;;OAEG;IACH,SAAS,CAAC,OAAU;QAClB,MAAM,OAAO,GAAG,IAAI,IAAI,CAAC,OAAO,CAAC,CAAC;QAClC,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC;YACf,IAAI,CAAC,IAAI,GAAG,OAAO,CAAC;YACpB,IAAI,CAAC,IAAI,GAAG,OAAO,CAAC;QACtB,CAAC;aAAM,CAAC;YACN,OAAO,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;YACzB,IAAI,CAAC,IAAI,GAAG,OAAO,CAAC;QACtB,CAAC;QACD,IAAI,CAAC,MAAM,EAAE,CAAC;IAChB,CAAC;IAED;;OAEG;IACH,MAAM,CAAC,OAAU,EAAE,QAAgB;QACjC,IAAI,QAAQ,GAAG,CAAC,IAAI,QAAQ,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC;YAC3C,OAAO,KAAK,CAAC;QACf,CAAC;QACD,IAAI,QAAQ,KAAK,CAAC,EAAE,CAAC;YACnB,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC;YACxB,OAAO,IAAI,CAAC;QACd,CAAC;QACD,IAAI,QAAQ,KAAK,IAAI,CAAC,MAAM,EAAE,CAAC;YAC7B,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC;YACvB,OAAO,IAAI,CAAC;QACd,CAAC;QAED,MAAM,OAAO,GAAG,IAAI,IAAI,CAAC,OAAO,CAAC,CAAC;QAClC,IAAI,OAAO,GAAG,IAAI,CAAC,IAAI,CAAC;QACxB,IAAI,IAAI,GAAmB,IAAI,CAAC;QAChC,IAAI,KAAK,GAAW,CAAC,CAAC;QAEtB,OAAO,KAAK,GAAG,QAAQ,EAAE,CAAC;YACxB,IAAI,GAAG,OAAO,CAAC;YACf,OAAO,GAAG,OAAQ,CAAC,IAAI,CAAC;YACxB,KAAK,EAAE,CAAC;QACV,CAAC;QAED,IAAK,CAAC,IAAI,GAAG,OAAO,CAAC;QACrB,OAAO,CAAC,IAAI,GAAG,OAAO,CAAC;QACvB,IAAI,CAAC,MAAM,EAAE,CAAC;QACd,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;OAEG;IACH,QAAQ,CAAC,SAAkC;QACzC,IAAI,OAAO,GAAmB,IAAI,CAAC,IAAI,CAAC;QACxC,IAAI,IAAI,GAAmB,IAAI,CAAC;QAChC,OAAO,OAAO,KAAK,IAAI,EAAE,CAAC;YACxB,IAAI,SAAS,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC;gBAC7B,IAAI,IAAI,KAAK,IAAI,EAAE,CAAC;oBAClB,IAAI,CAAC,IAAI,GAAG,OAAO,CAAC,IAAI,CAAC;gBAC3B,CAAC;qBAAM,CAAC;oBACN,IAAI,CAAC,IAAI,GAAG,OAAO,CAAC,IAAI,CAAC;gBAC3B,CAAC;gBACD,IAAI,OAAO,KAAK,IAAI,CAAC,IAAI,EAAE,CAAC;oBAC1B,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;gBACnB,CAAC;gBACD,IAAI,CAAC,MAAM,EAAE,CAAC;gBACd,OAAO,IAAI,CAAC;YACd,CAAC;YACD,IAAI,GAAG,OAAO,CAAC;YACf,OAAO,GAAG,OAAO,CAAC,IAAI,CAAC;QACzB,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;OAEG;IACH,QAAQ,CAAC,QAAgB;QACvB,IAAI,QAAQ,GAAG,CAAC,IAAI,QAAQ,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;YAC5C,OAAO,SAAS,CAAC;QACnB,CAAC;QACD,IAAI,OAAO,GAAmB,IAAI,CAAC,IAAI,CAAC;QACxC,IAAI,QAAQ,KAAK,CAAC,EAAE,CAAC;YACnB,IAAI,CAAC,IAAI,GAAG,OAAQ,CAAC,IAAI,CAAC;YAC1B,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;gBACtB,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;YACnB,CAAC;YACD,IAAI,CAAC,MAAM,EAAE,CAAC;YACd,OAAO,OAAQ,CAAC,KAAK,CAAC;QACxB,CAAC;QAED,IAAI,IAAI,GAAmB,IAAI,CAAC;QAChC,IAAI,KAAK,GAAW,CAAC,CAAC;QACtB,OAAO,KAAK,GAAG,QAAQ,EAAE,CAAC;YACxB,IAAI,GAAG,OAAO,CAAC;YACf,OAAO,GAAG,OAAQ,CAAC,IAAI,CAAC;YACxB,KAAK,EAAE,CAAC;QACV,CAAC;QACD,IAAK,CAAC,IAAI,GAAG,OAAQ,CAAC,IAAI,CAAC;QAC3B,IAAI,QAAQ,KAAK,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACjC,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;QACnB,CAAC;QACD,IAAI,CAAC,MAAM,EAAE,CAAC;QACd,OAAO,OAAQ,CAAC,KAAK,CAAC;IACxB,CAAC;IAED;;OAEG;IACH,GAAG,CAAC,QAAgB;QAClB,IAAI,QAAQ,GAAG,CAAC,IAAI,QAAQ,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;YAC5C,OAAO,SAAS,CAAC;QACnB,CAAC;QACD,IAAI,OAAO,GAAmB,IAAI,CAAC,IAAI,CAAC;QACxC,IAAI,KAAK,GAAW,CAAC,CAAC;QACtB,OAAO,KAAK,GAAG,QAAQ,EAAE,CAAC;YACxB,OAAO,GAAG,OAAQ,CAAC,IAAI,CAAC;YACxB,KAAK,EAAE,CAAC;QACV,CAAC;QACD,OAAO,OAAQ,CAAC,KAAK,CAAC;IACxB,CAAC;IAED;;OAEG;IACH,KAAK;QACH,OAAO,IAAI,CAAC,MAAM,KAAK,CAAC,CAAC;IAC3B,CAAC;IAED;;OAEG;IACH,IAAI;QACF,OAAO,IAAI,CAAC,MAAM,CAAC;IACrB,CAAC;IAED;;OAEG;IACH,KAAK;QACH,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;QACjB,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;QACjB,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;IAClB,CAAC;CACF;AAzKD,gCAyKC"}

package/dist/lib/priority-queue.d.ts

@@ -0,0 +1,32 @@
+import { PriorityQueueTy } from '../types';
+export declare class PriorityQueue<T> implements PriorityQueueTy<T> {
+    private items;
+    constructor();
+    /**
+     * Adds an element with a priority to the queue.
+     * Lower priority numbers have higher precedence.
+     */
+    push(element: T, priority: number): void;
+    /**
+     * Removes and returns the highest priority element from the queue,
+     * or undefined if queue is empty.
+     */
+    pop(): T | undefined;
+    /**
+     * Returns the highest priority element without removing it,
+     * or undefined if queue is empty.
+     */
+    front(): T | undefined;
+    /**
+     * Checks if the queue is empty. Returns true if empty, false otherwise.
+     */
+    empty(): boolean;
+    /**
+     * Returns the number of elements in the queue.
+     */
+    size(): number;
+    /**
+     * Removes all elements from the queue.
+     */
+    clear(): void;
+}